3 6 a ≡ 8 4 b ( m o d 1 0 1 )
How many ordered pairs ( a , b ) of integer solutions does the above congruency have, where 1 ≤ a ≤ 1 0 0 and 1 ≤ b ≤ 1 0 0 ?
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.
Yes, exactly! Thank you for a clear and detailed solution (+1)! The key fact to observe is that both 36 and 84 have order 5 in ( Z / 1 0 1 Z ) ∗
Log in to reply
Is there a way to determine they both an order 5 without listing out the first few powers?
Log in to reply
I'm not aware of a shortcut... are you? It suffices to check the powers of one of them, of course. Alternatively, you could check the powers 3 6 2 , 3 6 5 , 3 6 1 0 and 3 6 2 5 since the order has to divide 100 (and, in fact, 50 since 36 is a square).
Log in to reply
@Otto Bretscher – Nope. I thought you knew some tricks up your sleeve.
Problem Loading...
Note Loading...
Set Loading...
We can calculate the following:
3 6 1 ≡ 3 6 ( m o d 1 0 1 )
3 6 2 ≡ 8 4 ( m o d 1 0 1 )
3 6 3 ≡ 9 5 ( m o d 1 0 1 )
3 6 4 ≡ 8 7 ( m o d 1 0 1 )
3 6 5 ≡ 1 ( m o d 1 0 1 )
Since the final power in this sequence is equivalent to 1 , the pattern continues for subsequent powers.
Likewise:
8 4 1 ≡ 8 4 ( m o d 1 0 1 )
8 4 2 ≡ 8 7 ( m o d 1 0 1 )
8 4 3 ≡ 3 6 ( m o d 1 0 1 )
8 4 4 ≡ 9 5 ( m o d 1 0 1 )
8 4 5 ≡ 1 ( m o d 1 0 1 )
For each value of a , there are 2 0 corresponding values of b . With 1 0 0 possible values of a , there are a total of 2 0 0 0 possible ordered pairs.