How to Prove That Log Base 2 of 3 Is Irrational

TL;DR

To prove that log base 2 of 3 is irrational, assume it's rational and derive a contradiction by showing that 3 to the power of an integer is always odd, while 2 to another integer is always even. This leads to an impossible equality, confirming the irrationality of log base 2 of 3.

Transcript

okay video show you guys how to prove that log base 2 of 3 is irrational and first of all let me explain how to I usually go to about provisioning like this to me this right here is like a negative statement because the word irrational means what it means not rational right so I'm trying to show log base 2 of 3 is not rational and in this case I wi... Read More

Key Insights

• 😌 The proof of log base 2 of 3 being irrational relies on the method of contradiction.
• 👍 The assumption that log base 2 of 3 is rational is used to derive a contradiction, proving its irrationality.
• 🦕 Understanding the properties of odd and even numbers is crucial in the proof.
• #️⃣ The proof contributes to the study of number theory and the concept of irrational numbers.
• ❓ Proofs by contradiction are common in mathematics to establish the validity of statements.
• #️⃣ The proof highlights the complexity of irrational numbers and their relationship with rational numbers.
• ❓ Logarithmic functions can be analyzed using mathematical properties and logical reasoning.

Questions & Answers

Q: What does it mean for a number to be irrational?

An irrational number cannot be expressed as a fraction of two integers. It is a number that cannot be written as a terminating or repeating decimal.

Q: Why is proving log base 2 of 3 irrational important?

Demonstrating the irrationality of log base 2 of 3 contributes to a deeper understanding of mathematics and number theory. It shows the complexity and intricacies of irrational numbers.

Q: What other proofs use the method of contradiction?

One famous proof using contradiction is to show there are infinitely many prime numbers. By assuming a finite number of primes and deriving a contradiction, it can be proven that the set of primes is infinite.

Q: How does the proof show that 3 to the B is always odd and 2 to the A is always even?

Since 3 is an odd number, any power of 3 will also be odd. Similarly, 2 is an even number, so any power of 2 will be even. This pattern is consistent and leads to the contradiction in the proof.

Summary & Key Takeaways

• The video explains how the proof of log base 2 of 3 being irrational is approached using the method of contradiction.

• By assuming log base 2 of 3 is rational and analyzing its properties, a contradiction is derived to prove its irrationality.

• The proof involves demonstrating that 3 to the B is always odd while 2 to the A is always even, leading to an impossible equality.