Hi, is anyone able to help me achieve this proof?

Attachment 28890

Thanks!

Lexi

Printable View

- Jul 23rd 2013, 06:56 AMLexiBellePrime number proof
Hi, is anyone able to help me achieve this proof?

Attachment 28890

Thanks!

Lexi - Jul 23rd 2013, 06:43 PMchiroRe: Prime number proof
Hey LexiBelle.

Do you have some background context for your problem? Is this function a subset of a more general set of results? - Jul 24th 2013, 01:23 AMLexiBelleRe: Prime number proof
Hey Chiro,

Well the general chapter title is Dirichlet's theorem on primes in arithmetic progressions.

I think I am meant to be using similar theory to that of proving a different theorem, whereby we used the introduction of a(n) to replace the summation part and A(x) by sums over n <= x. Then we replace a(n)logn/n.

Does this look familiar at all? I cant say im comfortable with the whole thing. - Jul 24th 2013, 08:01 PMchiroRe: Prime number proof
What about the prime number theorem? (i.e. log(n)/n)?

I only have a very elementary background in number theory but log(n)/n looks like something to do with the prime counting function. - Jul 25th 2013, 03:20 AMLexiBelleRe: Prime number proof
Yeah like im sure this will be involved somewhere. Im guessing some kind of integration by parts using this etc. But not exactly sure how I am to set this up, like the first few lines of working....?