/
Would it be a direct or indirect proof?
Hint : \(x\mid y\) and \(x \mid z\) \(\implies \) \(x\mid (y-z)\)
hmmm
\( b \mid a\) and \(b \mid (a + 2)\) \(\implies \) \(b\mid 2\) What can you infer from above ?
im confused because of the fact that a has to be a positive integer
I just don't see it...
positive or negative, it doesn't matter
well i see how b=2 but how does it equal 1?
Look at my second reply from top. Do you get why \(b\mid 2\) ?
nuh uh
Do you understand my first hint ?
yes, so you're just moving it around?
see if u can give me an example of that hint
You just need to understand that hint for the proof
if 5|20 and 5|10 then 5|(20-10)?
but I don't get how you know that
Good. Lets prove the result in that hint first
well 5|5
sorry 5|10
I've attached a proof of @ganeshie8 's claim that he made in the hint. I'm doing it as text document so I don't barge in too much into the conversation
that still has me a little lost
which line are you stuck at ?
the subtraction
(of the two equations)
why not factor out the gcf beforehand?
I used the idea that if `A = B` and `C = D` then you can subtract the two equations (left sides grouped together, same with the right) so we will end up with `A - C = B - D` notice how the order stays the same. A comes first and so does B
ohh alright
that makes sense
so we assume b|a and b|(a+2) then b is a common factor of (a, a+2) by the propstition of divisibility?
so b divides any linear combination of (a, a + 2)
therefore means b|[(a+2)- a] i.e b|2
But is that a valid proof?
the proposition of divisibility is used was the ( if a|b and a|c then a|(bx+cy) )
` we assume b|a and b|(a+2) then b is a common factor of (a, a+2)` I agree if x | y and x | z then x is a common factor of y and z ----------------------------------------------------- `b divides any linear combination of (a, a + 2)` I also agree here too the linear combination that is handy here is `-1*a + 1*(a+2)` which ultimately simplifies to 2
So I guess it's right, well I don't see anything wrong with it. Am I missing anything?
Your concern is valid. This would a valid proof only if you had proven below previously : `if a|b and a|c then a|(bx+cy)`
well that's one of our notes, we don't need to re-prove something we did in class, just refer to it (prof's decision)
I know technically I should prove it, I guess I can re-write the proof if I can find it.
keep in mind that `x-y` is a linear combination of x and y it is in the form `bx+cy` where b = 1 and c = -1 so the two ideas are very similar
I think that method is just fine, the a | (bx+cy) method
awesome, thanks guys you're both amazing <3 haha, a lot smarter than me for sure :P
\(b\mid a\) and \(b\mid(a+2)\) \(\implies \) \(b \mid 2\) What can you conclude from \(b\mid 2\) ?
if you're curious about the more generalized linear combination proof, see attached
Thanks!
Join our real-time social learning platform and learn together with your friends!