1.
Cuisenaire rod
–
In the early 1950s, Caleb Gattegno popularised this set of coloured number rods created by the Belgian primary school teacher Georges Cuisenaire, who called the rods réglettes. They became very good at traditional arithmetic when they were allowed to manipulate the rods, in 1952 he published Les nombres en couleurs, Numbers in Color, which outlined their use. Cuisenaire, a player, taught music as well as arithmetic in the primary school in Thuin. He wondered why children found it easy and enjoyable to pick up a tune and these comparisons with music and its representation led Cuisenaire to experiment in 1931 with a set of ten rods sawn out of wood, with lengths from 1 cm to 10 cm. He painted each length of rod a different colour and began to use these in his teaching of arithmetic, at this sight, all other impressions of the surrounding vanished, to be replaced by a growing excitement. Gattegno named the rods Cuisenaire rods and began trialing and popularizing them, while of course the material has found an important place in myriad teacher-centered lessons, Gattegnos student-centered practice inspired a number of educators. For instance, the French-Canadian educator Madeleine Goutard in her 1963 Mathematics and Children, wrote and he is the one who reveals the child to himself by making him more conscious of, and more creative with his own mind. We find everything out for ourselves, Gattegno formed the Cuisenaire Company in Reading, England in 1954 and, by the end of the 1950s, Cuisenaire rods had been adopted by teachers in 10,000 schools in more than a hundred countries. The rods received wide use in the 1960s and 1970s, in 2000, the United States-based company Educational Teaching Aids acquired the US Cuisenaire Company and formed ETA/Cuisenaire to sell Cuisenaire rods-related material. In 2004, Cuisenaire rods were featured in an exhibition of paintings, though primarily used for mathematics, they have also become popular in language-teaching classrooms, particularly The Silent Way. In her first school, and in schools since then, Maria Montessori used coloured rods in the classroom to teach concepts of mathematics and length. This is possibly the first instance of coloured rods being used in the classroom for this purpose, catherine Stern also devised a set of coloured rods produced by staining wood with aesthetically pleasing colours. In 1961 Seton Pollock produced the Colour Factor system, consisting of rods from lengths 1 to 12 cm, based on the work of Cuisenaire and Gattegno, he had invented a unified system for logically assigning a color to any number. After white, the colors red, blue and yellow are assigned to the first three primes. Higher primes are associated with darkening shades of grey, the colors of non-prime numbers are obtained by mixing the colors associated with their factors – this is the key concept. The aesthetic and numerically comprehensive Color Factor system was marketed for years by Setons family, before being conveyed to Edward Arnold

2.
Number theory
–
Number theory or, in older usage, arithmetic is a branch of pure mathematics devoted primarily to the study of the integers. It is sometimes called The Queen of Mathematics because of its place in the discipline. Number theorists study prime numbers as well as the properties of objects out of integers or defined as generalizations of the integers. Integers can be considered either in themselves or as solutions to equations, questions in number theory are often best understood through the study of analytical objects that encode properties of the integers, primes or other number-theoretic objects in some fashion. One may also study real numbers in relation to rational numbers, the older term for number theory is arithmetic. By the early century, it had been superseded by number theory. The use of the arithmetic for number theory regained some ground in the second half of the 20th century. In particular, arithmetical is preferred as an adjective to number-theoretic. The first historical find of a nature is a fragment of a table. The triples are too many and too large to have been obtained by brute force, the heading over the first column reads, The takiltum of the diagonal which has been subtracted such that the width. The tables layout suggests that it was constructed by means of what amounts, in language, to the identity 2 +1 =2. If some other method was used, the triples were first constructed and then reordered by c / a, presumably for use as a table. It is not known what these applications may have been, or whether there could have any, Babylonian astronomy, for example. It has been suggested instead that the table was a source of examples for school problems. While Babylonian number theory—or what survives of Babylonian mathematics that can be called thus—consists of this single, striking fragment, late Neoplatonic sources state that Pythagoras learned mathematics from the Babylonians. Much earlier sources state that Thales and Pythagoras traveled and studied in Egypt, Euclid IX 21—34 is very probably Pythagorean, it is very simple material, but it is all that is needed to prove that 2 is irrational. Pythagorean mystics gave great importance to the odd and the even, the discovery that 2 is irrational is credited to the early Pythagoreans. This forced a distinction between numbers, on the one hand, and lengths and proportions, on the other hand, the Pythagorean tradition spoke also of so-called polygonal or figurate numbers

3.
Divisor function
–
In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the function, it counts the number of divisors of an integer. It appears in a number of identities, including relationships on the Riemann zeta function. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities, a related function is the divisor summatory function, which, as the name implies, is a sum over the divisor function. The sum of divisors function σx, for a real or complex number x, is defined as the sum of the xth powers of the positive divisors of n. It can be expressed in sigma notation as σ x = ∑ d ∣ n d x, the notations d, ν and τ are also used to denote σ0, or the number-of-divisors function. When x is 1, the function is called the function or sum-of-divisors function. The aliquot sum s of n is the sum of the proper divisors, and equals σ1 − n, the cases x =2 to 5 are listed in A001157 − A001160, x =6 to 24 are listed in A013954 − A013972. For a non-square integer, n, every divisor, d, of n is paired with divisor n/d of n and σ0 is even, for an integer, one divisor is not paired with a distinct divisor. Similarly, the number σ1 is odd if and only if n is a square or twice a square. For a prime p, σ0 =2 σ0 = n +1 σ1 = p +1 because by definition. Also, where pn# denotes the primorial, σ0 =2 n since n prime factors allow a sequence of binary selection from n terms for each proper divisor formed, clearly,1 < σ0 < n and σ > n for all n >2. The divisor function is multiplicative, but not completely multiplicative and it follows that d is, σ0 = ∏ i =1 r. For example, if n is 24, there are two factors, noting that 24 is the product of 23×31, a1 is 3. Thus we can calculate σ0 as so, σ0 = ∏ i =12 = =4 ⋅2 =8, the eight divisors counted by this formula are 1,2,4,8,3,6,12, and 24. Here s denotes the sum of the divisors of n, that is. This function is the one used to perfect numbers which are the n for which s = n. If s > n then n is an abundant number and if s < n then n is a deficient number

4.
1 (number)
–
1, is a number, a numeral, and the name of the glyph representing that number. It represents a single entity, the unit of counting or measurement, for example, a line segment of unit length is a line segment of length 1. It is also the first of the series of natural numbers. The word one can be used as a noun, an adjective and it comes from the English word an, which comes from the Proto-Germanic root *ainaz. The Proto-Germanic root *ainaz comes from the Proto-Indo-European root *oi-no-, compare the Proto-Germanic root *ainaz to Old Frisian an, Gothic ains, Danish een, Dutch een, German eins and Old Norse einn. Compare the Proto-Indo-European root *oi-no- to Greek oinos, Latin unus, Old Persian aivam, Old Church Slavonic -inu and ino-, Lithuanian vienas, Old Irish oin, One, sometimes referred to as unity, is the first non-zero natural number. It is thus the integer before two and after zero, and the first positive odd number, any number multiplied by one is that number, as one is the identity for multiplication. As a result,1 is its own factorial, its own square, its own cube, One is also the result of the empty product, as any number multiplied by one is itself. It is also the natural number that is neither composite nor prime with respect to division. The Gupta wrote it as a line, and the Nagari sometimes added a small circle on the left. The Nepali also rotated it to the right but kept the circle small and this eventually became the top serif in the modern numeral, but the occasional short horizontal line at the bottom probably originates from similarity with the Roman numeral I. Where the 1 is written with an upstroke, the number 7 has a horizontal stroke through the vertical line. While the shape of the 1 character has an ascender in most modern typefaces, in typefaces with text figures, many older typewriters do not have a separate symbol for 1 and use the lowercase letter l instead. It is possible to find cases when the uppercase J is used,1 cannot be used as the base of a positional numeral system, as the only digit that would be permitted in such a system would be 0. Since the base 1 exponential function always equals 1, its inverse does not exist, there are two ways to write the real number 1 as a recurring decimal, as 1.000. and as 0.999. There is only one way to represent the real number 1 as a Dedekind cut, in a multiplicative group or monoid, the identity element is sometimes denoted 1, but e is also traditional. However,1 is especially common for the identity of a ring. When such a ring has characteristic n not equal to 0,1 is the first figurate number of every kind, such as triangular number, pentagonal number and centered hexagonal number, to name just a few

5.
2 (number)
–
2 is a number, numeral, and glyph. It is the number following 1 and preceding 3. The number two has many properties in mathematics, an integer is called even if it is divisible by 2. For integers written in a system based on an even number, such as decimal and hexadecimal. If it is even, then the number is even. In particular, when written in the system, all multiples of 2 will end in 0,2,4,6. In numeral systems based on an odd number, divisibility by 2 can be tested by having a root that is even. Two is the smallest and first prime number, and the only prime number. Two and three are the two consecutive prime numbers. 2 is the first Sophie Germain prime, the first factorial prime, the first Lucas prime, the first Ramanujan prime, and it is an Eisenstein prime with no imaginary part and real part of the form 3n −1. It is also a Stern prime, a Pell number, the first Fibonacci prime, and it is the third Fibonacci number, and the second and fourth Perrin numbers. Despite being prime, two is also a highly composite number, because it is a natural number which has more divisors than any other number scaled relative to the number itself. The next superior highly composite number is six, vulgar fractions with only 2 or 5 in the denominator do not yield infinite decimal expansions, as is the case with all other primes, because 2 and 5 are factors of ten, the decimal base. Two is the number x such that the sum of the reciprocals of the powers of x equals itself. In symbols ∑ k =0 ∞12 k =1 +12 +14 +18 +116 + ⋯ =2. This comes from the fact that, ∑ k =0 ∞1 n k =1 +1 n −1 for all n ∈ R >1, powers of two are central to the concept of Mersenne primes, and important to computer science. Two is the first Mersenne prime exponent, the square root of 2 was the first known irrational number. The smallest field has two elements, in the set-theoretical construction of the natural numbers,2 is identified with the set

6.
3 (number)
–
3 is a number, numeral, and glyph. It is the number following 2 and preceding 4. Three is the largest number still written with as many lines as the number represents, to this day 3 is written as three lines in Roman and Chinese numerals. This was the way the Brahmin Indians wrote it, and the Gupta made the three lines more curved, the Nagari started rotating the lines clockwise and ending each line with a slight downward stroke on the right. Eventually they made these strokes connect with the lines below, and it was the Western Ghubar Arabs who finally eliminated the extra stroke and created our modern 3. ٣ While the shape of the 3 character has an ascender in most modern typefaces, in typefaces with text figures the character usually has a descender, as, for example, in some French text-figure typefaces, though, it has an ascender instead of a descender. A common variant of the digit 3 has a flat top and this form is sometimes used to prevent people from fraudulently changing a 3 into an 8. It is usually found on UPC-A barcodes and standard 52-card decks,3 is, a rough approximation of π and a very rough approximation of e when doing quick estimates. The first odd prime number, and the second smallest prime, the only number that is both a Fermat prime and a Mersenne prime. The first unique prime due to the properties of its reciprocal, the second triangular number and it is the only prime triangular number. Both the zeroth and third Perrin numbers in the Perrin sequence, the smallest number of sides that a simple polygon can have. The only prime which is one less than a perfect square, any other number which is n2 −1 for some integer n is not prime, since it is. This is true for 3 as well, but in case the smaller factor is 1. If n is greater than 2, both n −1 and n +1 are greater than 1 so their product is not prime, the number of non-collinear points needed to determine a plane and a circle. Also, Vulgar fractions with 3 in the denominator have a single digit repeating sequences in their decimal expansions,0.000, a natural number is divisible by three if the sum of its digits in base 10 is divisible by 3. For example, the number 21 is divisible by three and the sum of its digits is 2 +1 =3, because of this, the reverse of any number that is divisible by three is also divisible by three. For instance,1368 and its reverse 8631 are both divisible by three and this works in base 10 and in any positional numeral system whose base divided by three leaves a remainder of one. Three of the five regular polyhedra have triangular faces – the tetrahedron, the octahedron, also, three of the five regular polyhedra have vertices where three faces meet – the tetrahedron, the hexahedron, and the dodecahedron

7.
4 (number)
–
4 is a number, numeral, and glyph. It is the number following 3 and preceding 5. Four is the only cardinal numeral in the English language that has the number of letters as its number value. Four is the smallest composite number, its divisors being 1 and 2. Four is also a composite number. The next highly composite number is 6, Four is the second square number, the second centered triangular number. 4 is the smallest squared prime and the even number in this form. It has a sum of 3 which is itself prime. The aliquot sequence of 4 has 4 members and is accordingly the first member of the 3-aliquot tree, a number is a multiple of 4 if its last two digits are a multiple of 4. For example,1092 is a multiple of 4 because 92 =4 ×23, only one number has an aliquot sum of 4 and that is squared prime 9. Four is the smallest composite number that is equal to the sum of its prime factors, however, it is the only composite number n for which. It is also a Motzkin number, in bases 6 and 12,4 is a 1-automorphic number. In addition,2 +2 =2 ×2 =22 =4, continuing the pattern in Knuths up-arrow notation,2 ↑↑2 =2 ↑↑↑2 =4, and so on, for any number of up arrows. A four-sided plane figure is a quadrilateral which include kites, rhombi, a circle divided by 4 makes right angles and four quadrants. Because of it, four is the number of plane. Four cardinal directions, four seasons, duodecimal system, and vigesimal system are based on four, a solid figure with four faces as well as four vertices is a tetrahedron, and 4 is the smallest possible number of faces of a polyhedron. The regular tetrahedron is the simplest Platonic solid, a tetrahedron, which can also be called a 3-simplex, has four triangular faces and four vertices. It is the only regular polyhedron

8.
5 (number)
–
5 is a number, numeral, and glyph. It is the number following 4 and preceding 6. Five is the prime number. Because it can be written as 221 +1, five is classified as a Fermat prime, therefore a regular polygon with 5 sides is constructible with compass and unmarked straightedge. 5 is the third Sophie Germain prime, the first safe prime, the third Catalan number, Five is the first Wilson prime and the third factorial prime, also an alternating factorial. Five is the first good prime and it is an Eisenstein prime with no imaginary part and real part of the form 3n −1. It is also the number that is part of more than one pair of twin primes. Five is conjectured to be the only odd number and if this is the case then five will be the only odd prime number that is not the base of an aliquot tree. Five is also the only prime that is the sum of two primes, namely 2 and 3. The number 5 is the fifth Fibonacci number, being 2 plus 3,5 is also a Pell number and a Markov number, appearing in solutions to the Markov Diophantine equation. Whereas 5 is unique in the Fibonacci sequence, in the Perrin sequence 5 is both the fifth and sixth Perrin numbers,5 is the length of the hypotenuse of the smallest integer-sided right triangle. In bases 10 and 20,5 is a 1-automorphic number,5 and 6 form a Ruth–Aaron pair under either definition. There are five solutions to Známs problem of length 6 and this is related to the fact that the symmetric group Sn is a solvable group for n ≤4 and not solvable for n ≥5. While all graphs with 4 or fewer vertices are planar, there exists a graph with 5 vertices which is not planar, K5, Five is also the number of Platonic solids. A polygon with five sides is a pentagon, figurate numbers representing pentagons are called pentagonal numbers. Five is also a square pyramidal number, Five is the only prime number to end in the digit 5, because all other numbers written with a 5 in the ones-place under the decimal system are multiples of five. As a consequence of this,5 is in base 10 a 1-automorphic number, vulgar fractions with 5 or 2 in the denominator do not yield infinite decimal expansions, unlike expansions with all other prime denominators, because they are prime factors of ten, the base. When written in the system, all multiples of 5 will end in either 5 or 0

9.
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

10.
8 (number)
–
8 is the natural number following 7 and preceding 9. 8 is, a number, its proper divisors being 1,2. It is twice 4 or four times 2, a power of two, being 23, and is the first number of the form p3, p being an integer greater than 1. The first number which is neither prime nor semiprime, the base of the octal number system, which is mostly used with computers. In octal, one digit represents 3 bits, in modern computers, a byte is a grouping of eight bits, also called an octet. A Fibonacci number, being 3 plus 5, the next Fibonacci number is 13. 8 is the only positive Fibonacci number, aside from 1, the order of the smallest non-abelian group all of whose subgroups are normal. The dimension of the octonions and is the highest possible dimension of a division algebra. The first number to be the sum of two numbers other than itself, the discrete biprime 10, and the square number 49. It has a sum of 7 in the 4 member aliquot sequence being the first member of 7-aliquot tree. All powers of 2, have a sum of one less than themselves. A number is divisible by 8 if its last 3 digits,8 and 9 form a Ruth–Aaron pair under the second definition in which repeated prime factors are counted as often as they occur. There are a total of eight convex deltahedra, a polygon with eight sides is an octagon. Figurate numbers representing octagons are called octagonal numbers, a polyhedron with eight faces is an octahedron. A cuboctahedron has as faces six equal squares and eight regular triangles. Sphenic numbers always have exactly eight divisors, the number 8 is involved with a number of interesting mathematical phenomena related to the notion of Bott periodicity. For example, if O is the limit of the inclusions of real orthogonal groups O ↪ O ↪ … ↪ O ↪ …. Clifford algebras also display a periodicity of 8, for example, the algebra Cl is isomorphic to the algebra of 16 by 16 matrices with entries in Cl

11.
9 (number)
–
9 is the natural number following 8 and preceding 10. In the NATO phonetic alphabet, the digit 9 is called Niner, five-digit produce PLU codes that begin with 9 are organic. Common terminal digit in psychological pricing, Nine is a number that appears often in Indian Culture and mythology. Nine influencers are attested in Indian astrology, in the Vaisheshika branch of Hindu philosophy, there are nine universal substances or elements, Earth, Water, Air, Fire, Ether, Time, Space, Soul, and Mind. Navaratri is a festival dedicated to the nine forms of Durga. Navaratna, meaning 9 jewels may also refer to Navaratnas - accomplished courtiers, Navratan - a kind of dish, according to Yoga, the human body has nine doors - two eyes, two ears, the mouth, two nostrils, and the openings for defecation and procreation. In Indian aesthetics, there are nine kinds of Rasa, Nine is considered a good number in Chinese culture because it sounds the same as the word long-lasting. Nine is strongly associated with the Chinese dragon, a symbol of magic, there are nine forms of the dragon, it is described in terms of nine attributes, and it has nine children. It has 117 scales –81 yang and 36 yin, all three numbers are multiples of 9 as well as having the same digital root of 9. The dragon often symbolizes the Emperor, and the number nine can be found in many ornaments in the Forbidden City, the name of the area called Kowloon in Hong Kong literally means, nine dragons. The nine-dotted line delimits certain island claims by China in the South China Sea, the nine-rank system was a civil service nomination system used during certain Chinese dynasties. 9 Points of the Heart / Heart Master Channels in Traditional Chinese Medicine, the nine bows is a term used in Ancient Egypt to represent the traditional enemies of Egypt. The Ennead is a group of nine Egyptian deities, who, in versions of the Osiris myth. The Nine Worthies are nine historical, or semi-legendary figures who, in Norse mythology, the universe is divided into nine worlds which are all connected by the world tree Yggdrasil. The nine Muses in Greek mythology are Calliope, Clio, Erato, Euterpe, Melpomene, Polyhymnia, Terpsichore, Thalia and it takes nine days to fall from heaven to earth, and nine more to fall from earth to Tartarus—a place of torment in the underworld. Leto labored for nine days and nine nights for Apollo, according to the Homeric Hymn to Delian Apollo, according to Georges Ifrah, the origin of the 9 integers can be attributed to ancient Indian civilization, and was adopted by subsequent civilizations in conjunction with the 0. In the beginning, various Indians wrote 9 similar to the modern closing question mark without the bottom dot, the Kshatrapa, Andhra and Gupta started curving the bottom vertical line coming up with a 3-look-alike. The Nagari continued the bottom stroke to make a circle and enclose the 3-look-alike, as time went on, the enclosing circle became bigger and its line continued beyond the circle downwards, as the 3-look-alike became smaller

12.
10 (number)
–
10 is an even natural number following 9 and preceding 11. Ten is the base of the numeral system, by far the most common system of denoting numbers in both spoken and written language. The reason for the choice of ten is assumed to be that humans have ten fingers, a collection of ten items is called a decade. The ordinal adjective is decimal, the adjective is denary. Increasing a quantity by one order of magnitude is most widely understood to mean multiplying the quantity by ten, to reduce something by one tenth is to decimate. A theoretical highest number in topics that require a rating, by contrast having 0 or 1 as the lowest number, Ten is a composite number, its proper divisors being 1,2 and 5. Ten is the smallest noncototient, a number that cannot be expressed as the difference between any integer and the number of coprimes below it. Ten is the discrete semiprime and the second member of the discrete semiprime family. Ten has an aliquot sum σ of 8 and is accordingly the first discrete semiprime to be in deficit, all subsequent discrete semiprimes are in deficit. The aliquot sequence for 10 comprises five members with this number being the second member of the 7-aliquot tree. Ten is the smallest semiprime that is the sum of all the prime numbers from its lower factor through its higher factor Only three other small semiprimes share this attribute. It is the sum of only one number the discrete semiprime 14. Ten is the sum of the first three numbers, of the four first numbers, of the square of the two first odd numbers and also of the first four factorials. Ten is the eighth Perrin number, preceded in the sequence by 5,5,7, a polygon with ten sides is a decagon, and 10 is a decagonal number. Because 10 is the product of a power of 2 with nothing but distinct Fermat primes, Ten is also a triangular number, a centered triangular number, and a tetrahedral number. Ten is the number of n queens problem solutions for n =5, Ten is the smallest number whose status as a possible friendly number is unknown. As is the case for any base in its system, ten is the first two-digit number in decimal, any integer written in the decimal system can be multiplied by ten by adding a zero to the end. The Roman numeral for ten is X, it is thought that the V for five is derived from an open hand, incidentally, the Chinese word numeral for ten, is also a cross, 十

13.
15 (number)
–
15 is the natural number following 14 and preceding 16. In English, it is the smallest natural number with seven letters in its spelled name, in spoken English, the numbers 15 and 50 are often confused because they sound similar. When carefully enunciated, they differ in which syllable is stressed,15 /fɪfˈtiːn/ vs 50 /ˈfɪfti/, however, in dates such as 1500 or when contrasting numbers in the teens, the stress generally shifts to the first syllable,15 /ˈfɪftiːn/. In a 24-hour clock, the hour is in conventional language called three or three oclock. A composite number, its divisors being 1,3 and 5. A repdigit in binary and quaternary, in hexadecimal, as well as all higher bases,15 is represented as F. the 4th discrete semiprime and the first member of the discrete semiprime family. It is thus the first odd discrete semiprime, the number proceeding 15,14 is itself a discrete semiprime and this is the first such pair of discrete semiprimes. The next example is the pair commencing 21, the smallest number that can be factorized using Shors quantum algorithm. With only two exceptions, all prime quadruplets enclose a multiple of 15, with 15 itself being enclosed by the quadruplet, the aliquot sum of 15 is 9, a square prime 15 has an aliquot sequence of 6 members. 15 is the composite number in the 3-aliquot tree. The abundant 12 is also a member of this tree, fifteen is the aliquot sum of the consecutive 4-power 16, and the discrete semiprime 33. 15 and 16 form a Ruth-Aaron pair under the definition in which repeated prime factors are counted as often as they occur. There are 15 solutions to Známs problem of length 7, if a positive definite quadratic form with integer matrix represents all positive integers up to 15, then it represents all positive integers via the 15 and 290 theorems. Group 15 of the table are sometimes known as the pnictogens. 15 Madadgar is designated as a number in Pakistan, for mobile phones, similar to the international GSM emergency number 112, if 112 is used in Pakistan. 112 can be used in an emergency if the phone is locked. The Hanbali Sunni madhab states that the age of fifteen of a solar or lunar calendar is when ones taklif begins and is the stage whereby one has his deeds recorded. In the Hebrew numbering system, the number 15 is not written according to the method, with the letters that represent 10 and 5

14.
17 (number)
–
17 is the natural number following 16 and preceding 18. In spoken English, the numbers 17 and 70 are sometimes confused because they sound similar, when carefully enunciated, they differ in which syllable is stressed,17 /sɛvənˈtiːn/ vs 70 /ˈsɛvənti/. However, in such as 1789 or when contrasting numbers in the teens, such as 16,17,18. The number 17 has wide significance in pure mathematics, as well as in applied sciences, law, music, religion, sports,17 is the sum of the first 4 prime numbers. In a 24-hour clock, the hour is in conventional language called five or five oclock. Seventeen is the 7th prime number, the next prime is nineteen, with which it forms a twin prime. 17 is the sixth Mersenne prime exponent, yielding 131071,17 is an Eisenstein prime with no imaginary part and real part of the form 3n −1. 17 is the third Fermat prime, as it is of the form 22n +1, specifically with n =2, since 17 is a Fermat prime, regular heptadecagons can be constructed with compass and unmarked ruler. This was proven by Carl Friedrich Gauss,17 is the only positive Genocchi number that is prime, the only negative one being −3. It is also the third Stern prime,17 is the average of the first two Perfect numbers. 17 is the term of the Euclid–Mullin sequence. Seventeen is the sum of the semiprime 39, and is the aliquot sum of the semiprime 55. There are exactly 17 two-dimensional space groups and these are sometimes called wallpaper groups, as they represent the seventeen possible symmetry types that can be used for wallpaper. Like 41, the number 17 is a prime that yields primes in the polynomial n2 + n + p, the maximum possible length of such a sequence is 17. Either 16 or 18 unit squares can be formed into rectangles with equal to the area. 17 is the tenth Perrin number, preceded in the sequence by 7,10,12, in base 9, the smallest prime with a composite sum of digits is 17. 17 is the least random number, according to the Hackers Jargon File and it is a repunit prime in hexadecimal. 17 is the possible number of givens for a sudoku puzzle with a unique solution

15.
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

16.
21 (number)
–
21 is the natural number following 20 and preceding 22. In a 24-hour clock, the twenty-first hour is in conventional language called nine or nine oclock,21 is, the fifth discrete semiprime and the second in the family. With 22 it forms the second discrete semiprime pair, a Blum integer, since it is a semiprime with both its prime factors being Gaussian primes. A composite number, its divisors being 1,3 and 7. The sum of the first six numbers, making it a triangular number. The sum of the sum of the divisors of the first 5 positive integers, the smallest non-trivial example of a Fibonacci number whose digits are Fibonacci numbers and whose digit sum is also a Fibonacci number. The smallest natural number that is not close to a power of 2, 2n,21 has an aliquot sum of 11 though it is the second composite number found in the 11-aliquot tree with the abundant square prime 18 being the first such member. Twenty-one is the first number to be the sum of three numbers 18,51,91. 21 appears in the Padovan sequence, preceded by the terms 9,12,16, in several countries 21 is the age of majority. In most US states,21 is the drinking age, however, in Puerto Rico and U. S. Virgin Island, the drinking age is 18. In Hawaii and New York,21 is the age that one person may purchase cigarettes. In some countries it is the voting age, in the United States,21 is the age at which one can purchase multiple tickets to an R-rated film without providing Identifications. It is also the age to one under the age of 17 as their parent or adult guardian for an R-rated movie. In some states,21 is the age, persons may gamble or enter casinos. In 2011, Adele named her second studio album 21, because of her age at the time, the Milwaukee Braves, for Hall of Famer Warren Spahn, the number continues to be honored by the team in its current home of Atlanta. The Pittsburgh Pirates, for Hall of Famer Roberto Clemente, following his death in a crash while attempting to deliver humanitarian aid to victims of an earthquake in Nicaragua. In the NBA, The Atlanta Hawks, for Hall of Famer Dominique Wilkins, the Boston Celtics, for Hall of Famer Bill Sharman. The Detroit Pistons, for Hall of Famer Dave Bing, the Sacramento Kings, for Vlade Divac

17.
25 (number)
–
25 is the natural number following 24 and preceding 26. It is a number, being 52 =5 ×5. It is one of two numbers whose square and higher powers of the number also ends in the same last two digits, e. g.252 =625, the other is 76. It is the smallest square that is also a sum of two squares,25 =32 +42, hence it often appears in illustrations of the Pythagorean theorem. 25 is the sum of the odd natural numbers 1,3,5,7 and 9. 25 is an octagonal number, a centered square number. 25 percent is equal to 1/4,25 has an aliquot sum of 6 and number 6 is the first number to have an aliquot sequence that does not culminate in 0 through a prime. 25 is the sum of three integers,95,119, and 143. Twenty-five is the second member of the 6-aliquot tree. It is the smallest base 10 Friedman number as it can be expressed by its own digits,52 and it is also a Cullen number. 25 is the smallest pseudoprime satisfying the congruence 7n =7 mod n.25 is the smallest aspiring number — a composite non-sociable number whose aliquot sequence does not terminate. Within base 10 one can readily test for divisibility by 25 by seeing if the last two digits of the number match 00,25,50 or 75. 25 and 49 are the perfect squares in the following list,13,25,37,49,511,613,715,817,919,1021,1123,1225,1327,1429. The formula in this list can be described as 10nZ + where n depends on the number of digits in Z, in base 30,25 is a 1-automorphic number, and in base 10 a 2-automorphic number. The percent DNA overlap of a half-sibling, grandparent, grandchild, aunt, uncle, niece, nephew, identical twin cousin, in Ezekiels vision of a new temple, The number twenty-five is of cardinal importance in Ezekiels Temple Vision. In The Book of Revelations New International Version, Surrounding the throne were twenty-four other thrones and they were dressed in white and had crowns of gold on their heads. In Islam, there are 25 prophets mentioned in the Quran, the size of the full roster on a Major League Baseball team for most of the season, except for regular-season games on or after September 1, when teams expand their roster to 40 players. The size of the roster on a Nippon Professional Baseball team for a particular game

18.
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

19.
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

20.
Parity (mathematics)
–
Parity is a mathematical term that describes the property of an integers inclusion in one of two categories, even or odd. An integer is even if it is divisible by two and odd if it is not even. For example,6 is even there is no remainder when dividing it by 2. By contrast,3,5,7,21 leave a remainder of 1 when divided by 2, examples of even numbers include −4,0,8, and 1738. In particular, zero is an even number, some examples of odd numbers are −5,3,9, and 73. Parity does not apply to non-integer numbers and this classification applies only to integers, i. e. non-integers like 1/2,4.201, or infinity are neither even nor odd. The sets of even and odd numbers can be defined as following and that is, if the last digit is 1,3,5,7, or 9, then it is odd, otherwise it is even. The same idea will work using any even base, in particular, a number expressed in the binary numeral system is odd if its last digit is 1 and even if its last digit is 0. In an odd base, the number is according to the sum of its digits – it is even if. The following laws can be verified using the properties of divisibility and they are a special case of rules in modular arithmetic, and are commonly used to check if an equality is likely to be correct by testing the parity of each side. As with ordinary arithmetic, multiplication and addition are commutative and associative in modulo 2 arithmetic, however, subtraction in modulo 2 is identical to addition, so subtraction also possesses these properties, which is not true for normal integer arithmetic. The structure is in fact a field with just two elements, the division of two whole numbers does not necessarily result in a whole number. For example,1 divided by 4 equals 1/4, which is neither even nor odd, since the concepts even, but when the quotient is an integer, it will be even if and only if the dividend has more factors of two than the divisor. The ancient Greeks considered 1, the monad, to be neither odd nor fully even. It is this, that two relatively different things or ideas there stands always a third, in a sort of balance. Thus, there is here between odd and even numbers one number which is neither of the two, similarly, in form, the right angle stands between the acute and obtuse angles, and in language, the semi-vowels or aspirants between the mutes and vowels. A thoughtful teacher and a pupil taught to think for himself can scarcely help noticing this, integer coordinates of points in Euclidean spaces of two or more dimensions also have a parity, usually defined as the parity of the sum of the coordinates. For instance, the cubic lattice and its higher-dimensional generalizations

21.
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 other integer to produce n. In this case one says also that n is a multiple of m, an integer n is divisible by another integer m if m is a divisor of n, this implies dividing n by m leaves no remainder. Under this definition, the statement m ∣0 holds for every m, as before, but with the additional constraint k ≠0. Under this definition, the statement m ∣0 does not hold for m ≠0, in the remainder of this article, which definition is applied is indicated where this is significant. 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 are 1,2,4, −1, −2, and −4,1 and −1 divide every integer. Every integer is a divisor of itself, every integer is a divisor of 0. Integers divisible by 2 are called even, and numbers not divisible by 2 are called odd,1, −1, n and −n are known as the trivial divisors of n. A divisor of n that is not a divisor is known as a non-trivial divisor. A non-zero integer with at least one divisor is known as a composite number, while the units −1 and 1. There are divisibility rules which allow one to recognize certain divisors of a number from the numbers digits, the generalization can be said to be the concept of divisibility in any integral domain. 7 is a divisor of 42 because 7 ×6 =42 and it can also be said that 42 is divisible by 7,42 is a multiple of 7,7 divides 42, or 7 is a factor of 42. The non-trivial divisors of 6 are 2, −2,3, the positive divisors of 42 are 1,2,3,6,7,14,21,42. 5 ∣0, because 5 ×0 =0, if a ∣ b and b ∣ a, then a = b or a = − b. If a ∣ b and a ∣ c, then a ∣ holds, however, if a ∣ b and c ∣ b, then ∣ b does not always hold. If a ∣ b c, and gcd =1, then a ∣ c, if p is a prime number and p ∣ a b then p ∣ a or p ∣ b. A positive divisor of n which is different from n is called a proper divisor or a part of n. A number that does not evenly divide n but leaves a remainder is called an aliquant part of n, an integer n >1 whose only proper divisor is 1 is called a prime number

22.
Perfect number
–
In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. Equivalently, a number is a number that is half the sum of all of its positive divisors i. e. σ1 = 2n. This definition is ancient, appearing as early as Euclids Elements where it is called τέλειος ἀριθμός. Euclid also proved a formation rule whereby q /2 is a perfect number whenever q is a prime of the form 2 p −1 for prime p —what is now called a Mersenne prime. Much later, Euler proved that all even numbers are of this form. This is known as the Euclid–Euler theorem and it is not known whether there are any odd perfect numbers, nor whether infinitely many perfect numbers exist. The first perfect number is 6 and its proper divisors are 1,2, and 3, and 1 +2 +3 =6. Equivalently, the number 6 is equal to half the sum of all its positive divisors, the next perfect number is 28 =1 +2 +4 +7 +14. This is followed by the perfect numbers 496 and 8128, in about 300 BC Euclid showed that if 2p−1 is prime then 2p−1 is perfect. The first four numbers were the only ones known to early Greek mathematics. Philo of Alexandria in his first-century book On the creation mentions perfect numbers, claiming that the world was created in 6 days and the moon orbits in 28 days because 6 and 28 are perfect. Philo is followed by Origen, and by Didymus the Blind, st Augustine defines perfect numbers in City of God in the early 5th century AD, repeating the claim that God created the world in 6 days because 6 is the smallest perfect number. The Egyptian mathematician Ismail ibn Fallūs mentioned the next three numbers and listed a few more which are now known to be incorrect. Euclid proved that 2p−1 is a perfect number whenever 2p −1 is prime. Prime numbers of the form 2p −1 are known as Mersenne primes, after the seventeenth-century monk Marin Mersenne, for 2p −1 to be prime, it is necessary that p itself be prime. However, not all numbers of the form 2p −1 with a prime p are prime, in fact, Mersenne primes are very rare—of the 9,592 prime numbers p less than 100,000, 2p −1 is prime for only 28 of them. Nicomachus conjectured that every number is of the form 2p−1 where 2p −1 is prime. Ibn al-Haytham circa 1000 AD conjectured that every perfect number is of that form

23.
Abundant number
–
In number theory, an abundant number or excessive number is a number for which the sum of its proper divisors is greater than the number itself. The integer 12 is the first abundant number and its proper divisors are 1,2,3,4 and 6 for a total of 16. The amount by which the sum exceeds the number is the abundance, the number 12 has an abundance of 4, for example. A number n for which the sum of divisors σ>2n, or, equivalently, the sum of proper divisors s>n. The first 28 abundant numbers are,12,18,20,24,30,36,40,42,48,54,56,60,66,70,72,78,80,84,88,90,96,100,102,104,108,112,114,120, …. For example, the divisors of 24 are 1,2,3,4,6,8. Because 36 is more than 24, the number 24 is abundant and its abundance is 36 −24 =12. The smallest odd abundant number is 945, the smallest abundant number not divisible by 2 or by 3 is 5391411025 whose distinct prime factors are 5,7,11,13,17,19,23, and 29. An algorithm given by Iannucci in 2005 shows how to find the smallest abundant number not divisible by the first k primes. If A represents the smallest abundant number not divisible by the first k primes then for all ϵ >0 we have,2 − ϵ < ln A <2 + ϵ for sufficiently large k, infinitely many even and odd abundant numbers exist. The set of abundant numbers has a natural density, marc Deléglise showed in 1998 that the natural density of the set of abundant numbers and perfect numbers is between 0.2474 and 0.2480. Every multiple of a number is abundant. For example, every multiple of 6 is abundant because the divisors include 1, n/2, n/3, every multiple of an abundant number is abundant. For example, every multiple of 20 is abundant because n/2 + n/4 + n/5 + n/10 + n/20 = n + n/10, every integer greater than 20161 can be written as the sum of two abundant numbers. An abundant number which is not a number is called a weird number. An abundant number with abundance 1 is called a quasiperfect number, numbers whose sum of proper factors equals the number itself are called perfect numbers, while numbers whose sum of proper factors is less than the number itself are called deficient numbers. The abundancy index of n is the ratio σ/n, distinct numbers n1, n2. with the same abundancy index are called friendly numbers. The sequence of least numbers n such that σ > kn, in which a2 =12 corresponds to the first abundant number, if p = is a list of primes, then p is termed abundant if some integer composed only of primes in p is abundant

24.
Natural number
–
In mathematics, the natural numbers are those used for counting and ordering. In common language, words used for counting are cardinal numbers, texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, but in other writings, that term is used instead for the integers. These chains of extensions make the natural numbers canonically embedded in the number systems. Properties of the numbers, such as divisibility and the distribution of prime numbers, are studied in number theory. Problems concerning counting and ordering, such as partitioning and enumerations, are studied in combinatorics, the most primitive method of representing a natural number is to put down a mark for each object. Later, a set of objects could be tested for equality, excess or shortage, by striking out a mark, the first major advance in abstraction was the use of numerals to represent numbers. This allowed systems to be developed for recording large numbers, the ancient Egyptians developed a powerful system of numerals with distinct hieroglyphs for 1,10, and all the powers of 10 up to over 1 million. A stone carving from Karnak, dating from around 1500 BC and now at the Louvre in Paris, depicts 276 as 2 hundreds,7 tens, and 6 ones, and similarly for the number 4,622. A much later advance was the development of the idea that 0 can be considered as a number, with its own numeral. The use of a 0 digit in place-value notation dates back as early as 700 BC by the Babylonians, the Olmec and Maya civilizations used 0 as a separate number as early as the 1st century BC, but this usage did not spread beyond Mesoamerica. The use of a numeral 0 in modern times originated with the Indian mathematician Brahmagupta in 628, the first systematic study of numbers as abstractions is usually credited to the Greek philosophers Pythagoras and Archimedes. Some Greek mathematicians treated the number 1 differently than larger numbers, independent studies also occurred at around the same time in India, China, and Mesoamerica. In 19th century Europe, there was mathematical and philosophical discussion about the nature of the natural numbers. A school of Naturalism stated that the numbers were a direct consequence of the human psyche. Henri Poincaré was one of its advocates, as was Leopold Kronecker who summarized God made the integers, in opposition to the Naturalists, the constructivists saw a need to improve the logical rigor in the foundations of mathematics. In the 1860s, Hermann Grassmann suggested a recursive definition for natural numbers thus stating they were not really natural, later, two classes of such formal definitions were constructed, later, they were shown to be equivalent in most practical applications. The second class of definitions was introduced by Giuseppe Peano and is now called Peano arithmetic and it is based on an axiomatization of the properties of ordinal numbers, each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent with several systems of set theory

25.
Almost perfect number
–
The only known almost perfect numbers are powers of 2 with non-negative exponents. It is known that an odd almost perfect number greater than 1 would have at least 6 prime factors, if m is an odd almost perfect number then m is a Descartes number. Moreover if a and b are positive odd integers such that b +3 < a < m /2 and such that 4m − a, almost Perfect, Quasi-Perfect, Pseudoperfect, Harmonic, Weird, Multiperfect and Hyperperfect Numbers. Sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, singh, S. Fermats Enigma, The Epic Quest to Solve the Worlds Greatest Mathematical Problem

26.
Amicable numbers
–
Amicable numbers are two different numbers so related that the sum of the proper divisors of each is equal to the other number. A pair of amicable numbers constitutes a sequence of period 2. A related concept is that of a number, which is a number that equals the sum of its own proper divisors. Numbers that are members of a sequence with period greater than 2 are known as sociable numbers. The smallest pair of numbers is. The first ten amicable pairs are, and, Amicable numbers were known to the Pythagoreans, who credited them with many mystical properties. A general formula by some of these numbers could be derived was invented circa 850 by the Iraqi mathematician Thābit ibn Qurra. Other Arab mathematicians who studied amicable numbers are al-Majriti, al-Baghdadi, the Iranian mathematician Muhammad Baqir Yazdi discovered the pair, though this has often been attributed to Descartes. Much of the work of Eastern mathematicians in this area has been forgotten, Thābit ibn Qurras formula was rediscovered by Fermat and Descartes, to whom it is sometimes ascribed, and extended by Euler. It was extended further by Borho in 1972, Fermat and Descartes also rediscovered pairs of amicable numbers known to Arab mathematicians. Euler also discovered dozens of new pairs, the second smallest pair, was discovered in 1866 by a then teenage B. Paganini, having been overlooked by earlier mathematicians, by 1946 there were 390 known pairs, but the advent of computers has allowed the discovery of many thousands since then. Exhaustive searches have been carried out to find all pairs less than a bound, this bound being extended from 108 in 1970, to 1010 in 1986,1011 in 1993,1017 in 2015. As of April 2016, there are over 1,000,000,000 known amicable pairs, while these rules do generate some pairs of amicable numbers, many other pairs are known, so these rules are by no means comprehensive. The Thābit ibn Qurra theorem is a method for discovering amicable numbers invented in the century by the Arab mathematician Thābit ibn Qurra. This formula gives the pairs for n =2, for n =4, and for n =7, Numbers of the form 3×2n −1 are known as Thabit numbers. In order for Ibn Qurras formula to produce an amicable pair, to establish the theorem, Thâbit ibn Qurra proved nine lemmas divided into two groups. The first three deal with the determination of the aliquot parts of a natural integer

27.
Sociable number
–
Sociable numbers are numbers whose aliquot sums form a cyclic sequence that begins and ends with the same number. They are generalizations of the concepts of amicable numbers and perfect numbers, the first two sociable sequences, or sociable chains, were discovered and named by the Belgian mathematician Paul Poulet in 1918. In a set of numbers, each number is the sum of the proper factors of the preceding number. For the sequence to be sociable, the sequence must be cyclic, the period of the sequence, or order of the set of sociable numbers, is the number of numbers in this cycle. If the period of the sequence is 1, the number is a number of order 1, or a perfect number—for example, the proper divisors of 6 are 1,2. A pair of numbers is a set of sociable numbers of order 2. There are no known sociable numbers of order 3, cycles in G n, s represent sociable numbers within the interval. Two special cases are loops that represent perfect numbers and cycles of two that represent amicable pairs. P. Poulet, #4865, LIntermédiaire des Mathématiciens 25, pp. 100–101, H. Cohen, On amicable and sociable numbers, Math. 24, pp. 423–429 A list of known sociable numbers Extensive tables of perfect, amicable and sociable numbers Weisstein, Eric W. Sociable numbers

28.
Springer Science+Business Media
–
Springer also hosts a number of scientific databases, including SpringerLink, Springer Protocols, and SpringerImages. Book publications include major works, textbooks, monographs and book series. Springer has major offices in Berlin, Heidelberg, Dordrecht, on 15 January 2015, Holtzbrinck Publishing Group / Nature Publishing Group and Springer Science+Business Media announced a merger. In 1964, Springer expanded its business internationally, opening an office in New York City, offices in Tokyo, Paris, Milan, Hong Kong, and Delhi soon followed. The academic publishing company BertelsmannSpringer was formed after Bertelsmann bought a majority stake in Springer-Verlag in 1999, the British investment groups Cinven and Candover bought BertelsmannSpringer from Bertelsmann in 2003. They merged the company in 2004 with the Dutch publisher Kluwer Academic Publishers which they bought from Wolters Kluwer in 2002, Springer acquired the open-access publisher BioMed Central in October 2008 for an undisclosed amount. In 2009, Cinven and Candover sold Springer to two private equity firms, EQT Partners and Government of Singapore Investment Corporation, the closing of the sale was confirmed in February 2010 after the competition authorities in the USA and in Europe approved the transfer. In 2011, Springer acquired Pharma Marketing and Publishing Services from Wolters Kluwer, in 2013, the London-based private equity firm BC Partners acquired a majority stake in Springer from EQT and GIC for $4.4 billion. In 2014, it was revealed that Springer had published 16 fake papers in its journals that had been computer-generated using SCIgen, Springer subsequently removed all the papers from these journals. IEEE had also done the thing by removing more than 100 fake papers from its conference proceedings. In 2015, Springer retracted 64 of the papers it had published after it was found that they had gone through a fraudulent peer review process, Springer provides its electronic book and journal content on its SpringerLink site, which launched in 1996. SpringerProtocols is home to a collection of protocols, recipes which provide step-by-step instructions for conducting experiments in research labs, SpringerImages was launched in 2008 and offers a collection of currently 1.8 million images spanning science, technology, and medicine. SpringerMaterials was launched in 2009 and is a platform for accessing the Landolt-Börnstein database of research and information on materials, authorMapper is a free online tool for visualizing scientific research that enables document discovery based on author locations and geographic maps. The tool helps users explore patterns in scientific research, identify trends, discover collaborative relationships. While open-access publishing typically requires the author to pay a fee for copyright retention, for example, a national institution in Poland allows authors to publish in open-access journals without incurring any personal cost - but using public funds. Springer is a member of the Open Access Scholarly Publishers Association, the Academic Publishing Industry, A Story of Merger and Acquisition – via Northern Illinois University

29.
International Standard Book Number
–
The International Standard Book Number is a unique numeric commercial book identifier. An ISBN is assigned to each edition and variation of a book, for example, an e-book, a paperback and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, the method of assigning an ISBN is nation-based and varies from country to country, often depending on how large the publishing industry is within a country. The initial ISBN configuration of recognition was generated in 1967 based upon the 9-digit Standard Book Numbering created in 1966, the 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108. Occasionally, a book may appear without a printed ISBN if it is printed privately or the author does not follow the usual ISBN procedure, however, this can be rectified later. Another identifier, the International Standard Serial Number, identifies periodical publications such as magazines, the ISBN configuration of recognition was generated in 1967 in the United Kingdom by David Whitaker and in 1968 in the US by Emery Koltay. The 10-digit ISBN format was developed by the International Organization for Standardization and was published in 1970 as international standard ISO2108, the United Kingdom continued to use the 9-digit SBN code until 1974. The ISO on-line facility only refers back to 1978, an SBN may be converted to an ISBN by prefixing the digit 0. For example, the edition of Mr. J. G. Reeder Returns, published by Hodder in 1965, has SBN340013818 -340 indicating the publisher,01381 their serial number. This can be converted to ISBN 0-340-01381-8, the check digit does not need to be re-calculated, since 1 January 2007, ISBNs have contained 13 digits, a format that is compatible with Bookland European Article Number EAN-13s. An ISBN is assigned to each edition and variation of a book, for example, an ebook, a paperback, and a hardcover edition of the same book would each have a different ISBN. The ISBN is 13 digits long if assigned on or after 1 January 2007, a 13-digit ISBN can be separated into its parts, and when this is done it is customary to separate the parts with hyphens or spaces. Separating the parts of a 10-digit ISBN is also done with either hyphens or spaces, figuring out how to correctly separate a given ISBN number is complicated, because most of the parts do not use a fixed number of digits. ISBN issuance is country-specific, in that ISBNs are issued by the ISBN registration agency that is responsible for country or territory regardless of the publication language. Some ISBN registration agencies are based in national libraries or within ministries of culture, in other cases, the ISBN registration service is provided by organisations such as bibliographic data providers that are not government funded. In Canada, ISBNs are issued at no cost with the purpose of encouraging Canadian culture. In the United Kingdom, United States, and some countries, where the service is provided by non-government-funded organisations. Australia, ISBNs are issued by the library services agency Thorpe-Bowker

30.
PlanetMath
–
PlanetMath is a free, collaborative, online mathematics encyclopedia. The emphasis is on rigour, openness, pedagogy, real-time content, interlinked content, intended to be comprehensive, the project is currently hosted by the University of Waterloo. The site is owned by a US-based nonprofit corporation, PlanetMath. org, the main PlanetMath focus is on encyclopedic entries, and some forum discussions. In addition, the project hosts data about books, expositions, a system for semi-private messaging among users is also in place. Developing software recommendations for improved content authoring and editorial functions, PlanetMath content is licensed under the copyleft Creative Commons Attribution/Share-Alike License. All content is written in LaTeX, a typesetting system popular among mathematicians because of its support of the needs of mathematical typesetting. The software running PlanetMath is written in Perl and runs on Linux and it is known as Noösphere and has been released under the free BSD License. As of March 13,2013 PlanethMath has retired Noösphere and runs now on a software called Planetary, encyclopedic content and bibliographic materials related to physics, mathematics and mathematical physics are developed by PlanetPhysics. The site, launched in 2005, uses similar software, but a significantly different moderation model with emphasis on current research in physics and peer review

31.
Integer factorization
–
In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers. If these integers are further restricted to numbers, the process is called prime factorization. When the numbers are large, no efficient, non-quantum integer factorization algorithm is known. However, it has not been proven that no efficient algorithm exists, the presumed difficulty of this problem is at the heart of widely used algorithms in cryptography such as RSA. Many areas of mathematics and computer science have been brought to bear on the problem, including elliptic curves, algebraic number theory, not all numbers of a given length are equally hard to factor. The hardest instances of these problems are semiprimes, the product of two prime numbers, many cryptographic protocols are based on the difficulty of factoring large composite integers or a related problem—for example, the RSA problem. An algorithm that efficiently factors an arbitrary integer would render RSA-based public-key cryptography insecure, by the fundamental theorem of arithmetic, every positive integer has a unique prime factorization. If the integer is then it can be recognized as such in polynomial time. If composite however, the theorem gives no insight into how to obtain the factors, given a general algorithm for integer factorization, any integer can be factored down to its constituent prime factors simply by repeated application of this algorithm. The situation is complicated with special-purpose factorization algorithms, whose benefits may not be realized as well or even at all with the factors produced during decomposition. For example, if N =10 × p × q where p < q are very large primes, trial division will quickly produce the factors 2 and 5 but will take p divisions to find the next factor. Among the b-bit numbers, the most difficult to factor in practice using existing algorithms are those that are products of two primes of similar size, for this reason, these are the integers used in cryptographic applications. The largest such semiprime yet factored was RSA-768, a 768-bit number with 232 decimal digits and this factorization was a collaboration of several research institutions, spanning two years and taking the equivalent of almost 2000 years of computing on a single-core 2.2 GHz AMD Opteron. Like all recent factorization records, this factorization was completed with an optimized implementation of the general number field sieve run on hundreds of machines. No algorithm has been published that can factor all integers in polynomial time, neither the existence nor non-existence of such algorithms has been proved, but it is generally suspected that they do not exist and hence that the problem is not in class P. The problem is clearly in class NP but has not been proved to be in, or not in and it is generally suspected not to be in NP-complete. There are published algorithms that are faster than O for all positive ε, i. e. sub-exponential, the best published asymptotic running time is for the general number field sieve algorithm, which, for a b-bit number n, is, O. For current computers, GNFS is the best published algorithm for large n, for a quantum computer, however, Peter Shor discovered an algorithm in 1994 that solves it in polynomial time

32.
Unitary divisor
–
In mathematics, a natural number a is a unitary divisor of a number b if a is a divisor of b and if a and b a are coprime, having no common factor other than 1. 1 is a divisor of every natural number. Equivalently, a given divisor a of b is a unitary divisor if, the sum of unitary divisors function is denoted by the lowercase Greek letter sigma thus, σ*. The sum of the powers of the unitary divisors is denoted by σ*k. If the proper divisors of a given number add up to that number. The number of divisors of a number n is 2k. The sum of the divisors of n is odd if n is a power of 2. Both the count and the sum of the divisors of n are multiplicative functions of n that are not completely multiplicative. The Dirichlet generating function is ζ ζ ζ = ∑ n ≥1 σ k ∗ n s, every divisor of n is unitary if and only if n is square-free. The sum of the powers of the odd unitary divisors is σ k ∗ = ∑ d ∣ n d ≡1 gcd =1 d k. It is also multiplicative, with Dirichlet generating function ζ ζ ζ = ∑ n ≥1 σ k ∗ n s, a divisor d of n is a bi-unitary divisor if the greatest common unitary divisor of d and n/d is 1. The number of divisors of n is a multiplicative function of n with average order A log x where A = ∏ p. A bi-unitary perfect number is one equal to the sum of its bi-unitary aliquot divisors, the only such numbers are 6,60 and 90. My Numbers, My Friends, Popular Lectures on Number Theory, a class of residue systems and related arithmetical functions. Arithmetical functions associated with the unitary divisors of an integer, the number of unitary divisors of an integer. Cohen, Graeme L. Arithmetic functions associated with infinitary divisors of an integer, the theory of the Riemann zeta-function with applications. Sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, eds

33.
Prime factor
–
In number theory, the prime factors of a positive integer are the prime numbers that divide that integer exactly. The prime factorization of an integer is a list of the integers prime factors, together with their multiplicities. The fundamental theorem of arithmetic says that every integer has a single unique prime factorization. To shorten prime factorizations, factors are expressed in powers. For example,360 =2 ×2 ×2 ×3 ×3 ×5 =23 ×32 ×5, in which the factors 2,3 and 5 have multiplicities of 3,2 and 1, respectively. For a prime factor p of n, the multiplicity of p is the largest exponent a for which pa divides n exactly. For a positive n, the number of prime factors of n. Perfect square numbers can be recognized by the fact all of their prime factors have even multiplicities. For example, the number 144 has the prime factors 144 =2 ×2 ×2 ×2 ×3 ×3 =24 ×32. These can be rearranged to make the more visible,144 =2 ×2 ×2 ×2 ×3 ×3 = × =2 =2. Because every prime factor appears a number of times, the original number can be expressed as the square of some smaller number. In the same way, perfect cube numbers will have prime factors whose multiplicities are multiples of three, and so on, positive integers with no prime factors in common are said to be coprime. Two integers a and b can also be defined as if their greatest common divisor gcd =1. Euclids algorithm can be used to determine whether two integers are coprime without knowing their prime factors, the runs in a time that is polynomial in the number of digits involved. The integer 1 is coprime to every integer, including itself. This is because it has no prime factors, it is the empty product and this implies that gcd =1 for any b ≥1. The function, ω, represents the number of prime factors of n, while the function, Ω. If n = ∏ i =1 ω p i α i, for example,24 =23 ×31, so ω =2 and Ω =3 +1 =4

34.
Fundamental theorem of arithmetic
–
For example,1200 =24 ×31 ×52 =3 ×2 ×2 ×2 ×2 ×5 ×5 =5 ×2 ×3 ×2 ×5 ×2 ×2 = etc. The requirement that the factors be prime is necessary, factorizations containing composite numbers may not be unique. This theorem is one of the reasons why 1 is not considered a prime number, if 1 were prime. Book VII, propositions 30,31 and 32, and Book IX, proposition 14 of Euclids Elements are essentially the statement, proposition 30 is referred to as Euclids lemma. And it is the key in the proof of the theorem of arithmetic. Proposition 31 is proved directly by infinite descent, proposition 32 is derived from proposition 31, and prove that the decomposition is possible. Book IX, proposition 14 is derived from Book VII, proposition 30, indeed, in this proposition the exponents are all equal to one, so nothing is said for the general case. Article 16 of Gauss Disquisitiones Arithmeticae is a modern statement. < pk are primes and the αi are positive integers and this representation is commonly extended to all positive integers, including one, by the convention that the empty product is equal to 1. This representation is called the representation of n, or the standard form of n. For example 999 = 33×37,1000 = 23×53,1001 = 7×11×13 Note that factors p0 =1 may be inserted without changing the value of n, allowing negative exponents provides a canonical form for positive rational numbers. However, as Integer factorization of large integers is much harder than computing their product, gcd or lcm, these formulas have, in practice, many arithmetical functions are defined using the canonical representation. In particular, the values of additive and multiplicative functions are determined by their values on the powers of prime numbers, the proof uses Euclids lemma, if a prime p divides the product of two natural numbers a and b, then p divides a or p divides b. We need to show that every integer greater than 1 is either prime or a product of primes, for the base case, note that 2 is prime. By induction, assume true for all numbers between 1 and n, if n is prime, there is nothing more to prove. Otherwise, there are integers a and b, where n = ab and 1 < a ≤ b < n, by the induction hypothesis, a = p1p2. pj and b = q1q2. qk are products of primes. But then n = ab = p1p2. pjq1q2. qk is a product of primes, assume that s >1 is the product of prime numbers in two different ways, s = p 1 p 2 ⋯ p m = q 1 q 2 ⋯ q n. We must show m = n and that the qj are a rearrangement of the pi, by Euclids lemma, p1 must divide one of the qj, relabeling the qj if necessary, say that p1 divides q1

35.
Arithmetic number
–
In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer. For instance,6 is a number because the average of its divisors is 1 +2 +3 +64 =3. However,2 is not a number because its only divisors are 1 and 2. It is known that the density of such numbers is 1, indeed. A number N is arithmetic if the number of divisors d divides the sum of divisors σ and it is known that the density of integers N obeying the stronger condition that d2 divides σ is 1/2

36.
Composite number
–
A composite number is a positive integer that can be formed by multiplying together two smaller positive integers. Equivalently, it is an integer that has at least one divisor other than 1. Every positive integer is composite, prime, or the unit 1, so the numbers are exactly the numbers that are not prime. For example, the integer 14 is a number because it is the product of the two smaller integers 2 ×7. Likewise, the integers 2 and 3 are not composite numbers because each of them can only be divided by one, every composite number can be written as the product of two or more primes. For example, the composite number 299 can be written as 13 ×23, and the composite number 360 can be written as 23 ×32 ×5, furthermore and this fact is called the fundamental theorem of arithmetic. There are several known primality tests that can determine whether a number is prime or composite, one way to classify composite numbers is by counting the number of prime factors. A composite number with two prime factors is a semiprime or 2-almost prime, a composite number with three distinct prime factors is a sphenic number. In some applications, it is necessary to differentiate between composite numbers with an odd number of prime factors and those with an even number of distinct prime factors. For the latter μ =2 x =1, while for the former μ =2 x +1 = −1, however, for prime numbers, the function also returns −1 and μ =1. For a number n with one or more repeated prime factors, if all the prime factors of a number are repeated it is called a powerful number. If none of its factors are repeated, it is called squarefree. For example,72 =23 ×32, all the factors are repeated. 42 =2 ×3 ×7, none of the factors are repeated. Another way to classify composite numbers is by counting the number of divisors, all composite numbers have at least three divisors. In the case of squares of primes, those divisors are, a number n that has more divisors than any x < n is a highly composite number. Composite numbers have also been called rectangular numbers, but that name can refer to the pronic numbers, numbers that are the product of two consecutive integers. Table of prime factors Integer factorization Canonical representation of a positive integer Sieve of Eratosthenes Fraleigh, a First Course In Abstract Algebra, Reading, Addison-Wesley, ISBN 0-201-01984-1 Herstein, I. N