Results 1 to 4 of 4

Math Help - proof using modular math

  1. #1
    Newbie
    Joined
    May 2009
    Posts
    9

    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
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,616
    Thanks
    1579
    Awards
    1
    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?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    May 2009
    Posts
    9
    thats not what my question is asking but it is an interesting question
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Flow Master
    mr fantastic's Avatar
    Joined
    Dec 2007
    From
    Zeitgeist
    Posts
    16,948
    Thanks
    5
    Quote Originally Posted by lmasud View Post
    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 ....
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 6
    Last Post: December 10th 2010, 06:35 AM
  2. Modular math
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: May 21st 2010, 09:05 PM
  3. modular arithmetic proof
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: February 8th 2010, 05:03 AM
  4. modular proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 23rd 2009, 04:48 PM
  5. Modular Proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 13th 2009, 11:21 PM

Search Tags


/mathhelpforum @mathhelpforum