Notices
Results 1 to 3 of 3

Thread: Primes

  1. #1 Primes 
    Forum Sophomore
    Join Date
    Jul 2007
    Location
    South Africa
    Posts
    196


    How much is known about primes studied by their index in the 1 mod 6 and 5 mod 6 sets?


    It also matters what isn't there - Tao Te Ching interpreted.
    Reply With Quote  
     

  2.  
     

  3. #2 Re: Primes 
    sak
    sak is offline
    Forum Junior sak's Avatar
    Join Date
    Sep 2007
    Location
    Presently at ME
    Posts
    210
    http://en.wikipedia.org/wiki/Primes


    Reply With Quote  
     

  4. #3  
    Forum Professor serpicojr's Avatar
    Join Date
    Jul 2007
    Location
    JRZ
    Posts
    1,069
    The question is typically asked in the form, "How many primes less than X are congruent to 1 mod 6?" The answer is asymptotically π(X)/2, where π(X) is the prime counting function. Indeed, the general answer to, "If gcd(a,q) = 1, how many primes less than X are congruent to a mod q?" is asymptotically π(X)/ø(q), where ø is supposed to be the Euler totient function. The fact that there are infinitely many primes in any such congruence class is known as Dirichlet's Theorem on Arithmetic Progressions, and the precise asymptotic statement is called the Prime Number Theorem for Arithmetic Progressions.

    To answer your question, if you listed out the positive integers congruent to a mod q, you'd find that the n-th prime in the sequence would have index about n log n.
    Reply With Quote  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •