<--- Back to Details
First PageDocument Content
Integer sequences / Primes in arithmetic progression / PrimeGrid / Primality test / Modular arithmetic / Quadratic residue / Mathematics / Prime numbers / Number theory
Date: 2008-05-23 09:34:32
Integer sequences
Primes in arithmetic progression
PrimeGrid
Primality test
Modular arithmetic
Quadratic residue
Mathematics
Prime numbers
Number theory

Jarosław Wróblewski, AP26 search, Version 3, May 23, 2008 How to search for 26 primes

Add to Reading List

Source URL: www.math.uni.wroc.pl

Download Document from Source Website

File Size: 163,84 KB

Share Document on Facebook

Similar Documents

Fast Generation of Prime Numbers on Portable Devices An Update Marc Joye Thomson Security Labs

Fast Generation of Prime Numbers on Portable Devices An Update Marc Joye Thomson Security Labs

DocID: 1tNf1 - View Document

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

STRUCTURE AND RANDOMNESS IN THE PRIME NUMBERS TERENCE TAO Abstract. A quick tour through some topics in analytic prime number theory.

DocID: 1tqCJ - View Document

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and explain how it is connected with the prime numbers. The second is

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and explain how it is connected with the prime numbers. The second is

DocID: 1tgjQ - View Document

´ AND THE DISTRIBUTION HARALD CRAMER OF PRIME NUMBERS∗ ANDREW GRANVILLE† IN ATHENS, GEORGIA, U.S.A. “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ mea

´ AND THE DISTRIBUTION HARALD CRAMER OF PRIME NUMBERS∗ ANDREW GRANVILLE† IN ATHENS, GEORGIA, U.S.A. “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ mea

DocID: 1tblA - View Document

The Discrete Logarithm Problem Ren´e Schoof Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ)∗ is at present a very difficult problem. The security of

The Discrete Logarithm Problem Ren´e Schoof Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ)∗ is at present a very difficult problem. The security of

DocID: 1sCRX - View Document