20040627, 21:34  #1 
"Juan Tutors"
Mar 2004
571 Posts 
Question on prime powers
I'm wondering if it can be shown, or even if it's known yet, whether there exist primes p,q such that (p^m)(q^n)<=A for an arbitrary positive integer A.
I am wondering because, in the special case where p and q are 2 and 3 (or vice versa) it might be easy to prove primality or compositeness of integers N in the range (q^n)<N<(p^m) through arguments about what forms the factors of N must have. 
20040704, 12:53  #2  
Mar 2004
11101_{2} Posts 
Quote:
Catalan's theorem states that there is only one solution (3²2³) for this equation. It has been prooven a few years ago after about 150 years of uncertainty :o) So I guess the answer to your question is not trivial. Jürgen 

20040707, 07:07  #3 
Feb 2003
2^{5} Posts 
try this page: http://www.primepuzzles.net/conjectures/conj_031.htm

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve  mickfrancis  Factoring  2  20160506 08:13 
Prime Powers  plandon  Math  7  20090630 21:29 
2^x using powers of e?  nibble4bits  Math  31  20071211 12:56 
Sums of prime powers  grandpascorpion  Math  49  20070422 17:06 
Powers, and more powers  Numbers  Puzzles  3  20050713 04:42 