Skip to content
Allin

Maths calculators

Every maths calculator here shows its result as you type, from a percentage or a GCD to a determinant, a derivative or a confidence interval. They are grouped below by branch, so you can go straight to geometry, statistics or algebra rather than hunting through a single long list.

Antilog Calculator (inverse logarithm)The antilogarithm undoes the logarithm: antilog_b(y) = bʸ, so log_b(bʸ) = y. Pick base 10, e, 2 or your own, enter the exponent, and the result comes back with the inverse relationship spelled out and the round trip checked. Bases of zero or less, and base 1, are rejected with the reason.Arc length calculatorThe length of a circular arc from the radius and the central angle — arc = r·θ, with θ in radians. Work in either direction: find the arc from radius and angle, the radius from arc and angle, or the angle from arc and radius. It also returns the sector area and the chord length.Average rate of change calculatorCompute the average rate of change of a function on an interval: [f(b) − f(a)] / (b − a), the slope of the secant line between (a, f(a)) and (b, f(b)). Type any function of x, set the endpoints a and b, and see f(a), f(b) and the average rate instantly.Bernoulli ODE SolverSolves y′ + P(x)y = Q(x)yⁿ by showing the substitution v = y^(1−n) that turns it into a linear equation, then integrating. The two degenerate cases are handled explicitly: n = 0 is already linear, n = 1 is separable.Convolution CalculatorLinear and circular discrete convolution with the sliding-and-summing steps shown term by term, plus a symbolic continuous convolution solved exactly through the Laplace convolution theorem.Curl calculatorCompute the curl of a vector field: the scalar curl ∂Q/∂x − ∂P/∂y in 2D, or the full vector curl ∇×F = ⟨R_y − Q_z, P_z − R_x, Q_x − P_y⟩ in 3D. Enter each component in x, y, z and get every partial symbolically plus the curl evaluated at an optional point.
Adjacency matrix calculatorTurn any graph into its adjacency matrix. Paste an edge list (A-B), an adjacency list (A: B C D) or a binary matrix — the tool auto-detects the format, builds the labelled adjacency matrix, and reports the degree sequence, in/out-degrees for directed graphs, and the vertex and edge counts.Angle Between Two Vectors Calculatorθ = arccos(a·b / (|a||b|)) in 2D or 3D, in degrees and radians, with the dot product, both magnitudes, the projections and a parallel / perpendicular / acute / obtuse verdict.Cholesky decomposition calculatorFactor a symmetric positive-definite matrix A into L·Lᵀ, where L is lower triangular — the Cholesky decomposition. Enter A on an editable square grid and it returns L, Lᵀ and the product L·Lᵀ; if the matrix is not symmetric or not positive-definite, it tells you which condition failed. Twice as fast as LU, Cholesky is used in optimization, Kalman filters and Monte-Carlo simulation.Column Space Calculator (basis of Col(A), rank, pivot columns)A basis of the column space of any matrix up to 6×6, taken from the ORIGINAL pivot columns rather than the reduced ones — with the rank, the free columns, the full RREF and every row operation.Cramer's Rule CalculatorSolves a 2×2 or 3×3 system with exact fractions, shows every determinant expanded term by term, and when D = 0 separates the two cases most calculators merge: dependent with infinitely many solutions, or inconsistent with none.Cross Product Calculatora × b in 3D with the determinant expansion shown, the magnitude |a||b|sin θ, the parallelogram and triangle areas, the unit normal and the right-hand rule.
Combination calculator (nCr)Compute the number of combinations nCr of r items from n.Derangement (subfactorial) calculator !nCompute the subfactorial !n — the number of derangements, permutations of n items in which nothing stays in its original place. It uses the exact recurrence !n = (n−1)·(!(n−1) + !(n−2)) with big integers, and shows the ratio !n / n!, which converges astonishingly fast to 1/e ≈ 0.3679. That ratio is the probability that a random shuffle leaves no element fixed — the classic 'hat-check' problem.Factorial calculatorCompute the factorial n! of a whole number.Inclusion–exclusion principle calculatorCompute the size of a union of 2 to 5 sets by inclusion–exclusion: add the individual sizes, subtract the pairwise overlaps, add back the triple overlaps, and so on, alternating signs. Work directly from your element lists — the tool sorts every element into its region and cross-checks the count — or from raw cardinalities like |A|, |A∩B|, |A∩B∩C| when you only know the counts. It shows each level's contribution and the final |A ∪ B ∪ …|.Permutation calculator (nPr)Compute the number of permutations nPr of r items from n.Permutations with repetition calculatorCount the ordered arrangements of length r drawn from n items when repetition is allowed — every position can be any of the n choices independently, giving exactly nʳ. This is the arrangement count for PIN codes, passwords, DNA strings and dice rolls, and it differs from ordinary permutations nPr, which forbid reuse. The result is computed exactly with big integers, however large it grows.
Bitwise CalculatorAND, OR, XOR, NOT and shifts in binary, decimal or hex, at 8, 16, 32 or 64 bits, with the bit-by-bit diagram and the result in all three bases. Computed with BigInt, so the 64-bit answers are right where JavaScript's own 32-bit operators would silently truncate.Delaunay triangulation generatorPaste a set of 2D points and it triangulates them the Delaunay way — the triangulation that avoids thin sliver triangles, where no point lies inside another triangle's circumcircle. It runs the Bowyer-Watson algorithm in your browser and draws the mesh, with point, triangle and edge counts.Dijkstra shortest path calculatorEnter a weighted graph as edges ("A, B, 4" per line) and a source node: Dijkstra's algorithm returns the shortest distance and the exact path from the source to every reachable vertex. Works for directed or undirected graphs, accepts many edge formats, and flags unreachable vertices — ideal for routing, networks and pathfinding.Graph coloring calculatorColor a graph so that no two adjacent vertices share a color. Enter an edge list and the DSATUR (or greedy) heuristic assigns a color to every vertex, shows the color classes, and reports an upper bound on the chromatic number χ. K4 needs 4 colors, an even cycle 2, an odd cycle 3 — see it instantly.Group theory order calculatorAnalyse the classic finite groups — cyclic Zₙ, direct products Zₘ×Zₙ, dihedral Dₙ and symmetric Sₙ. It gives the group order, whether it is abelian, its structure, the number of generators for cyclic groups, and the order of any element you enter, including a permutation in cycle notation for Sₙ.Hamiltonian path & cycle checkerCheck whether a graph has a Hamiltonian path (visits every vertex once) or a Hamiltonian cycle (also returns to the start). Enter an edge list, pick directed or undirected, and an exhaustive backtracking search either returns a concrete path and cycle or proves that none exists. Capped at 12 vertices for speed.