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

Click For Summary
Any integer of the form 8^n + 1, where n ≥ 1, is proven to be composite. The expression can be factored into (2^n + 1)(2^(2n) - 2^n + 1), establishing that both factors are greater than 1 for n ≥ 1. This shows that 8^n + 1 has divisors other than 1 and itself. Further analysis using the remainder theorem confirms that m + 1 is a factor of m^3 + 1, reinforcing the composite nature of the expression. Thus, the conclusion is that all integers of the form 8^n + 1 for n ≥ 1 are indeed composite.
Math100
Messages
816
Reaction score
229
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:
Physics news on Phys.org
Correct. You should begin with the next chapter.
 
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?
 
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##.
 
First, I tried to show that ##f_n## converges uniformly on ##[0,2\pi]##, which is true since ##f_n \rightarrow 0## for ##n \rightarrow \infty## and ##\sigma_n=\mathrm{sup}\left| \frac{\sin\left(\frac{n^2}{n+\frac 15}x\right)}{n^{x^2-3x+3}} \right| \leq \frac{1}{|n^{x^2-3x+3}|} \leq \frac{1}{n^{\frac 34}}\rightarrow 0##. I can't use neither Leibnitz's test nor Abel's test. For Dirichlet's test I would need to show, that ##\sin\left(\frac{n^2}{n+\frac 15}x \right)## has partialy bounded sums...