24/7 Pet Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Irrational number - Wikipedia

    en.wikipedia.org/wiki/Irrational_number

    Perhaps the numbers most easy to prove irrational are certain logarithms. Here is a proof by contradiction that log 2 3 is irrational (log 2 3 ≈ 1.58 > 0). Assume log 2 3 is rational. For some positive integers m and n, we have ⁡ =. It follows that / =

  3. Proof that π is irrational - Wikipedia

    en.wikipedia.org/wiki/Proof_that_π_is_irrational

    v. t. e. In the 1760s, Johann Heinrich Lambert was the first to prove that the number π is irrational, meaning it cannot be expressed as a fraction , where and are both integers. In the 19th century, Charles Hermite found a proof that requires no prerequisite knowledge beyond basic calculus.

  4. Square root of 2 - Wikipedia

    en.wikipedia.org/wiki/Square_root_of_2

    The square root of 2 (approximately 1.4142) is a real number that, when multiplied by itself or squared, equals the number 2. It may be written in mathematics as or . It is an algebraic number, and therefore not a transcendental number.

  5. Proof that e is irrational - Wikipedia

    en.wikipedia.org/wiki/Proof_that_e_is_irrational

    Euler's proof. Euler wrote the first proof of the fact that e is irrational in 1737 (but the text was only published seven years later). [1] [2] [3] He computed the representation of e as a simple continued fraction, which is. Since this continued fraction is infinite and every rational number has a terminating continued fraction, e is irrational.

  6. Dirichlet's approximation theorem - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_approximation...

    In number theory, Dirichlet's theorem on Diophantine approximation, also called Dirichlet's approximation theorem, states that for any real numbers and , with , there exist integers and such that and. Here represents the integer part of . This is a fundamental result in Diophantine approximation, showing that any real number has a sequence of ...

  7. Cantor's diagonal argument - Wikipedia

    en.wikipedia.org/wiki/Cantor's_diagonal_argument

    Georg Cantor published this proof in 1891, [1] [2]: 20– [3] but it was not his first proof of the uncountability of the real numbers, which appeared in 1874. [ 4 ] [ 5 ] However, it demonstrates a general technique that has since been used in a wide range of proofs, [ 6 ] including the first of Gödel's incompleteness theorems [ 2 ] and ...

  8. Thomae's function - Wikipedia

    en.wikipedia.org/wiki/Thomae's_function

    The topmost point in the middle shows f (1/2) = 1/2. Thomae's function is a real -valued function of a real variable that can be defined as: [1] : 531. It is named after Carl Johannes Thomae, but has many other names: the popcorn function, the raindrop function, the countable cloud function, the modified Dirichlet function, the ruler function ...

  9. Constructive proof - Wikipedia

    en.wikipedia.org/wiki/Constructive_proof

    A constructive proof of the theorem that a power of an irrational number to an irrational exponent may be rational gives an actual example, such as: =, = ⁡, =. The square root of 2 is irrational, and 3 is rational.