Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given that the product of the first $n$ terms of a geometric sequence is $P$ ,

$ \bullet$ find $\displaystyle \prod_{k=1}^{\frac{n}{3}}a_{3k-1}$

in terms $P$ if the terms are $a_1,a_2,a_3...a_n$

$ \bullet$ hence prove that $S\ge n\sqrt{P}$ where S is the sum


share|cite|improve this question
How is $S$ defined? And what are your thoughts on the question? – Servaes Aug 28 '13 at 8:10
i just edited it,now $S$ is defined – Jonas12 Aug 28 '13 at 10:53

The inequality $S\ge n\sqrt P$ doesn't hold in general. A geometric sequence has the form $a_n=ar^n$ for some $a$ and $r$, so in general we have

$$P=a^nr^{1+2+\cdots+ n}= a^nr^{n(n+1)/2}$$


$$S=a(r+r^2+\cdots +r^n)$$

It's pretty clear by examination of these formulas that $S$ can be a lot smaller than $n\sqrt P$; for example, if $r=1$ and $a=4$, we have $S=4n$ while $n\sqrt P= n2^n$, so $S\lt n\sqrt P$ as soon as $n\gt2$.

Perhaps the OP means the $n$th root of $P$ rather than $n$ times the square root (or, more likely, $n$ times the $n$th root of $P$).

share|cite|improve this answer
$S\ge n\sqrt[n]{P}$ you are correct @Barry Cipra – Jonas12 Aug 28 '13 at 19:19

so far i considered


now we use geometric mean

$\large \frac{a_{n-1}}{a_{n-2}}=\frac{a_{n}}{a_{n-1}}$

$a_{n-1}^2=a_{n-2}a_{n}$ hence


so we have



share|cite|improve this answer

Are you sure you have the correct question?

Take the case of a series with only one term where that term equals 1.

Then S=P=1 and therefore $S\ge 2\sqrt{P}$ is NOT true for this case.

share|cite|improve this answer
sorry i meant $S\ge n\sqrt{P}$ – Jonas12 Aug 28 '13 at 18:18

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.