On 8/1/06, John R Pierce <[EMAIL PROTECTED]> wrote:
> Здравствуйте уважаемый мистер Max A.! > > ...... anyone here read russian care to translate ?
From Babelfish, slightly formatted for readability, and also corrected the number: How do you do the respected mister max A! Bagodaren for the positive estimation of the theoretical part of the method of the search for prime numbers in the natural series proposed by me. With the examination of its use for the practical search for numbers Mersenne, I please to consider my following refinements. In the second numerical line, besides number 3, prime numbers be absent. This makes it possible by one third to decrease a quantity of the numbers being investigated, among which it cannot be prime numbers. To determine the numbers, which relate to the second numerical line possible by two arithmetic operations. It is necessary to take away from the number 3 being investigated and to divide remainder into 6. If we this remainder are divided integrally, then the number being investigated deliberately composite number, which relates to the second numerical line, and on it must not be expended time. The third numerical line includes those numbers, which are divided without the remainder by 6 after their value will be reduced per 5 units, while to the first, numbers, which are divided without the remainder by 6 after their value will be reduced by one. In this case each number obtains the individual ordinal number in its numerical line, which is 6 times lower than its value. Using ordinal number of the number, but not its value, we 6 times is decreased load on the computer. The separation of the numbers into two numerical lines, which contain in themselves all simple natural numbers, makes it possible to divide the researchers into two groups, each of whom will investigate their numerical line without duplicating of the work of each other. The use of ordinal numbers of the numbers instead of their values opens the new method of detecting the prime numbers without their checking to simplicity. It is necessary to reveal with the computer displacement into the depths of the numerical line the ordinal number of the cell not filled by the number, and according to its number to determine the value of the absent number, using equation N1 = с1 - 5 for the first numerical line, or N3 = с3 - 1 for the third numerical line. The obtained number will be deliberately prime number, and it must not be checked against the presence in it of dividers. The formulas, by which are determined the ordinal numbers of the numbers in each numerical line, are given in the previously sent article. Novak number will fill a numerical number with the composite numbers through each (2^2596495 1 - 1)*6 units given birth to by it. The same will occur also with the discovered earlier prime numbers. Putro.
_______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
