The following problem is a special case Show this number always is composite number? , but I think this special case is relatively difficult to deal with, that is, if this is solved, it may solve the general situation.
show this number $$A=2004^{2005}+1002^{2005}\cdot 2005^{1002}+2005^{2004}$$is not a prime number.
This is a question from an eighth-grade math contest exercise, (this .:see:at last page problem 20 I'm thinking mod 3, mod 5, mod 7. It doesn't seem to work. because $$A\equiv 0+0+1=1\pmod 3$$ $$A\equiv -1+0+0=4\pmod 5$$ Use Fermat's little theorem $$A\equiv 2+1+3^{0}=4\pmod 7$$
Actually the smallest prime factor of A turns out to be $670543$. This limits the number of approaches that could possibly work: don't bother checking mod small primes.