PROBLEM OF THE WEEK

Solution of Problem No. 7 (Fall 2000 Series)

Problem: Show that, for every positive integer n,

  2n−1   2n+1
2n − 1 2
2n + 1 2
< 1 · 3 · 5 · · · (2n − 1) < .
e e

Solution (by Vikram Buddhi, Gr. Math)

By considering the graphs of log x and log(x−2) and partitioning the interval [3, 2n+1]
into equal subintervals of width 2, we find
Z 2n+1 Z 2n+1
log(x − 2)dx < 2[log 3 + log 5 + · · · + log(2n − 1)] < log x dx.
3 3

Hence, integrating:

(2n − 1) log(2n − 1) − (2n − 1) + 1 < 2[log 3 + · · · + log(2n − 1)]

< (2n + 1) log(2n + 1) − (2n + 1) − 3 log 3 + 3.

Taking exponents gives

  2n−1   2n−1   2n+1  e  32   2n+1
2n − 1 2
2n − 1 2
1 2n + 1 2
2n + 1 2
< ·e < 1·3 · · · (2n−1) <
2 · < .
e e e 3 e

Also solved by:

Graduates: Wook Kim (MA)

Faculty: Steven Landy (Phys. at IUPUI)

Others: Damir D. Dzhafarov (Sr. Harrison H.S., WL), Mike Hamburg (Jr. St. Joseph’s
H.S., South Bend)

There were two incorrect solutions.

Correction of Problem No. 8:

Problem No. 8 is incorrect as stated. The hypothesis “the ratio of the length of a side
to the length of the base is rational” should be replaced by “the length of a side and the
length of the base are rational.”