- proof is straightforward
- мат. доказательство не вызывает затруднений
Большой англо-русский и русско-английский словарь. 2001.
proof is straightforward
Смотреть что такое "proof is straightforward" в других словарях:
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Proof that 22/7 exceeds π — Proofs of the famous mathematical result that the rational number 22⁄7 is greater than π date back to antiquity. What follows is a modern mathematical proof that 22⁄7 > π, requiring only elementary techniques from calculus. The purpose is not… … Wikipedia
Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… … Wikipedia
Direct proof — In mathematics and logic, a direct proof is a way of showing the truth or falsehood of a given statement by a straightforward combination of established facts, usually existing lemmas and theorems, without making any further assumptions. In order … Wikipedia
Gödel numbering for sequences — A Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness… … Wikipedia
Difference of two squares — In mathematics, the difference of two squares, or the difference of perfect squares, is when a number is squared, or multiplied by itself, and is then subtracted from another squared number. It refers to the identity from elementary algebra.… … Wikipedia
Least common multiple — In arithmetic and number theory, the least common multiple (also called the lowest common multiple or smallest common multiple) of two integers a and b, usually denoted by LCM(a, b), is the smallest positive integer that is a multiple of both a… … Wikipedia
Orthonormal basis — In mathematics, particularly linear algebra, an orthonormal basis for inner product space V with finite dimension is a basis for V whose vectors are orthonormal.[1][2][3] For example, the standard basis for a Euclidean space Rn is an orthonormal… … Wikipedia
Heawood conjecture — The Heawood conjecture or Ringel–Youngs theorem in graph theory gives an upper bound for the number of colors which are sufficient for graph coloring on a surface of a given genus. It was proven in 1968 by Gerhard Ringel and J. W. T. Youngs. One… … Wikipedia
Abraham de Moivre — Moivre redirects here; for the French commune see Moivre, Marne. Abraham de Moivre Abraham de Moivre Born … Wikipedia
Periodic continued fraction — In mathematics, an infinite periodic continued fraction is a continued fraction that can be placed in the form:x = a 0 + cfrac{1}{a 1 + cfrac{1}{a 2 + cfrac{ddots}{quadddotsquad a k + cfrac{1}{a {k+1} + cfrac{ddots}{quadddotsquad a {k+m 1} +… … Wikipedia
