- name: Build pages

env:

MKDOCS_GIT_COMMITTERS_APIKEY: ${{ secrets.PAT_API_KEY }}

run: |

- uses: FirebaseExtended/action-hosting-deploy@v0

- name: Build pages

env:

MKDOCS_GIT_COMMITTERS_APIKEY: ${{ secrets.PAT_API_KEY }}

run: |

- name: Run algorithm code tests

- pymdownx.emoji:

emoji_index: !!python/name:materialx.emoji.twemoji

emoji_generator: !!python/name:materialx.emoji.to_svg

plugins:

- mkdocs-simple-hooks:

hooks:

on_env: "hooks:on_env"

- search

- literate-nav:

nav_file: navigation.md

- git-revision-date-localized:

enable_creation_date: true

- git-authors

- git-committers:

repository: e-maxx-eng/e-maxx-eng

docs_path: src/

- macros

extra:


Arbitrary-Precision arithmetic, also known as "bignum" or simply "long arithmetic" is a set of data structures and algorithms which allows to process much greater numbers than can be fit in standard data types. Here are several types of arbitrary-precision arithmetic.

Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$ using only $O(\log n)$ multiplications (instead of $O(n)$ multiplications required by the naive approach).

The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathematician Sun Zi.

The discrete logarithm is an integer $x$ satisfying the equation

The problem of finding a discrete root is defined as follows. Given a prime $n$ and two integers $a$ and $k$, find all $x$ for which:

In this article we discuss how to compute the number of divisors $d(n)$ and the sum of divisors $\sigma(n)$ of a given number $n$.

Given two non-negative integers $a$ and $b$, we have to find their **GCD** (greatest common divisor), i.e. the largest number which is a divisor of both $a$ and $b$.

While the [Euclidean algorithm](euclid-algorithm.md) calculates only the greatest common divisor (GCD) of two integers $a$ and $b$, the extended version also finds a way to represent GCD in terms of $a$ and $b$, i.e. coefficients $x$ and $y$ for which:

You are given two numbers $n$ and $k$. Find the largest power of $k$ $x$ such that $n!$ is divisible by $k^x$.

title: Factorial modulo p

Consider a problem of computing $ax^y \pmod{2^d}$, given integers $a$, $x$, $y$ and $d \geq 3$, where $x$ is odd.

In this article we list several algorithms for factorizing integers, each of them can be both fast and also slow (some slower than others) depending on their input.

In this article we will discuss an algorithm that allows us to multiply two polynomials of length $n$ in $O(n \log n)$ time, which is better than the trivial multiplication which takes $O(n^2)$ time.

The Fibonacci sequence is defined as follows:

Gray code is a binary numeral system where two successive values differ in only one bit.

A Linear Diophantine Equation (in two variables) is an equation of the general form:

Euler's totient function, also known as **phi-function** $\phi (n)$, counts the number of integers between 1 and $n$ inclusive, which are coprime to $n$. Two numbers are coprime if their greatest common divisor equals $1$ ($1$ is considered to be coprime to any number).

In this article we will cover common operations that you will probably have to do if you deal with polynomials.

Given a number $n$, find all prime numbers in a segment $[2;n]$.

Sieve of Eratosthenes is an algorithm for finding all the prime numbers in a segment $[1;n]$ using $O(n \log \log n)$ operations.

- Home

- [Main Page](index.md)

- [Navigation](navigation.md)

- [How to Contribute](contrib.md)

- [Preview](preview.md)

- Algebra

{{ page.meta.git_revision_date_localized }}

{% if not "\x3ch1" in page.content %}

<h1>{{ page.title | d(config.site_name, true)}}</h1>

{% endif %}