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

Math100
Messages
813
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##.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top