Scribd
Upload
121 views4 pages

Dreaming of The Perfect Number

The document discusses perfect numbers and how they relate to powers of two. It begins by describing a dream where the author was given a puzzle about creating numbers from other numbers using prime factors. This led the author to investigate perfect numbers, which are numbers where the sum of their proper positive divisors is equal to the number. The document then presents the concept of perfect numbers, provides some examples, and notices a pattern where perfect numbers can be expressed as (2^n) * (2^(n+1) - 1) when 2^(n+1) - 1 is a prime number. It concludes by sharing a program to test this pattern for larger numbers.

Uploaded by

Adrian Cox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
121 views4 pages

Dreaming of The Perfect Number

The document discusses perfect numbers and how they relate to powers of two. It begins by describing a dream where the author was given a puzzle about creating numbers from other numbers using prime factors. This led the author to investigate perfect numbers, which are numbers where the sum of their proper positive divisors is equal to the number. The document then presents the concept of perfect numbers, provides some examples, and notices a pattern where perfect numbers can be expressed as (2^n) * (2^(n+1) - 1) when 2^(n+1) - 1 is a prime number. It concludes by sharing a program to test this pattern for larger numbers.

Uploaded by

Adrian Cox
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 4

Dreaming Of The Perfect Number

Wtitten by Adi Cox


5th September 2016
_____________________________________________________________________
Like many dreams I can only remember the end of this dream. I woke
up early in the morning with a puzzle gifted to me from the
Pleiadians:
"Create 28 from 47?"
47 - 19 = 28 was my first thought, but that was a boring answer. So
I started to think about the factors of 28 and so I got 4 times 7
equals 28, which I thought was a much better answer.
To me 28 is an important number because it is a perfect number.
i.e. The factors of n less than n when added together equal n. In
the case of 28:
1 + 2 + 4 + 7 + 14 = 28
If a number n has factors less than n that add up to less than n
then n is deficient.
If a number n has factors less than n that add up to greater than n
then n is abundant.
28 is the second perfect number, 6 being the first:
1 + 2 + 3 = 6
Using this analogy of the above we get the puzzle:
"Create 6 from 23?"
Which is obviously 2 times 3 equals 6.
Following this logic we get the following:
_____________________________________________________________________
Perfect Numbers
----->
Create From x
Prime Factors
_____________________________________________________________________
6
28
496
8128
33550336
8589869056

----->
----->
----->
----->
----->
----->

23
47
1631
64127
40968191
65536131071

2^1 . 3
2^2 . 7
2^4 . 31
2^6 . 127
2^12 . 8191
2^16 . 131071

_____________________________________________________________________
I can see a pattern here:
2^n , 2^(n+1) -1

2^2 , 2^3 -1
4 , 7
4 times 7 equals 28 so does (2^n)(2^(n+1) -1) equal a perfect number?
2^3 , 2^4 -1
8 , 15
8 times 15 equals 120 but 120 is an abundant number and so it is not
perfect. This is because 15 is not a prime number.
When 2^(n+1) -1 is not a prime number then (2^n)(2^(n+1) -1) is not
a perfect number, but when 2^(n+1) -1 is a prime number then
(2^n)(2^(n+1) -1) is a perfect number.
The above is only true for the small sample of perfect numbers that I
have investigated. Inductive reasoning is not a proof, but it makes a
strong argument.
I am sure that these are all well known facts that I have found here
but I worked it out for myself, with a little help from my friends.
_____________________________________________________________________
Below is a program to find perfect numbers:
_____________________________________________________________________
<!DOCTYPE HTML PUBLIC " - //W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd
">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>A for loop</title>
</head>
<body>
<script type="text/javascript" language="javascript">

u=1;
v=34;

document.write("y is a perfect number when x is a prime number:<br />");


document.write(" (2^(x-1)) * ((2^x)-1) = y","<br />");
document.write("-----------------------------------------------<br />");
document.write("<br />");
for (x = u; x < v; x++)
{
//y=(2^(x-1))*((2^x)-1);
a=Math.pow(2, x);
b=Math.pow(2, (x+1))
//document.write(a,"<br />");
//document.write(b,"<br />");
//document.write(a*(b-1),"<br />");

document.write("(2^(",x,")) * ((2^",x+1,")-1) = ",a*(b-1), "<br />");


document.write(a," * ",b-1," = ",a*(b-1), "<br />");
document.write("<br />");
}
</script>
</body>
</html>
_____________________________________________________________________
Below is the output for the above program:
_____________________________________________________________________
y is a perfect number when x is a prime number:
(2^(x-1)) * ((2^x)-1) = y
----------------------------------------------(2^(1)) * ((2^2)-1) = 6
2 * 3 = 6
(2^(2)) * ((2^3)-1) = 28
4 * 7 = 28
(2^(3)) * ((2^4)-1) = 120
8 * 15 = 120
(2^(4)) * ((2^5)-1) = 496
16 * 31 = 496
(2^(5)) * ((2^6)-1) = 2016
32 * 63 = 2016
(2^(6)) * ((2^7)-1) = 8128
64 * 127 = 8128
(2^(7)) * ((2^8)-1) = 32640
128 * 255 = 32640
(2^(8)) * ((2^9)-1) = 130816
256 * 511 = 130816
(2^(9)) * ((2^10)-1) = 523776
512 * 1023 = 523776
(2^(10)) * ((2^11)-1) = 2096128
1024 * 2047 = 2096128
(2^(11)) * ((2^12)-1) = 8386560
2048 * 4095 = 8386560
(2^(12)) * ((2^13)-1) = 33550336
4096 * 8191 = 33550336
(2^(13)) * ((2^14)-1) = 134209536
8192 * 16383 = 134209536
(2^(14)) * ((2^15)-1) = 536854528
16384 * 32767 = 536854528

(2^(15)) * ((2^16)-1) = 2147450880


32768 * 65535 = 2147450880
(2^(16)) * ((2^17)-1) = 8589869056
65536 * 131071 = 8589869056
(2^(17)) * ((2^18)-1) = 34359607296
131072 * 262143 = 34359607296
(2^(18)) * ((2^19)-1) = 137438691328
262144 * 524287 = 137438691328
(2^(19)) * ((2^20)-1) = 549755289600
524288 * 1048575 = 549755289600
(2^(20)) * ((2^21)-1) = 2199022206976
1048576 * 2097151 = 2199022206976
(2^(21)) * ((2^22)-1) = 8796090925056
2097152 * 4194303 = 8796090925056
(2^(22)) * ((2^23)-1) = 35184367894528
4194304 * 8388607 = 35184367894528
(2^(23)) * ((2^24)-1) = 140737479966720
8388608 * 16777215 = 140737479966720
(2^(24)) * ((2^25)-1) = 562949936644096
16777216 * 33554431 = 562949936644096
(2^(25)) * ((2^26)-1) = 2251799780130816
33554432 * 67108863 = 2251799780130816
(2^(26)) * ((2^27)-1) = 9007199187632128
67108864 * 134217727 = 9007199187632128
(2^(27)) * ((2^28)-1) = 36028796884746240
134217728 * 268435455 = 36028796884746240
(2^(28)) * ((2^29)-1) = 144115187807420420
268435456 * 536870911 = 144115187807420420
(2^(29)) * ((2^30)-1) = 576460751766552600
536870912 * 1073741823 = 576460751766552600
(2^(30)) * ((2^31)-1) = 2305843008139952000
1073741824 * 2147483647 = 2305843008139952000
(2^(31)) * ((2^32)-1) = 9223372034707292000
2147483648 * 4294967295 = 9223372034707292000
(2^(32)) * ((2^33)-1) = 36893488143124136000
4294967296 * 8589934591 = 36893488143124136000
(2^(33)) * ((2^34)-1) = 147573952581086480000
8589934592 * 17179869183 = 147573952581086480000

You might also like