![]() |
|
|
#45 | |
|
Aug 2006
3×1,993 Posts |
Quote:
If you really look over it you'd see that what it actually proves (when appropriately cleaned up) is this: that for any N, there exist infinitely many pairs (n, n+2) where no prime smaller than N divides either member. |
|
|
|
|
|
|
#46 | |
|
Jan 2011
1816 Posts |
Quote:
Here's an honest answer. The problem with maths is perhaps that untrained people can just about get a grip of what some incredibly difficult problems involve. Any idiot like me can get their head around stuff like what twin primes are and what the Goldbach Conjecture means. And then, one of the nice things about maths is when you do occasionally have sudden moments of revelation, which can be immensely gratifying. (By which I only mean basic stuff like seeing why a well known proof like that for the infinitude of primes works, or whatever.) On this occasion I started out getting fascinated by patterns in numbers with no idea I could find anything new out. (I was a decent mathematician at school, was accepted for a maths degree, but changed course, and now haven't done any for years, so have forgotten a huge chunk of what I once knew.) I recently rediscovered the fun of it, at a fairly basic level, mostly from having to explain stuff to my daughter. I was just getting my head around some of the absolute basics like why all primes over 3 are 6n + or - 1 and what happens when you multiply two of them together, why that is always the difference between two squares, and how that relates to the basic geometry of squares, rectangles, and series of consecutive odd numbers etc. I've always liked that pattern of successive odd number differences you get from 5x5, 4x6, 3x7 etc and was interested to realise that was also related to the Goldbach problem. I was happy enough pottering about, but then had a deranged moment when I saw the way that the repeating primorial patterns in twin primes and chains of Goldbach pairs are related by the 2/p thing, and at about the same time realised how that fraction Euler equated to the harmonic series works. Then I just got thoroughly carried away with myself. I feel foolish now, deservedly so. Anyhow, my point is that maths is a subject in which you can suddenly understand just enough to make wild claims, but not enough to see why they are so wild. But I swear I won't make a habit of it. |
|
|
|
|
|
|
#47 | |
|
Jan 2011
23×3 Posts |
Quote:
|
|
|
|
|
|
|
#48 |
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
33·37 Posts |
|
|
|
|
|
|
#49 | |
|
May 2004
New York City
2·29·73 Posts |
Quote:
|
|
|
|
|
|
|
#50 |
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
33·37 Posts |
|
|
|
|
|
|
#51 | ||
|
"(^r'°:.:)^n;e'e"
Nov 2008
;t:.:;^
3E716 Posts |
Quote:
SEX_TUPLE_T : column which contain "prime sextuplet" ? b y d i c o p x Quote:
p,s, ;-)) ah ... forget that we have to be eccentric people .. (rank Last fiddled with by cmd on 2011-01-14 at 09:20 Reason: [quote] http://en.wikipedia.org/wiki/Prime_quadruplet |
||
|
|
|
|
|
#53 | |
|
May 2004
New York City
2×29×73 Posts |
Quote:
I wonder wonder why. |
|
|
|
|
|
|
#55 |
|
May 2004
New York City
2·29·73 Posts |
I have a foundational question:
Does anyone (in the world) know for certain that no one in the world has ever successfully, completely, accurately, mathematically proved the twin prime conjecture, i.e. that there are an infinite number of pairs of consecutive (differing by two) positive prime integers? IOW is it possible (in your view) that such a proof was kept secret? |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Mersenne Primes p which are in a set of twin primes is finite? | carpetpool | Miscellaneous Math | 3 | 2017-08-10 13:47 |
| Twin Primes | Computer Science & Computational Number Theory | 171 | 2013-05-14 02:57 | |
| twin primes! | sghodeif | Miscellaneous Math | 9 | 2006-07-19 03:22 |
| OT: Twin Primes | R.D. Silverman | Math | 8 | 2005-07-15 21:56 |
| Twin primes again | Chris Card | Math | 1 | 2005-05-26 14:18 |