(In reply to re: Answer:
Good question, Charlie!
It is obvious to me that only odd values of n need to be checked.
If n = 2k, then ((2k)^(2k))-1 can be factored into
(((2k)^(k))-1) * (((2k)^(k))+1),
and x is not going to be prime if k > 1