Does anybody know if this is true?
I can't find references about it, also I can't prove to be true (or false).
I think computing $x$ is a brute force task.
Thanks (and sorry if I lost some basic concept).
Does anybody know if this is true?
I can't find references about it, also I can't prove to be true (or false).
I think computing $x$ is a brute force task.
Thanks (and sorry if I lost some basic concept).
Definitely not for all pairs $(q,n)$.
For instance $x^q-1$ is a multiple of $x-1$ and so if $x^q-1$ is prime then $x-1=1$ and so $x=2$. But $2^q-1$ is prime only if $q$ is prime. So, for all $q$ composite, $x^q-1$ is never a prime.
Finding the $q$ for which $2^q-1$ is prime is major undertaking and the main source of large primes. See Mersenne prime.
It is false for $q=3$ and $n=12^3$, since $x^3-12^3 = (x-12)(x^2+12x+144)$, which is negative and so not prime for $x<12$; equals $0$, not prime, for $x=12$; equals $469 = 7 * 67$ for $x=13$, and finally is divisible by $x-12$ for $x>13$.