10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

492 Chapter 9 FAST ALGORITHMS FOR LARGE-INTEGER ARITHMETIC<br />

As a brief digression, we should note here that the original Goldbach<br />

conjecture is true if a different signal of infinite length, namely<br />

G =(1, 1, 1, 0, 1, 1, 0, 1, 1, 0,...),<br />

where the 1’s occur at indices (p−3)/2 for the odd primes p =3, 5, 7, 11, 13,...,<br />

has the property that the acyclic G×A G has no zero elements. In this case the<br />

n-th element of the acyclic is precisely the number of Goldbach representations<br />

of 2n +6.<br />

Back to Theorem 9.5.13: It is advantageous to study the length-N DFT<br />

Y of the aforementioned signal y. This DFT turns out to be a famous sum:<br />

Yk(N) =cN(k) =<br />

<br />

e ±2πijk/N , (9.26)<br />

gcd(j,N)=1<br />

where j is understood to run over those elements in the interval [0,N−1] that<br />

are coprime to N, so the sign choice in the exponent doesn’t matter, while<br />

cN(k) is the standard notation for the Ramanujan sum, which sum is already<br />

known to enjoy intriguing multiplicative properties [Hardy and Wright 1979].<br />

In fact, the appearance of the Ramanujan sum in Section 1.4.4 suggests that<br />

it makes sense for cN also to have some application in discrete convolution<br />

studies. We leave the proof of Theorem 9.5.13 to the reader (see Exercise 9.40),<br />

but wish to make several salient points. First, the sum in relation (9.26) can<br />

itself be thought of as a result of “sieving” out finite sums corresponding to<br />

the divisors of N. This gives rise to interesting series algebra. Second, it is<br />

remarkable that the cyclic length-N convolution of y with itself can be given<br />

a closed form. The result is<br />

(y × y)n = ϕ2(N,n) = <br />

(p − θ(n, p)), (9.27)<br />

where θ(n, p) is1ifp|n, else2.Thus,for0≤ n2 is a regular prime, then Fermat’s last theorem, that<br />

p|N<br />

x p + y p = z p<br />

has no Diophantine solution with xyz = 0, holds. (We note in passing that<br />

FLT is now a genuine theorem of A. Wiles, but the techniques here predated<br />

that work and still have application to such remaining open problems as the<br />

Vandiver conjecture.) Furthermore, p is regular if it does not divide any of<br />

the numerators of the even-index Bernoulli numbers<br />

B2,B4,...,Bp−3.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!