##### About This Page

I designed this page for an elementary number theory course I'm taking this year. You can take a look at the source code here.

#### Euclid GCD Algorithm

This calculates the GCD of two numbers using the Euclidean algorithm. You can read more about it here.

#### Vigenère Solver

Thanks to Wikipedia for the frequncies of letters, Simon Singh *(The Code Book)* for the detailed description on the cracking algorithm, and ChartJS for the beautiful JS chart library.

Here's another code if you need one more to crack:

`DAZFI SFSPA VQLSN PXYSZ WXALC DAFGQ UISMT PHZGA MKTTF TCCFX KFCRG GLPFE TZMMM ZOZDE ADWVZ WMWKV GQSOH QSVHP WFKLS LEASE PWHMJ EGKPU RVSXJ XVBWV POSDE TEQTX OBZIK WCXLW NUOVJ MJCLL OEOFA ZENVM JILOW ZEKAZ EJAQD ILSWW ESGUG KTZGQ ZVRMN WTQSE OTKTK PBSTA MQVER MJEGL JQRTL GFJYG SPTZP GTACM OECBX SESCI YGUFP KVILL TWDKS ZODFW FWEAA PQTFS TQIRG MPMEL RYELH QSVWB AWMOS DELHM UZGPG YEKZU KWTAM ZJMLS EVJQT GLAWV OVVXH KWQIL IEUYS ZWXAH HUSZO GMUZQ CIMVZ UVWIF JJHPW VXFSE TZEDF`

#### Linear Congruences

Calculate all solutions to modular equations with the form **Ax = B (mod M)**

#### Modular Exponentiation

#### Binary: Two's Complement & Addition/Subtraction

Coming soon.

#### List of Primes

Use this to generate a list of prime numbers. You can either set a list size, or an "up to" value (i.e. only prime numbers up to that number). Also customize the joiner (defaults to a space) if you would like to change how the numbers are outputted. "\n" for newline.