Search results
24 gru 2016 · An example would suffice to prove this claim. If you don't want to divide an irrational number by itself, how about $2\sqrt{2}/\sqrt{2}$. You should be able to prove that if a number is irrational, then twice that number is also irrational.
- Prove that $2^{1/2}$ is irrational
In particular $2$ is not a perfect square and so $\sqrt 2$...
- Prove that $2^{1/2}$ is irrational
6 maj 2014 · The simplest that I know is a proof that $\log_2 3$ is irrational. Here it is: remember that to say that a number is rational is to say that it is $a/b$, where $a$ and $b$ are integers (e.g. $5/7$, etc.). So suppose $\log_2 3 = a/b$. Since this is a positive number, we can take $a$ and $b$ to be positive.
In particular $2$ is not a perfect square and so $\sqrt 2$ must be irrational. In a very similar way one can argue that $$ \frac{a}{b}\notin\mathbb Z\implies\frac{a^k}{b^k}\notin\mathbb Z $$ To show that any integer that is NOT a perfect $k$-th power of an integer has an irrational $k$-th root.
Summary and Review. We can use indirect proofs to prove an implication. There are two kinds of indirect proofs: proof by contrapositive and proof by contradiction. In a proof by contrapositive, we actually use a direct proof to prove the contrapositive of the original implication.
NEIL MAKUR. Abstract. We start by looking at some basic properties regarding operations with rational and irrational numbers. We then go on to show that certain radicals are irrational. Next, we state and prove a criterion for irrationality and use it to prove that e is irrational.
The best known of all irrational numbers is \(\sqrt{2}\). We establish \(\sqrt{2} \ne \dfrac{a}{b}\) with a novel proof which does not make use of divisibility arguments. Suppose \(\sqrt{2} = \dfrac{a}{b}\) (\(a\), \(b\) integers), with \(b\) as small as possible.
18 lut 2021 · An integer p> 1 is a prime if ∀a, b ∈ Z, if ab = p then either a = p ∧ b = 1 or a = 1 ∧ b = p. An integer n> 1 is a composite if ∃a, b ∈ Z(ab = n) with 1 <a <n ∧ 1 <b <n. Notes: The integer 1 is neither prime nor composite. A positive integer n is composite if it has a divisor d that satisfies 1 <d <n.
