Somebody good can write and run this in less than 5 minutes, but here are the bases in which the first left-to-right prime concatenation of the primes to a...
Other than for concatenations of 3 of them, the largest prime non-titanic concatenation of consecutive primes brackets the five smallest over 10^142 in...
Don't understand. Either a yahoo mail defect or hacking is removing parenthesis from link. At any rate, all the stuff supposedly meant to save a reader time...
This send by Mr. Hassler to multiple recipients appears to indicate computations on this problem comparable in speed to work I did some months ago, with no...
Abstract In this paper, we will show the solution of seven of the hardest unsolved problems in number theory. We proved that there are infinite number of...
Just as an added note, after seeing these results I am inclined to think the problem in the other direction of finding a prime that sequentially generates only...
This is one I worked on a little and will likely attack again in the reasonably near future if nobody else resolves it. I cannot guarantee that the very best...
Assuming that my PARI/GP did not crash, after 2, 23, 233, 2333 and 23333 are all prime, concatenation of n^2 copies of each prime prime(n) does not produce...
I joined just to inform you that I can calcolate ordinal number of a prime number.. did someone had done it before?. do you consider this kind of calculation...
A beautiful day, there are some new results for the distribution of primes concerning quadratic polynoms: http://109.91.184.78/devalco/quadr_Sieb_x%5E2+1.htm#A...
I now believe, without proof, that there are infinitely many odd perfect numbers. Proposed Algorithm for searching for odd perfect numbers Start with an empty...
If one asks how many iterations of concatenating the prime factors including repetition in all possible orders are needed to find a single prime; the number 4...
Hi, Group. I had someone contact me anonymously about my proof. We argued back and forth in e-mails for over a week. Finally, he convinced me that my work was...
Hello group, I know I shouldn't write under the influence of the excitment. However I can't resist the urge to share a good news ! In July, Steve Maddox shared...
Argh! This is the only group that I belong to that has postings going to sender and not the group list. I would like to suggest that the default be set to...
Hi, similar to the reisel and the Sierpinski problem is there a twin prime conjecture for k such that k is a multiple of 3 and k*2^n+1 | k*2^n-1 can never be...
... From: Roahn Wynar To: kermit@... Sent: Monday, July 18, 2011 5:33 PM Subject: Re: [PrimeNumbers] Vague description for algorithm to search for odd...
Start with choice of prime number presumed to divide the odd perfect number. Name the odd perfect number, "M". During the algorithm, the minimal power of a...
Suppose M is an odd perfect number. If 3 does not divide M, then the square free part of M must be an odd prime equal to 1 mod 3, and the square part of M must...
Using the theorems of Euler and Gauss, and other mathematicians, we today can make an elementary and simple proof that no square-free odd number can be...
Here is a set of 11 consecutive primes consisting of 8 contiguous subsets of 4 primes. Each subset has 3 distinct differences (gaps) between adjacent primes...
Hello list, about every 6 months, I unearth my notes and ideas about the demonstration of the TPC and here comes that time of the year again... In nov. 2009, I...
Prime numbers greater than two are those numbers, expressed in base two, which contain a one in the rightmost position and and odd number of ones, or...
Leonhard Euler [Opera Omnia Ser.1 vol.4 pp.143-144] conjectured that there was an integer linear relation amongst [ Zeta(3), ln(2)^2, ln(2)*Pi^2 ]. OK, today...
Hello, I was wondering if their is a general solution on how to determine the minimal information required in the matrix to find the "Unique" solution, if the...
Hi; Here's an article on Primality testing and have a set of prime numbers. Can I get your comments and suggestions on this subject? Thank you to all of you. ...
