CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 3 of 3
  1. #1
    Join Date
    Feb 2015
    Posts
    21

    anyone explain this to me??

    Name:  m2.jpg
Views: 160
Size:  15.8 KB
    plz explain it with ans~~i am not so sure

  2. #2
    VictorN's Avatar
    VictorN is offline Super Moderator Power Poster
    Join Date
    Jan 2003
    Location
    Hanover Germany
    Posts
    20,398

    Re: anyone explain this to me??

    Well, reading the http://en.wikipedia.org/wiki/Modular_arithmetic would be a good start!
    Victor Nijegorodov

  3. #3
    Join Date
    Jul 2013
    Posts
    576

    Re: anyone explain this to me??

    Quote Originally Posted by tonsonson View Post
    i am not so sure
    You only need to know that a = b mod m means a<m.

    First have a look at proposition i. On the left side a+x must be smaller than m+m but on the right side b can be infinitely big so this proposition must be false.

    Then have a look at proposition ii. On the left side a*x can be almost m*m but the right side can never be bigger than m so this proposition must be false too.

    And that's enougth to declare alternative B the winner (if one of A thru E is true).
    Last edited by razzle; February 22nd, 2015 at 04:37 AM.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  





Click Here to Expand Forum to Full Width

Featured