Every integer of the form n^4+4, with n>1, is composite?

In summary, every integer of the form n^4+4, with n>1, is composite, as shown by the non-trivial factorization of n^4+4 into (n^2-2n+2)(n^2+2n+2) for n>1.
  • #1
Math100
783
220
Homework Statement
Establish the following statement:
Every integer of the form n^4+4, with n>1, is composite.
Relevant Equations
None.
Proof: Suppose a=n^4+4 for some a##\in\mathbb{Z}## such that n>1.
Then we have a=n^4+4=(n^2-2n+2)(n^2+2n+2).
Note that n^2-2n+2>1 and n^2+2n+2>1 for n>1.
Therefore, every integer of the form n^4+4, with n>1, is composite.
 
  • Like
Likes fresh_42
Physics news on Phys.org
  • #2
Math100 said:
Homework Statement:: Establish the following statement:
Every integer of the form n^4+4, with n>1, is composite.
Relevant Equations:: None.
Proof: Suppose a=n^4+4 for some a##\in\mathbb{Z}## such that n>1.
Then we have a=n^4+4=(n^2-2n+2)(n^2+2n+2).
Note that n^2-2n+2>1 and n^2+2n+2>1 for n>1.
Therefore, every integer of the form n^4+4, with n>1, is composite.
If you add double sharps then you get automatically the correct form:

Math100 said:
Homework Statement:: Establish the following statement:
Every integer of the form ##n^4+4##, with ##n>1##, is composite.

Proof: Suppose ##a=n^4+4## for some ##a \in\mathbb{Z}## such that ##n>1.##
Then we have ##a=n^4+4=(n^2-2n+2)(n^2+2n+2).##
Note that ##n^2-2n+2>1## and ##n^2+2n+2>1## for ##n>1.##
Therefore, every integer of the form ##n^4+4##, with ##n>1##, is composite.

Here is my version for comparison:

\begin{align*}
n^4+4&=n^4+4n^2+4 - 4n^2=(n^2+2)^2 -4n^2\\
&=((n^2+2)-2n)((n^2+2)+2n)
\end{align*}
Since ##n^2+2n+2 > n^2-2n+2>1## for all ##n>1##, ##n^4+4## has a non-trivial factorization, i.e. is composite.
 
  • Like
Likes nuuskur and Math100
  • #3
fresh_42 said:
If you add double sharps then you get automatically the correct form:
Here is my version for comparison:

\begin{align*}
n^4+4&=n^4+4n^2+4 - 4n^2=(n^2+2)^2 -4n^2\\
&=((n^2+2)-2n)((n^2+2)+2n)
\end{align*}
Since ##n^2+2n+2 > n^2-2n+2>1## for all ##n>1##, ##n^4+4## has a non-trivial factorization, i.e. is composite.
Sorry, but I don't understand 'double sharps'. What does this mean?
 
  • #4
Math100 said:
Sorry, but I don't understand 'double sharps'. What does this mean?
Type ## a= n^4+4 ## instead of a=n^4+4.
 
  • Like
Likes Math100
  • #5
fresh_42 said:
Type ## n^4 ## instead of n^4.
Thank you, now I got it!
 

FAQ: Every integer of the form n^4+4, with n>1, is composite?

What is the statement "Every integer of the form n^4+4, with n>1, is composite?"

The statement means that for any integer greater than 1, if it is raised to the fourth power and then added to 4, the resulting number will always be a composite number (a number that is not prime and has more than two factors).

Why is this statement important?

This statement is important because it is a mathematical theorem that has been proven to be true. It provides a general rule for determining whether a number is composite, which can be useful in various mathematical applications.

How was this statement proven?

This statement was proven using mathematical induction, which is a method of mathematical proof that involves showing that a statement is true for a base case (in this case, n=2) and then proving that if the statement is true for a particular value of n, it must also be true for the next value of n (n+1).

Can this statement be applied to any number that is raised to a power and then added to a constant?

No, this statement only applies to numbers of the form n^4+4. It has been proven to be true for this specific form, but may not hold true for other forms.

What are some examples of numbers that would satisfy this statement?

Some examples of numbers that would satisfy this statement are 20, 68, 148, 260, 404, etc. These numbers are all of the form n^4+4, where n is greater than 1, and they are all composite numbers.

Back
Top