Monday, April 9, 2018

Prove that none of the numbers 1(9),11(9),111(9),1111(9)cdots are prime




I want to prove that none of the numbers 1(9),11(9),111(9),1111(9) are prime where x(9) means, the number x is in base 9. My first attempt was to try mathematical induction. V(0) works because 1 is not a prime. But then i couldn't prove the induction step anyhow.
1+9+81+...+9n is not prime1+9+81+...+9n+1 is not prime
My next try was to prove it with geometric series.
Let sn=nk=19n
We are proving nN:sn is not prime.
using the sum of geometric seriessn=9n18 But here I am stuck again and have no idea how to show that this can't be prime for any nN.


Answer



Hint
9n1=(3n)21=(3n1)(3n+1)




Now, 3n1,3n+1 are two consecutive even numbers, thus one is divisible by 4 and the other by 2. Consider the two cases (when 4|3n1 and 4|3n+1) and write 9n18 as a product of two integers. Explain why neither can be 1.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...