Results 1 to 2 of 2

Math Help - Product of primes using induction

  1. #1
    Junior Member
    Joined
    May 2008
    Posts
    55

    Post Product of primes using induction

    prove by using induction that every integer k, k>1, can be written as a product of primes,
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Quote Originally Posted by Sally_Math View Post
    prove by using induction that every integer k, k>1, can be written as a product of primes,
    Use strong induction. Say k>1, if it is a prime then proof complete. Otherwise, k=ab where a,b<k. But then by strong induction both a,b can be written as a product of primes themselves. Thus, k is a product of primes.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Prove that (product of primes between n and 2n) > 2^n
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: November 17th 2010, 02:45 PM
  2. product of primes
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: April 13th 2010, 10:24 AM
  3. product of primes II
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: January 3rd 2010, 01:37 PM
  4. Product of Primes
    Posted in the Number Theory Forum
    Replies: 8
    Last Post: December 23rd 2009, 06:57 PM
  5. An induction problem with primes
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 4th 2008, 06:29 PM

Search Tags


/mathhelpforum @mathhelpforum