Results 1 to 3 of 3

Math Help - Proof Using Fundamental Thm of Arithmetic

  1. #1
    Junior Member
    Joined
    May 2009
    Posts
    66

    Proof Using Fundamental Thm of Arithmetic

    I'm asked to prove this lemma using the fundamental theorem of arithmetic:

    Suppose a,b,p \in \mathbb{Z} and p is prime. If p|ab then p|a or p|b.

    I understand how to prove this using normal methods. (Contradiction seems straightforward.) However, I've read the definition of the fundamental theorem of arithmetic on wikipedia, and am stuck on how to use it to prove the statement.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Nov 2008
    From
    Paris
    Posts
    354
    Contradiction seems straightforward
    Yep you can do that with the fundamental theorem of arithmetic. Assume p does not appear in the decomposition of a,b. Then...
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Oct 2010
    Posts
    17
    ?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Fundamental Theorem of Arithmetic
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: February 15th 2010, 05:31 PM
  2. Fundamental Theorem of Arithmetic...
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: December 10th 2009, 04:44 PM
  3. Fundamental Theorem of Arithmetic
    Posted in the Number Theory Forum
    Replies: 8
    Last Post: March 19th 2007, 03:53 PM
  4. Fundamental Theorem of Arithmetic Help
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: February 24th 2007, 04:41 PM

Search Tags


/mathhelpforum @mathhelpforum