Simple Somos Sequence Calculator

Simple Somos Sequence Calculator

An old Russian olympiad problem asked to prove that the sequence generated by the following algorithm

   a1 = 1, a2 = 1,
   an = (an-12 + 2) / an-2, n ≥ 3.

consists entirely of positive integers.

A proof of this fact can be found on a separate page, where it was also observed that the statement holds when 2 in the numerator is replaced with any positive integer m. The applet below generates as many members of the sequence as fit the applet drawing area. The parameter m ranges from 2 through 100.

If you are reading this, your browser is not set to run Java applets. Try IE11 or Safari and declare the site as trusted in the Java setup.

Simple Somos Sequence Calculator

What if applet does not run?

|Activities| |Contact| |Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny


Search by google: