Prove-that-for-every-integer-n-2-the-number-n-4-4-n-is-composite-

Tinku Tara March 2, 2025 Number Theory 0 Comments

Question Number 217130 by ArshadS last updated on 02/Mar/25

Prove that for every integer n≥2 the number n^4 + 4^n is composite.

$$ \\ $$$$\mathrm{Prove}\:\mathrm{that}\:\mathrm{for}\:\mathrm{every}\:\mathrm{integer}\:\:\mathrm{n}\geqslant\mathrm{2}\:\:\mathrm{the}\:\mathrm{number}\:\:\mathrm{n}^{\mathrm{4}} +\:\mathrm{4}^{{n}} \:\:\mathrm{is} \\ $$$$\mathrm{c}{o}\mathrm{mposite}. \\ $$

Facebook Tweet Pin

Prove-that-for-every-integer-n-2-the-number-n-4-4-n-is-composite-

Leave a Reply Cancel reply