an [0,1] iterative based on the Farey tree that isn't b-normal
- To: mathgroup at smc.vnet.net
- Subject: [mg52089] an [0,1] iterative based on the Farey tree that isn't b-normal
- From: Roger Bagula <tftn at earthlink.net>
- Date: Wed, 10 Nov 2004 04:45:38 -0500 (EST)
- Reply-to: tftn at earthlink.net
- Sender: owner-wri-mathgroup at wolfram.com
This is an iteration based on two transcental numbers E and Pi.
Any other pair of rational transcendentals can be used.
The result is limited ( not very well here!) to the interval [0,1]
It isn't actually a very good way to manufacture transcendentals, but it
works most of the time.
The idea is to present a [0,1] iterative
that doesn't depend on the Modulo one fractional part
and isn't b-normal by the Bailey definition.
(* transcendental Farey tree recursive function*)
Respectfully, Roger L. Bagula
tftn at earthlink.net, 11759Waterhill Road, Lakeside,Ca 92040-2905,tel: 619-5610814 :
alternative email: rlbtftn at netscape.net
URL : http://home.earthlink.net/~tftn
Prev by Date:
Re: Converting Dates to Mathematica Format
Next by Date:
Re: ListContourPlot - different levels
Previous by thread:
Re: nonlinear programming with differential-algebraic constraints (2)
Next by thread:
iterative b -normal examples from one of Bailey's papers