1) This problem involves finding the largest number n such that 62 mod n, 132 mod n, and 237 mod n all have the same remainder.
2) For two numbers to have the same remainder when divided by n, their difference must be divisible by n. The difference between 132 and 62 is 70, which is divisible by 35.
3) Testing shows that 35 is the largest number for which 62 mod 35, 132 mod 35, and 237 mod 35 all have the same remainder of 27.
1) This problem involves finding the largest number n such that 62 mod n, 132 mod n, and 237 mod n all have the same remainder.
2) For two numbers to have the same remainder when divided by n, their difference must be divisible by n. The difference between 132 and 62 is 70, which is divisible by 35.
3) Testing shows that 35 is the largest number for which 62 mod 35, 132 mod 35, and 237 mod 35 all have the same remainder of 27.
1) This problem involves finding the largest number n such that 62 mod n, 132 mod n, and 237 mod n all have the same remainder.
2) For two numbers to have the same remainder when divided by n, their difference must be divisible by n. The difference between 132 and 62 is 70, which is divisible by 35.
3) Testing shows that 35 is the largest number for which 62 mod 35, 132 mod 35, and 237 mod 35 all have the same remainder of 27.
1) This problem involves finding the largest number n such that 62 mod n, 132 mod n, and 237 mod n all have the same remainder.
2) For two numbers to have the same remainder when divided by n, their difference must be divisible by n. The difference between 132 and 62 is 70, which is divisible by 35.
3) Testing shows that 35 is the largest number for which 62 mod 35, 132 mod 35, and 237 mod 35 all have the same remainder of 27.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1of 2
Best Answer: This is a problem in remainder arithmetic.
It is convenient to use the "mod" notation. mod means find the
remainder. Example: 7 mod 4 = 3 or 15 mod 4 = 3 We need to find the largest n so that 62 mod n = 132 mod n = 237 mod n If two numbers have the same remainder, then the difference of their remainders is 0. so (132-62 ) mod n = 0. Or 70 mod n = 0. So n divides 70 evenly. How large can n be? Well maybe 70. 237 mod 70 = 27 but 132 mod 70 is 62. Nope. Ok try 35. 62 mod 35 = 27; 132 mod 35 = 27 and 237 mod 37 = 27
Let the common remainder be R.
We seek a number Q such that R is congruent to 62 (modulo Q) R is congruent to 132 (modulo Q) R is congruent to 237 (modulo Q) This means that the interval 132-62= 70 is a multiple of Q This also means that the interval 237-132 = 105 is also a multiple of Q 70 = 2*5*7 105=3*5*7 We could have used the larger interval 237-62 = 175 = 5*5*7 but this does not really add new information (this interval is not independent from the other two). The common prime factors are 5 and 7 Q = 5*7 = 35 should work and should be the highest such number. 62 divided by 35 = 1, with a remainder of 27 132 divided by 35 = 3, with a remainder of 27 237 divided by 35 = 6 with a remainder of 27