Results 1 to 2 of 2

Math Help - Primes proof

  1. #1
    Junior Member
    Joined
    Dec 2005
    Posts
    34

    a bet, got to win

    i need to prove that there are infinite souletions to
    the multifaction of the first n/ln(n) primes is smaller then n^2
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    Dec 2005
    Posts
    34
    i found up that my equetion is wrong

    since n/ln(n) equals the number of primes between zero and n
    and betwin n and 2n there is always a prime

    u can take only the primes n/2 n/4 and n/8
    in case that n is big enough and each one of them have been lowered to lowest number in range (2~2n)

    their multifaction is n^3/64 which is much bigger from n^2 from n>64
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Odd Primes Proof (Should be simple)
    Posted in the Number Theory Forum
    Replies: 11
    Last Post: May 14th 2010, 12:42 PM
  2. Proof of primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 10th 2010, 09:35 PM
  3. Mod proof with primes
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: February 1st 2010, 07:32 PM
  4. Proof of primes.
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 26th 2009, 01:12 AM
  5. proof of inifinite primes
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: December 13th 2008, 02:10 AM

Search Tags


/mathhelpforum @mathhelpforum