Also another case of 2^prime - 1 being composite; its smallest prime factor is 6,361. ... The first prime number greater than 10100. It has been named gooprol ...

The second smallest prime number larger than a googol. Trooprol. 10^100 + ... larger than the previous number, but 105,000,000 times larger. It is known ...

... prime, because a number must have at least one factor smaller than its square root and another larger than its square root. To check if 21,397 is prime, for ...

It is the 2nd (2,2)-prime. In Roman Numerals 10 is denoted by X. 11 eleven. Eleven is the 5th prime number. It's the smallest positive integer greater than 10.

... primes that are coprime to 10. The first three values of r(21, n), however, are simply ... number with more than 1010^40 digits). r(11, r(11, 2)) = r(11 ...

... than 10gooprol (gooprol = 10^100+267 is the smallest prime number larger than a googol). It's quite trivial to see that this number must lie somewhere between ...

can be the length given by the smallest prime number which is greater than the corresponding reference signal sequence, for another embodiment of this invention ...

π(x) is defined as the number of prime numbers less than or equal to x. ... number at least a thousand times bigger than 10 10^34. And that's no good ...

any one of the set of any and all prime numbers which may be expressed in ... Certificate serial numbers greater than zero (0) containing at least 64 bits ...

We can then say that a Skewes' Number is at least 10^10^10^33.946 times larger than a googolplex!! What!? That's practically the size of Skewes' itself! So this ...

10. The system of claim 8 , further comprising: a divisor selector to ... smallest prime number or a smallest prime power greater than 2 g. 14. A ...

... smallest known consecutive primes beginning with the smallest. It's not ... prime number, and all prime numbers are greater than 1. Therefore: s(n)^2+1 ...

We also conjecture that every even number greater than 80612 is the sum of two Prime-Indexed Primes. ... A Wieferich Prime Search up to 6.7 x 10. (with ...

10, 2004, and entitled Method And Apparatus For Generating Random Number ... greater than the smallest available prime number. If it is not, then ...

expressible as a product of given primes, greater than or equal to a given size. For example: julia> n = 1973 # a not-small prime number, FFTs will be slow

... small proven prime number which may be lower than 32 bits. Thus ... smallest prime numbers if the greatest common divisor thus calculated is equal to 1.

Every prime number greater than 3 can be written in the form of (6K + 1) or ... greater, then the smallest number and always less than the largest number.

... greater than the smallest available prime number. If it is not, then ... US6141668A * 1997-10-06 2000-10-31 Nec Corporation Pseudo-random number generating method ...

... least all prime numbers up to 10 10. It is believed that there are around ... greater than 1 for any value of the number 'r', then: i. declaring the ...

... prime to 10 (basically any prime other than 2 and 5). To find out if a ... Decide whether n or (p-n) will be more convenient (usually the smaller number.) ...