All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers > Sequences
Powers of Ten (Posted on 2015-07-14) Difficulty: 3 of 5
Does the arithmetic sequence 1, 2188, 4375, 6562, ...... contain infinitely many powers of 10?
Give reasons for your answer.

  Submitted by K Sengupta    
Rating: 5.0000 (1 votes)
Solution: (Hide)
Well, obviously it does contain infinitely many powers of 10.

We are looking for values 10^N which equal 1 mod 2187. Because 10^0 = 1, mod N, the sequence 10^N must eventually equal 1 for some higher N, because power cycle with respect to any mod. There is nothing magic about 2187 or 10 for that matter.

For any k and s, the arithmetic series 1, 1+k, 1+2k, ... contains infinitely many powers of s for any positive integers k and s.

In this case, we observe that 10^243 = 1 mod 2187, so the cycle has length 243. 10^n = 1 mod 2187 for n = 243k, where k is any integer.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionAnswerMath Man2015-07-16 19:21:55
re: Pwerful answer (spoiler)broll2015-07-15 05:41:40
re(2): Pwerful answer (spoiler)Steve Herman2015-07-14 16:27:47
re: Pwerful answer (spoiler)Charlie2015-07-14 16:14:00
re(2): Pwerful answer (spoiler)Steve Herman2015-07-14 15:01:24
Hints/Tipsre: Pwerful answer (spoiler)Ady TZIDON2015-07-14 14:18:38
SolutionPwerful answer (spoiler)Steve Herman2015-07-14 11:58:09
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information