Divisibility
31arithmetic — arithmetically, adv. n. /euh rith meuh tik/; adj. /ar ith met ik/, n. 1. the method or process of computation with figures: the most elementary branch of mathematics. 2. Also called higher arithmetic, theoretical arithmetic. the theory of… …
32Critique of the Kantian philosophy — Schopenhauer appended a criticism to the first volume of his The World as Will and Representation. He wanted to show Kant s errors so that Kant s merits would be appreciated and his achievements furthered. At the time he wrote his criticism,… …
33Integral domain — In abstract algebra, an integral domain is a commutative ring that has no zero divisors,[1] and which is not the trivial ring {0}. It is usually assumed that commutative rings and integral domains have a multiplicative identity even though this… …
34Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… …
35Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… …
36Extension (metaphysics) — In metaphysics, extension is, roughly speaking, the property of taking up space . René Descartes defines extension as the property of existing in more than one dimension. For Descartes, the primary characteristic of matter is extension, just as… …
37101 (number) — 101 (one hundred [and] one) is the natural number following 100 and preceding 102. It is variously pronounced one hundred and one / a hundred and one , one hundred one / a hundred one , and one oh one . As an ordinal number, 101st rather than… …
38Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive …
39Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… …
40Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La …
