Builds the Affine Cipher Translation Algorithm from a string given an a and b value

This calculator determines the nth automorphic number

Determines the product of two expressions using boolean algebra.

Given a set of modulo equations in the form:
x ≡ a mod b
x ≡ c mod d
x ≡ e mod f

the calculator will use the Chinese Remainder Theorem to find the lowest possible solution for x in each modulus equation.
Given that the n_i portions are not pairwise coprime and you entered two modulo equations, then the calculator will attempt to solve using the Method of Successive Subsitution

Takes any natural number using the Collatz Conjecture and reduces it down to 1.

This calculator determines the nth composite number. Helps you generate composite numbers.

Given a possible congruence relation a ≡ b (mod n), this determines if the relation holds true (b is congruent to c modulo n).

Given a set of partitions, this determines the cross partitions.

This calculator determines the nth decagonal number

Calculates the number of derangements/subfactorial !n.

Determines how many (n) digit numbers can be formed based on a variety of criteria.

Solves for ax + by = c using integer solutions if they exist

Given 2 numbers a and b, this calculates the following
1) The Greatest Common Divisor (GCD) using Euclids Algorithm
2) x and y in Bézouts Identity ax + by = d using Euclids Extended Algorithm Extended Euclidean Algorithm

Given a positive integer (n), this calculates Euler's totient, also known as φ

For any integer a and a prime number p, this demonstrates Fermats Little Theorem.

Demonstrates the addition table and multiplication table for a finite field (Galois Field) of n denoted GF(n).

This calculator generates 5000 iterations for the development of the gamma constant γ

Given an original group of certain types of member, this determines how many groups/teams can be formed using a certain condition.

This calculator determines the nth heptagonal number

This calculator determines the nth hexagonal number

Calculates hyperbolic function values: sinh, cosh, tanh, csch, sech, coth

Calculates hyperbolic function values: arcsinh, arccosh, arctanh, arccsch, arcsech, arccoth

Given a set of data, this interpolates using the following methods:
* Linear Interpolation
* Nearest Neighbor (Piecewise Constant)
* Polynomial Interpolation

Given a partitioned interval, this evaluates the norm (mesh) by calculating each subinterval

Builds the Lagrange Theorem Notation (Bachet Conjecture) for any natural number using the Sum of four squares.

Given a word, this determines the number of unique arrangements of letters in the word.

Given an modular equation ax ≡ b (mod m), this solves for x if a solution exists

Using the linear congruential generator algorithm, this generates a list of random numbers based on your inputs

Solves xⁿ mod p using the following methods:
* Modular Exponentiation
* Successive Squaring

Given 2 integers a and b, this modulo calculator determines a mod b or simplifies modular arithmetic such as 7 mod 3 + 5 mod 8 - 32 mod 5

Shows modus Ponens definition and examples

Shows Modus Tollens definition and examples

Calculates the multifactorial n!^(m)

This calculator determines the nth nonagonal number

This calculator determines if an integer you entered has any of the following properties:
* Even Numbers or Odd Numbers (Parity Function or even-odd numbers)
* Evil Numbers or Odious Numbers
* Perfect Numbers, Abundant Numbers, or Deficient Numbers
* Triangular Numbers
* Prime Numbers or Composite Numbers
* Automorphic (Curious)
* Undulating Numbers
* Square Numbers
* Cube Numbers
* Palindrome Numbers
* Repunit Numbers
* Apocalyptic Power
* Pentagonal
* Tetrahedral (Pyramidal)
* Narcissistic (Plus Perfect)
* Catalan
* Repunit

This calculator determines the nth octagonal number

Given a population size (n) and a group population of (m), this calculator determines how many ordered or unordered groups of (m) can be formed from (n)

This calculator determines the nth pentagonal number

Given a prime number p and a potential root of b, this determines if b is a primitive root of p.

Given 2 positive integers n and d, this displays the quotient remainder theorem.

This calculator determines the nth rectangular number

Using the Sieve of Eratosthenes algorithm, this will show how many prime numbers are less than a number (n).

This calculator determines the nth square number

This calculator determines the nth triangular number. Generates composite numbers.

Sets up a truth table based on a logical statement of 1, 2 or 3 letters with statements such as propositions, equivalence, conjunction, disjunction, negation. Includes modus ponens.