Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > University Math Help > Discrete Mathematics, Set Theory and Logic
Reply
 
Thread Tools Display Modes
  #1  
Old November 16th, 2009, 10:15 AM
Junior Member
 
Join Date: May 2009
Posts: 58
Thanks: 9
Thanked 0 Times in 0 Posts
absvalue is on a distinguished road
Default 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.
Reply With Quote
Advertisement
 
  #2  
Old November 16th, 2009, 11:13 AM
Senior Member
 
Join Date: Nov 2008
Location: Paris
Posts: 333
Country:
Thanks: 17
Thanked 171 Times in 168 Posts
clic-clac has a spectacular aura aboutclic-clac has a spectacular aura aboutclic-clac has a spectacular aura about
Default

Quote:
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...
Reply With Quote
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 11:28 AM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2010, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.