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

  • Thread starter Thread starter sarrah1
  • Start date Start date
  • Tags Tags
    Induction
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$.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
4
Views
2K
Replies
3
Views
2K
Replies
6
Views
1K
Replies
1
Views
1K
Replies
1
Views
2K
Back
Top