-
1 check over/through the proofs
check over/through the proofsde drukproeven na/doorkijken -
2 check
n. onderzoek; rem; ruit; cheque; verificatie, bevestiging; cheque, uitgeschreven bestelling van een partij die de bank gelast een specifiek bedrag aan een andere partij over te maken, betalingsopdracht; geldopdracht; rekening van restaurant--------v. onderzoeken, nagaan, verifiëren, controleren; remmen, stoppencheck1[ tsjek]2 proef ⇒ test, controle4 kaartje ⇒ reçu, bonnetje♦voorbeelden:1 keep a check on someone, 〈 Amerikaans-Engels〉have one's checks upon someone • iemand in de gaten/het oog houdenput a check on someone • iemand intomen1 ruit(je) ⇒ ruitpatroon, geruite stof2 schaak♦voorbeelden:1 keep in check • onder controle/in bedwang houdenwithout check • ongehinderd2 check! • schaak!————————check2♦voorbeelden:1 controleren ⇒ testen, toetsen♦voorbeelden:check over/through the proofs • de drukproeven na/doorkijken♦voorbeelden:check one's hunger • zijn honger stillen
См. также в других словарях:
Proofs involving the totient function — This page provides proofs for identities involving the totient function varphi(k) and the Möbius function mu(k).um of integers relatively prime to and less than or equal to n Claim::sum {1le kle n atop {gcd(k,n)=1 k = frac{1}{2} , varphi(n) ,… … Wikipedia
Connected space/Proofs — Every path connected space is connectedLet S be path connected and suppose, for contradiction, that S is not connected. Then S = A cup B for nonempty disjoint open sets A and B . Let x in A, y in B. Since S is path connected, there exists a… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Rigour — For the medical term, see Rigor (medicine). For the sign of death, see Rigor mortis. Rigour or rigor (see spelling differences) has a number of meanings in relation to intellectual life and discourse. These are separate from public and political… … Wikipedia
Mizar system — For the star system, see Mizar (star). The Mizar system consists of a language for writing strictly formalized mathematical definitions and proofs, a computer program which is able to check proofs written in this language, and a library of… … Wikipedia
Logic — For other uses, see Logic (disambiguation). Philosophy … Wikipedia
Metamath — Developer(s) Norman Megill Written in C Operating system … Wikipedia
Commitment scheme — In cryptography, a commitment scheme allows one to commit to a value while keeping it hidden, with the ability to reveal the committed value later. Commitments are used to bind a party to a value so that they cannot adapt to other messages in… … Wikipedia
Divisibility rule — A divisibility rule is a shorthand way of discovering whether a given number is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, and… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia