mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2016-04-08, 21:15   #12
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts
Default

Quote:
Originally Posted by Batalov View Post
In addition to what Charles wrote, infinitude of composite members of any sequence has nothing to do with the infinitude of prime members.

sm88, you need to start thinking at least about the basic properties of infinities: that is, (even for complementary sets, e.g. a set "A" and a set of all others "non-A"):
- a sum of a finite set and and infinite set is an infinite set;
- a sum of an infinite set and and infinite set is an infinite set, so
- knowing that one subset is infinite (e.g. "non-A") gives you no information about its complement's infinitude.
okay thanks.


, the local king of the idiots.

Last fiddled with by science_man_88 on 2016-04-08 at 21:15
science_man_88 is offline   Reply With Quote
Old 2016-04-11, 20:34   #13
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

216448 Posts
Default

For kicks and giggles, I found a larger triple set:
23660119537*2^18001-1 = p (5430 digits)
3*23660119537*2^18002-5 = 6p-1, twin
3*23660119537*2^18002-7 = 6p+1, twin
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
probable largest prime. sudaprime Miscellaneous Math 11 2018-02-05 08:10
NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED! dabaichi News 561 2013-03-29 16:55
Largest known prime Unregistered Information & Answers 24 2008-12-13 08:13
Largest 64 bit prime? amcfarlane Math 6 2004-12-26 23:15
need Pentium 4s for 5th largest prime search (largest proth) wfgarnett3 Lounge 7 2002-11-25 06:34

All times are UTC. The time now is 08:34.

Fri Sep 18 08:34:17 UTC 2020 up 8 days, 5:45, 0 users, load averages: 1.97, 1.71, 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.