Home > Numbers
| Divisible for every n (Posted on 2007-10-11) |
 |
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 |
 | Reverse Case | Chris, PhD | 2012-08-11 07:17:28 |
|
|
Please log in:
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:
|
