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....
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
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.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
? why three integer ? two is enough
Well, the question has been put up like that....
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