Any integer of the form ## 8^n+1 ##, where n##\geq##1, is composite?

Click For Summary
SUMMARY

Any integer of the form 8n + 1, where n ≥ 1, is definitively composite. This conclusion is derived from the factorization of 8n + 1 into (2n + 1)(22n - 2n + 1). Since both factors are greater than 1 for n ≥ 1, it follows that 8n + 1 cannot be prime. The proof is validated through the application of the remainder theorem and polynomial division.

PREREQUISITES
  • Understanding of integer factorization
  • Familiarity with polynomial division
  • Knowledge of the remainder theorem
  • Basic concepts of number theory
NEXT STEPS
  • Study the properties of the remainder theorem in depth
  • Learn about polynomial factorization techniques
  • Explore advanced topics in number theory related to composite numbers
  • Investigate the implications of similar forms, such as 9n + 1
USEFUL FOR

Mathematicians, students of number theory, and anyone interested in the properties of composite numbers and integer factorization will benefit from this discussion.

Math100
Messages
817
Reaction score
230
Homework Statement
Establish the following statement:
Any integer of the form ## 8^n+1 ##, where n##\geq##1, is composite.
[Hint: ## 2^n+1\mid 2^{3n} +1 ##.]
Relevant Equations
None.
Proof:

Suppose ##a=8^n+1 ## for some ##a \in\mathbb{Z}## such that n##\geq##1.
Then we have ##a=8^n+1 ##
=## (2^3)^n+1 ##
=## (2^n+1)(2^{2n} -2^n+1) ##.
This means ## 2^n+1\mid 2^{3n} +1 ##.
Since ##2^n+1>1## and ##2^{2n} -2^n+1>1## for all n##\geq##1,
it follows that ##8^n+1## is composite.
Therefore, any integer of the form ##8^n+1 ##, where n##\geq##1, is composite.
 
Last edited:
  • Like
Likes   Reactions: fresh_42
Physics news on Phys.org
Correct. You should begin with the next chapter.
 
  • Like
Likes   Reactions: Math100
E.g. you have been told that ##(2^n+1)\,|\,(2^{3n}+1)## and your calculation shows how. Now, can you also divide ##(2^{3n}+1) \, : \,(2^{n}+1) = ## by long division?
 
  • Like
Likes   Reactions: Math100
It's ## 2^{2n} +1-2^n ##.
 
Let ##m = 2^n##, so that ##a = m^3 + 1##. By the remainder theorem ##m + 1## is a factor of ##m^3 + 1##. Also, for ##m > 1## we have ##m^3 +1 \ne m + 1##, so the other factor cannot be ##1##. Hence ##a## is composite for ##n \ge 1##.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
Replies
7
Views
4K
  • · Replies 30 ·
2
Replies
30
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 12 ·
Replies
12
Views
5K
Replies
3
Views
1K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
1
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K