Least: 128
By adding 35 to 128, there is (999-128)/35 ≈ 24 numbers:
128, 163, 198, 233, 268, 303, 338, 373, 408, 443, 478, 513, 548, 583, 618, 653, 688, 723, 758, 793, 828, 863, 898, 933, 968.
506
The remainder is 8. To find the remainder when a number is divided by 9, add the digits together; if this sum has more than 1 digit, repeat until one digit remains. This digit is the remainder, unless it is 9 in which case the remainder is 0. examples: remainder 53 → 5 + 3 = 8 → remainder is 8 when 53 is divided by 9. remainder 126 → 1 + 2 + 6 = 9 → remainder is 0, ie no remainder, 126 is divisible by 9. remainder 258 → 2 + 5 + 8 = 15 → 1 + 5 = 6 → remainder is 6 when 258 is divided by 9.
I guess you mean what's the units digit of 32011. It is 7. To work this out, see how the units digit of 3n changes; it goes: 3, 9, 7, 1, 3, 9, 7, 1, ... (only the first 8 powers are shown) repeating the same sequence of 4 digits. So if we find the remainder of 2011 divided by 4, it will tell us which of the four numbers (3, 9, 7, 1) will be the units digit of 32011: 2011 ÷ 4 ⇒ remainder 3, so the 3rd digit is the required digit: 7. (If there had been no remainder, then the 4th digit, namely 1, would have been the required value.)
Assume the decimal starts recurring immediately after the decimal point. (If the recurring string starts after k digits, then you want to find the (2001-k)th digit instead.) Find the length of the recurring string = L Find the remainder when 2001 is divided by L = R The 2001st digit is the Rth digit in the recurring string.
Any number can be divided by 36 but most will give a remainder. To find all the numbers which when divided by 36 do not give a remiander use the formula 36n where n is any positive integer.
506
The remainder is 8. To find the remainder when a number is divided by 9, add the digits together; if this sum has more than 1 digit, repeat until one digit remains. This digit is the remainder, unless it is 9 in which case the remainder is 0. examples: remainder 53 → 5 + 3 = 8 → remainder is 8 when 53 is divided by 9. remainder 126 → 1 + 2 + 6 = 9 → remainder is 0, ie no remainder, 126 is divisible by 9. remainder 258 → 2 + 5 + 8 = 15 → 1 + 5 = 6 → remainder is 6 when 258 is divided by 9.
A remainder is what's left after a division. If I can find a sum that has a one digit answer but a two digit remainder, I've proven it's possible. 915/100= 9 with a remainder of 15. One digit answer, two digit remainder. So, yes, it's possible.
14, 20, 26, 32, 38, 44, 50, 56, 62, 68, 74, 80, 86, 92, and 98
You determine all numbers that will can be divided evenly (without a remainder) into the object numbers. The highest number doing that is the common factor.
35
160 and 192.
Any number can be divided by 36 but most will give a remainder. To find all the numbers which when divided by 36 do not give a remiander use the formula 36n where n is any positive integer.
I guess you mean what's the units digit of 32011. It is 7. To work this out, see how the units digit of 3n changes; it goes: 3, 9, 7, 1, 3, 9, 7, 1, ... (only the first 8 powers are shown) repeating the same sequence of 4 digits. So if we find the remainder of 2011 divided by 4, it will tell us which of the four numbers (3, 9, 7, 1) will be the units digit of 32011: 2011 ÷ 4 ⇒ remainder 3, so the 3rd digit is the required digit: 7. (If there had been no remainder, then the 4th digit, namely 1, would have been the required value.)
Assume the decimal starts recurring immediately after the decimal point. (If the recurring string starts after k digits, then you want to find the (2001-k)th digit instead.) Find the length of the recurring string = L Find the remainder when 2001 is divided by L = R The 2001st digit is the Rth digit in the recurring string.
11.0503
127.6