Nice try Aizen. Can anyone try a pure geometrical approach here? It is not more than 4-5 liner for sure.Team BV - Vineet
ABC is the trinagle with G is as centroid and D, E, F as mid points of BC, CA and Ab respectively.
Extend GD to P such GD = DP, then PC = BG = 2BE/3, PG = AG = 2AD/3 and GC = 2CF/3
area of triangle PCG = 2*area of triangle GDC = 2*(1/6)*area of of triangle ABC
= (1/3)*area of triangle ABC
Since dimensions of triangle PCG are 2/3 of the traingle having dimensions 3, 4, 5, we can say that ar(PCG) = (4/9)*area of triangle having dimensions 3, 4, 5
=> (4/9)*area of triangle having dimensions 3, 4, 5 = (1/3)*area of triangle ABC
=> area of triangle ABC = (4/3)*area of triangle having dimensions 3, 4, 5
From four positive real nos a, b, c and d, 4 distinct combination of sum of three numbers are formed S1, S2, S3 and S4. IF abcd = 5. FInd the minvalue of S1S2S3S4
@aditi88 since we want the highest coefficient of 100!, we would ideally want to take the number which acts as the highest constraint for a power of 100! to be complete, which would be the highest prime number under
@aditi88since we want the highest coefficient of 100!, we would ideally want to take the number which acts as the highest constraint for a power of 100! to be complete, which would be the highest prime number under
@techgeek2050 As you say......expand (a+b+c)(a+b+d)(b+c+d)(a+c+d). and then use the am>= gm logic to find that a=b=c=d for that expansion to be minimum....so each number =5^1/4 hence answer is 5^4/4*81
@aditi88since we want the highest coefficient of 100!, we would ideally want to take the number which acts as the highest constraint for a power of 100! to be complete, which would be the highest prime number under
but the highest power of 97 in 10000! will be 103 + 1 = 104, isnt it ?