Results 1 to 2 of 2

Math Help - proof with perfect and prime numbers

  1. #1
    Newbie
    Joined
    Sep 2010
    Posts
    3

    proof with perfect and prime numbers

    problem: given that the divisors of 2^(n-1)p are 1,2,2^2,...,2^(n-1) and p,2p,(2^2)p,...,2^(n-2)p; show that 2^(n-1)p is perfect when p=2^(n) -1 is prime.



    to show that 2^(n-1) p is perfect we need to show that it is equal to the sum of its divisors (including 1 but excluding itself).
    so we would show that
    2^(n-1)p = 1+2+2^2+...+2^(n-1) + p+2p+2^(2)p+...+2^(n-2)p
    2^(n-1)p = 1+2+2^2+...+2^(n-1) + p [1+2+2^(2)+...+2^(n-2)]

    * 1+2+2^2+...+2^(n-1) = 2^(n) -1 * therefore:

    2^(n-1)p = 2^(n)-1 + p [1+2+2^(2)+...+2^(n-2)]

    i dont know how to manipulate this equation anymore to get the right side to look like the left side?

    any suggestions?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    Oct 2009
    Posts
    4,261
    Quote Originally Posted by jean91890 View Post
    problem: given that the divisors of 2^(n-1)p are 1,2,2^2,...,2^(n-1) and p,2p,(2^2)p,...,2^(n-2)p; show that 2^(n-1)p is perfect when p=2^(n) -1 is prime.



    to show that 2^(n-1) p is perfect we need to show that it is equal to the sum of its divisors (including 1 but excluding itself).
    so we would show that
    2^(n-1)p = 1+2+2^2+...+2^(n-1) + p+2p+2^(2)p+...+2^(n-2)p
    2^(n-1)p = 1+2+2^2+...+2^(n-1) + p [1+2+2^(2)+...+2^(n-2)]

    * 1+2+2^2+...+2^(n-1) = 2^(n) -1 * therefore:

    2^(n-1)p = 2^(n)-1 + p [1+2+2^(2)+...+2^(n-2)]

    i dont know how to manipulate this equation anymore to get the right side to look like the left side?

    any suggestions?
    You need to remember the formulae for the sum of geometric sequences, and take into account that the divisors of

    2^{n-1}p=2^{n-1}(2^n-1)=2^{2n-1}-2^{n-1} are the ones given to you above, so their sum is:

    \sum\limits^{n-1}_{k=0}2^k+p\sum\limits^{n-2}_{k=0}2^k=2^n-1+p(2^{n-1}-1)=p+p(2^{n-1}-1)=2^{n-1}p

    Tonio
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Proof that all numbers>1 are divisable by a prime.
    Posted in the Number Theory Forum
    Replies: 7
    Last Post: July 13th 2011, 12:33 PM
  2. Proof involving prime numbers
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: March 7th 2011, 02:38 PM
  3. Proof with prime numbers
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 25th 2009, 08:58 PM
  4. Proof Perfect Numbers
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: March 29th 2007, 01:11 PM
  5. [SOLVED] Proof on Perfect Numbers
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: October 20th 2006, 09:07 AM

Search Tags


/mathhelpforum @mathhelpforum