1. Find all primes of the form $n^3-1$ .
Problem
Source:
Tags: number theory
21.06.2017 22:39
$n^3 - 1 = (n-1)(n^2 + n + 1)$ $n^2 + n + 1 > 1$ for any postive integer $n$ Thus $(n-1) = 1 \Rightarrow n = 2$ Thus only solution is $n = 2$
21.06.2017 23:01
So the prime would be 7, right?
22.06.2017 00:30
Is thua really an Olympiad question?!
22.06.2017 01:43
I have seen a harder AIME #4. As a generalization, if the question asked for $x^n-1$ being a prime, then the only possible solution would be $x=2$. THis may not be a solution, but there are no other solutions possible.
22.06.2017 10:08
You mean $x=2$?
22.06.2017 19:04
mathwiz0803 wrote: I have seen a harder AIME #4. As a generalization, if the question asked for $x^n-1$ being a prime, then the only possible solution would be $x=2$. THis may not be a solution, but there are no other solutions possible. Obviously, since that expression is divisible by $x-1$ hence it must be $1$
22.06.2017 19:49
Pandasareamazing. wrote: So the prime would be 7, right? Yes the prime is $7$.
26.04.2023 21:06
$n^3-1=(n-1)(n^2+n+1)$ $n^2+n+1>1$ for all natural n Implying that $n-1=1 \Rightarrow n=2$ Which is the only solution $\blacksquare$