A minimalist discrete math calculator. Available on the Google Play Store.
Quickly calculate the quotient and remainder of two numbers. Useful for solving Linear Diophantine Equations by hand or doing the Euclidean Algorithim by hand.
Given a Linear Diophantine Equation of the form ax + by = c, finds the lowest integers that satisfy x and y, as well as the general formula for integer solutions of x and y in the form x = x0 ± k1 * n1 and y = y0 ∓ k2 * n2.
Given three integers b, e, and m, calculates the remainder of a number b raised to the power e modulo m. Useful for doing cryptography exercises by hand.
Created by Victor Szeto and Timothy Tong. Based on the iOS app of the same name by Timothy Tong.
Any questions, suggestions, comments, or concerns? You can reach us by email at: me at victorszeto.com, and me at timothytong.com.