Roger, What is the point in sending such a big recurrence equation without a good explanation for it? Jose Brox ... From: Roger Bagula To: true number theory ;...
Russell sent me Phil's message with p=13 and p=17! Here is this message with my editings (sorry Phil!) %%%%%%% NMBRTHRY archives -- November 2001 (#9) Date:...
I am humbled by this new record... Congratulations. BTW, please do the PRP testing on your remaining candidates, you never know if there is another 100,000...
Are there any types/forms of primes of which there are definitely only a finite number? I'm sure there must be, but can't think of any off the top of my head....
In a message dated 01/10/03 14:35:10 GMT Daylight Time, ... = 0 mod 2. (Proof left as an exercise|-) Mike [Non-text portions of this message have been removed]...
... Even primes? Chris __________________________________________________________________ McAfee VirusScan Online from the Netscape Network. Comprehensive...
OK let me attempt to rephrase that so as to avoid "trivial" solutions... Are there any types/forms of primes of which there are definitely only a finite (>1...
Fermat Primes are only finite in number. I think I would be right in saying there are infinitely many 'types' of primes which yield only a finite number of...
... Still, that restriction allows "trivial" solutions. I came up with this one in just a few minutes, and there are an infinite number of examples like this:...
In a message dated 01/10/03 15:25:15 GMT Daylight Time, caldwell@... ... Not the second of these: restrict to x = 2 and you have made a probably-false ...
... The heuristics certainly say that, but has it been definitely proven? __________________________________________________ Virus checked by MessageLabs Virus...
... Not true. The number of Fermat primes is suspected to be finite, but it has not been proved. As far as I know, anyway. Unless my books are out of date! ...
... Aside from wholly trivial cases which Chris Caldwell has partly covered (even primes, n-digit primes, primes a < x < b where x is prime, yadda yadda ...
... Up to 1.25*10^15 there are only two Wieferich primes: 1093 and 3511. Prime p is a Wieferich prime if 2^(p-1) = 1 (mod p^2). But there isn't a prove that...
In an earlier mail I stated:- Fermat Primes are only finite in number. I think I should of worded this 'more carefully'. I know that this is only a conjecture...
... Not only is there not a proof, heuristic arguments suggest that there should be an infinite number of them. Paul...
Paul Leyland
pleyland@...
Oct 1, 2003 3:35 pm
13686
... An n-gon is constructible (with usual rules) if and only if it is a product of a power of two and distinct Fermat primes. So 17 gets us back to the...
On this subject, is there any set of primes that has been shown to have a finite - but unknown - number of elements? I can't think of any, though there are...
Another proof of concept: the three consecutive primes 1300255474963,1300255474967,1300255475161 yield the value (p[n+2]-p[n+1])(p[n+1]-p[n])/4=194 Adam...
I list the value (p[n+2]-p[n+1])(p[n+1]-p[n])/4 and the first prime p (n+1) past 13*10^10 that verfies that that value shouldn't be on the list, (note: I am...
... I hope you haven't. I don't really think the Online Encyclopedia of Integer Sequences was created for "guesses" -- your sequence doesn't belong there. ......
#{x<=N:x is prime}=N/log(N)+o(1). So floor(n/log(n)) tells you 'about' how many primes are less than n, and floor((n+1)/log(n+1))-floor(n/log(n)) tells you...
... Careful with this, you've quoted the error term wrong. The PNT statement should be, #{x<=N:x is prime}=(N/log N)*(1+o(1)) i.e. the o(1) is relative error,...
I was wondering if there are infinite primes for a*b^n+-1 with a and n fixed for the + series and separately for the - series. Let me know what you think. For...
... All of that is lost (unless, Zak, you want to cut and paste and post ... Also I did not receive this! ... message, ... a ... post ... is ... the...
