Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2004-06-08, 10:57   #23
wpolly's Avatar
Sep 2002
Vienna, Austria

3·73 Posts

A further generalization:
for every k-tuple of irreducible polynomials P1, P2, ... Pn with no congrurence contradictions(for example not n and n^2+2 because one of them will always be divisible by 3) there'll be infinitely many k such that P1(k), P2(k), ...., Pn(k) are all primes.
wpolly is offline   Reply With Quote
Old 2004-06-09, 20:31   #24
philmoore's Avatar
Sep 2002
Tracktown, U.S.A.

25·5·7 Posts

There is another message at:
claiming that lemma 8 is wrong as stated.
philmoore is offline   Reply With Quote
Old 2004-06-14, 00:50   #25
jinydu's Avatar
Dec 2003
Hopefully Near M48

2·3·293 Posts
Default Another Article on the Supposed Proof

"Twin Prime Proof Proffered
By Eric W. Weisstein
June 9, 2004--A recent preprint by Vanderbilt University mathematician R. F. Arenstorf appears to come close to settling the longstanding question of the infinitude of twin primes. Twin primes are pairs of prime numbers such that the larger member of the pair is exactly 2 greater than the smaller, i.e., primes p and q such that q - p = 2. Explicitly, the first few twin primes are (3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), ....

The properties and distribution of twin primes (first given this name by Paul Stäckel, 1892-1919), are active areas of mathematical research. While the distribution of twin primes has remained elusive, mathematician V. Brun proved in 1919 that the sum of the reciprocals of the members of each twin prime pair

converges to a definite number even if the sum contains an infinite number a terms, a result known as Brun's theorem. The number B, known as Brun's constant, is difficult to compute, but is known to be approximately equal to 1.902160583104. (Amusingly, it was Thomas Nicely's 1995 high-precision computation of Brun's constant that first revealed a serious hardware bug in Intel's Pentium microprocessor.) Since the sum of the reciprocals of all the primes diverges (which represents a strengthening of Euclid's second theorem on the infinitude of the primes that was first proved by Euler in 1737), Brun's theorem shows that the twin primes are sparsely distributed among the primes.

The twin prime conjecture states that there are an infinite number of twin primes. While Hardy and Wright (1979, p. 5) note that "the evidence, when examined in detail, appears to justify the conjecture," and Shanks (1993, p. 219) states even more strongly, "the evidence is overwhelming," Hardy and Wright also note that the proof or disproof of conjectures of this type "is at present beyond the resources of mathematics."

In fact, no proof of the twin primes conjecture has been constructed despite the efforts of dozens of mathematicians over almost a century. In contrast, a recent preprint has apparently succeeded in showing the existence of prime arithmetic progressions of any length k, a related and also long-outstanding problem (MathWorld headline news story, April 12, 2004).

In a May 26 preprint, R. F. Arenstorf published a proposed proof of the twin prime conjecture, even in a stronger form due to Hardy and Littlewood (1923). The proof uses methods from classical analytic number theory, including the properties of the Riemann zeta function, ideas from the proof of the prime number theorem, and a so-called Tauberian theorem due to Wiener and Ikehara dating back to 1931, the latter of which leads almost immediately to Arenstorf's main result.

While Arenstorf's approach looks promising, an error in one particular step of the proof (specifically, Lemma 8 on page 35, where a lemma is short theorem used in proving a larger theorem) has recently been pointed out by French mathematician Gérald Tenenbaum of the Institut Élie Cartan in Nancy (Tenenbaum 2004). While mathematicians remain hopeful that any holes in the proof can be corrected, Tenenbaum opines that this particular error may have serious consequences for the integrity of the overall proof. Additional analysis by other mathematicians over the coming weeks and months will establish if, like the originally flawed proof of Fermat's last theorem, the twin prime result can also be corrected, thus finally settling this long-open problem, or if it requires additional insight and tools before it can finally be cracked."
jinydu is offline   Reply With Quote
Old 2005-04-06, 08:07   #26
Bronze Medalist
mfgoode's Avatar
Jan 2004

22×33×19 Posts
Cool Twin primes Conjecture

Originally Posted by ET_
If there are infinitely many, it's only a mater of time to find them out


Here is a paraphrase from the book 'Archimedes' Revenge' by Paul Hoffman.
'What about primes-called twin primes- that differ by two?
Among the first 25 primes are 8 pairs of twin primes ----
For almost 150 yrs, number theorists have conjectured that pairs of twin primes are inexhaustable, like the primes themselves, but no one has been able to prove this.

Progres was made in 1966 when the Chinese math'cian Chen Jing-run proved that there exist infinitely many pairs of numbers that differ by two in whch the fiirst number is a prime and the second is either a prime or the product of two primes( these are called 'almost prime')

Chen proved a weaker version of Goldbachs conjecture: every "sufficiently large" even number is the sum of a prime and an 'almost prime' ".
Mathem'cians consider Chen's proof to be the most significant contribution to prime number theory in the last few decades'
mfgoode is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Twin Prime Conjecture Proof Steve One Miscellaneous Math 53 2019-03-18 00:34
A proof for the Twin Prime Conjecture Carl Fischbach Miscellaneous Math 7 2009-06-24 05:52
Awesome song on Twin Prime Conjecture. cipher Twin Prime Search 0 2009-04-15 12:21
The Twin Prime Conjecture Song Templus Lounge 9 2006-03-14 16:30
Twin prime conjecture work, notation question eepiccolo Math 7 2005-06-04 23:01

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

Tue Feb 7 17:26:55 UTC 2023 up 173 days, 14:55, 1 user, load averages: 0.89, 0.98, 0.91

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔