MHB Proving ${\psi}_{n}(x)\le F(n)$ by Induction

  • Thread starter Thread starter sarrah1
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary
The discussion focuses on proving by induction that ${\psi}_{n}(x) \le F(n)$ for $x \in [a, b]$. The user establishes a base case for $n=1$, confirming that ${\psi}_{1}(x) \le f(x,1) \le F(1)$. They also demonstrate that if ${\psi}_{n}(x) \le f(x,n)$ holds, then it follows that ${\psi}_{n+1}(x) \le F(n+1)$. The user seeks clarification on whether this implies that ${\psi}_{n}(x) \le F(n)$ is valid. Definitions for ${\psi}_n$, $F$, $a$, and $b$ are requested to further the discussion.
sarrah1
Messages
55
Reaction score
0
Hello

is my proof be correct ?

I wish to prove by induction that ${\psi}_{n}(x)\le F(n)$ , $x\in[a,b]$ ... (1)

Let there exists a function $f(x,n)$ such that if ${\psi}_{n}(x)\le f(x,n) $ then ${\psi}_{n}(x) \le F(n)$ .

I know that (1) is true for $n=1$ i.e. ${\psi}_{1}(x)\le f(x,1)\le F(1)$ ,

and I was able to prove that

${\psi}_{n+1}(x)\le F(n+1)$ , $x\in[a,b]$

would this implies ${\psi}_{n}(x)\le F(n)$

thanks
 
Physics news on Phys.org
sarrah said:
I wish to prove by induction that ${\psi}_{n}(x)\le F(n)$ , $x\in[a,b]$
Please provide the definitions of $\psi_n$, $F$, $a$ and $b$.
 
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 3 ·
Replies
3
Views
722
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
3K