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

Home > Numbers > Sequences
Repeated Digits (Posted on 2014-01-14) Difficulty: 2 of 5
Define the sequence A(n) as: A(1) = 1, A(2) =13, A(3) = 131, A(4) = 1313,...
  1. Determine the minimum value of n such that A(n) is divisible by 29.
  2. What is the general form of n such that A(n) is divisible by 29?

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution spoiler | Comment 1 of 2
131313131   does it.
n....9 digits fits.
28 digits fits as well.

Edited, after seeing Ch's program's results:
The valid n are congruent to   0 mod 28  or 9 mod 28:
i.e.  n=9,28,37,56   etc

Edited on January 14, 2014, 2:29 pm
  Posted by Ady TZIDON on 2014-01-14 10:30: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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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