James Wanless wrote in message ... >The following information is copyright James Wanless 23/06/00: > >There are an infinite number of primes of the form ak + b [hcf(a,b)=1] > >Proof: >Let N=a(p1p2p3p4.....pn) + b [p1=2,p2=3,p3=5,p4=7, etc.] >then, hcf(N,pn)=1 > >Therefore either N is prime, or it's divisible by some pm>pn > >Let n->99999... >pn->99999... [from Euclid's proof of infinitude of primes] >=> N prime [since pm can't be greater than pn, which is already >infinite]
Hah! Do you call this mathematics? I call it child's play. Here is my proof that 1+1=1:
For any integer N, N+N=2N. Now let N->99999... so that we also have 2N->99999... (plug it into your calculator if you don't believe me). So we arrive at:
99999... + 99999... = 99999...
Now divide through by 99999... to obtain
Now I can prove that I am the pope:
I am one, the pope is one, therefore I and the pope are one.