Since x a b − 1 = ( x a − 1 ) × ( x a ( b − 1 ) + x a ( b − 2 ) + ⋯ + x a + 1 ) , we conclude that the number 2 1 0 5 − 1 has factors of 2 3 − 1 = 7 , 2 5 − 1 = 3 1 and 2 7 − 1 = 1 2 7 . Is ( 2 3 − 1 ) × ( 2 5 − 1 ) × ( 2 7 − 1 ) 2 1 0 5 − 1 prime?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
@Arjen Vreugdenhil FYI Another use of cyclotomic polynomials, for factoring x n − 1 .
As an aside, sophie germain identity is also Cyclotomic polynomials in disguise. This allows us to generalize the identity, with (initially surprising) results.
First we show that 49 divides 2 2 1 − 1 . Indeed, from 2 1 0 = 1 0 2 4 = 2 1 ⋅ 4 9 − 5 ≡ − 5 ( m o d 4 9 ) we have 2 2 1 = 2 ⋅ ( 2 1 0 ) 2 ≡ 2 ⋅ ( − 5 ) 2 ≡ 5 0 ≡ 1 ( m o d 4 9 ) , so 2 2 1 − 1 ≡ 0 ( m o d 4 9 ) . By 21 | 105 we get 2 2 1 − 1 | 2 1 0 5 − 1 , hence we can conclude that the power of 7 in the factorisation of 2 1 0 5 − 1 has to be at least 2. Since 2 1 0 5 − 1 divided by 7, 31 and 127 is definitely bigger than 7, furthermore we have proven that it has to be divisible by 7, it follows that it cannot be a prime.
Relevant Wiki : Lifting the Exponent
The number 2 1 0 5 − 1 is divided by 7 , 3 1 , 1 2 7 .
We need to find how many number of primes 7 , 3 1 , 1 2 7 exists in the factorization of 2 1 0 5 − 1
First start with 7
2 1 0 5 − 1 = ( 2 1 5 ) 7 − 1
Herem, 7 ∣ 2 1 5 − 1
Proof: 2 6 ≡ 1 = > 2 1 2 ≡ 1 = > 2 1 5 = 2 1 2 . 2 3 ≡ 1 ( m o d 7 )
So, using L T E lemma
v p ( x n − y n ) = v p ( x − y ) + v p ( n )
v 7 ( 2 1 0 5 − 1 ) = v 7 ( 2 1 5 − 1 ) + v 7 ( 1 0 5 )
v 7 ( 2 1 0 5 − 1 ) ≥ 1 + 1 = 2
So, there is at leat two factors of 7 are there.
When 2 1 0 5 − 1 is divided by the primes 7 , 3 1 , 1 2 7 there will be at least one 7 and other quotient part which is achieved by dividing 3 1 , 1 2 7 .As g c d ( 7 , 3 1 , 1 2 7 ) = 1 So, at least 7 will be in tact.
Finally the quotient will be looks like 7 × q which can not be prime
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Cyclotomic Polynomials
Here's how I solved the problem, making use of 2 a − 1 ∣ 2 a b − 1 that I was alluding to.
We know that 2 1 5 − 1 ∣ 2 1 0 5 − 1 . It is easy to see that ( 2 3 − 1 ) ( 2 5 − 1 ) 2 1 5 − 1 would be a proper factor (not necessarily prime) of the expression. Hence the expression is not prime.
More generally, we know that ( 2 1 0 5 − 1 ) = ∏ d ∣ 1 0 5 Φ d ( 2 ) , which gives us 8 factors of 105 (of which Φ 1 ( 2 ) = 1 ). This expresses 2 1 0 5 − 1 as the product of 7 (not necessarily prime) factors, and we've only eliminated 3 prime factors. The other factors of the expression are Φ 1 5 ( 2 ) (which is the term I gave above), Φ 2 1 ( 2 ) , Φ 3 5 ( 2 ) , and Φ 1 0 5 ( 2 ) .
In particular, this generalizes easily. We didn't need to hunt down a certain factor that worked.
Do you see why I had to use 1 0 5 = 3 × 5 × 7 as the product of 3 prime factors? Simply using 1 5 = 3 × 5 would only give us 1 additional factor.