Update documentation

breezy-codes · Jun 28, 2024 · efd7459 · efd7459
1 parent 9936fb5
commit efd7459
Show file tree

Hide file tree

Showing 33 changed files with 5,467 additions and 1,493 deletions.
diff --git a/RSA-Algorithm/RSA-example.html b/RSA-Algorithm/RSA-example.html
@@ -185,37 +185,27 @@
         </ul>
         <p aria-level="2" class="caption" role="heading"><span class="caption-text">Number Theory</span></p>
 <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/modular-arithmetic/mod-arith-intro.html">Modular Arithmetic</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-arithmetic.html"><strong>Modular Arithmetic</strong></a></li>
-
-
-
-
+<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/number-theory/prime-num-intro.html">Prime Numbers</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prime-numbers.html"><strong>Prime Numbers</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/fermats-little-theorem.html"><strong>Fermat’s Little Theorem</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/finding-coprimes.html"><strong>Finding Coprimes</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prime-factorisation.html"><strong>Prime Factorisation</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/gcd-lcm.html"><strong>GCD and LCM</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prim-introduction.html"><strong>Prime Numbers Complete</strong></a></li>
 
+</ul>
+</details></li>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/modular-arithmetic/mod-arith-intro.html">Modular Arithmetic</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
 <li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-addition.html"><strong>Modular Addition</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-subtraction.html"><strong>Modular Subtraction</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-multiplication.html"><strong>Modular Multiplication</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-inverse.html"><strong>Modular Inverse</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-exponentiation.html"><strong>Modular Exponentiation</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/mod-introduction.html"><strong>Modular Arithmetic Complete</strong></a></li>
 
 
 
 
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-subtraction.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-multiplication.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-inverse.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-exponentiation.html"><strong>Modular Addition</strong></a></li>
-
-
-
 
 </ul>
 </details></li>

diff --git a/RSA-Algorithm/RSA-with-large-num.html b/RSA-Algorithm/RSA-with-large-num.html
@@ -184,37 +184,27 @@
         </ul>
         <p aria-level="2" class="caption" role="heading"><span class="caption-text">Number Theory</span></p>
 <ul class="nav bd-sidenav">
-<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/modular-arithmetic/mod-arith-intro.html">Modular Arithmetic</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-arithmetic.html"><strong>Modular Arithmetic</strong></a></li>
-
-
-
-
+<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/number-theory/prime-num-intro.html">Prime Numbers</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prime-numbers.html"><strong>Prime Numbers</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/fermats-little-theorem.html"><strong>Fermat’s Little Theorem</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/finding-coprimes.html"><strong>Finding Coprimes</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prime-factorisation.html"><strong>Prime Factorisation</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/gcd-lcm.html"><strong>GCD and LCM</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/number-theory/prim-introduction.html"><strong>Prime Numbers Complete</strong></a></li>
 
+</ul>
+</details></li>
+<li class="toctree-l1 has-children"><a class="reference internal" href="../maths/modular-arithmetic/mod-arith-intro.html">Modular Arithmetic</a><details><summary><span class="toctree-toggle" role="presentation"><i class="fa-solid fa-chevron-down"></i></span></summary><ul>
 <li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-addition.html"><strong>Modular Addition</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-subtraction.html"><strong>Modular Subtraction</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-multiplication.html"><strong>Modular Multiplication</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-inverse.html"><strong>Modular Inverse</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-exponentiation.html"><strong>Modular Exponentiation</strong></a></li>
+<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/mod-introduction.html"><strong>Modular Arithmetic Complete</strong></a></li>
 
 
 
 
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-subtraction.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-multiplication.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-inverse.html"><strong>Modular Addition</strong></a></li>
-
-
-
-
-<li class="toctree-l2"><a class="reference internal" href="../maths/modular-arithmetic/modular-exponentiation.html"><strong>Modular Addition</strong></a></li>
-
-
-
 
 </ul>
 </details></li>