Divisibility
111Gold standard — For other uses, see Gold standard (disambiguation). Under a gold standard, paper notes are convertible into pre set, fixed quantities of gold. The gold standard is a monetary system in which the standard economic unit of account is a fixed mass… …
112Yulian Vasilievich Sokhotski — Julian Karol Sochocki ( ru. Юлиан Карл Васильевич Сохоцкий) (February 2, 1842, Warsaw, Congress Poland, Russian Empire – December 14, 1927, Leningrad, Soviet Union) was a Polish mathematician. Sochocki was born in Warsaw under the Russian… …
113Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …
114Exponential distribution — Not to be confused with the exponential families of probability distributions. Exponential Probability density function Cumulative distribution function para …
115Cox's theorem — Cox s theorem, named after the physicist Richard Threlkeld Cox, is a derivation of the laws of probability theory from a certain set of postulates. This derivation justifies the so called logical interpretation of probability. As the laws of… …
1162 (number) — II redirects here. For other uses, see II (disambiguation). Two redirects here. For other uses, see Two (disambiguation). 2 −1 0 1 2 3 4 5 6 7 8 9 → List of numbers …
117Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… …
118Composite number — A composite number is a positive integer which has a positive divisor other than one or itself. In other words a composite number is any positive integer greater than one that is not a prime number. So, if n > 0 is an integer and… …
119Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… …
120Magma (algebra) — In abstract algebra, a magma (or groupoid; not to be confused with groupoids in category theory) is a basic kind of algebraic structure. Specifically, a magma consists of a set M equipped with a single binary operation . A binary operation is… …
