1.
Cube (algebra)
–
In arithmetic and algebra, the cube of a number n is its third power, the result of the number multiplied by itself twice, n3 = n × n × n. It is also the number multiplied by its square, n3 = n × n2 and this is also the volume formula for a geometric cube with sides of length n, giving rise to the name. The inverse operation of finding a number whose cube is n is called extracting the cube root of n and it determines the side of the cube of a given volume. It is also n raised to the one-third power, both cube and cube root are odd functions,3 = −. The cube of a number or any other mathematical expression is denoted by a superscript 3, a cube number, or a perfect cube, or sometimes just a cube, is a number which is the cube of an integer. The perfect cubes up to 603 are, Geometrically speaking, an integer m is a perfect cube if and only if one can arrange m solid unit cubes into a larger. For example,27 small cubes can be arranged into one larger one with the appearance of a Rubiks Cube, the difference between the cubes of consecutive integers can be expressed as follows, n3 −3 = 3n +1. There is no minimum perfect cube, since the cube of an integer is negative. For example, −4 × −4 × −4 = −64, unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25,75 and 00 can be the last two digits, any pair of digits with the last digit odd can be a perfect cube. With even cubes, there is considerable restriction, for only 00, o2, e4, o6, some cube numbers are also square numbers, for example,64 is a square number and a cube number. This happens if and only if the number is a perfect sixth power, the last digits of each 3rd power are, It is, however, easy to show that most numbers are not perfect cubes because all perfect cubes must have digital root 1,8 or 9. That is their values modulo 9 may be only −1,1 and 0, every positive integer can be written as the sum of nine positive cubes. The equation x3 + y3 = z3 has no solutions in integers. In fact, it has none in Eisenstein integers, both of these statements are also true for the equation x3 + y3 = 3z3. The sum of the first n cubes is the nth triangle number squared,13 +23 + ⋯ + n 3 =2 =2. Proofs Charles Wheatstone gives a simple derivation, by expanding each cube in the sum into a set of consecutive odd numbers. Indeed, he begins by giving the identity n 3 = + + + ⋯ + ⏟ n consecutive odd numbers, kanim provides a purely visual proof, Benjamin & Orrison provide two additional proofs, and Nelsen gives seven geometric proofs

2.
Prime number
–
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a number is called a composite number. For example,5 is prime because 1 and 5 are its only positive integer factors, the property of being prime is called primality. A simple but slow method of verifying the primality of a number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and n, algorithms much more efficient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for numbers of forms, such as Mersenne numbers. As of January 2016, the largest known prime number has 22,338,618 decimal digits, there are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no simple formula that separates prime numbers from composite numbers. However, the distribution of primes, that is to say, many questions regarding prime numbers remain open, such as Goldbachs conjecture, and the twin prime conjecture. Such questions spurred the development of branches of number theory. Prime numbers give rise to various generalizations in other domains, mainly algebra, such as prime elements. A natural number is called a number if it has exactly two positive divisors,1 and the number itself. Natural numbers greater than 1 that are not prime are called composite, among the numbers 1 to 6, the numbers 2,3, and 5 are the prime numbers, while 1,4, and 6 are not prime. 1 is excluded as a number, for reasons explained below. 2 is a number, since the only natural numbers dividing it are 1 and 2. Next,3 is prime, too,1 and 3 do divide 3 without remainder, however,4 is composite, since 2 is another number dividing 4 without remainder,4 =2 ·2. 5 is again prime, none of the numbers 2,3, next,6 is divisible by 2 or 3, since 6 =2 ·3. The image at the right illustrates that 12 is not prime,12 =3 ·4, no even number greater than 2 is prime because by definition, any such number n has at least three distinct divisors, namely 1,2, and n

3.
7 (number)
–
7 is the natural number following 6 and preceding 8. Seven, the prime number, is not only a Mersenne prime. It is also a Newman–Shanks–Williams prime, a Woodall prime, a prime, a lucky prime, a happy number, a safe prime. Seven is the lowest natural number that cannot be represented as the sum of the squares of three integers, Seven is the aliquot sum of one number, the cubic number 8 and is the base of the 7-aliquot tree. N =7 is the first natural number for which the statement does not hold, Two nilpotent endomorphisms from Cn with the same minimal polynomial. 7 is the only number D for which the equation 2n − D = x2 has more than two solutions for n and x natural, in particular, the equation 2n −7 = x2 is known as the Ramanujan–Nagell equation. 7 is the dimension, besides the familiar 3, in which a vector cross product can be defined. 7 is the lowest dimension of an exotic sphere, although there may exist as yet unknown exotic smooth structures on the 4-dimensional sphere. 999,999 divided by 7 is exactly 142,857, for example, 1/7 =0.142857142857. and 2/7 =0.285714285714. In fact, if one sorts the digits in the number 142857 in ascending order,124578, the remainder of dividing any number by 7 will give the position in the sequence 124578 that the decimal part of the resulting number will start. For example,628 ÷7 =89 5/7, here 5 is the remainder, so in this case,628 ÷7 =89.714285. Another example,5238 ÷7 =748 2/7, hence the remainder is 2, in this case,5238 ÷7 =748.285714. A seven-sided shape is a heptagon, the regular n-gons for n ≤6 can be constructed by compass and straightedge alone, but the regular heptagon cannot. Figurate numbers representing heptagons are called heptagonal numbers, Seven is also a centered hexagonal number. Seven is the first integer reciprocal with infinitely repeating sexagesimal representation, There are seven frieze groups, the groups consisting of symmetries of the plane whose group of translations is isomorphic to the group of integers. There are seven types of catastrophes. When rolling two standard six-sided dice, seven has a 6 in 36 probability of being rolled, the greatest of any number, the Millennium Prize Problems are seven problems in mathematics that were stated by the Clay Mathematics Institute in 2000. Currently, six of the problems remain unsolved, in quaternary,7 is the smallest prime with a composite sum of digits

4.
19 (number)
–
19 is the natural number following 18 and preceding 20. In a 24-hour clock, the hour is in conventional language called seven or seven oclock. 19 is the 8th prime number, the sequence continues 23,29,31,37. 19 is the seventh Mersenne prime exponent,19 is the fifth happy number and the third happy prime. 19 is the sum of two odd discrete semiprimes,65 and 77 and is the base of the 19-aliquot tree. 19 is the number of fourth powers needed to sum up to any natural number. It is the value of g.19 is the lowest prime centered triangular number, a centered hexagonal number. The only non-trivial normal magic hexagon contains 19 hexagons,19 is the first number with more than one digit that can be written from base 2 to base 19 using only the digits 0 to 9, the other number is 20. 19 is The TCP/IP port used for chargen, astronomy, Every 19 years, the solar year and the lunar year align in whats known as the metonic cycle. Quran code, There have been claims that patterns of the number 19 are present a number of times in the Quran. The Number of Verse and Sura together in the Quran which announces Jesus son of Maryams birth, in the Bábí and Baháí faiths, a group of 19 is called a Váhid, a Unity. The numerical value of this word in the Abjad numeral system is 19, the Baháí calendar is structured such that a year contains 19 months of 19 days each, as well as a 19-year cycle and a 361-year supercycle. The Báb and his disciples formed a group of 19, There were 19 Apostles of Baháulláh. With a similar name and anti-Vietnam War theme, I Was Only Nineteen by the Australian group Redgum reached number one on the Australian charts in 1983, in 2005 a hip hop version of the song was produced by The Herd. 19 is the name of Adeles 2008 debut album, so named since she was 19 years old at the time, hey Nineteen is a song by American jazz rock band Steely Dan, written by members Walter Becker and Donald Fagen, and released on their 1980 album Gaucho. Nineteen has been used as an alternative to twelve for a division of the octave into equal parts and this idea goes back to Salinas in the sixteenth century, and is interesting in part because it gives a system of meantone tuning, being close to 1/3 comma meantone. Some organs use the 19th harmonic to approximate a minor third and they refer to the ka-tet of 19, Directive Nineteen, many names add up to 19,19 seems to permeate every aspect of Roland and his travelers lives. In addition, the ends up being a powerful key

5.
37 (number)
–
37 is the natural number following 36 and preceding 38. Thirty-seven is the 12th prime number, a prime with 73. It is a hexagonal number and a star number. Every positive integer is the sum of at most 37 fifth powers,37 appears in the Padovan sequence, preceded by the terms 16,21, and 28. Since the greatest prime factor of 372 +1 =1370 is 137, the atomic number of rubidium The normal human body temperature in degrees Celsius Messier object M37, a magnitude 6. The duration of Saros series 37 was 1298.1 years, the Saros number of the lunar eclipse series which began on -1492 April 3 and ended on -194 May 22. The duration of Saros series 37 was 1298.1 years, kepler-37b is the smallest known planet. The New York Yankees, also for Stengel and this honor made him the first manager to have had his number retired by two different teams. In the NFL, The Detroit Lions, for Doak Walker, the San Francisco 49ers, for Jimmy Johnson. Thirty-seven is, The number of plays William Shakespeare is thought to have written, today the +37 prefix is shared by Lithuania, Latvia, Estonia, Moldova, Armenia, Belarus, Andorra, Monaco, San Marino and Vatican City. A television channel reserved for radio astronomy in the United States The number people are most likely to state when asked to give a number between 0 and 100. The inspiration for the album 37 Everywhere by Punchline List of highways numbered 37 Number Thirty-Seven, Pennsylvania, unincorporated community in Cambria County, Pennsylvania I37

6.
On-Line Encyclopedia of Integer Sequences
–
The On-Line Encyclopedia of Integer Sequences, also cited simply as Sloanes, is an online database of integer sequences. It was created and maintained by Neil Sloane while a researcher at AT&T Labs, Sloane continues to be involved in the OEIS in his role as President of the OEIS Foundation. OEIS records information on integer sequences of interest to professional mathematicians and amateurs, and is widely cited. As of 30 December 2016 it contains nearly 280,000 sequences, the database is searchable by keyword and by subsequence. Neil Sloane started collecting integer sequences as a student in 1965 to support his work in combinatorics. The database was at first stored on punched cards and he published selections from the database in book form twice, A Handbook of Integer Sequences, containing 2,372 sequences in lexicographic order and assigned numbers from 1 to 2372. The Encyclopedia of Integer Sequences with Simon Plouffe, containing 5,488 sequences and these books were well received and, especially after the second publication, mathematicians supplied Sloane with a steady flow of new sequences. The collection became unmanageable in book form, and when the database had reached 16,000 entries Sloane decided to go online—first as an e-mail service, as a spin-off from the database work, Sloane founded the Journal of Integer Sequences in 1998. The database continues to grow at a rate of some 10,000 entries a year, Sloane has personally managed his sequences for almost 40 years, but starting in 2002, a board of associate editors and volunteers has helped maintain the database. In 2004, Sloane celebrated the addition of the 100, 000th sequence to the database, A100000, in 2006, the user interface was overhauled and more advanced search capabilities were added. In 2010 an OEIS wiki at OEIS. org was created to simplify the collaboration of the OEIS editors and contributors, besides integer sequences, the OEIS also catalogs sequences of fractions, the digits of transcendental numbers, complex numbers and so on by transforming them into integer sequences. Sequences of rationals are represented by two sequences, the sequence of numerators and the sequence of denominators, important irrational numbers such as π =3.1415926535897. are catalogued under representative integer sequences such as decimal expansions, binary expansions, or continued fraction expansions. The OEIS was limited to plain ASCII text until 2011, yet it still uses a form of conventional mathematical notation. Greek letters are represented by their full names, e. g. mu for μ. Every sequence is identified by the letter A followed by six digits, sometimes referred to without the leading zeros, individual terms of sequences are separated by commas. Digit groups are not separated by commas, periods, or spaces, a represents the nth term of the sequence. Zero is often used to represent non-existent sequence elements, for example, A104157 enumerates the smallest prime of n² consecutive primes to form an n×n magic square of least magic constant, or 0 if no such magic square exists. The value of a is 2, a is 1480028129, but there is no such 2×2 magic square, so a is 0

7.
Centered hexagonal number
–
The nth centered hexagonal number is given by the formula n 3 −3 =3 n +1. Expressing the formula as 1 +6 shows that the centered hexagonal number for n is 1 more than 6 times the th triangular number. The first few centered hexagonal numbers are,1,7,19,37,61,91,127,169,217,271,331,397,469,547,631,721,817,919. In base 10 one can notice that the hexagonal numbers rightmost digits follow the pattern 1–7–9–7–1, the sum of the first n centered hexagonal numbers is n3. That is, centered hexagonal pyramidal numbers and cubes are the same numbers, viewed from the opposite perspective, centered hexagonal numbers are differences of two consecutive cubes, so that the centered hexagonal numbers are the gnomon of the cubes. In particular, prime centered hexagonal numbers are cuban primes, the difference between 2 and the nth centered hexagonal number is a number of the form 3n2 + 3n −1, while the difference between 2 and the nth centered hexagonal number is a pronic number. Hexagonal number Magic hexagon Star number

8.
Cubic function
–
In algebra, a cubic function is a function of the form f = a x 3 + b x 2 + c x + d, where a is nonzero. Setting f =0 produces an equation of the form. The solutions of this equation are called roots of the polynomial f, If all of the coefficients a, b, c, and d of the cubic equation are real numbers then there will be at least one real root. All of the roots of the equation can be found algebraically. The roots can also be found trigonometrically, alternatively, numerical approximations of the roots can be found using root-finding algorithms like Newtons method. The coefficients do not need to be complex numbers, much of what is covered below is valid for coefficients of any field with characteristic 0 or greater than 3. The solutions of the cubic equation do not necessarily belong to the field as the coefficients. For example, some cubic equations with rational coefficients have roots that are complex numbers. Cubic equations were known to the ancient Babylonians, Greeks, Chinese, Indians, Babylonian cuneiform tablets have been found with tables for calculating cubes and cube roots. The Babylonians could have used the tables to solve cubic equations, the problem of doubling the cube involves the simplest and oldest studied cubic equation, and one for which the ancient Egyptians did not believe a solution existed. Methods for solving cubic equations appear in The Nine Chapters on the Mathematical Art, in the 3rd century, the Greek mathematician Diophantus found integer or rational solutions for some bivariate cubic equations. In the 11th century, the Persian poet-mathematician, Omar Khayyám, in an early paper, he discovered that a cubic equation can have more than one solution and stated that it cannot be solved using compass and straightedge constructions. He also found a geometric solution, in the 12th century, the Indian mathematician Bhaskara II attempted the solution of cubic equations without general success. However, he gave one example of an equation, x3 + 12x = 6x2 +35. He used what would later be known as the Ruffini-Horner method to approximate the root of a cubic equation. He also developed the concepts of a function and the maxima and minima of curves in order to solve cubic equations which may not have positive solutions. He understood the importance of the discriminant of the equation to find algebraic solutions to certain types of cubic equations. Leonardo de Pisa, also known as Fibonacci, was able to approximate the positive solution to the cubic equation x3 + 2x2 + 10x =20

9.
University of Tennessee at Martin
–
The University of Tennessee at Martin, located in Martin, Tennessee, in the United States, is one of the five campuses of the University of Tennessee system. Prior to the acquisition of Lambuth University in Jackson by University of Memphis in 2011, UTM operates a large experimental farm and several satellite centers in West Tennessee. Although UT Martin dates from 1927, it is not the first educational institution to use the current site, in 1900, Ada Gardner Brooks donated a site on what was then the outskirts of Martin to the Tennessee Baptist Convention for the purposes of opening a school. The school opened as the Hall-Moody Institute, named for two locally prominent Baptist ministers and it originally offered 13 years of study, from elementary grades to the equivalent of the first years of collegiate work. The institute changed its name to Hall-Moody Normal School in 1917, five years later, Hall-Moody changed its name again to Hall-Moody Junior College. Due to declining enrollment and financial difficulties in the mid-1920s, Hall-Moody Junior College was in danger of closing, in 1927, the Tennessee Baptist Convention made the decision to consolidate Hall-Moody with a similar institution, Union University, in nearby Jackson. University of Tennessee president Harcourt Morgan agreed to accept the proposition on the condition that the Martin community would acquire the property as well as space for expansion, the City of Martin and Weakley County sold bonds to purchase the campus and some surrounding land. On February 10,1927, Senate Bill Number 301 established the University of Tennessee Junior College in Martin, on March 29, it was officially approved by Governor Austin Peay. However, an influx of returning servicemen ushered in rapid growth both in enrollment and educational offerings, in 1951, with the addition of four-year fields of study leading to a bachelors degree, it was redesignated the University of Tennessee Martin Branch. In 1961, it was the first campus in the University of Tennessee system to begin racial desegregation of undergraduates, until 1967, it was treated as an off-site department of the main campus in Knoxville. As such, its presiding officer was known first as an executive officer, in 1967, it was granted equal status with the main campus in Knoxville under its current name, and its presiding officer was granted the title of chancellor. The school grew greatly from the post-World War II era, largely under the influence of the G. I, Bill of Rights, through the 1960s under the leadership of Paul Meek, who led the school from 1934 to 1967. It was noted that the school had almost as many entering freshmen in 1969 as it had students in 1961. C. Porter Claxton Paul Meek Archie R. Dykes Larry T. McGehee Charles E. Smith Margaret N. Perry Philip W. Conn Nick Dunagan Thomas A. Rakes Robert M. Smith Keith S. Carver, Jr. There is an active ROTC program and a school of nursing, the school is among the top providers of candidates to the University of Tennessee Health Science Center in Memphis. There is a graduate school, with most graduate degrees being conferred in education. The university is accredited by the Southern Association of Colleges. During the tenure of Dr. Robert Smith, UT Martin successfuly met the challenge and was removed from probation and he was also granted the honorary title chancellor emeritus

10.
Ed Pegg Jr.
–
Ed Pegg Jr. is an expert on mathematical puzzles and is a self-described recreational mathematician. He wrote an online column called Ed Pegg Jr. s Math Games for the Mathematical Association of America during the years 2003–2007. His puzzles have also used by Will Shortz on the puzzle segment of NPRs Weekend Edition Sunday. In 2000, he left NORAD to join Wolfram Research, where he collaborated on A New Kind of Science, in 2004 he started assisting Eric W. Weisstein at Wolfram MathWorld. He has made contributions to several hundred MathWorld articles and he was one of the chief consultants for Numb3rs. MathPuzzle Ed Pegg Jr. s Math Games Demonstrations by Ed Pegg Jr, the Math Behind Numb3rs CBS puzzle Ed Pegg Jr. s entry in the Numericana Hall of Fame

11.
Mersenne prime
–
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a number that can be written in the form Mn = 2n −1 for some integer n. They are named after Marin Mersenne, a French Minim friar, the first four Mersenne primes are 3,7,31, and 127. If n is a number then so is 2n −1. The definition is therefore unchanged when written Mp = 2p −1 where p is assumed prime, more generally, numbers of the form Mn = 2n −1 without the primality requirement are called Mersenne numbers. The smallest composite pernicious Mersenne number is 211 −1 =2047 =23 ×89, Mersenne primes Mp are also noteworthy due to their connection to perfect numbers. As of January 2016,49 Mersenne primes are known, the largest known prime number 274,207,281 −1 is a Mersenne prime. Since 1997, all newly found Mersenne primes have been discovered by the “Great Internet Mersenne Prime Search”, many fundamental questions about Mersenne primes remain unresolved. It is not even whether the set of Mersenne primes is finite or infinite. The Lenstra–Pomerance–Wagstaff conjecture asserts that there are infinitely many Mersenne primes,23 | M11,47 | M23,167 | M83,263 | M131,359 | M179,383 | M191,479 | M239, and 503 | M251. Since for these primes p, 2p +1 is congruent to 7 mod 8, so 2 is a quadratic residue mod 2p +1, since p is a prime, it must be p or 1. The first four Mersenne primes are M2 =3, M3 =7, M5 =31, a basic theorem about Mersenne numbers states that if Mp is prime, then the exponent p must also be prime. This follows from the identity 2 a b −1 = ⋅ = ⋅ and this rules out primality for Mersenne numbers with composite exponent, such as M4 =24 −1 =15 =3 ×5 = ×. Though the above examples might suggest that Mp is prime for all p, this is not the case. The evidence at hand does suggest that a randomly selected Mersenne number is more likely to be prime than an arbitrary randomly selected odd integer of similar size. Nonetheless, prime Mp appear to grow increasingly sparse as p increases, in fact, of the 2,270,720 prime numbers p up to 37,156,667, Mp is prime for only 45 of them. The lack of any simple test to determine whether a given Mersenne number is prime makes the search for Mersenne primes a difficult task, the Lucas–Lehmer primality test is an efficient primality test that greatly aids this task. The search for the largest known prime has somewhat of a cult following, consequently, a lot of computer power has been expended searching for new Mersenne primes, much of which is now done using distributed computing

12.
Pythagorean prime
–
A Pythagorean prime is a prime number of the form 4n +1. Pythagorean primes are exactly the odd numbers that are the sum of two squares. For instance, the number 5 is a Pythagorean prime, √5 is the hypotenuse of a triangle with legs 1 and 2. The first few Pythagorean primes are 5,13,17,29,37,41,53,61,73,89,97,101,109,113, by Dirichlets theorem on arithmetic progressions, this sequence is infinite. More strongly, for n, the numbers of Pythagorean and non-Pythagorean primes up to n are approximately equal. However, the number of Pythagorean primes up to n is frequently smaller than the number of non-Pythagorean primes. For example, the values of n up to 600000 for which there are more Pythagorean than non-Pythagorean odd primes are 26861 and 26862. Sum of one odd square and one square is congruent to 1 mod 4. Fermats theorem on sums of two states that the prime numbers that can be represented as sums of two squares are exactly 2 and the odd primes congruent to 1 mod 4. The representation of such number is unique, up to the ordering of the two squares. Another way to understand this representation as a sum of two squares involves Gaussian integers, the numbers whose real part and imaginary part are both integers. The norm of a Gaussian integer x + yi is the number x2 + y2, thus, the Pythagorean primes occur as norms of Gaussian integers, while other primes do not. Within the Gaussian integers, the Pythagorean primes are not considered to be prime numbers, similarly, their squares can be factored in a different way than their integer factorization, as p2 =22 =. The real and imaginary parts of the factors in these factorizations are the leg lengths of the right triangles having the given hypotenuses, in the finite field Z/p with p a Pythagorean prime, the polynomial equation x2 = −1 has two solutions. This may be expressed by saying that −1 is a quadratic residue mod p, in contrast, this equation has no solution in the finite fields Z/p where p is an odd prime but is not Pythagorean. Pythagorean Primes, including 5,13 and 137, sloanes A007350, Where prime race 4n-1 vs. 4n+1 changes leader. The On-Line Encyclopedia of Integer Sequences

13.
Pierpont prime
–
A Pierpont prime is a prime number of the form 2 u 3 v +1 for some nonnegative integers u and v. That is, they are the prime numbers p for which p −1 is 3-smooth. They are named after the mathematician James Pierpont, who introduced them in the study of regular polygons that can be constructed using conic sections. It is possible to prove that if v =0 and u >0, then u must be a power of 2, if v is positive then u must also be positive, and the Pierpont prime is of the form 6k +1. Empirically, the Pierpont primes do not seem to be rare or sparsely distributed. There are 36 Pierpont primes less than 106,59 less than 109,151 less than 1020, there are few restrictions from algebraic factorisations on the Pierpont primes, so there are no requirements like the Mersenne prime condition that the exponent must be prime. As there are Θ numbers of the form in this range. Andrew M. Gleason made this explicit, conjecturing there are infinitely many Pierpont primes. According to Gleasons conjecture there are Θ Pierpont primes smaller than N, when 2 u >3 v, the primality of 2 u 3 v +1 can be tested by Proths theorem. As part of the ongoing search for factors of Fermat numbers. The following table gives values of m, k, and n such that k ⋅2 n +1 divides 22 m +1, the left-hand side is a Pierpont prime when k is a power of 3, the right-hand side is a Fermat number. As of 2017, the largest known Pierpont prime is 3 ×210829346 +1, whose primality was discovered by Sai Yik Tang, in the mathematics of paper folding, the Huzita axioms define six of the seven types of fold possible. It has been shown that these folds are sufficient to allow the construction of the points that solve any cubic equation. It follows that they allow any regular polygon of N sides to be formed, as long as N >3 and of the form 2m3nρ and this is the same class of regular polygons as those that can be constructed with a compass, straightedge, and angle-trisector. Regular polygons which can be constructed with compass and straightedge are the special case where n =0 and ρ is a product of distinct Fermat primes, themselves a subset of Pierpont primes. In 1895, James Pierpont studied the same class of regular polygons, Pierpont generalized compass and straightedge constructions in a different way, by adding the ability to draw conic sections whose coefficients come from previously constructed points. As he showed, the regular N-gons that can be constructed with these operations are the ones such that the totient of N is 3-smooth. Since the totient of a prime is formed by subtracting one from it, however, Pierpont did not describe the form of the composite numbers with 3-smooth totients. As Gleason later showed, these numbers are exactly the ones of the form 2m3nρ given above, the smallest prime that is not a Pierpont prime is 11, therefore, the hendecagon is the smallest regular polygon that cannot be constructed with compass, straightedge and angle trisector

14.
Pell number
–
In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins 1/1, 3/2, 7/5, 17/12, and 41/29, so the sequence of Pell numbers begins with 1,2,5,12, and 29. The numerators of the sequence of approximations are half the companion Pell numbers or Pell–Lucas numbers, these numbers form a second infinite sequence that begins with 2,6,14,34. As with Pells equation, the name of the Pell numbers stems from Leonhard Eulers mistaken attribution of the equation, the Pell–Lucas numbers are also named after Édouard Lucas, who studied sequences defined by recurrences of this type, the Pell and companion Pell numbers are Lucas sequences. The Pell numbers are defined by the recurrence relation P n = {0 if n =0,1 if n =1,2 P n −1 + P n −2 otherwise. In words, the sequence of Pell numbers starts with 0 and 1, and then each Pell number is the sum of twice the previous Pell number and the Pell number before that. The first few terms of the sequence are 0,1,2,5,12,29,70,169,408,985,2378,5741,13860, …. The Pell numbers can also be expressed by the closed form formula P n = n − n 22, a third definition is possible, from the matrix formula = n. Pell numbers arise historically and most notably in the rational approximation to √2. If two large integers x and y form a solution to the Pell equation x 2 −2 y 2 = ±1 and that is, the solutions have the form P n −1 + P n P n. The approximation 2 ≈577408 of this type was known to Indian mathematicians in the third or fourth century B. C, the Greek mathematicians of the fifth century B. C. also knew of this sequence of approximations, Plato refers to the numerators as rational diameters. In the 2nd century CE Theon of Smyrna used the term the side and these approximations can be derived from the continued fraction expansion of 2,2 =1 +12 +12 +12 +12 +12 + ⋱. As Knuth describes, the fact that Pell numbers approximate √2 allows them to be used for accurate rational approximations to an octagon with vertex coordinates. All vertices are equally distant from the origin, and form uniform angles around the origin. Alternatively, the points, and form approximate octagons in which the vertices are equally distant from the origin. A Pell prime is a Pell number that is prime, the first few Pell primes are 2,5,29,5741, …. The indices of these primes within the sequence of all Pell numbers are 2,3,5,11,13,29,41,53,59,89,97,101,167,181,191, … These indices are all themselves prime. As with the Fibonacci numbers, a Pell number Pn can only be prime if n itself is prime, the only Pell numbers that are squares, cubes, or any higher power of an integer are 0,1, and 169 =132. However, despite having so few squares or other powers, Pell numbers have a connection to square triangular numbers

15.
Partition (number theory)
–
In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition, a summand in a partition is also called a part. The number of partitions of n is given by the function p. The notation λ ⊢ n means that λ is a partition of n, Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials, the symmetric group and in group representation theory in general. For example, the partition 2 +2 +1 might instead be written as the tuple or in the more compact form where the superscript indicates the number of repetitions of a term. There are two common methods to represent partitions, as Ferrers diagrams, named after Norman Macleod Ferrers. Both have several possible conventions, here, we use English notation, with diagrams aligned in the upper-left corner. The partition 6 +4 +3 +1 of the positive number 14 can be represented by the diagram, The 14 circles are lined up in 4 rows. The diagrams for the 5 partitions of the number 4 are listed below, rather than representing a partition with dots, as in the Ferrers diagram, the Young diagram uses boxes or squares. As a type of shape made by adjacent squares joined together, by convention p =1, p =0 for n negative. The first few values of the function are,1,1,2,3,5,7,11,15,22,30,42,56,77,101,135,176,231,297,385,490,627,792,1002,1255,1575,1958,2436,3010,3718,4565,5604. As of June 2013, the largest known prime number that counts a number of partitions is p, the generating function for p is given by, ∑ n =0 ∞ p x n = ∏ k =1 ∞. Expanding each factor on the side as a geometric series. The xn term in this product counts the number of ways to write n = a1 + 2a2 + 3a3 +, where each number i appears ai times. This is precisely the definition of a partition of n, so our product is the generating function. More generally, the function for the partitions of n into numbers from a set A can be found by taking only those terms in the product where k is an element of A. This result is due to Euler, the formulation of Eulers generating function is a special case of a q-Pochhammer symbol and is similar to the product formulation of many modular forms, and specifically the Dedekind eta function

16.
Bell number
–
In combinatorial mathematics, the Bell numbers count the number of partitions of a set. These numbers have been studied by mathematicians since the 19th century, and their roots go back to medieval Japan, but they are named after Eric Temple Bell, who wrote about them in the 1930s. The nth of these numbers, Bn, counts the number of different ways to partition a set that has n elements, or equivalently. Outside of mathematics, the number also counts the number of different rhyme schemes for n-line poems. As well as appearing in counting problems, these numbers have a different interpretation, in particular, Bn is the nth moment of a Poisson distribution with mean 1. In general, Bn is the number of partitions of a set of size n, a partition of a set S is defined as a set of nonempty, pairwise disjoint subsets of S whose union is S. For example, B3 =5 because the 3-element set can be partitioned in 5 distinct ways, b0 is 1 because there is exactly one partition of the empty set. Every member of the empty set is a nonempty set, therefore, the empty set is the only partition of itself. As suggested by the set notation above, we consider neither the order of the partitions nor the order of elements within each partition and this means that the following partitionings are all considered identical. If, instead, different orderings of the sets are considered to be different partitions, If a number N is a squarefree positive integer, then Bn gives the number of different multiplicative partitions of N. These are factorizations of N into numbers greater than one, treating two factorizations as the same if they have the same factors in a different order. A rhyme scheme describes which lines rhyme with other. Thus, the 15 possible four-line rhyme schemes are AAAA, AAAB, AABA, AABB, AABC, ABAA, ABAB, ABAC, ABBA, ABBB, ABBC, ABCA, ABCB, ABCC, and ABCD. The Bell numbers come up in a card shuffling problem mentioned in the addendum to Gardner, of these, the number that return the deck to its original sorted order is exactly Bn. Thus, the probability that the deck is in its original order after shuffling it in this way is Bn/nn, probability that would describe a uniformly random permutation of the deck. Related to card shuffling are several problems of counting special kinds of permutations that are also answered by the Bell numbers. For instance, the nth Bell number equals number of permutations on n items in which no three values that are in sorted order have the last two of three consecutive. The permutations that avoid the generalized patterns 12-3, 32-1, 3-21, 1-32, 3-12, 21-3, the permutations in which every 321 pattern can be extended to a 3241 pattern are also counted by the Bell numbers

17.
Motzkin number
–
In mathematics, a Motzkin number for a given number n is the number of different ways of drawing non-intersecting chords between n points on a circle. The Motzkin numbers are named after Theodore Motzkin, and have diverse applications in geometry, combinatorics. The following figure shows the 9 ways to draw non-intersecting chords between 4 points on a circle, the following figure shows the 21 ways to draw non-intersecting chords between 5 points on a circle. Motzkin numbers can be expressed in terms of binomial coefficients and Catalan numbers, a Motzkin prime is a Motzkin number that is prime. Guibert, Pergola & Pinzani showed that vexillary involutions are enumerated by Motzkin numbers