|
1987 (number)
1987 is the natural number following 1986 and preceding 1988. In mathematics 1987 is an odd number and the 300th prime number. It is the first number of a sexy prime triplet (1987, 1993, 1999). Being of the form 4''n'' + 3, it is a Gaussian prime. It is a lucky number and therefore also a lucky prime. 1987 is a prime factor of the 9th number in Sylvester's sequence, and is the 15th prime to divide any number in the sequence. There are 1987 polyiamonds with 12 cells that tile the plane isohedrally. In other fields * UN 1987 is the UN number for the hazardous substance "Alcohol Alcohol most commonly refers to: * Alcohol (chemistry), an organic compound in which a hydroxyl group is bound to a carbon atom * Alcohol (drug), an intoxicant found in alcoholic drinks Alcohol may also refer to: Chemicals * Ethanol, one of sev ...s, N.O.S." (N.O.S. stands for ''not otherwise specified''). *There are 1987 ways to place four non-attacking chess kings on a 5 × 5 board.. References ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called '' cardinal numbers'', and numbers used for ordering are called '' ordinal numbers''. Natural numbers are sometimes used as labels, known as ''nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports jersey numbers). Some definitions, including the standard ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural numbers form a set. Many other number sets are built by succ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Odd Number
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because \begin -2 \cdot 2 &= -4 \\ 0 \cdot 2 &= 0 \\ 41 \cdot 2 &= 82 \end By contrast, −3, 5, 7, 21 are odd numbers. The above definition of parity applies only to integer numbers, hence it cannot be applied to numbers like 1/2 or 4.201. See the section "Higher mathematics" below for some extensions of the notion of parity to a larger class of "numbers" or in other more general settings. Even and odd numbers have opposite parities, e.g., 22 (even number) and 13 (odd number) have opposite parities. In particular, the parity of zero is even. Any two consecutive integers have opposite parity. A number (i.e., integer) expressed in the decimal numeral system is even or odd according to whether its last digit is even or odd. That is, if the last digit is 1, 3, 5, 7, or 9, then it is odd; other ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which alw ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sexy Prime
In number theory, sexy primes are prime numbers that differ from each other by 6. For example, the numbers 5 and 11 are both sexy primes, because both are prime and . The term "sexy prime" is a pun stemming from the Latin word for six: . If or (where is the lower prime) is also prime, then the sexy prime is part of a prime triplet. In August 2014 the Polymath group, seeking the proof of the twin prime conjecture, showed that if the generalized Elliott–Halberstam conjecture is proven, one can show the existence of infinitely many pairs of consecutive primes that differ by at most 6 and as such they are either twin, cousin or sexy primes. Primorial ''n''# notation As used in this article, # stands for the product 2 · 3 · 5 · 7 · … of all the primes ≤ . Types of groupings Sexy prime pairs The sexy primes (sequences and in OEIS) below 500 are: :(5,11), (7,13), (11,17), (13,19), (17,23), (23,29), (31,37), (37,43), (41,47), (47,53), (53,59), (61,67) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Integer
In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as \mathbf /math> or \Z Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic. Gaussian integers are algebraic integers and form the simplest ring of quadratic integers. Gaussian integers are named after the German mathematician Carl Friedrich Gauss. Basic definitions The Gaussian integers are the set :\mathbf \, \qquad \text i^2 = -1. In other words, a Gaussian integer is a complex number such that its real and imaginary parts are both integers. Since the Gaussian integers are closed under addition and mu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lucky Number
In number theory, a lucky number is a natural number in a set which is generated by a certain "sieve". This sieve is similar to the Sieve of Eratosthenes that generates the primes, but it eliminates numbers based on their position in the remaining set, instead of their value (or position in the initial set of natural numbers). The term was introduced in 1956 in a paper by Gardiner, Lazarus, Metropolis and Ulam. They suggest also calling its defining sieve, "the sieve of Josephus Flavius" because of its similarity with the counting-out game in the Josephus problem. Lucky numbers share some properties with primes, such as asymptotic behaviour according to the prime number theorem; also, a version of Goldbach's conjecture has been extended to them. There are infinitely many lucky numbers. Twin lucky numbers and twin primes also appear to occur with similar frequency. However, if ''L''''n'' denotes the ''n''-th lucky number, and ''p''''n'' the ''n''-th prime, then ''L''''n'' > ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Factor
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which alwa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sylvester's Sequence
In number theory, Sylvester's sequence is an integer sequence in which each term of the sequence is the product of the previous terms, plus one. The first few terms of the sequence are :2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 . Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its terms. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms. Formal definiti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyiamond
A polyiamond (also polyamond or simply iamond, or sometimes triangular polyomino) is a polyform whose base form is an equilateral triangle. The word ''polyiamond'' is a back-formation from ''diamond'', because this word is often used to describe the shape of a pair of equilateral triangles placed base to base, and the initial 'di-' looks like a Greek prefix meaning 'two-' (though ''diamond'' actually derives from Greek '' ἀδάμας'' - also the basis for the word "adamant"). The name was suggested by recreational mathematics writer Thomas H. O'Beirne in ''New Scientist'' 1961 number 1, page 164. Counting The basic combinatorial question is, How many different polyiamonds exist with a given number of cells? Like polyominoes, polyiamonds may be either free or one-sided. Free polyiamonds are invariant under reflection as well as translation and rotation. One-sided polyiamonds distinguish reflections. The number of free ''n''-iamonds for ''n'' = 1, 2, 3, ... is: :1, 1, 1, 3, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isohedral
In geometry, a tessellation of dimension (a plane tiling) or higher, or a polytope of dimension (a polyhedron) or higher, is isohedral or face-transitive if all its faces are the same. More specifically, all faces must be not merely congruent but must be ''transitive'', i.e. must lie within the same '' symmetry orbit''. In other words, for any two faces and , there must be a symmetry of the ''entire'' figure by translations, rotations, and/or reflections that maps onto . For this reason, convex isohedral polyhedra are the shapes that will make fair dice. Isohedral polyhedra are called isohedra. They can be described by their face configuration. An isohedron has an even number of faces. The dual of an isohedral polyhedron is vertex-transitive, i.e. isogonal. The Catalan solids, the bipyramids, and the trapezohedra are all isohedral. They are the duals of the (isogonal) Archimedean solids, prisms, and antiprisms, respectively. The Platonic solids, which are either sel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
UN Number
A UN number (United Nations number) is a four-digit number that identifies hazardous materials, and articles (such as explosives, flammable liquids, oxidizers, toxic liquids, etc.) in the framework of international trade and transport. Some hazardous substances have their own UN numbers (e.g. acrylamide has UN 2074), while sometimes groups of chemicals or products with similar properties receive a common UN number (e.g. flammable liquids, not otherwise specified, have UN 1993). A chemical in its solid state may receive a different UN number than the liquid phase if its hazardous properties differ significantly; substances with different levels of purity (or concentration in solution) may also receive different UN numbers. Hazard identifiers Associated with each UN number is a hazard identifier, which encodes the general hazard class and subdivision (and, in the case of explosives, their compatibility group). If a substance poses several dangers, then subsidiary risk identif ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
