last two digits

Given that a is a positive integral multiple of 12 such that

a 2 a a^2 \equiv a mod 100,

find the sum of the two smallest values of a.


The answer is 576.

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.

3 solutions

Edward Rong
Jun 11, 2014

If it is true that a 2 a a^2\equiv a (mod 100), then it must also be true that a 2 a a^2\equiv 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 a^2\equiv a (mod 10) holds true (bearing in mind that a a (mod 10) is even) are a 6 a\equiv 6 or 0 0 (mod 10).

Let a a (mod 10) be 10 x + y 10x+y .

If y = 0, a 2 a^2 (mod 10) ( 10 x + 0 ) 2 = 100 x 2 \equiv (10x+0)^2=100x^2 so is always congruent to 0 (mod 100). This means that x must be 0 as well, and 10x+y, and therefore a a must be a multiple of 100.

If y = 6, a 2 a^2 (mod 10) ( 10 x + 6 ) 2 = 100 x 2 + 120 x + 36 \equiv (10x+6)^2=100x^2+120x+36 (mod 10) 20 x + 36 \equiv 20x+36 (mod 100). The only values for which 10 x + y 20 x + 36 10x+y\equiv 20x+36 (mod 10) is x = 7 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 276 276 and 300 300 , the sum of which is 276 + 300 = 576 276+300=\mbox{576} .

Rajdeep Brahma
Apr 25, 2017

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

Ankit Kumar Jain
Mar 8, 2016

As @Edward Rong did , I first concluded that a 0 ; 6 ( m o d 10 ) a\equiv{0 ;6}\pmod{10}

When a 0 ( m o d 10 ) a 2 00 ( m o d 100 ) a 00 ( m o d 100 ) a\equiv{0}\pmod{10} \Rightarrow a^{2}\equiv{00}\pmod{100} \Rightarrow a\equiv{00}\pmod{100} .

When a 6 ( m o d 10 ) a 06 , 16 , 26 , 36 , 46 , 56 , 66 , 76 , 86 , 96 ( m o d 100 ) a\equiv{6}\pmod{10} \Rightarrow a\equiv{06 , 16 , 26 , 36 , 46 , 56 , 66 , 76 , 86 , 96}\pmod{100} ,But 12 a 4 a a ≢ 06 , 26 , 46 , 66 , 86 ( m o d 100 ) 12|a \Rightarrow 4|a \Rightarrow a\not\equiv{06 , 26 , 46 , 66 , 86}\pmod{100} .

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 76 76 .

So we are left to deal with 00 , 76 00 , 76 .

12 a 3 a 12|a \Rightarrow 3|a So , by divisibility by 3 3 , we see that the smallest numbers satisfying are 300 , 276 300 , 276

Moderator note:

A better approach would be to classify all solutions to a 2 a ( m o d 100 ) a^ 2 \equiv a \pmod{100} 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.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...