Ask your own question, for FREE!
Mathematics 41 Online
OpenStudy (zzr0ck3r):

prove that for all integers a and c, if a is odd, c>0, c devides a and c devides a+2, then c= 1.

OpenStudy (zzr0ck3r):

Hey man I see you typing and I have to go to a party but thank you so much and I will look when I get back in a few hours. ty

OpenStudy (zarkon):

if \(a\) is odd then \(a=2k-1\) for some integrer k then \(a+2=2k+1\) notice that \[(k)\times(2k-1)+(-(k-1))\times(2k+1)=1\] thus the GCD(\(2k-1,2k+1\))=1 so the greatest common divisor is 1. since \(c\) divides both, \(c\) must be 1

OpenStudy (zarkon):

I thought of a 2nd proof suppose \(c|a\) and \(c|a+2\) then \(a=k_1c\) and \(a+2=k_2c\) where \(k_1,k_2\) are both odd (since \(a,a+2\) are odd) clearly \(k_2>k_1\) and their minimum difference is 2 thus \(k_2-k_1>1\) then \(a=k_1c\Rightarrow a+2=k_1c+2\) so \(k_1c+2=k_2c\) then \(2=k_2c-k_1c=(k_2-k_1)c\) since \(k_2-k_1>1\) and \(k_2-k_1,c\) are integers we must have that c=1

OpenStudy (zzr0ck3r):

ahh the second one is more along the lines of what we are doing in class.

OpenStudy (zzr0ck3r):

nice work:)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
chatAI: Happy Easter!
40 minutes ago 0 Replies 0 Medals
danielfootball123: HAPPY EASTER!!!!
37 minutes ago 8 Replies 0 Medals
ShadowKid3: I drew Leon again (used suggestions from last art post) so Leon v2 :D
2 seconds ago 3 Replies 0 Medals
Puck: for all you amazing people
35 minutes ago 3 Replies 2 Medals
Breathless: update on drawing.
3 hours ago 12 Replies 5 Medals
ShadowKid3: what are examples of a class three lever?
1 day ago 3 Replies 2 Medals
alphaXtiger: Help pls
2 days ago 3 Replies 1 Medal
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!