|
Star Number
A star number is a centered figurate number, a centered hexagram (six-pointed star), such as the Star of David, or the board Chinese checkers is played on. The ''n''th star number is given by the formula ''Sn'' = 6''n''(''n'' − 1) + 1. The first 43 star numbers are 1, 13, 37, 73, 121, 181, 253, 337, 433, 541, 661, 793, 937, 1093, 1261, 1441, 1633, 1837, 2053, 2281, 2521, 2773, 3037, 3313, 3601, 3901, 4213, 4537, 4873, 5221, 5581, 5953, 6337, 6733, 7141, 7561, 7993, 8437, 8893, 9361, 9841, 10333, 10837 The digital root of a star number is always 1 or 4, and progresses in the sequence 1, 4, 1. The last two digits of a star number in base 10 are always 01, 13, 21, 33, 37, 41, 53, 61, 73, 81, or 93. Unique among the star numbers is 35113, since its prime factors (i.e., 13, 37 and 73) are also consecutive star numbers. Relationships to other kinds of numbers Geometrically, the ''n''th star number is made up of a central point and 12 copies of the (''n''−1)th triangular n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infinity
Infinity is that which is boundless, endless, or larger than any natural number. It is often denoted by the infinity symbol . Since the time of the ancient Greeks, the philosophical nature of infinity was the subject of many discussions among philosophers. In the 17th century, with the introduction of the infinity symbol and the infinitesimal calculus, mathematicians began to work with infinite series and what some mathematicians (including l'Hôpital and Bernoulli) regarded as infinitely small quantities, but infinity continued to be associated with endless processes. As mathematicians struggled with the foundation of calculus, it remained unclear whether infinity could be considered as a number or magnitude and, if so, how this could be done. At the end of the 19th century, Georg Cantor enlarged the mathematical study of infinity by studying infinite sets and infinite numbers, showing that they can be of various sizes. For example, if a line is viewed as the set of all o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alternating Series
In mathematics, an alternating series is an infinite series of the form \sum_^\infty (-1)^n a_n or \sum_^\infty (-1)^ a_n with for all . The signs of the general terms alternate between positive and negative. Like any series, an alternating series converges if and only if the associated sequence of partial sums converges. Examples The geometric series 1/2 − 1/4 %2B 1/8 − 1/16 %2B %E2%8B%AF sums to 1/3. The alternating harmonic series has a finite sum but the harmonic series does not. The Mercator series provides an analytic expression of the natural logarithm: \sum_^\infty \frac x^n \;=\; \ln (1+x). The functions sine and cosine used in trigonometry can be defined as alternating series in calculus even though they are introduced in elementary algebra as the ratio of sides of a right triangle. In fact, \sin x = \sum_^\infty (-1)^n \frac, and \cos x = \sum_^\infty (-1)^n \frac . When the alternating factor is removed from these series one obtains the hyperbolic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit Fraction
A unit fraction is a rational number written as a fraction where the numerator is one and the denominator is a positive integer. A unit fraction is therefore the reciprocal of a positive integer, 1/''n''. Examples are 1/1, 1/2, 1/3, 1/4, 1/5, etc. Arithmetic Elementary arithmetic Multiplying any two unit fractions results in a product that is another unit fraction: \frac1x \times \frac1y = \frac1. However, adding, subtracting, or dividing two unit fractions produces a result that is generally not a unit fraction: \frac1x + \frac1y = \frac \frac1x - \frac1y = \frac \frac1x \div \frac1y = \frac. Modular arithmetic In modular arithmetic, unit fractions can often be converted into equivalent integers using a calculation based on greatest common divisors. In turn, this conversion can be used to simplify division operations in modular arithmetic, by transforming them into equivalent multiplication operations. Specifically, consider the problem of dividing by a value x modulo y. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harmonic Series (mathematics)
In mathematics, the harmonic series is the infinite series formed by summing all positive unit fractions: \sum_^\infty\frac = 1 + \frac + \frac + \frac + \frac + \cdots. The first n terms of the series sum to approximately \ln n + \gamma, where \ln is the natural logarithm and \gamma\approx0.577 is the Euler–Mascheroni constant. Because the logarithm has arbitrarily large values, the harmonic series does not have a finite limit: it is a divergent series. Its divergence was proven in the 14th century by Nicole Oresme using a precursor to the Cauchy condensation test for the convergence of infinite series. It can also be proven to diverge by comparing the sum to an integral, according to the integral test for convergence. Applications of the harmonic series and its partial sums include Euler's proof that there are infinitely many prime numbers, the analysis of the coupon collector's problem on how many random trials are needed to provide a complete range of responses, the co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Octagonal Number
An octagonal number is a figurate number that represents an octagon. The octagonal number for ''n'' is given by the formula 3''n''2 - 2''n'', with ''n'' > 0. The first few octagonal numbers are : 1, 8, 21, 40, 65, 96, 133, 176, 225, 280, 341, 408, 481, 560, 645, 736, 833, 936 Octagonal numbers can be formed by placing triangular numbers on the four sides of a square. To put it algebraically, the ''n''-th octagonal number is x_n=n^2 + 4\sum_^ k = 3n^2-2n. The octagonal number for ''n'' can also be calculated by adding the square of ''n'' to twice the (''n - 1'')th pronic number. Octagonal numbers consistently alternate parity. Octagonal numbers are occasionally referred to as "star numbers," though that term is more commonly used to refer to centered dodecagonal numbers. Applications in combinatorics x_n is the number of partitions of 6n-5 into 1,2 or 3s. For example: there are x_2=8 such partitions for 2*6-5=7: : ,1,1,1,1,1,1 ,1,1,1,1,2 ,1,1,1,3 ,1,1,2,2 ,1,2,3 , ... [...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 always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Number
In mathematics, a square number or perfect square is an integer that is the square (algebra), square of an integer; in other words, it is the multiplication, product of some integer with itself. For example, 9 is a square number, since it equals and can be written as . The usual notation for the square of a number is not the product , but the equivalent exponentiation , usually pronounced as " squared". The name ''square'' number comes from the name of the shape. The unit of area is defined as the area of a unit square (). Hence, a square with side length has area . If a square number is represented by ''n'' points, the points can be arranged in rows as a square each side of which has the same number of points as the square root of ''n''; thus, square numbers are a type of figurate numbers (other examples being Cube (algebra), cube numbers and triangular numbers). Square numbers are non-negative. A non-negative integer is a square number when its square root is again an intege ... [...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] |
Triangular Number
A triangular number or triangle number counts objects arranged in an equilateral triangle. Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The th triangular number is the number of dots in the triangular arrangement with dots on each side, and is equal to the sum of the natural numbers from 1 to . The sequence of triangular numbers, starting with the 0th triangular number, is (This sequence is included in the On-Line Encyclopedia of Integer Sequences .) Formula The triangular numbers are given by the following explicit formulas: T_n= \sum_^n k = 1+2+3+ \dotsb +n = \frac = , where \textstyle is a binomial coefficient. It represents the number of distinct pairs that can be selected from objects, and it is read aloud as " plus one choose two". The first equation can be illustrated using a visual proof. For every triangular number T_n, imagine a "half-square" arrangement of objects corresponding to the triangular numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Digital Root
The digital root (also repeated digital sum) of a natural number in a given radix is the (single digit) value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached. For example, in base 10, the digital root of the number 12345 is 6 because the sum of the digits in the number is 1 + 2 + 3 + 4 + 5 = 15, then the addition process is repeated again for the resulting number 15, so that the sum of 1 + 5 equals 6, which is the digital root of that number. In base 10, this is equivalent to taking the remainder upon division by 9 (except when the digital root is 9, where the remainder upon division by 9 will be 0), which allows it to be used as a divisibility rule. Formal definition Let n be a natural number. For base b > 1, we define the digit sum F_ : \mathbb \rightarrow \mathbb to be the following: :F_(n) = \sum_^ d_i where k = \lfloor \log_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
