Code from the 2020 Polymath REU project "Walking to infinity on special sequences".
Find a file
2020-08-10 09:41:16 -07:00
.vscode Create settings.json 2020-07-14 15:41:12 -04:00
cpp added add_digit_anywhere_primes to c++ 2020-07-20 23:22:38 -07:00
fortran fixed formatting error 2020-08-02 17:43:08 -07:00
java rollback 2020-07-20 09:55:53 -04:00
python a little more cleaning before everyone else joins 2020-07-19 20:49:06 -07:00
rust updated prime paths 2020-08-03 16:55:20 -07:00
scheme added templates and comments 2020-07-17 22:36:57 -07:00
.gitignore a little more cleaning before everyone else joins 2020-07-19 20:49:06 -07:00
full_appending_primes_tree.txt added tree 2020-07-17 22:16:07 -07:00
README.md added README 2020-08-10 09:41:16 -07:00

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.