LOGIN/REGISTER
Please Wait...
It is currently Sep 02, 2010, 11:20 am
Post new topic Reply to topic  [ 2 posts ]  Share: Facebook
Message
Post Posted: Feb 09, 2008, 1:32 pm • # 1 


Let a>1 be a positive integer. Prove that every non-zero positive integer N has a multiple in the sequence (a_n)_{n\ge1}, a_n=\left\lfloor\frac{a^n}n\right\rfloor.

_________________
The fate of equilibrium is to end the eternity...
 
 
Post Posted: Feb 11, 2008, 3:31 am • # 2 


Strange problem. Let N=N_1N_2, where N_2 and a are coprime, and N_1 divides a^C for suitable positive integer C. Without loss of generality, CN_1 divides a^{C} (we may take C being large power of a). Take large prime p such that p-1 is divisible by \varphi(n). The existence of such p is well-known elementary case of the Dirichlet theorem, which may be obtained using the cyclotomic polynomials. Then take n=pC. Then by Fermat's little theorem we have [a^{Cp}/(Cp)]=(a^{Cp}-a^C)/(Cp), which is divisible by N=N_1N_2.
 
 
Display posts from previous:  Sort by  

All times are UTC - 8 hours [ DST ]

Share: Facebook

Moderators: MithsApprentice, N.T.TUAN, Peter, darij grinberg, orl, pbornsztein, freemind, Megus, amfulger, harazi, ZetaX, Arne, High School Olympiad Moderators

Post new topic Reply to topic  [ 2 posts ] 

Login

Username:   Password:   Log me on automatically each visit  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum