Re: TLT : Tommy's Last Theorem

On Aug 4, 7:24 am, amy666 <tommy1...@xxxxxxxxxxx> wrote:
In article
<14444682.1217801297414.JavaMail.jaka...@xxxxxxxxxxxxx
forum.org>,
 amy666 <tommy1...@xxxxxxxxxxx> wrote:

Let pi(7,n,x) be the prime counting function of
primes n mod 7.

Then for all positive integer x and all positive
integer N :

pi(7,3,x^2) >= pi(7,N,x^2) - 7.

Well, it's certainly true for N = 3, indeed, for N =
3 (mod 7),
and for N = 0 (mod 7).
For other N, it's more likely that
pi(7, 3, x^2) - pi(7, N, x^2) is unbounded above and
below.

--
Gerry Myerson (ge...@xxxxxxxxxxxxxxx) (i -> u for
email)

so you have proof for those 2 ?- Hide quoted text -

Following methods of Littlewood, the proof should not be difficult.
However, it contains elements of sieve methods and the mathematics
involved is beyond Tommy's level.

I can sketch how such a proof will go, but will only do so if
Tommy can provide some evidence that he will be able to understand it.

So Tommy, please explain for us the Brun-Titchmarsh theorem and how it
is relevant to this problem.
.

Relevant Pages

  • Re: TLT : Tommys Last Theorem
    ... Pubkeybreaker wrote: ... primes n mod 7. ... Gerry Myerson (i -> u for ... So Tommy, please explain for us the Brun-Titchmarsh ...
    (sci.math)
  • Re: twin prime conjecture
    ... Gerry Myerson writes: ... be my guest). ... doofi we get here in sci.math who make bold claims. ... There is a standard sieve methods text, ...
    (sci.math)
  • Re: typical sci.math !
    ... Remind me, tommy, who was it that claimed to have written a paper ... primes congruent 3 mod 7, the assertion that started this thread, ... you claim to be interested in primes in arithmetic progressions, ...
    (sci.math)
  • Re: twin prime conjecture
    ... doofi we get here in sci.math who make bold claims. ... There is a standard sieve methods text, ... Analytic Number Theory, An Introductory Course, World Scientific, ... Gerry Myerson ...
    (sci.math)
  • Re: Sophie Germains form of prime 2n + 1
    ... Has it been proven that that are infinity primes of such form? ... you show incapacity of writing precisely (or reading ?): ... that arises in sieve methods. ...
    (sci.math)