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.
wow! nice observation seth christmas..
Thanks for the solution. I couldn't get a nice solution too.
Great observation! Do you know what other numbers (mod 100) have powers whose remainder mod 100 repeat every 4 terms?
Obviously 1 does, but that repeats every term.
2 repeats every 4th term, yielding 2, 4, 8, 6 as unit digit, tens digit in the form, P − 3 . (This is for the 4th terms only since that is the end of the cycle)
3 has a similar pattern, ending in 81 after 4. So its pattern is twice its power followed by a 1.
4 always ends in 4 for odd powers and 6 for even powers, tens digit of the form (power=P) 3 ( P − 1 ) for odd powers, and 2 P − 3 for even powers.
5 always yields 25 for any power mod 100.
6 always has 6 in the unit digit, tens digit following the pattern (after the 6 1 which is 0 6 ) 3,1,9,7,5. This follows a pattern every 6 terms
7 we have gone over in this problem.
8 has the pattern of 8,4,2,6 for its unit digit, repeating every 4th term, tens digit (of the 4th terms) in the same form as 4, 3 ( P − 1 )
9, being a power of 3, repeats every 2 terms, thus every 4 terms as well, but has a better pattern every 10, ending in exactly 01.
Please correct me if I have made any mistakes with these. I kinda just winged it quickly to see if there were any neat patterns.
Log in to reply
Note that for 3, 3 5 = 2 4 3 ≡ 4 3 ( m o d 1 0 0 ) . It seems like you are mixing up mod 100 and mod 10 when replying.
So, more specifically, how can we solve for x 4 ≡ 1 ( m o d 1 0 0 ) ? As noticed x = 1 , 7 are solutions. Are there any others? This is a "degree 4" modulus equation. Are there 4 solutions? Or more than 4?
7 3 N ⟹ 3 4 3 N ≡ 7 8 0 ≡ 7 2 × 4 0 ≡ 4 9 4 0 ≡ ( 5 0 − 1 ) 4 0 ≡ 1 (mod 1000) ≡ 1 (mod 1000)
Let N ≡ a b c , a three-digit integer. Then,
3 4 3 ( 1 0 0 a + 1 0 b + c ) 3 4 3 0 0 a + 3 4 3 0 b + 3 4 3 c 3 4 3 0 0 a + 3 4 3 0 b + 2 4 0 1 3 4 3 0 0 a + 2 4 0 1 6 8 6 0 0 + 2 4 0 1 ⟹ N ≡ 1 (mod 1000) ≡ 1 (mod 1000) ≡ 1 (mod 1000) ≡ 1 (mod 1000) ≡ 1 (mod 1000) ≡ a b c = 2 0 7 For last digit of LHS = 1 ⟹ c = 7 For 2nd last digit of LHS = 0 ⟹ b = 0 For 3rd last digit of LHS = 0 ⟹ a = 2
That was amazing.
Sir , you can try my sets My Problems and THRILLER . The former contains problems that I have posted and the latter contains some awesome problems.
Can you please fix the link for me!!??
EDIT
I have done it. Thanks.
7 4 ≡ 4 0 1 ( m o d 1 0 0 0 )
7 7 7 ≡ 7 7 6 ⋅ 7 ≡ 2 4 0 1 1 9 ⋅ 7 ≡ 4 0 1 1 9 ⋅ 7 ≡ ( 4 0 0 + 1 ) 1 9 ⋅ 7 ≡ ( 1 9 × 4 0 0 + 1 ) ⋅ 7 ≡ 2 0 7 ( m o d 1 0 0 0 )
@Chew-Seong Cheong @Seth Christman Please comment!
Good approach. I have just thought of a solution. See my solution too.
Problem Loading...
Note Loading...
Set Loading...
I don't know of any fancy, quick equation to assist with this, but I have a rather fun solution.
Whenever one is dealing with finding digits from powers, establishing a pattern is the first step to take. Listing out the powers of 7 mod 1000 (to limit them to 3 digits) we get:
7 , 4 9 , 3 4 3 , 401 , 8 0 7 , 6 4 9 , 5 4 3 , 801 , 6 0 7 , 2 4 9 , 7 4 3 , 201 , …
If we look at every 4th term, a small pattern is emerging. Specifically it always ends with 0 1 and leads with its current power placement mod 10 (Ex. 7 4 = … 4 0 1 , 7 8 = … 8 0 1 , 7 1 2 = … 2 0 1
Now we see that 7 7 m o d 4 = 1
So our solution, broken down, is 7 7 7 = 7 7 6 × 7 = … 6 0 1 × 7 = … 2 0 7
Thus the answer is 2 0 7