Scribd
Upload
33 views1 page

Seltop MATH1

The document presents a theorem for finding the sum of divisors of numbers of the form PN, where P is a prime number and N is an integer greater than or equal to 1. It shows examples for N=1,2,3,4,5 that the sum of divisors can be expressed as (PN+1 +PN +PN-1 +PN-2+...+ P1 +P0). It then states that for any prime number P, the sum of divisors of PN will equal this expression.

Uploaded by

irisiri28
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views1 page

Seltop MATH1

The document presents a theorem for finding the sum of divisors of numbers of the form PN, where P is a prime number and N is an integer greater than or equal to 1. It shows examples for N=1,2,3,4,5 that the sum of divisors can be expressed as (PN+1 +PN +PN-1 +PN-2+...+ P1 +P0). It then states that for any prime number P, the sum of divisors of PN will equal this expression.

Uploaded by

irisiri28
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1st Theorem : First Sem SelTop Math Let P be a prime number N be an integer greater than or equal to 1

If N = 1 = N=2 = N =3 = N =4 = N =5 = =
( )( )

)(

= P+1

)(

= (
)

) =(
)

= =

)(

) =( )

)(

=(

**from this sets of examples coming from the equation of finding the sum of the divisors for a number, we can come up with another equation (shortcut): For any number P that is a prime number, The sum of the divisors for PN equals:

Sd (PN) = (PN+1 +PN +PN-1 +PN-2++ P1 +P0)

You might also like