anonymous
  • anonymous
prove that the product of three consecutive positive integers is divisible by 2. (This has to be proved using Euclid's Division Algorithm). I hv solved it, but just want to reconfirm....
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
? why three integer ? two is enough
anonymous
  • anonymous
Well, the question has been put up like that....
dumbcow
  • dumbcow
the product of an odd integer and even will always be even and the product of an even integer with any other integer is always even and an even integer is divisible by 2 by definition (2n)*(2n+1)*(2n) = 2*[n*(2n+1)(2n)] id have to look up euclids algorithm though

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
yeah, u hv given a trimmed version of what i did basically u hv used Euclid's div lemma only
dumbcow
  • dumbcow
oh cool, i didnt know if i remembered it or not you are probably correct then
anonymous
  • anonymous
Euclid's division lemma says "Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r where \[0\le r < b\]
anonymous
  • anonymous
Therefore, taking b as 2 we get a = 2q + r and \[0\le r < 2\]
anonymous
  • anonymous
So, if r = 0, then a = 2q + 0 = 2q If r = 1, then a = 2q + 1
anonymous
  • anonymous
Hence all positive integers are of the form 2a and 2q+1
dumbcow
  • dumbcow
right and if a number can be represented in the 2q form it can be said it is divisible by 2
anonymous
  • anonymous
Yes, so for my question I hv two possibilities 1) 2q, 2q+1 and 2q 2) 2q+1, 2q, 2q+1
anonymous
  • anonymous
In first case product is 8q^3 + 4q^2 = 2(4q^3 + 2q^2) and since it is a multiple of 2, it is divisible by 2
anonymous
  • anonymous
In second case the product is 2(4q^3 + 4q^2 + q) which is again a multiple of 2 and hence divisible by 2
dumbcow
  • dumbcow
correct
anonymous
  • anonymous
Thanks for confirming..U get a medal !!

Looking for something else?

Not the answer you are looking for? Search for more explanations.