Results 1 to 3 of 3

Math Help - Modulo problem

  1. #1
    Senior Member Twig's Avatar
    Joined
    Mar 2008
    From
    Gothenburg
    Posts
    396

    Modulo problem

    Hi!

    I am very new at this modulo arithmetic, and donīt know who to interpret this problem.

    Let N = 2*3*5*7*........*101 + 1

    Find the smallest positive integer for which N \equiv x\ (\bmod y)
    if y = 2.



    Please help me UNDERSTAND what to do here, not just a solution.

    Thanks!
    Last edited by Twig; August 7th 2008 at 01:06 PM. Reason: Trying to learn latex...
    Follow Math Help Forum on Facebook and Google+

  2. #2
    o_O
    o_O is offline
    Primero Espada
    o_O's Avatar
    Joined
    Mar 2008
    From
    Canada
    Posts
    1,408
    N \equiv 1 \: \left(\text{mod} \: 2\right)

    Why? Because N is an odd number (you have an even number + 1) and any odd number leaves a remainder of 1 (this is x) when divided by 2 (your modulus).
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Senior Member Twig's Avatar
    Joined
    Mar 2008
    From
    Gothenburg
    Posts
    396

    hi

    Hi!

    Yes of course, there is a 2 at the beginning! So N has to be odd because we add one at the end.

    Thanks!
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Modulo problem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: February 17th 2011, 08:17 PM
  2. Modulo problem
    Posted in the Discrete Math Forum
    Replies: 9
    Last Post: September 7th 2010, 06:53 AM
  3. Modulo of squares = modulo of roots
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: December 1st 2009, 10:04 AM
  4. Help with Modulo Problem
    Posted in the Algebra Forum
    Replies: 1
    Last Post: September 24th 2009, 09:54 AM
  5. Modulo problem
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: November 29th 2006, 10:03 PM

Search Tags


/mathhelpforum @mathhelpforum