Let $a \geq 3$ and suppose $a^2 + 1$ is a prime number. How do I prove the unitary digit of $a$ must be one of $6, 4$ or $0$. I can see it's true for $a^2+1=17, 37, 101, 197, 257...$etc. where the $10^0$ digit of $a$ is $6, 4$ or $0$ and the pattern repeats but how do I show this and formulate it into a proof using modular arithmetic?
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment