My Profile

Keep Up to Date:
Blog RSS
Blog
Forum RSS
Forum
Search

Buy & Sell

Used (Like New) $20

Post New Topic Post Reply
Posted 1 Year ago
Transhumanist
Senior Boarder
Posts: 70
graphgraph
User Offline
 
prove or disprove: does there exist a positive integer N such that there exist integers r, s, t where N = r^2 + 1 = s^3 + 1 = t^5 +1. If so find the smallest such N and prove it is minimal.
The administrator has disabled public write access.
Posted 1 Year ago
saintthomas
Expert Boarder
Posts: 82
graphgraph
User Offline
 
*spoily?* * * * * * * * * * * * * * * * * * How about 1 = 0^2 + 1 = 0^3 + 1 = 0^5 + 1 ? Or 2 = 1^2 + 1 = ... The next one would be N = 2^30+1.
The administrator has disabled public write access.
Posted 1 Year ago
dagger29
Senior Boarder
Posts: 78
graphgraph
User Offline
 
cheater how about some non trivial soutions
The administrator has disabled public write access.
Posted 1 Year ago
ScottNash
Senior Boarder
Posts: 68
graphgraph
User Offline
 
Well, the problem itself is pretty trivial. You want N-1 to be a square, a cube and a fifth power. Do you see why it must be a 30th power? Will any 30th power do?

More interesting might be something like: find the least positive k such that there exist a square, a cube and a fifth power which are all distinct, all greater than 1, and no two differ by more than k.

Department of Mathematics http://www.math.ubc.ca/~israel University of British Columbia Vancouver, BC, Canada V6T 1Z2
The administrator has disabled public write access.
Posted 1 Year ago
paydayuscf
Senior Boarder
Posts: 79
graphgraph
User Offline
 
writes

N=1, r=s=t=0.
The administrator has disabled public write access.
Posted 1 Year ago
kdavis004
Senior Boarder
Posts: 63
graphgraph
User Offline
 
A couple of easy trivial solutions:

r = s = t = 0, N = 1 r = s = t = 1, N = 2

Next solution:

r = 2^15 s = 2^10 t = 2^6 N = 2^30 + 1
The administrator has disabled public write access.
 
Copyright © 2006 - Jan 2009 Fun Quizzes Club