MHB Products and Sums and Proofs....oh, my

  • Thread starter Thread starter MarkFL
  • Start date Start date
  • Tags Tags
    Sums
Click For Summary
The discussion centers on proving the equation $$\prod_{j=2}^n\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}$$ using mathematical induction. The proof begins with base cases for j=2 and j=3, leading to a recursive assumption for j=n-1. By applying the induction step for j=n, the equation is validated, confirming the result. Participants express gratitude for contributions and corrections throughout the proof process. The proof is successfully completed, showcasing the effectiveness of induction in this mathematical context.
MarkFL
Gold Member
MHB
Messages
13,284
Reaction score
12
Prove that:

$$\prod_{j=2}^n\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}$$
 
Mathematics news on Phys.org
Re: products and sums and proofs...oh, my!

$$\sum_{k=1}^{j}\underbrace{\phantom{e^{-x^{2}}}}_{\text{What goes here?}}$$
 
Re: products and sums and proofs...oh, my!

Ackbach said:
$$\sum_{k=1}^{j}\underbrace{\phantom{e^{-x^{2}}}}_{\text{What goes here?}}$$

I have fixed my OP to include that important piece of information. Thank you for catching this error. :D
 
MarkFL said:
Prove that:

$$\prod_{j=2}^n\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}$$
$1-\dfrac {1}{1+2+3+----+n}=1-\dfrac {2}{n(n+1)}$
I will use mathematical induction method to prove it
(it is easier)
j=2
$1-\dfrac{2}{6}=\dfrac {4}{6}$
j=3
$(1-\dfrac{2}{6})\times (1-\dfrac{2}{12})=\dfrac {5}{9}$
--------
--------
suppose j=n-1
$(1-\dfrac{2}{6})\times (1-\dfrac{2}{12})\times ------\times (1-\dfrac {2}{(n-1)n})=\dfrac {n+1}{3(n-1)}$
then j=n
$(1-\dfrac{2}{6})\times (1-\dfrac{2}{12})\times --\times (1-\dfrac {2}{(n-1)n})\times (1-\dfrac {2}{n(n+1)})$
$=\dfrac {n+1}{3(n-1)}\times (1-\dfrac {2}{n(n+1)})=\dfrac {n+2}{3n}$
so the proof is completed
 
Last edited:
1−1/(1+2+3+−−−−+n)=1−2/(n(n+1))
= (n(n+1) - 2)/(n(n+1) = (n+2)(n-1)/(n(n+1)

by multiplying out we get the result
 
I wish to thank everyone that participated! (Yes)

I also used induction...

First, show the base case $P_2$ is true:

$$\prod_{j=2}^2\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{2+2}{3(2)}$$

$$1-\frac{1}{\sum\limits_{k=1}^2(k)}=\frac{4}{6}$$

$$1-\frac{1}{1+2}=\frac{2}{3}$$

$$\frac{2}{3}=\frac{2}{3}$$

Thus, the base case is true. Next, state the induction hypothesis $P_n$:

$$\prod_{j=2}^n\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}$$

As the inductive step, multiply by:

$$1-\frac{1}{\sum\limits_{k=1}^{n+1}(k)}=\frac{n(n+3)}{(n+1)(n+2)}$$

and we have:

$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{n+2}{3n}\left(\frac{n(n+3)}{(n+1)(n+2)} \right)$$

$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{1}{3n}\left(\frac{n(n+3)}{n+1} \right)$$

$$\prod_{j=2}^{n+1}\left(1-\frac{1}{\sum\limits_{k=1}^j(k)} \right)=\frac{(n+1)+2}{3(n+1)}$$

We have derived $P_{n+1}$ from $P_n$ thereby completing the proof by induction.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K