proof using modular math

Printable View

• May 11th 2009, 04:19 PM
lmasud
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
• May 11th 2009, 05:08 PM
Plato
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?
• May 12th 2009, 04:59 AM
lmasud
thats not what my question is asking but it is an interesting question
• May 12th 2009, 05:04 AM
mr fantastic
Quote:

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 ....