|
3779 (number)
3000 (three thousand) is the natural number following 2999 and preceding 3001. It is the smallest number requiring thirteen letters in English (when "and" is required from 101 forward). Selected numbers in the range 3001–3999 3001 to 3099 *3001 – super-prime; divides the Euclid number 2999# + 1 *3003 – triangular number, only number known to appear eight times in Pascal's triangle; no number is known to appear more than eight times other than 1. (see Singmaster's conjecture) *3019 – super-prime, happy prime *3023 – 84th Sophie Germain prime, 51st safe prime *3025 = 552, sum of the cubes of the first ten integers, centered octagonal number, dodecagonal number *3037 – star number, cousin prime with 3041 *3045 – sum of the integers 196 to 210 ''and'' sum of the integers 211 to 224 *3046 – centered heptagonal number *3052 – decagonal number *3059 – centered cube number *3061 – prime of the form 2p-1 *3063 – perfect totient number *3067 – super-p ... [...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 number, cardinal numbers'', and numbers used for ordering are called ''Ordinal number, 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 Number (sports), jersey numbers). Some definitions, including the standard ISO/IEC 80000, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Centered Cube Number
A centered cube number is a centered figurate number that counts the number of points in a three-dimensional pattern formed by a point surrounded by concentric cubical layers of points, with points on the square faces of the th layer. Equivalently, it is the number of points in a body-centered cubic pattern within a cube that has points along each of its edges. The first few centered cube numbers are : 1, 9, 35, 91, 189, 341, 559, 855, 1241, 1729, 2331, 3059, 3925, 4941, 6119, 7471, 9009, ... . Formulas The centered cube number for a pattern with concentric layers around the central point is given by the formula :n^3 + (n + 1)^3 = (2n+1)\left(n^2+n+1\right). The same number can also be expressed as a trapezoidal number (difference of two triangular numbers), or a sum of consecutive numbers, as :\binom-\binom = (n^2+1)+(n^2+2)+\cdots+(n+1)^2. Properties Because of the factorization , it is impossible for a centered cube number to be a prime number. The only centered ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Truncatable Prime
In number theory, a left-truncatable prime is a prime number which, in a given base, contains no 0, and if the leading ("left") digit is successively removed, then all resulting numbers are prime. For example, 9137, since 9137, 137, 37 and 7 are all prime. Decimal representation is often assumed and always used in this article. A right-truncatable prime is a prime which remains prime when the last ("right") digit is successively removed. 7393 is an example of a right-truncatable prime, since 7393, 739, 73, and 7 are all prime. A left-and-right-truncatable prime is a prime which remains prime if the leading ("left") and last ("right") digits are simultaneously successively removed down to a one- or two-digit prime. 1825711 is an example of a left-and-right-truncatable prime, since 1825711, 82571, 257, and 5 are all prime. In base 10, there are exactly 4260 left-truncatable primes, 83 right-truncatable primes, and 920,720,315 left-and-right-truncatable primes. History An author ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proth Prime
A Proth number is a natural number ''N'' of the form N = k \times 2^n +1 where ''k'' and ''n'' are positive integers, ''k'' is odd and 2^n > k. A Proth prime is a Proth number that is prime. They are named after the French mathematician François Proth. The first few Proth primes are : 3, 5, 13, 17, 41, 97, 113, 193, 241, 257, 353, 449, 577, 641, 673, 769, 929, 1153, 1217, 1409, 1601, 2113, 2689, 2753, 3137, 3329, 3457, 4481, 4993, 6529, 7297, 7681, 7937, 9473, 9601, 9857 (). It is still an open question whether an infinite number of Proth primes exist. It was shown in 2022 that the reciprocal sum of Proth primes converges to a real number near 0.747392479, substantially less than the value of 1.093322456 for the reciprocal sum of Proth numbers. The primality of Proth numbers can be tested more easily than many other numbers of similar magnitude. Definition A Proth number takes the form N=k 2^n +1 where ''k'' and ''n'' are positive integers, k is odd and 2^n>k. A Proth prim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tribonacci Number
In mathematics, the Fibonacci numbers form a sequence defined recursion, recursively by: :F_n = \begin 0 & n = 0 \\ 1 & n = 1 \\ F_ + F_ & n > 1 \end That is, after two starting values, each number is the sum of the two preceding numbers. The Fibonacci sequence has been studied extensively and generalized in many ways, for example, by starting with other numbers than 0 and 1, by adding more than two numbers to generate the next number, or by adding objects other than numbers. Extension to negative integers Using F_ = F_n - F_, one can extend the Fibonacci numbers to negative integers. So we get: :... −8, 5, −3, 2, −1, 1, 0, 1, 1, 2, 3, 5, 8, ... and F_ = (-1)^ F_n. See also NegaFibonacci coding. Extension to all real or complex numbers There are a number of possible generalizations of the Fibonacci numbers which include the real numbers (and sometimes the complex numbers) in their domain. These each involve the golden ratio , and are based on Binet's formula :F_n = \frac. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimal Prime (recreational Mathematics)
In recreational number theory, a minimal prime is a prime number for which there is no shorter subsequence of its digits in a given base that form a prime. In base 10 there are exactly 26 minimal primes: : 2, 3, 5, 7, 11, 19, 41, 61, 89, 409, 449, 499, 881, 991, 6469, 6949, 9001, 9049, 9649, 9949, 60649, 666649, 946669, 60000049, 66000049, 66600049 . For example, 409 is a minimal prime because there is no prime among the shorter subsequences of the digits: 4, 0, 9, 40, 49, 09. The subsequence does not have to consist of consecutive digits, so 109 is not a minimal prime (because 19 is prime). But it does have to be in the same order; so, for example, 991 is still a minimal prime even though a subset of the digits can form the shorter prime 19 by changing the order. Similarly, there are exactly 32 composite numbers which have no shorter composite subsequence: :4, 6, 8, 9, 10, 12, 15, 20, 21, 22, 25, 27, 30, 32, 33, 35, 50, 51, 52, 55, 57, 70, 72, 75, 77, 111, 117, 171, 371, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Emirp
An emirp (''prime'' spelled backwards) is a prime number that results in a different prime when its decimal digits are reversed. This definition excludes the related palindromic primes. The term ''reversible prime'' is used to mean the same as emirp, but may also, ambiguously, include the palindromic primes. The sequence of emirps begins 13, 17, 31, 37, 71, 73, 79, 97, 107, 113, 149, 157, 167, 179, 199, 311, 337, 347, 359, 389, 701, 709, 733, 739, 743, 751, 761, 769, 907, 937, 941, 953, 967, 971, 983, 991, ... . All non-palindromic permutable primes are emirps. , the largest known emirp is 1010006+941992101×104999+1, found by Jens Kruse Andersen in October 2007. The term 'emirpimes' (singular) is used also in places to treat semiprimes in a similar way. That is, an emirpimes is a semiprime that is also a (distinct) semiprime upon reversing its digits. It is an open problem whether there are infinitely many emirps. Other bases The emirps in base 12 are (using rotated ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Centered Square Number
In elementary number theory, a centered square number is a centered figurate number that gives the number of dots in a square with a dot in the center and all other dots surrounding the center dot in successive square layers. That is, each centered square number equals the number of dots within a given city block distance of the center dot on a regular square lattice. While centered square numbers, like figurate numbers in general, have few if any direct practical applications, they are sometimes studied in recreational mathematics for their elegant geometric and arithmetic properties. The figures for the first four centered square numbers are shown below: : Each centered square number is the sum of successive squares. Example: as shown in the following figure of Floyd's triangle, 25 is a centered square number, and is the sum of the square 16 (yellow rhombus formed by shearing a square) and of the next smaller square, 9 (sum of two blue triangles): Relationships with o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sphenic Number
In number theory, a sphenic number (from grc, σφήνα, 'wedge') is a positive integer that is the product of three distinct prime numbers. Because there are infinitely many prime numbers, there are also infinitely many sphenic numbers. Definition A sphenic number is a product ''pqr'' where ''p'', ''q'', and ''r'' are three distinct prime numbers. In other words, the sphenic numbers are the square-free 3-almost primes. Examples The smallest sphenic number is 30 = 2 × 3 × 5, the product of the smallest three primes. The first few sphenic numbers are : 30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, 165, ... the largest known sphenic number is :(282,589,933 − 1) × (277,232,917 − 1) × (274,207,281 − 1). It is the product of the three largest known primes. Divisors All sphenic numbers have exactly eight divisors. If we express the sphenic number as n = p \cdot q \cdot r, where ''p'', ''q'', and ''r'' are distinct primes, then the set of divisors of ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pronic Number
A pronic number is a number that is the product of two consecutive integers, that is, a number of the form n(n+1).. The study of these numbers dates back to Aristotle. They are also called oblong numbers, heteromecic numbers,. or rectangular numbers; however, the term "rectangular number" has also been applied to the composite numbers. The first few pronic numbers are: : 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 … . Letting P_n denote the pronic number n(n+1), we have P_ = P_. Therefore, in discussing pronic numbers, we may assume that n\geq 0 without loss of generality, a convention that is adopted in the following sections. As figurate numbers The pronic numbers were studied as figurate numbers alongside the triangular numbers and square numbers in Aristotle's ''Metaphysics'', and their discovery has been attributed much earlier to the Pythagoreans.. As a kind of figurate number, the pronic numbers are somet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pentagonal Pyramidal Number
A pyramidal number is a figurate number that represents a pyramid with a polygonal base and a given number of triangular sides. A pyramidal number is the number of points in a pyramid where each layer of the pyramid is an -sided polygon of points. The term often refers to square pyramidal numbers, which have a square base with four sides, but it can also refer to pyramids with three or more sides. The numbers of points in the base (and in parallel layers to the base) are given by polygonal numbers of the given number of sides, while the numbers of points in each triangular side is given by a triangular number. It is possible to extend the pyramidal numbers to higher dimensions. Formula The formula for the th -gonal pyramidal number is :P_n^r= \frac, where , . This formula can be factored: :P_n^r=\frac=\left(\frac\right)\left(\frac\right)=T_n \cdot \frac, where is the th triangular number. Sequences The first few triangular pyramidal numbers (equivalently, tetrahedral numbe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nonagonal Number
A nonagonal number (or an enneagonal number) is a figurate number that extends the concept of triangular number, triangular and square numbers to the nonagon (a nine-sided polygon). However, unlike the triangular and square numbers, the patterns involved in the construction of nonagonal numbers are not rotationally symmetrical. Specifically, the ''n''th nonagonal number counts the number of dots in a pattern of ''n'' nested nonagons, all sharing a common corner, where the ''i''th nonagon in the pattern has sides made of ''i'' dots spaced one unit apart from each other. The nonagonal number for ''n'' is given by the formula: :\frac . Nonagonal numbers The first few nonagonal numbers are: :0 (number), 0, 1 (number), 1, 9 (number), 9, 24 (number), 24, 46 (number), 46, 75 (number), 75, 111 (number), 111, 154 (number), 154, 204 (number), 204, 261, 325, 396, 474, 559, 651, 750, 856, 969, 1089 (number), 1089, 1216, 1350, 1491, 1639, 1794, 1956, 2125, 2301, 2484, 2674, 2871, 3075, 3286, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
