Results 1 to 2 of 2

Thread: A divisibility problem 2

  1. February 27th 2010, 03:40 PM #1
    eyke
    eyke is offline
    Newbie
    Joined
    Mar 2009
    Posts
    16

    A divisibility problem 2

    Show that (n!+1, (n+1)!+1)=1
    Follow Math Help Forum on Facebook and Google+
  2. February 27th 2010, 04:32 PM #2
    NonCommAlg
    NonCommAlg is offline
    MHF Contributor
    Joined
    May 2008
    Posts
    2,296
    Thanks
    6
    Quote Originally Posted by eyke View Post
    Show that (n!+1, (n+1)!+1)=1
    if d \mid n! + 1, then d \mid (n+1)! + n+1. so if we also have d \mid (n+1)! + 1, then d \mid n and hence d \mid n!, which completes the proof because we're given that d \mid n!+1.
    Follow Math Help Forum on Facebook and Google+
« A divisibility problem | Primes 2 »

Similar Math Help Forum Discussions

  1. Divisibility problem
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: December 8th 2011, 06:24 PM
  2. [SOLVED] Divisibility Problem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: June 28th 2011, 07:53 AM
  3. Divisibility Problem(2)
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: September 18th 2010, 01:02 PM
  4. A divisibility problem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 27th 2010, 04:28 PM
  5. A divisibility problem 3
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 27th 2010, 04:15 PM

Search Tags


/mathhelpforum @mathhelpforum