Solve any Number Theory problems – Step by Step – using the Number Theory Made Easy app at www.TiNspireApps.com
Watch this Video to see how it can solve all number theory problems:
Solve Prime Numbers, Euclidean Algorithm, Theorems by Collatz, Bezout, Fermat, Euler, Wilson, Law Of Reciprocity, Chinese Remainder etc Perform Modular Arithmetic at all levels, Find GCD, LCM, Sigma Notation, Proof by Induction, Solve Diophantine Equations and any other equations, solve 2×2 and 3×3 system of equations, Solve Arithmetic and Geometric Sequences, Complex Numbers, Quadratic Equations, Complete the Square, Polynomials , Perform Polynomial and Synthetic Division, Rational Zero Theorem, Solve Combinatorics problems involving permutations and combinations. Game Theory , Prisoners Dilemma. All problems can be solved STEP BY STEP
Here is a listing of the app functionality:
| Theorems & Conjectures |
| Goldbach Conjecture |
| Collatz Conjecture |
| Twin Prime Conjecture |
| Dirichlet’s Box Principle |
| Euclid: Infinitely many primes. |
| Prime Number Theorem |
| Euler’s Theorem |
| Fermat’s Little Theorem |
| Fermat’s Last Theorem |
| Wilson’s Theorem |
| Chinese Remainder Theorem |
| Law of Quadratic Reciprocity |
| Bezout Theorem |
| Primes |
| Find Prime-Factorization |
| List Primes between A and B |
| Count Primes between A and B |
| Find Prime greater/less than A |
| Prime Checker |
| Coprime Checker |
| Euler’s Phi(n)-function |
| Find GCD & LCM |
| Euclidean Algorithm finds GCD |
| Extended Euclidean Algorithm |
| Bezout Theorem |
| Perfect Numbers (Euclid-Euler Theorem) |
| Mersenne Numbers |
| Amicable Numbers |
| Modular Arithmetic |
| Compute a mod m |
| Create table mod m |
| Compute a+b |
| Compute a^n mod m |
| Find Inverse of a mod m |
| Find Order of a mod m |
| Primitive Root mod m |
| Solve ax=b mod m |
| Solve x^2=a mod m |
| Solve ax^2+bx+c=0 mod m |
| Legendre Symbol |
| Law of Quadratic Reciprocity |
| Integers |
| Factor |
| Expand/Distribute |
| Find GCD & LCM |
| List Divisors of N |
| Sigma Σ-Notation |
| Divisibility Rules |
| Proof By Induction (Sums) |
| Proof By Induction (Products) |
| Diophantine Equations |
| Count Integers given Range given N |
| Count Integers divisble by N and/or M |
| Integer Solutions to 1 Eqn. with 2 Variables |
| Integer Solutions to 1 Eqn. with 3 Variables |
| Try: Non-Integer Solutions to 1 Equation |
| Algebra |
| Solve any Equation or Inequality |
| Solve 2×2 system – Step by Step |
| Solve 3×3 system – Step by Step |
| Simplify & Evaluate |
| Powers |
| Find Common Denominator |
| Find Proper Fractions |
| Solve Proportion (Ratio) Problems |
| Absolute and Percent Change |
| Logic |
| Read Truth Tables |
| Read Proposition Laws |
| Read Conditional |
| Read BiConditional |
| Read Set Theory: 10 Facts |
| Read Set Theory: 9 Laws |
| Polynomials & Sequences |
| All-in-one-Polynomial Explorer |
| Find Degree |
| Find Roots |
| Polynomial Division & Remainder |
| Synthetic Division |
| Explicit Sequence & Partial Sum |
| Recursive Sequence & Partial Sum |
| Sequence Formula Finder |
| Geometric Sequence & Series |
| Arithmetic Sequence |
| Quadratic Equations & Complex Numbers |
| Do the Quadratic Equation |
| Complete the Square |
| Complete the Square to find Zeros |
| Complete the Square to find Vertex |
| One Complex Number : All-in-one-Explorer |
| Two Complex Numbers : All-in-one-Explorer |
| Combinatorics |
| n1*n2*n3*.. = Multiplication Principle |
| n! = Number of Rearrangements |
| Compute n!*m! |
| nPr = Number of ways to rearrange r given n |
| nCr = Number of ways to pick r given n |
| Game Theory |
| Read Introduction & Applications |
| Read Symmetric vs Non-Symmetric Games |
| Read Cooperative vs Non-Cooperative Games |
| Read Zero-Sum Games |
| Read Simultaneous vs Non-Simultaneous Games |
| Read Symmetric vs Non-Symmetric Games |
| Read Prisoners Dilemma |
| Read Strictly Determined Games |
| Read Perfect vs Imperfect Information |