I have two expressions (both of which have a term raised to the power of $n$) and I am trying to prove that they can't be prime numbers at the same time for $n>2$.
I can't post the expressions, but I was wondering if there was someway to prove it by saying: "Let the first and the second be prime numbers then because their product is equal to something they can't be prime numbers at the same time.
Is their a statement or law that I can use?