|
217 (number)
217 (two hundred ndseventeen) is the natural number following 216 and preceding 218. In mathematics 217 is a centered hexagonal number, a 12-gonal number, a centered 36-gonal number, a Fermat pseudoprime to base 5, and a Blum integer. It is both the sum of two positive cubes and the difference of two positive consecutive cubes in exactly one way: 217 = 6^3 + 1^3 = 9^3 - 8^3. When written in binary, it is a non-repetitive Kaprekar number. OEIS It is also the sum of all the s of . See also *217
Year 217 (R ...
[...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] |
216 (number)
216 (two hundred ndsixteen) is the natural number following 215 and preceding 217. It is a cube, and is often called Plato's number, although it is not certain that this is the number intended by Plato. In mathematics 216 is the cube of 6, and the sum of three cubes:216=6^3=3^3+4^3+5^3. It is the smallest cube that can be represented as a sum of three positive cubes, making it the first nontrivial example for Euler's sum of powers conjecture. It is, moreover, the smallest number that can be represented as a sum of any number of distinct positive cubes in more than one way. It is a highly powerful number: the product 3\times 3 of the exponents in its prime factorization 216 = 2^3\times 3^3 is larger than the product of exponents of any smaller number. Because there is no way to express it as the sum of the proper divisors of any other integer, it is an untouchable number. Although it is not a semiprime, the three closest numbers on either side of it are, making it the middle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
218 (number)
218 (two hundred ndeighteen) is the natural number following 217 and preceding 219. In mathematics *Mertens function(218) = 3, a record high. *218 is nontotient and also noncototient. *218 is the number of inequivalent ways to color the 12 edges of a cube using at most 2 colors, where two colorings are equivalent if they differ only by a rotation of the cube. *There are 218 nondegenerate Boolean functions of 3 variables. *The number of surface points on a 73 cube. In other fields *218 is the current number of votes in the US House of Representatives a party or coalition needs to win in order to achieve a majority. *The years 218 and 218 BC __NOTOC__ Year 218 BC was a year of the pre-Julian Roman calendar. At the time it was known as the Year of the Consulship of Scipio and Longus (or, less frequently, year 536 ''Ab urbe condita''). The denomination 218 BC for this year has been ... *Area code 218, for northern Minnesota. References Integers {{Num-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Centered Hexagonal Number
In mathematics and combinatorics, a centered hexagonal number, or hex number, is a centered figurate number that represents a hexagon with a dot in the center and all other dots surrounding the center dot in a hexagonal lattice. The following figures illustrate this arrangement for the first four centered hexagonal numbers: : Centered hexagonal numbers should not be confused with cornered hexagonal numbers, which are figurate numbers in which the associated hexagons share a vertex. The sequence of hexagonal numbers starts out as follows : : 1, 7, 19, 37, 61, 91, 127, 169, 217, 271, 331, 397, 469, 547, 631, 721, 817, 919. Formula The th centered hexagonal number is given by the formula :H(n) = n^3 - (n-1)^3 = 3n(n-1)+1 = 3n^2 - 3n +1. \, Expressing the formula as :H(n) = 1+6\left(\frac\right) shows that the centered hexagonal number for is 1 more than 6 times the th triangular number. In the opposite direction, the ''index'' corresponding to the centered he ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dodecagonal Number
A dodecagonal number is a figurate number that represents a dodecagon. The dodecagonal number for ''n'' is given by the formula :D_=5n^2 - 4n The first few dodecagonal numbers are: : 0, 1, 12, 33, 64, 105, 156, 217, 288, 369, 460, 561, 672, 793, 924, 1065, 1216, 1377, 1548, 1729, 1920, 2121, 2332, 2553, 2784, 3025, 3276, 3537, 3808, 4089, 4380, 4681, 4992, 5313, 5644, 5985, 6336, 6697, 7068, 7449, 7840, 8241, 8652, 9073, 9504, 9945 ... Properties *The dodecagonal number for ''n'' can be calculated by adding the square of ''n'' to four times the (''n'' - 1)th pronic number, or to put it algebraically, D_n = n^2 + 4(n^2 - n). *Dodecagonal numbers consistently alternate parity, and in base 10, their units place digits follow the pattern 1, 2, 3, 4, 5, 6, 7, 8, 9, 0. *By the Fermat polygonal number theorem, every number is the sum of at most 12 dodecagonal numbers. *D_n is the sum of the first n natural numbers congruent to 1 mod 10. *D_n is the sum of all odd numbers from 4n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Centered Polygonal Number
The centered polygonal numbers are a class of series of figurate numbers, each formed by a central dot, surrounded by polygonal layers of dots with a constant number of sides. Each side of a polygonal layer contains one more dot than each side in the previous layer; so starting from the second polygonal layer, each layer of a centered ''k''-gonal number contains ''k'' more dots than the previous layer. Examples Each centered ''k''-gonal number in the series is ''k'' times the previous triangular number, plus 1. This can be formalized by the expression \frac +1, where ''n'' is the series rank, starting with 0 for the initial 1. For example, each centered square number in the series is four times the previous triangular number, plus 1. This can be formalized by the expression \frac +1. These series consist of the *centered triangular numbers 1, 4, 10, 19, 31, 46, 64, 85, 109, 136, 166, 199, ... (), *centered square numbers 1, 5, 13, 25, 41, 61, 85, 113, 145, 181, 221, 265, ... ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermat Pseudoprime
In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem. Definition Fermat's little theorem states that if ''p'' is prime and ''a'' is coprime to ''p'', then ''a''''p''−1 − 1 is divisible by ''p''. For an integer ''a'' > 1, if a composite integer ''x'' divides ''a''''x''−1 − 1, then ''x'' is called a Fermat pseudoprime to base ''a''. In other words, a composite integer is a Fermat pseudoprime to base ''a'' if it successfully passes the Fermat primality test for the base ''a''. The false statement that all numbers that pass the Fermat primality test for base 2, are prime, is called the Chinese hypothesis. The smallest base-2 Fermat pseudoprime is 341. It is not a prime, since it equals 11·31, but it satisfies Fermat's little theorem: 2340 ≡ 1 (mod 341) and thus passes the Fermat primality test for the base 2. Pseudoprimes to base 2 are sometimes called Sarrus numbers, af ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Base 5
Quinary (base-5 or pental) is a numeral system with five as the base. A possible origination of a quinary system is that there are five digits on either hand. In the quinary place system, five numerals, from 0 to 4, are used to represent any real number. According to this method, five is written as 10, twenty-five is written as 100 and sixty is written as 220. As five is a prime number, only the reciprocals of the powers of five terminate, although its location between two highly composite numbers ( 4 and 6) guarantees that many recurring fractions have relatively short periods. Today, the main usage of base 5 is as a biquinary system, which is decimal using five as a sub-base. Another example of a sub-base system, is sexagesimal, base 60, which used 10 as a sub-base. Each quinary digit can hold log25 (approx. 2.32) bits of information. Comparison to other radices Usage Many languagesHarald Hammarström, Rarities in Numeral Systems: "Bases 5, 10, and 20 are o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Blum Integer
In mathematics, a natural number ''n'' is a Blum integer if is a semiprime for which ''p'' and ''q'' are distinct prime numbers congruent to 3 mod 4.Joe Hurd, Blum Integers (1997), retrieved 17 Jan, 2011 from http://www.gilith.com/research/talks/cambridge1997.pdf That is, ''p'' and ''q'' must be of the form , for some integer ''t''. Integers of this form are referred to as Blum primes. Goldwasser, S. and Bellare, M.br>"Lecture Notes on Cryptography". Summer course on cryptography, MIT, 1996-2001 This means that the factors of a Blum integer are Gaussian primes with no imaginary part. The first few Blum integers are : 21, 33, 57, 69, 77, 93, 129, 133, 141, 161, 177, 201, 209, 213, 217, 237, 249, 253, 301, 309, 321, 329, 341, 381, 393, 413, 417, 437, 453, 469, 473, 489, 497, ... The integers were named for computer scientist Manuel Blum. Properties Given a Blum integer, ''Q''''n'' the set of all quadratic residues modulo ''n'' and coprime to ''n'' and . Then: *''a'' h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kaprekar Number
In mathematics, a natural number in a given number base is a p-Kaprekar number if the representation of its square in that base can be split into two parts, where the second part has p digits, that add up to the original number. The numbers are named after D. R. Kaprekar. Definition and properties Let n be a natural number. We define the Kaprekar function for base b > 1 and power p > 0 F_ : \mathbb \rightarrow \mathbb to be the following: :F_(n) = \alpha + \beta, where \beta = n^2 \bmod b^p and :\alpha = \frac A natural number n is a p-Kaprekar number if it is a fixed point for F_, which occurs if F_(n) = n. 0 and 1 are trivial Kaprekar numbers for all b and p, all other Kaprekar numbers are nontrivial Kaprekar numbers. For example, in base 10, 45 is a 2-Kaprekar number, because : \beta = n^2 \bmod b^p = 45^2 \bmod 10^2 = 25 : \alpha = \frac = \frac = 20 : F_(45) = \alpha + \beta = 20 + 25 = 45 A natural number n is a sociable Kaprekar number if it is a periodic point fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Divisor
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a multiple of m. An integer n is divisible or evenly divisible by another integer m if m is a divisor of n; this implies dividing n by m leaves no remainder. Definition An integer is divisible by a nonzero integer if there exists an integer such that n=km. This is written as :m\mid n. Other ways of saying the same thing are that divides , is a divisor of , is a factor of , and is a multiple of . If does not divide , then the notation is m\not\mid n. Usually, is required to be nonzero, but is allowed to be zero. With this convention, m \mid 0 for every nonzero integer . Some definitions omit the requirement that m be nonzero. General Divisors can be negative as well as positive, although sometimes the term is restricted to positive divisors. For example, there are six divisors of 4; they a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integers
An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language of mathematics, the set of integers is often denoted by the boldface or blackboard bold \mathbb. The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the natural numbers, \mathbb is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and are not. The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
