Results 1 to 5 of 5

Math Help - Remainders

  1. #1
    Newbie
    Joined
    Mar 2006
    Posts
    2

    Remainders

    Help I'm so confused on how to solve these math problems....
    • Find the remainder when 15! is divided by 17
    • Find the remainder when 2(26!) is divided by 29
    • Verify that 4(29!) + 5! is divisible by 31
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by dooz33
    Help I'm so confused on how to solve these math problems....
    [list][*]Find the remainder when 15! is divided by 17
    Since, you are working modulo 17, you have that the product,
    15x14x13x12x11x10x9x8x7x6x5x4x3x2x1
    Is the same as,
    (-2)x(-3)x(-4)x(-5)x(-6)x(-7)x(-8)x8x7x6x5x4x3x2x1
    Thus, you have, (multiply same numbers)
    -1x4x9x16x25x36x49x64
    Again, since you are working modulo 17 you have,
    -1x4x(-8)x(-1)x(-8)x(2)x(-2)x(-4)
    Thus, you have, (multiply same numbers)
    1x16x64
    Thus,
    1x(-1)x(-4)
    Thus,
    4
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Forum Admin topsquark's Avatar
    Joined
    Jan 2006
    From
    Wellsville, NY
    Posts
    10,211
    Thanks
    419
    Awards
    1

    Cool

    Now THAT was just too cool!

    -Dan
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Senior Member
    Joined
    Jun 2005
    Posts
    295
    Awards
    1
    I suspect that these are exercises on Wilson's Theorem: (p-1)! \equiv -1 \pmod p for prime p.

    So for example 16.15! \equiv -1 \pmod{17} gives 15! \equiv 1. (ThePerfectHacker dropped some factors from his multiplication.)
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Junior Member
    Joined
    Jan 2006
    Posts
    56
    Quote Originally Posted by rgep
    I suspect that these are exercises on Wilson's Theorem: (p-1)! \equiv -1 \pmod p for prime p.

    So for example 16.15! \equiv -1 \pmod{17} gives 15! \equiv 1. (ThePerfectHacker dropped some factors from his multiplication.)
    I suspect there is more then one théorème involved in those three different questions thus they are surely many ways to find the solution
    wich is the clever according to the questioner supposed knowledge

    edit: i am on the third's question from here and now!
    ----- and i know not much (just a little basis on congruence).

    edit: for this one i would take PerfectHacker methodologie
    Last edited by SkyWatcher; March 31st 2006 at 09:50 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Remainders
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 9th 2010, 07:27 PM
  2. Remainders
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: October 18th 2010, 06:04 AM
  3. Remainders mod x
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 15th 2010, 10:57 PM
  4. Remainders
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 18th 2010, 03:27 PM
  5. Remainders again
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: March 27th 2010, 10:35 AM

Search Tags


/mathhelpforum @mathhelpforum