Results 1 to 2 of 2

Math Help - Prove that if n>=2 and not prime, then n has a prime divisor p<=(sq.root)n

  1. #1
    Newbie panglot's Avatar
    Joined
    May 2011
    From
    Carbondale, IL
    Posts
    13

    Question Prove that if n>=2 and not prime, then n has a prime divisor p<=(sq.root)n

    Hello All,

    Does a solution to such as problem as this exist? In proving this, would it be advisable to attempt "reductio ad absurdum" for something like this and then extend it?

    Thank you for your time.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor Also sprach Zarathustra's Avatar
    Joined
    Dec 2009
    From
    Russia
    Posts
    1,506
    Thanks
    1

    Re: Prove that if n>=2 and not prime, then n has a prime divisor p<=(sq.root)n

    Quote Originally Posted by panglot View Post
    Hello All,

    Does a solution to such as problem as this exist? In proving this, would it be advisable to attempt "reductio ad absurdum" for something like this and then extend it?

    Thank you for your time.
    Hint:

    Read here: Sieve of Eratosthenes - Wikipedia, the free encyclopedia
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: October 22nd 2011, 01:37 PM
  2. Prove composite number has a prime divisor
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: January 25th 2011, 05:44 PM
  3. Replies: 6
    Last Post: August 28th 2010, 12:44 AM
  4. Find prime divisor
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: May 20th 2010, 10:04 AM
  5. Least prime number divisor of 5^3 + 9^3
    Posted in the Algebra Forum
    Replies: 2
    Last Post: April 14th 2007, 07:15 AM

Search Tags


/mathhelpforum @mathhelpforum