Bingo Math — K ⇒ ∞

Player

Blue

Your Turn!

Fluffy McHops

Pink

Waiting...

Game starting...

Select a card to reveal a question!

How to Play — Bingo Math

Win the game by achieving one of these goals first:

Answer math questions correctly to claim boxes in your color!

If you choose to enable the Advanced Math settings, you will encounter:

Modulo Arithmetic: Standard remainders (e.g., 14 mod 5).
Euclidean Division: Find quotient and strictly non-negative remainder ($A = Bq + r$, $0 \le r < |B|$).
Bézout's Identity: Find valid coefficients $x$ and $y$ using the Extended Euclidean Algorithm.
Fermat's Little Theorem: Input the reduced power $\pmod{p-1}$, then the final answer.
Euler's Theorem: Calculate Euler's Totient $\phi(N)$ first, then the final answer.
CRT: Standard Chinese Remainder Theorem with simple variables.
Two Linear Cong: A system of congruences with coefficients. Requires simplifying first, then supplying the congruence class ($x \equiv R \pmod M$).
RSA Cryptography: Use RSA algorithm with given primes p, q and public exponent e. Either encrypt a message $c \equiv m^e \pmod{n}$ or decrypt using $m \equiv c^d \pmod{n}$ where $d$ is the modular inverse of $e$.

Starting in 60s…