# Thread: proof using modular math

1. ## proof using modular math

show that 5n+3, where n is an element of prime numbers, can never be a perfect square.

thanks in advance

2. Can you find an integer k such that $5\left| {\left( {k \pm \sqrt 3 } \right)} \right.?$
Why or why not?
What does this have to do with this question?

3. thats not what my question is asking but it is an interesting question

4. Originally Posted by lmasud
thats not what my question is asking but it is an interesting question
Actually, it is what your question is asking.

Note: Plato is not in the habit of asking irrelevant questions ....