<commit_before>#Marathon's book
---

## Number Systems and Bases
###Change Bases
## Number Theory
###Divisors
###Greatest Common Divisor GCD
###Least Common Multiple LCM
## Sequences
###Binet's Algorithm<commit_msg>Modify the mark down for improving the index<commit_after># Marathon's book
---

## Number Systems and Bases
* [Change Bases] - Change a number between bases.
## Number Theory
* [Divisors] - Get all divisors of a number. 
* [Greatest Common Divisor GCD] - Compute the Greatest common divisor of a number.
* [Least Common Multiple LCM] - Compute the least commond multiple of a number
## Sequences
* [Binet's Algorithm]  - Calc the nth number of the fibonacci sequence


License
----

MIT

{'fraction_non_alphanumeric': 0.10241820768136557, 'fraction_numerical': 0.0, 'mean_word_length': 4.293233082706767, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3881472', 'n_tokens_mistral': 222, 'n_tokens_neox': 206, 'n_words': 88}