Rational number: A number that can be expressed as \(\frac{p}{q}\) where \(p\) and \(q\) are integers and \(q \neq 0\).
Irrational number: A number that cannot be expressed as a fraction of two integers.
- Assume the opposite of what you want to prove
- Use logical reasoning to derive a contradiction
- Conclude that the original assumption must be false
Suppose \(\sqrt{2} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors (fraction in lowest terms)
\((\sqrt{2})^2 = \left(\frac{p}{q}\right)^2\)
\(2 = \frac{p^2}{q^2}\)
\(2q^2 = p^2\)
This means \(p^2\) is even, so \(p\) must be even
Since \(p\) is even, we can write \(p = 2k\) for some integer \(k\)
Substituting: \(2q^2 = (2k)^2 = 4k^2\)
So \(q^2 = 2k^2\), which means \(q^2\) is even
If \(q^2\) is even, then \(q\) must be even
But this means both \(p\) and \(q\) are even, so they share a common factor of 2
This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms
Since our assumption led to a contradiction, \(\sqrt{2}\) cannot be rational
Therefore, \(\sqrt{2}\) is irrational
\(\sqrt{2}\) is irrational because assuming it is rational leads to a contradiction.
• Proof by contradiction: Assume opposite, derive contradiction
• Even number property: If \(n^2\) is even, then \(n\) is even
• Coprime condition: Any rational can be expressed in lowest terms
Prime number: A natural number greater than 1 that has no positive divisors other than 1 and itself.
Prime property: If a prime divides a product, it must divide at least one of the factors.
Suppose \(\sqrt{3} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors
\((\sqrt{3})^2 = \left(\frac{p}{q}\right)^2\)
\(3 = \frac{p^2}{q^2}\)
\(3q^2 = p^2\)
This means \(3\) divides \(p^2\)
Since 3 is prime and divides \(p^2 = p \cdot p\), it must divide \(p\)
So we can write \(p = 3k\) for some integer \(k\)
Substituting: \(3q^2 = (3k)^2 = 9k^2\)
So \(q^2 = 3k^2\), which means \(3\) divides \(q^2\)
Since 3 divides \(q^2\), it must also divide \(q\)
So both \(p\) and \(q\) are multiples of 3
If both \(p\) and \(q\) are multiples of 3, they share a common factor of 3
This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms
\(\sqrt{3}\) is irrational because assuming it is rational leads to a contradiction.
• Prime divisor property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)
• Proof by contradiction: Assume rational, derive contradiction
• Lowest terms: Coprime numerator and denominator
Composite number: A positive integer that has at least one positive divisor other than 1 and itself.
Fundamental theorem of arithmetic: Every integer greater than 1 has a unique prime factorization.
Suppose \(\sqrt{6} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors
\((\sqrt{6})^2 = \left(\frac{p}{q}\right)^2\)
\(6 = \frac{p^2}{q^2}\)
\(6q^2 = p^2\)
This means \(6\) divides \(p^2\), so \(2\) and \(3\) both divide \(p^2\)
Since 2 is prime and divides \(p^2\), it must divide \(p\)
Since 3 is prime and divides \(p^2\), it must divide \(p\)
So we can write \(p = 6k\) for some integer \(k\)
Substituting: \(6q^2 = (6k)^2 = 36k^2\)
So \(q^2 = 6k^2\), which means \(6\) divides \(q^2\)
Since 2 and 3 divide \(q^2\), they both divide \(q\)
So both \(p\) and \(q\) are multiples of 6
If both \(p\) and \(q\) are multiples of 6, they share a common factor
This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms
\(\sqrt{6}\) is irrational because assuming it is rational leads to a contradiction.
• Fundamental theorem: Prime factorization is unique
• Prime divisor property: Extends to composite numbers
• Contradiction method: Assume rational, show impossible
Rational Number: A number expressible as \(\frac{p}{q}\) where \(p, q\) are integers and \(q \neq 0\)
Irrational Number: A number that cannot be expressed as a ratio of integers
Proof by Contradiction: Assume the opposite of what you want to prove, show it leads to a contradiction
Prime Number: A natural number greater than 1 with no divisors other than 1 and itself
Even/Odd Property: If \(n^2\) is even, then \(n\) is even
Prime Divisor Property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)
Lowest Terms: Any rational number can be expressed as \(\frac{p}{q}\) with \(\gcd(p,q) = 1\)
Fundamental Theorem: Every integer > 1 has unique prime factorization
1. Assume rational: \(\sqrt{n} = \frac{p}{q}\) in lowest terms
2. Square both sides: Eliminate the square root
3. Cross multiply: Obtain an equation relating \(p\) and \(q\)
4. Apply properties: Use prime divisor or even/odd properties
5. Derive contradiction: Show \(p\) and \(q\) share a common factor
6. Conclude: Original assumption was false
Prime vs Composite: Use prime divisor property for primes, factor for composites
Even/odd: Useful for \(\sqrt{2}\) and multiples
Lowest terms: Always assume fraction is in lowest terms
Unique factorization: Leverage for composite numbers
Modular arithmetic: A system of arithmetic for integers that considers remainders after division.
Quadratic residues: Numbers that can be expressed as squares modulo a given modulus.
Suppose \(\sqrt{5} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors
\((\sqrt{5})^2 = \left(\frac{p}{q}\right)^2\)
\(5 = \frac{p^2}{q^2}\)
\(5q^2 = p^2\)
This means \(5\) divides \(p^2\)
Since 5 is prime and divides \(p^2 = p \cdot p\), it must divide \(p\)
So we can write \(p = 5k\) for some integer \(k\)
Substituting: \(5q^2 = (5k)^2 = 25k^2\)
So \(q^2 = 5k^2\), which means \(5\) divides \(q^2\)
Since 5 divides \(q^2\), it must also divide \(q\)
So both \(p\) and \(q\) are multiples of 5
If both \(p\) and \(q\) are multiples of 5, they share a common factor of 5
This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms
\(\sqrt{5}\) is irrational because assuming it is rational leads to a contradiction.
• Prime divisor property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)
• Proof by contradiction: Assume rational, derive contradiction
• Lowest terms: Coprime numerator and denominator
Perfect square: A positive integer that can be expressed as \(k^2\) for some integer \(k\).
Fundamental theorem of arithmetic: Every integer greater than 1 has a unique prime factorization.
Suppose \(\sqrt{n} = \frac{p}{q}\) where \(p\) and \(q\) are positive integers with no common factors
\((\sqrt{n})^2 = \left(\frac{p}{q}\right)^2\)
\(n = \frac{p^2}{q^2}\)
\(nq^2 = p^2\)
Since \(n\) is not a perfect square, in its prime factorization, at least one prime appears an odd number of times
Let \(n = p_1^{a_1} \cdot p_2^{a_2} \cdot ... \cdot p_k^{a_k}\) where at least one \(a_i\) is odd
In the equation \(nq^2 = p^2\), the prime \(p_i\) appears an odd number of times in \(n\)
Since \(q^2\) contributes an even number of each prime to the left side, the total count of \(p_i\) on the left side is odd
On the right side, \(p^2\) has each prime appearing an even number of times
This contradicts the fundamental theorem of arithmetic since the same number cannot have different prime factorizations
Therefore, our assumption that \(\sqrt{n}\) is rational must be false
So \(\sqrt{n}\) is irrational when \(n\) is not a perfect square
\(\sqrt{n}\) is irrational for any positive integer \(n\) that is not a perfect square.
• Fundamental theorem: Unique prime factorization
• Perfect square criterion: All prime exponents even
• Contradiction method: Assume rational, show impossible
Algebraic numbers: Numbers that are roots of non-zero polynomial equations with rational coefficients.
Transcendental numbers: Numbers that are not algebraic (like \(\pi\) and \(e\)).
Density property: Between any two real numbers, there exists both a rational and an irrational number.
Cardinality: The set of irrational numbers is uncountably infinite, while rationals are countably infinite.
- Classify the number: Determine if it's likely to be rational or irrational
- Choose appropriate method: Direct proof, contradiction, or contrapositive
- Apply relevant theorems: Prime divisor property, fundamental theorem of arithmetic
- Derive logical consequences: Follow the chain of implications
- Identify contradiction: Show the assumption leads to impossibility
- State conclusion: Clearly articulate the final result
• \(\sqrt{p}\) is irrational for any prime \(p\)
• \(\sqrt{n}\) is rational if and only if \(n\) is a perfect square
• \(\sqrt{ab} = \sqrt{a}\sqrt{b}\) (for positive \(a, b\))
• If \(r\) is rational and \(i\) is irrational, then \(r + i\) and \(ri\) (if \(r \neq 0\)) are irrational
• The sum of two irrationals may be rational or irrational