For those not familiar with Wilson's Theory: P is a prime number if, and only if, (P-1)! + 1 is divisible by P. Now take the number 1, (1-1)! + 1 = 0! + 1 = 2....
So I was looking at the Mersenne numbers yesterday and found a curious property: 3^(2^(p-1)) = -3 (mod 2^p - 1) if (2^p - 1) divides S(p-1). For the sake of...
I've started looking at at n^a + (n+1)^b, where a,b <= n+1 . It generates a reasonable number of primes. I'll be examining for any patterns in prime generation...
Here is the definition of Wilson's Theorem from the Prime Pages: http://www.utm.edu/research/primes/notes/proofs/Wilsons.html Wilson's Theorem. Let p be an...
... problem ... chance in hell ... that will eventually be in reputable journals is first circulated by preprint; often on the Internet. Mathematicians often...
"Erdos proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n > 6." This was stated at:...
The Erdos proof is available at Ask Dr. Math - not that I understand it! Bob nick_honolson <nick_honolson@...> wrote: "Erdos proved that there exist at...
Thank you Nick, that was helpful! Erdos figured prominently as an amazing 'networker' in the book I recently read called The Music of the Primes. And that...
Anybody up to checking some calculations?? Sure would be appreciated. See http://www.opertech.com/primes/residues.html in particular the value of C2 (think it...
Hi, Mark, An interesting expression. Let np ( n ) = n^n + (n+1)^(n+1) . I confirm that n = 1, 2, and 3 are the only known primes of this form. If n mod 6...
Walter Nissen
wnissen@...
Mar 3, 2005 3:06 am
16154
Hi, If a solution to GC was not couched in formal mathematics but was let's say based on observation and a little arithmetic, easy to understand and short;...
... Why don't you go ahead and submit it? Supposing you actually have a valid proof of Goldbach's, I'm pretty sure any journal editor would go out of their way...
I UNDERSTOOD THE LOGIC BUT JUST CANT FINISH IT... IT IS SIMILAR TO THE FROBENIUS PROBLEM ONLY THAT THIS QUESTION DEALS WITH THREE NUMBERS ... COULD ... AS...
... It helps if you factor n^4 - 5n^2 + 4 as (n-2)(n-1)(n+1)(n+2). Right off the bat you already ensure that it has 4 factors, but you can do better. If n is a...
I think the below is true, but I can't prove or disprove the statement. Please help. If 3^(3^n)+3^(((3^n)+1)/2)+1 is prime then is 3^(3^n)-3^(((3^n)+1)/2) +1...
Define sequence a(n+1)=n*f(n)+a(n), a(1)=2, f(n) is nth term of fibonacci sequence. The first few terms are 2,3,7,13,25,73........... Notice that all terms...
... There seems to be a definite pattern to the parity of n*f(n). Try to work from there and see what you can prove about your sequence. Décio [Non-text...
... Law of small numbers. It's hard to tell if this is true because you can't check much further than that -- n = 15 is about the limit given current ...
... If it was a genuine proof, then yes. It would be monumental. The problem is, though, that it is very unlikely that there is such a proof. ... Well, there...
There is a Law of Small Numbers in statistics, but you seem to be using the term incorrectly; just dropping it in where it makes no sense. Milton L. Brown ...
Milton Brown
miltbrown@...
Mar 5, 2005 6:44 am
16166
... Googling "Law of Small Numbers" shows something in good agreement with Decio's use of the term, e.g.: ...
... Cosigned, since the "Law of Small Numbers" makes perfect since in this case. Looking at the first 3 tiny pairs of numbers could lead someone to believe...
chrisdarroch <chrisdarr2@...> wrote: Hi, If a solution to GC was not couched in formal mathematics but was let's say based on observation and a little...
... The disdain, at least on my part, is not for assuming a solution, but for the foolish games those who think they have one often play. I get tired of "I got...
Hello, Chris speaks wisdom, take it from a former 8. Anyone can claim proof. Someone who actually has proof does not need to make any claims whatsoever, they...
Chris Caldwell <caldwell@...> wrote: ... The disdain, at least on my part, is not for assuming a solution, but for the foolish games those who think they...
richard042@... wrote: Hello, Chris speaks wisdom, take it from a former 8. Anyone can claim proof. Someone who actually has proof does not need to make...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
