I am not able to give a proof of the following statement: given an integer number $k$, we consider the following expression: $$x=\sqrt{k^3}-\sqrt[3]{k^2}$$ Show that you can get infinite prime numbers from this formula. I tried for $1\le k \le 1e7$ and I found only one prime number: $531457$. Is it possible to show we can get only a finite set of primes using the equation defined above? Many thanks.
Asked
Active
Viewed 449 times
2
1 Answers
3
One possible interpretation is that an infinite number of primes appear as divisors in the sequence $\lfloor k^{3/2}-k^{2/3} \rfloor$ for $k \in \mathbb{N}$. This follows from the fact that there are approximately $N^{2/3}$ numbers of this form below $N$ and this growth rate cannot be achieved with only finitely many primes as factors.
WimC
- 32,192
- 2
- 48
- 88
And if $k$ is not a sixth power, then the two terms are non-rational algebraic integers of degrees two and three respectively, so their sum cannot be a rational integer.
Something doesn't add up. Which value of $k$ gives $$531457=3^{12}+2^4?$$
– Jyrki Lahtonen Mar 20 '12 at 17:56