9
Celestine preetham
·2009-07-12 07:44:58
put a=1 ,b=2 ,c=3
u find that they form an ap!
later on u go to prove that they are always in ap by checkin if
bc-a2+ab-c2 =2(ac -b2)
341
Hari Shankar
·2009-07-12 08:41:35
I have just got hammered in another site for a subjective answer, but I am still gonna stick my neck out;
a,b,c are in A.P. implies
a(a+b+c) , b(a+b+c), c(a+b+c) are in A.P.
or
a2+ab+ac, b2+ab+bc, c2+ac + bc are in A.P.
which implies that
a2+ab+ac -(ab+bc+ac), b2+ab+bc -(ab+bc+ac), c2+ac + bc (ab+bc+ac) are in A.P.
or
a2-bc, b2-ac, c2-ab are in A.P.
1
JOHNCENA IS BACK
·2009-07-12 08:48:04
@prophet sir.
thank you
can u tell the basic thrust behind solving these problems?
341
Hari Shankar
·2009-07-12 09:02:18
If a,b,c are in A.P., ka, kb, kc are also in A.P. and so are a+k, b+k, c+k.
Here, first I subtracted the first two terms and got (a-b)(a+b+c), so I took multiplying a,b,c by a+b+c as a starting point. Then it was obvious how to get to the final configuration
9
Celestine preetham
·2009-07-12 20:45:41
dude the basic thrust behind solving these problems is pattern recognition
u need to solve a lot of probs to gain experience