Given that a is a positive integral multiple of 12 such that
a 2 ≡ a mod 100,
find the sum of the two smallest values of a.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
100I(a)(a-1) ; 12Ia
Consider 2 cases one where 25Ia and the other 25I(a-1).U get 300 (obviously the least no.s) for the 1st one & 276 for 2nd case.
So,ANSWER=576
As @Edward Rong did , I first concluded that a ≡ 0 ; 6 ( m o d 1 0 )
When a ≡ 0 ( m o d 1 0 ) ⇒ a 2 ≡ 0 0 ( m o d 1 0 0 ) ⇒ a ≡ 0 0 ( m o d 1 0 0 ) .
When a ≡ 6 ( m o d 1 0 ) ⇒ a ≡ 0 6 , 1 6 , 2 6 , 3 6 , 4 6 , 5 6 , 6 6 , 7 6 , 8 6 , 9 6 ( m o d 1 0 0 ) ,But 1 2 ∣ a ⇒ 4 ∣ a ⇒ a ≡ 0 6 , 2 6 , 4 6 , 6 6 , 8 6 ( m o d 1 0 0 ) .
For these cases I just checked them out by squaring them to see whether they satisfied the conditions or not.
And the number which satisfied was 7 6 .
So we are left to deal with 0 0 , 7 6 .
1 2 ∣ a ⇒ 3 ∣ a So , by divisibility by 3 , we see that the smallest numbers satisfying are 3 0 0 , 2 7 6
A better approach would be to classify all solutions to a 2 ≡ a ( m o d 1 0 0 ) and then find those which are multiples of 12. This is because there is a simple classification for the modular arithmetic equation, which doesn't us require to guess what possible values can be attained.
Problem Loading...
Note Loading...
Set Loading...
If it is true that a 2 ≡ a (mod 100), then it must also be true that a 2 ≡ a (mod 10). We know that a is an even number so we can work out the possibilities for the last digit of a.
The only values for which a 2 ≡ a (mod 10) holds true (bearing in mind that a (mod 10) is even) are a ≡ 6 or 0 (mod 10).
Let a (mod 10) be 1 0 x + y .
If y = 0, a 2 (mod 10) ≡ ( 1 0 x + 0 ) 2 = 1 0 0 x 2 so is always congruent to 0 (mod 100). This means that x must be 0 as well, and 10x+y, and therefore a must be a multiple of 100.
If y = 6, a 2 (mod 10) ≡ ( 1 0 x + 6 ) 2 = 1 0 0 x 2 + 1 2 0 x + 3 6 (mod 10) ≡ 2 0 x + 3 6 (mod 100). The only values for which 1 0 x + y ≡ 2 0 x + 3 6 (mod 10) is x = 7 .
Bearing in mind these constraints and the fact that a is a multiple of 12, the two smallest values that a can be are 2 7 6 and 3 0 0 , the sum of which is 2 7 6 + 3 0 0 = 576 .