Number Theory Help

Prime numbers, modular arithmetic, GCD, and combinatorics.

Ask your own number theory question

Type your own problem on the homepage and see every step. 5 free questions, no sign-up.

Example problems & solutions

Find GCD(48, 18)

Using Euclidean algorithm: 48 = 2×18 + 12; 18 = 1×12 + 6; 12 = 2×6 + 0. GCD = 6.

Type any math problem and Layla shows every step.

Stuck on a different problem? Ask Algegram and get every step explained. Your first 5 questions are free, no sign-up needed.