Tag
Elementary number theory
- What Can Be the Last Digit of a Fourth Power?The last digit of a natural number raised to the fourth power can only be 0, 1, 5, or 6. Here is a short proof and examples.
- If the Sum of Two Squares Is Zero, Are Both Numbers Zero?For real numbers, a² + b² = 0 forces a = b = 0 because each square is nonnegative; over complex numbers, cancellation is possible.
- Solve y³ = x³ + 8x² − 6x + 8 for Positive IntegersSet d = y − x and compare coefficients in the difference of cubes to show the unique positive-integer solution is x = 9, y = 11.
- How to Analyze Whether an Integer Is a Perfect SquareUse prime factorization, modular residues, and an integer-square-root check to decide whether a nonnegative integer is a perfect square.
- How to Use Induction in a Proof About Prime NumbersSee how strong induction proves every integer greater than 1 has a prime factorization, and why induction over prime numbers alone needs care.
- Proof That Every Integer Greater Than 1 Is a Product of PrimesA strong-induction proof shows every integer greater than 1 is a finite product of primes; handle 1, zero, and negative integers separately.
- Why Does ac Divide bc Exactly When a Divides b?For positive integers a, b, and c, ac divides bc exactly when a divides b. Prove both directions directly from the definition of divisibility.
- Why Is Every Cube 0, 1, or 8 Modulo 9?Write n as 3q, 3q + 1, or 3q + 2, then expand its cube to show it is congruent to 0, 1, or 8 modulo 9.
- If a Divides b+c, Must It Divide b or c?The claim is false: a can divide b+c without dividing either term. A counterexample and the correct divisibility rules explain why.
- Why Is the Legendre Symbol (3/p) Determined by p Modulo 12?Quadratic reciprocity shows that for every prime p greater than 3, 3 is a square modulo p exactly when p is 1 or 11 modulo 12.
- Why Is gcd(k, n+k) = 1 Exactly When gcd(k, n) = 1?Adding one integer to another does not change their common divisors, so gcd(k, n+k) equals gcd(k,n). Thus one gcd is 1 exactly when the other is.
- How Many Integer Lattice Points Are Inside a Circle?Count integer-coordinate points in a disk by summing vertical lattice points for each integer x. See the exact formula and a radius-5 example.
- How Many Integers Are Relatively Prime to a Given Number?Use Euler’s totient function to count integers relatively prime to n, or apply inclusion–exclusion with floor counts for any interval.
- What Is Modulo Reduction, and How Do You Use It?Modulo reduction replaces an integer with an equivalent remainder and simplifies sums, products, and powers while preserving congruences, not ordinary equality.
- Why Can a Perfect Square End Only in 0, 1, 4, 5, 6, or 9?A perfect square in base 10 can end only in 0, 1, 4, 5, 6, or 9; check square residues modulo 10 and see why the converse fails.
- How to Find a Quadratic Nonresidue Modulo a Prime pTest candidates a using Euler's criterion: if a^(p−1)/2 is −1 modulo p, then a is a quadratic nonresidue.
- How to Check Whether a Number Is PerfectA positive integer is perfect when its proper divisors sum to itself. Learn a direct divisor-pair check and a faster formula using prime factors.
- What Are the Last Two Nonzero Digits of 2016!?The last two nonzero digits of 2016! are 64. Strip its factors of 2 and 5, remove trailing-zero pairs, then reduce the result modulo 100.
- What Is the Greatest Common Divisor of Prime Numbers?The gcd of two distinct primes is 1; if they are the same prime, their gcd is that prime itself.