🚀 go-pugleaf

Take any n positive numbers x1,...,xn such that their product is 1.
Prove that their sum is greater than or equal to n. On what conditions
would the sum be n?


Prove that

 n + n + ... + n = 2^n
 0   1         n   

where

  n
  m

means n choose m and 2^n means 2 to the exponent n.

n choose m means the number of different subsets of m elements that
can be chosen or constructed from a set of n elements. Show that

                    n!
n choose m = n = ---------
             m   m! (n-m)!

where p! means 1 x 2 x ... x p (those are multiplication signs, not
the letter x).

--

Henry Choy
choy@cs.usask.ca

What rolls down stairs alone or in pairs            This has been brought to 
Rolls over your neighbor's dog?                     you by the numbers 4
What's great for a snack and fits on your back?     and 9 and the letter P.
It's Log, Log, Log!  -- "The Log Song", from            -- Big Bird
                         Ren & Stimpy

Math is tough!       -- Barbie