mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-07-14, 08:13   #12
JeppeSN
 
JeppeSN's Avatar
 
"Jeppe"
Jan 2016
Denmark

2408 Posts
Smile

Quote:
Originally Posted by drmurat View Post
I asked it because if 2^(n) + 1 is prime and 2^(n+1) + 1 can be prime . it means
(2^n) * (2^ (2n) + 1) *(2^ (2n+1) + 1)
gives perfect number
but it is impossible . one of them is devided by 3
It is true that one of them is divisible by 3. Modulo 3, we have 2^n + 1 ≡ (-1)^n + 1, so every second n produces zero modulo 3.

As mentioned above, n=0 and n=1 both work, because 2^0+1; 2^1+1; 2^2+1 gives 2; 3; 5. For n=0 your formula does make a perfect number, but for n=1, the way I read it, your formula gives 90, which is not perfect.

/JeppeSN
JeppeSN is offline   Reply With Quote
Old 2020-07-14, 09:45   #13
drmurat
 
"murat"
May 2020
turkey

53 Posts
Default

Quote:
Originally Posted by JeppeSN View Post
It is true that one of them is divisible by 3. Modulo 3, we have 2^n + 1 ≡ (-1)^n + 1, so every second n produces zero modulo 3.

As mentioned above, n=0 and n=1 both work, because 2^0+1; 2^1+1; 2^2+1 gives 2; 3; 5. For n=0 your formula does make a perfect number, but for n=1, the way I read it, your formula gives 90, which is not perfect.

/JeppeSN
the condition is 2^n and two prime number with the mantioned relation . for example 2 5 9 . 5 and 9 must be prime or 8 17 33 . 17 and 33 must he prime . I didnt say all numbers gives perfect number with this way but I said if the number format 2^n * a * b gives pwrfect number . obe of the way can be this rule
but as we see we cant get two prime with this rule
drmurat is offline   Reply With Quote
Old 2020-07-14, 11:17   #14
JeppeSN
 
JeppeSN's Avatar
 
"Jeppe"
Jan 2016
Denmark

2408 Posts
Question

I do not understand how it works. If we said 33 was a prime, then σ(4488) = σ(8*17*33) = σ(8)*σ(17)*σ(33) =! 15*18*34 = 9180 (under the false hypothesis "!" that 33 is prime). I cannot see how that should give a perfect number, σ(x) = 2*x. The "prime factor" 33 which appears in 2*x, does not arise in σ(x).

Also note that Euler proved all even perfect numbers are of Euclid's classical form (i.e. perfect numbers arising from Mersenne primes). Therefore, no perfect number can have the form 2^n * a * b where n is greater than zero, and a and b are greater than one.

/JeppeSN
JeppeSN is offline   Reply With Quote
Old 2020-07-14, 11:37   #15
drmurat
 
"murat"
May 2020
turkey

5310 Posts
Default

x
Quote:
Originally Posted by JeppeSN View Post
I do not understand how it works. If we said 33 was a prime, then σ(4488) = σ(8*17*33) = σ(8)*σ(17)*σ(33) =! 15*18*34 = 9180 (under the false hypothesis "!" that 33 is prime). I cannot see how that should give a perfect number, σ(x) = 2*x. The "prime factor" 33 which appears in 2*x, does not arise in σ(x).

Also note that Euler proved all even perfect numbers are of Euclid's classical form (i.e. perfect numbers arising from Mersenne primes). Therefore, no perfect number can have the form 2^n * a * b where n is greater than zero, and a and b are greater than one.

/JeppeSN
okay . firstly I calculated the aliquot sum of 2^n * a * b ( a , b prime ) . the calculation method is not based on divisors . then I get the difference of number and aliquot sum I get th result of 0 fr 2 5 9 I try to get the relation of primes for perfect number .so I assumed 9 is prime according to this . if we assume 9 is prime ...think that divisors of 9 are 1 and 9 . 2 * 5 * 9 = 90 the divisors will be 1 , 2 . 5 . 10 . 9 . 18 , 45 collection of them will be 90 the same relation must be 4 17 33 . it is stupidly but correct . I dont say I found new perfect number I only say it can be a way of finding new perfect number if a and b be prime at the same time. but no number pair whic a and b prime ehind

Last fiddled with by drmurat on 2020-07-14 at 12:31
drmurat is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 02:26.

Wed Oct 21 02:26:13 UTC 2020 up 40 days, 23:37, 0 users, load averages: 1.70, 1.74, 1.69

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.