Click the greenflag then write the number of pseudo-random numbers, the value of a{0} (the first value in the list), a number b and a number c. Somes rules to respect to do it work: seed≠0 b>0 c>0 b≠c If seed=1, b≠1 and c≠1
All by me. I was playing with recursive formulas on my calculator and I found this one. I think a{n} is an approximation of a number, where a{n+1} is a better approximation than a{n}, and this number is different with other values for a{0}, b and c.
