Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Recursion

  • To: mathgroup at smc.vnet.net
  • Subject: [mg62300] Re: [mg62274] Recursion
  • From: Bob Hanlon <hanlonr at cox.net>
  • Date: Sat, 19 Nov 2005 23:18:27 -0500 (EST)
  • Reply-to: hanlonr at cox.net
  • Sender: owner-wri-mathgroup at wolfram.com

Clear[x];
x[1] = x1;
x[t_Integer?Positive] := x[t] = a*x[t - 1](1 - x[t - 1]);


Bob Hanlon

> 
> From: JikaiRF at aol.com
To: mathgroup at smc.vnet.net
> Date: 2005/11/19 Sat AM 05:53:56 EST
> Subject: [mg62300] [mg62274] Recursion
> 
> Dear Sirs,
> 
> I would like to obtain trajectories with respect to x, from the following
> relationship:
>                
>                
> 
>                     x(t+1)=a x(t)(1-x(t))
> 
>  
> 
> Here, a means a constant with a constraint, 1 < a < 4, t   a positive integer 
> and x a variable.
> I know this difference equation cannot be solved by mathematics directly, 
> because it is not linear.
> So, I would like to follow a numerical series in terms of x, and I need to 
> know how to program Mathematica for this.
> 
> I look forward to your response.
> 
>      
> 
>      Sincerely,
>      
>      Fujio Takata.
> 
> 


  • Prev by Date: Intepolation of an array with missing points
  • Next by Date: Re: Recursion
  • Previous by thread: Re: Re: Recursion
  • Next by thread: Re: Recursion