Solve Recurrent Equation - Step-by-Step Guide

Thread starter vtakhist
Start date Apr 18, 2009

AI Thread Summary

The discussion focuses on solving a recurrent sequence defined by the equation P{X(n)=m}=SUM(from 1, to n-1)(p(n,k)*P{X(k)=m-1}. The initial conditions are provided as P{X(0}=0}=1 and P{X(1)=0}=1. The term p(n,k) is described as a constant that depends on n and k, but its specific nature is not detailed. Participants seek a comprehensive solution to the problem, particularly clarifying the meaning of P{X(n)=m} as the probability that the random variable X(n) equals m. The thread emphasizes the need for a step-by-step guide to fully address the recurrent equation.

Apr 18, 2009

vtakhist

Good Day. I need to solve reccurent sequence.
P{X(n)=m}=SUM(from 1, to n-1)(p(n,k)*P{X(k)=m-1}
P{X(0}=0}=1 P{X(1)=0}=1
p(n,k)-some const witch depends on n and k.
I need full solvation of this problem.
Thanks for help.

Physics news on Phys.org

Apr 20, 2009

poutsos.A

WHAT is p{X(n)=m} ? apart from other things

Apr 21, 2009

vtakhist

Probability, that random variable X(n) will take a value m.

Thread 'Onto set mapping is the surjective set mapping, and into injective?'

The textbook is being fine. I asked the forum for some introduction to topology, and decided to start with Simmon`s. This naive question is due to ignorance of the words into and onto, which I don't distinguish in Spanish. A quick browsing sugests I'm right.

View full post »