wball/PolymathREU-Walking-to-infinity-on-special-sequences
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

added README

Browse source
This commit is contained in:
William Ball 2020-08-10 09:41:16 -07:00
parent 38dbb97d7b
commit cc25ea91b6
1 changed files with 10 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
README.md Normal file
View file

@ -0,0 +1,10 @@
# Code from the Polymath REU Walking to Infinity on Special Sequences project
The code is organized by language so that people who knew different programming
languages would still be able to test out sequences, since the tree system I
came up with for checking every possible path of a sequence is so versatile.
Each language has an implementation of the tree system as well as a sample and a
template, so you can easily try out any sequence you want. Rust was primarily
used for the hefty calculations involving things other than the tree system,
since it is so fast and easy to use. All the tree code is well documented and
commented, and the fast code is not, but fairly straightforward.