Comments on: Polymath proposal: bounded gaps between primes
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/
Massively collaborative mathematical projectsMon, 27 Feb 2017 09:13:57 +0000hourly1http://wordpress.com/By: sadaoui hamza
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-73473
Sat, 15 Mar 2014 20:07:53 +0000http://polymathprojects.org/?p=340#comment-73473j’ai trouvé une démonstration de la Conjecture des nombres premiers jumeaux. il consiste a ….. contact moi cyber_hmza@hotmail.fr
]]>By: Коллективный разум в теории простых чисел « Домик Миа
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-73090
Sun, 23 Feb 2014 16:21:43 +0000http://polymathprojects.org/?p=340#comment-73090[…] Tao с группой коллег организовал коллективный проект polymath8a, целью которого было снижение доказанной верхней […]
]]>By: Conjecture des nombres premiers jumeaux : l'étau se resserre | Sciences-Campus Info
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-56073
Sun, 15 Dec 2013 15:45:56 +0000http://polymathprojects.org/?p=340#comment-56073[…] améliorations des arguments de Y. Zhang. Le 4 juin, T. Tao a créé dans le cadre du « projet Polymath », une collaboration ouverte et en ligne qui a attiré des dizaines de mathématiciens. Le […]
]]>By: The new Prime gap | On the learning curve...
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-49933
Wed, 04 Dec 2013 12:13:38 +0000http://polymathprojects.org/?p=340#comment-49933[…] as we move along the number line. A bunch of mathematicians including Terrance tao worked further (polymath project on this) and improved that gap to as a few thousands. The latest result from Maynard brings in an […]
]]>By: Ben Thurston
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-49883
Wed, 04 Dec 2013 10:19:29 +0000http://polymathprojects.org/?p=340#comment-49883I thought of this when I thought of the problem, I go into more detail in the link I provide. But first you can prove that a number is the second of a pair of twin primes if and only if it divides no prime up to the square root of the number with a remainder of 2 or 0. Then I use this estimate for the number of pairs of twin primes: up to N=(p+1)^2-1 for a prime p. N*(1/2)*(3/5)*(5/7)*…*(p-2)/p, this follows from the statistical notion that of all the numbers up to N, (3/5) for example will not divide 5 by 0 or 2. so (p-2)/p is the fraction of numbers up to N that does not divide p with a remainder of 0 or 2 and these are multiplied for every prime up to the square root of N to give an estimate of the number of pairs of twin primes less than N. Then I show that this estimate tends towards infinity with increasing N, thus I conclude that there are an infinite number of twin primes. Maybe someone could explain why this doesn’t work? http://benpaulthurstonblog.blogspot.com/2013/11/even-simpler-idea-for-proof-of-twin.html
]]>By: Crowd-sourcing shrinking the prime gap | Later On
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-47063
Sat, 30 Nov 2013 18:54:23 +0000http://polymathprojects.org/?p=340#comment-47063[…] Los Angeles, a winner of the Fields Medal, mathematics’ highest honor, had created a “Polymath project,” an open, online collaboration to improve the bound that attracted dozens of […]
]]>By: Sudden Progress on Prime Number Problem Has Mathematicians Buzzing | Learn How to be Prepared
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-41646
Sat, 23 Nov 2013 20:43:41 +0000http://polymathprojects.org/?p=340#comment-41646[…] Los Angeles, a winner of the Fields Medal, mathematics’ highest honor, had created a “Polymath project,” an open, online collaboration to improve the bound that attracted dozens of […]
]]>By: Luiz Roberto Meier
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-41412
Sat, 23 Nov 2013 12:33:32 +0000http://polymathprojects.org/?p=340#comment-41412Take any twin prime (n,m). n mod 3 = 2 , m mod 3 = 1. The first prime number of the pair will always be 2 and the second prime will always be 1.
]]>By: NFTF » Sudden Progress on Prime Number Problem Has Mathematicians Buzzing
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-40655
Fri, 22 Nov 2013 12:47:42 +0000http://polymathprojects.org/?p=340#comment-40655[…] Los Angeles, a winner of the Fields Medal, mathematics’ highest honor, had created a “Polymath project,” an open, online collaboration to improve the bound that attracted dozens of […]
]]>By: Is neuroscience mature enough for a #polybrain project to exist? | neuroecology
https://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-40035
Thu, 21 Nov 2013 15:57:32 +0000http://polymathprojects.org/?p=340#comment-40035[…] most recent polymath success – improving the bound between gaps of primes from 70,000,000 to 4,680 – has me […]
]]>