• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

proof for arithmetic mean>=geometric mean? (1 Viewer)

u-borat

Banned
Joined
Nov 3, 2007
Messages
1,755
Location
Sydney
Gender
Male
HSC
2013
there is a proof in the 1998 hsc q8, but it relies on previous parts.

that begs the question, would the BOS ask for this proof without any hints or is it too difficult?
 

bazza159

Member
Joined
Oct 11, 2007
Messages
31
Gender
Male
HSC
2008
its not too hard

Q: Prove [a - b]/2 >= root ab, a>0, b >0

Now (root a - root b)^2 >= 0

a - 2root ab + b >= 0

a + b >= 2root ab

(a+b)/2>= root ab

hence arithmetic mean >= geometric mean
 

shaon0

...
Joined
Mar 26, 2008
Messages
2,029
Location
Guess
Gender
Male
HSC
2009
u-borat said:
there is a proof in the 1998 hsc q8, but it relies on previous parts.

that begs the question, would the BOS ask for this proof without any hints or is it too difficult?
No its not that hard (as shown in the above post). Our teacher did it in class in a minimal amount of steps. So you'd probably be able to do it.
 

Affinity

Active Member
Joined
Jun 9, 2003
Messages
2,062
Location
Oslo
Gender
Undisclosed
HSC
2003
you can do the n value case by induction.

There are plenty of other ways to do it though..
I think the paper you refered to essentially used holders or jensens inequality
 

AMorris

Member
Joined
Sep 6, 2005
Messages
56
Location
Sydney
Gender
Male
HSC
2007
Affinity said:
you can do the n value case by induction.
The proofs that are solely by induction (i.e. no calculus) are quite tricky and the two common ones which are listed on the wikipedia article have a few not so straightforward steps. It is easier to prove it using calculus and fiddling around with maxima and minima.

Fortunately, they will never ask you to prove more than the n=3 case without giving you a complete walk through of the proof so there is absolutely no need to memorise the proof of the general case.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top