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

Home > Numbers
Divisible for every n (Posted on 2007-10-11) Difficulty: 4 of 5
Let x,y>1 be integers such that for all n>0, xn-1 is divisible by yn-1. Then show that x=yk, where k is a positive integer.

No Solution Yet Submitted by Praneeth    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsReverse CaseChris, PhD2012-08-11 07:17:28
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