Results 1 to 2 of 2

Math Help - Show that for all integers r,s

  1. #1
    Newbie
    Joined
    Apr 2008
    Posts
    2

    Show that for all integers r,s

    Quite straightforward, but it's proving somewhat frustrating for me.

    Show that for all integers r,s with 2(r^2)+1= s, one of r and s must be divisble by 3.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Quote Originally Posted by Jamot69 View Post
    Quite straightforward, but it's proving somewhat frustrating for me.

    Show that for all integers r,s with 2(r^2)+1= s, one of r and s must be divisble by 3.
    If r has form 3k+1 then 2(r^2)+1 is divisible by 3, so s is divisible by 3. If r has form 3k+2 the same idea applies. Otherwise r has form 3k but then there is nothing to show.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Show that there exist no positive integers ...
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: August 23rd 2011, 04:49 PM
  2. Replies: 1
    Last Post: September 7th 2010, 07:30 PM
  3. Take integers a,b,c,d. Show that...
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 29th 2010, 09:41 AM
  4. Replies: 1
    Last Post: October 10th 2008, 02:51 AM
  5. Replies: 2
    Last Post: September 22nd 2007, 02:03 PM

Search Tags


/mathhelpforum @mathhelpforum