Ask your own question, for FREE!
Mathematics 12 Online
OpenStudy (hba):

Stats help required

OpenStudy (hba):

OpenStudy (hba):

Any hints?

OpenStudy (anonymous):

sorry, don't even know what GM is

OpenStudy (unklerhaukus):

geometric mean?

OpenStudy (hba):

Yeah lol :P

mathslover (mathslover):

Do you know the formula for GM @hba ??

Parth (parthkohli):

The GM of \(a,b,c\cdots \) is \(\sqrt{abc\cdots}\)

OpenStudy (hba):

So G1.G2?

OpenStudy (hba):

I also got the same thing but i don't think that would be the answer to my problem.

Parth (parthkohli):

It seems like that is the answer.

OpenStudy (hba):

You sure?

OpenStudy (hba):

I don't think so.Moreover you have made a few mistakes above.

OpenStudy (unklerhaukus):

\[\sqrt[n].\]

OpenStudy (hba):

Well first of all that would not be a square root.It would be G1=(a1.a2.....an)^(1/n)

Parth (parthkohli):

Yeah

Parth (parthkohli):

Frook.

OpenStudy (hba):

Also, G2=(b1.b2........bm)^(1/m)

OpenStudy (hba):

@mathslover Yes i do.

mathslover (mathslover):

Is your doubt clear now hba?

OpenStudy (hba):

I don't think so i have any doubts.I just don't know how to do this freaking question -_-

OpenStudy (hba):

Well i don't think so the solution is that simple.

mathslover (mathslover):

Yes, I am tryig that.

OpenStudy (hba):

I am waiting.

mathslover (mathslover):

I am getting : \(\large{G_{m+n} = (\cfrac{G_n^m}{G_m^n})^{\cfrac{1}{m-n}}}\)

mathslover (mathslover):

Hba , do you have the answer?

OpenStudy (hba):

No

OpenStudy (chihiroasleaf):

@mathslover : how did you get the answer?

mathslover (mathslover):

5 minute please

OpenStudy (chihiroasleaf):

if \[ G_{1} = \sqrt[n]{a_{1} . a_{2} ... a_{n} } \] and \(G_{2} = \sqrt[m]{b_{1} . b_{2} ... b_{m} }\) aren't we looking for \[\sqrt[n+m]{a_{1} . a_{2} ... a_{n} .b_{1} . b_{2} ... b_{m} }\] ?

mathslover (mathslover):

Let a G.P : a, ar , ... \(\large{G_m = [a * ar * ar^2 ... * ar^{m-1}]^\cfrac{1}{m}} \) \(G_m = ( a^ m . r^{\cfrac{(m-1)m}{2}}) ^\cfrac{1}{m}\)

mathslover (mathslover):

\(G_ m = a . r^(\cfrac{m-1}{2})\) \(\implies a = \cfrac{G_m}{r^\cfrac{m-1}{2}}\) \(\large G_n = a. r^ \cfrac{n-1}{2}\) \(\large G_n = G_m . r^{(\cfrac{n-1}{2} - \cfrac{m-1}{2})}\)

mathslover (mathslover):

\(G_n = G_m \times r ^{(\cfrac{n-m}{2})}\) \(G_{m+n} = a . r^{(\cfrac{m+n-1}{2})}\) \(\implies G_m . r^{(\cfrac{m+n-1}{2} - \cfrac{m-1}{2})}\) \(\implies G_m \times r^{\cfrac{n}{2}}\) \(\implies G_m \times {(\cfrac{G_n}{G_m})}^{\cfrac{n}{n-m}}\) \(\implies G_n ^{\cfrac{n}{n-m}} \times G_m ^ {\cfrac{-m}{n-m}}\) \(\implies [\cfrac{G_m^m}{G_n^n}]^{(\cfrac{1}{m-n})}\) \(\implies [\cfrac{G_n^n}{G_m^m}] ^ \cfrac{1}{n-m}\)

mathslover (mathslover):

This is what I did friends, lemme know if it helps any one :)

mathslover (mathslover):

@chihiroasleaf ? Any views?

OpenStudy (hba):

@Hero Do you think it's correct?

OpenStudy (hba):

@NadiaKamal

mathslover (mathslover):

in which step are you getting problem Hba?

OpenStudy (hba):

@hartnn: Mind helping.

mathslover (mathslover):

@hartnn geometric mean of m numbers is Mth root of x1 to xm

mathslover (mathslover):

Its not sqrt

mathslover (mathslover):

https://en.wikipedia.org/wiki/Geometric_mean Have a look

mathslover (mathslover):

Moreover, the last expression is wrong. (I tried it using 2 examples)

mathslover (mathslover):

I understand :)

hartnn (hartnn):

\(\large GM_m = \sqrt[m]{x1.x2......xm} \implies GM_m^m=x1.x2......xm\) \(\large GM_n = \sqrt[n]{y1.y2......ym}\implies GM_n^n=y1.y2......ym\) \(\large GM_{m+n} = \sqrt[m+n]{(x1.x2......xm)(y1.y2......ym)} \\ \large = \sqrt[m+n]{GM_m^m .GM_n^n} \\ \Huge = (GM_m)^{\dfrac{m}{m+n}}(GM_n)^{\dfrac{n}{m+n}}\) @hba ask if any doubts

OpenStudy (hba):

@hartnn Thanks a lot hartnn :D

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!