Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

not true..

in fact scratch that last read it wrong

any contradiction you can show me ?

I guess its true

ofcorse it must be true!! its a CMI ques!! :P

and i didnt even get the case!! @A.Avinash_Goutham :P

Because diagonal of all rectangles isnt a integer

yea i missed that

you'll get (m^3)n -m(n^3) I think. Not that I checked how you got to mn(m+n)(m-n)

that's divisible by 2 ... just have to prove it is also divisible by 3

yep..

for divisibility by 3, assume it to be of form 3a+1 or 3a+2 (for not divisible)

I guess we have to prove that (2k+1)2k(k+1) is always divisible by 12

right? @experimentX

well ... i think so.

wait a min,,i think its done..induction will come to our aid here! :D

it is not complete yet..

Now, when k is multiple of 6 then,
(2k+1)2k(k+1) is always divisible by 12