1.
Mathematics
–
Mathematics is the study of topics such as quantity, structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope, Mathematicians seek out patterns and use them to formulate new conjectures. Mathematicians resolve the truth or falsity of conjectures by mathematical proof, when mathematical structures are good models of real phenomena, then mathematical reasoning can provide insight or predictions about nature. Through the use of abstraction and logic, mathematics developed from counting, calculation, measurement, practical mathematics has been a human activity from as far back as written records exist. The research required to solve mathematical problems can take years or even centuries of sustained inquiry, rigorous arguments first appeared in Greek mathematics, most notably in Euclids Elements. Galileo Galilei said, The universe cannot be read until we have learned the language and it is written in mathematical language, and the letters are triangles, circles and other geometrical figures, without which means it is humanly impossible to comprehend a single word. Without these, one is wandering about in a dark labyrinth, carl Friedrich Gauss referred to mathematics as the Queen of the Sciences. Benjamin Peirce called mathematics the science that draws necessary conclusions, David Hilbert said of mathematics, We are not speaking here of arbitrariness in any sense. Mathematics is not like a game whose tasks are determined by arbitrarily stipulated rules, rather, it is a conceptual system possessing internal necessity that can only be so and by no means otherwise. Albert Einstein stated that as far as the laws of mathematics refer to reality, they are not certain, Mathematics is essential in many fields, including natural science, engineering, medicine, finance and the social sciences. Applied mathematics has led to entirely new mathematical disciplines, such as statistics, Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, the history of mathematics can be seen as an ever-increasing series of abstractions. The earliest uses of mathematics were in trading, land measurement, painting and weaving patterns, in Babylonian mathematics elementary arithmetic first appears in the archaeological record. Numeracy pre-dated writing and numeral systems have many and diverse. Between 600 and 300 BC the Ancient Greeks began a study of mathematics in its own right with Greek mathematics. Mathematics has since been extended, and there has been a fruitful interaction between mathematics and science, to the benefit of both. Mathematical discoveries continue to be made today, the overwhelming majority of works in this ocean contain new mathematical theorems and their proofs. The word máthēma is derived from μανθάνω, while the modern Greek equivalent is μαθαίνω, in Greece, the word for mathematics came to have the narrower and more technical meaning mathematical study even in Classical times
2.
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
3.
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
4.
Highly composite number
–
A highly composite number is a positive integer with more divisors than any smaller positive integer has. The term was coined by Ramanujan, the related concept of largely composite number refers to a positive integer which has at least as many divisors as any smaller positive integer. The initial or smallest 38 highly composite numbers are listed in the table below, the number of divisors is given in the column labeled d. The table below shows all the divisors of one of these numbers, the 15, 000th highly composite number can be found on Achim Flammenkamps website. Roughly speaking, for a number to be highly composite it has to have prime factors as small as possible, also, except in two special cases n =4 and n =36, the last exponent ck must equal 1. It means that 1,4, and 36 are the only square highly composite numbers, saying that the sequence of exponents is non-increasing is equivalent to saying that a highly composite number is a product of primorials. Note, that although the above described conditions are necessary, they are not sufficient for a number to be highly composite. For example,96 =25 ×3 satisfies the conditions and has 12 divisors but is not highly composite since there is a smaller number 60 which has the same number of divisors. If Q denotes the number of composite numbers less than or equal to x. The first part of the inequality was proved by Paul Erdős in 1944 and we have 1.13862 < lim inf log Q log log x ≤1.44 and lim sup log Q log log x ≤1.71. Highly composite numbers higher than 6 are also abundant numbers, one need only look at the three or four highest divisors of a particular highly composite number to ascertain this fact. It is false that all composite numbers are also Harshad numbers in base 10. The first HCN that is not a Harshad number is 245,044,800, which has a sum of 27. 10 of the first 38 highly composite numbers are highly composite numbers. The sequence of composite numbers is a subset of the sequence of smallest numbers k with exactly n divisors. A positive integer n is a composite number if d ≥ d for all m ≤ n. The counting function QL of largely composite numbers satisfies c ≤ log Q L ≤ d for positive c, d with 0.2 ≤ c ≤ d ≤0.5. Because the prime factorization of a composite number uses all of the first k primes
5.
Primorial
–
The rest of this article uses the latter interpretation. The name primorial, coined by Harvey Dubner, draws an analogy to primes the same way the name relates to factors. For the nth prime number pn, the primorial pn# is defined as the product of the first n primes, p n # ≡ ∏ k =1 n p k, where pk is the kth prime number. For instance, p5# signifies the product of the first 5 primes, the first six primorials pn# are,1,2,6,30,210,2310. The sequence also includes p0# =1 as empty product, asymptotically, primorials pn# grow according to, p n # = e n log n, where o is little-o notation. This is equivalent to, n # = {1 if n =0,1 # × n if n is prime # if n is composite. For example, 12# represents the product of those primes ≤12,12 # =2 ×3 ×5 ×7 ×11 =2310, since π =5, this can be calculated as,12 # = p π # = p 5 # =2310. Consider the first 12 primorials n#,1,2,6,6,30,30,210,210,210,210,2310,2310. We see that for composite n every term n# simply duplicates the preceding term #, in the above example we have 12# = p5# = 11# since 12 is a composite number. The natural logarithm of n# is the first Chebyshev function, written ϑ or θ, primorials n# grow according to, ln ∼ n. The idea of multiplying all known primes occurs in some proofs of the infinitude of the prime numbers, primorials play a role in the search for prime numbers in additive arithmetic progressions. For instance, 7009223613394100000♠2236133941 + 23# results in a prime, beginning a sequence of thirteen primes found by repeatedly adding 23#, 23# is also the common difference in arithmetic progressions of fifteen and sixteen primes. Every highly composite number is a product of primorials, primorials are all square-free integers, and each one has more distinct prime factors than any number smaller than it. For each primorial n, the fraction φ/n is smaller than it for any lesser integer, any completely multiplicative function is defined by its values at primorials, since it is defined by its values at primes, which can be recovered by division of adjacent values. Base systems corresponding to primorials have a proportion of repeating fractions than any smaller base. Every primorial is a sparsely totient number, the n-compositorial of a composite number n is the product of all composite numbers up to and including n. The n-compositorial is equal to the n-factorial divided by the primorial n#, the compositorials are 1,4,24,192,1728, 7004172800000000000♠17280, 7005207360000000000♠207360, 7006290304000000000♠2903040, 7007435456000000000♠43545600, 7008696729600000000♠696729600
6.
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
7.
6 (number)
–
6 is the natural number following 5 and preceding 7. The SI prefix for 10006 is exa-, and for its reciprocal atto-,6 is the smallest positive integer which is neither a square number nor a prime number. Six is the second smallest composite number, its proper divisors are 1,2 and 3, since six equals the sum of its proper divisors, six is the smallest perfect number, Granville number, and S -perfect number. As a perfect number,6 is related to the Mersenne prime 3,6 is the only even perfect number that is not the sum of successive odd cubes. As a perfect number,6 is the root of the 6-aliquot tree, and is itself the sum of only one number. Six is the number that is both the sum and the product of three consecutive positive numbers. Unrelated to 6 being a number, a Golomb ruler of length 6 is a perfect ruler. Six is the first discrete biprime and the first member of the discrete biprime family, Six is the smallest natural number that can be written as the sum of two positive rational cubes which are not integers,6 =3 +3. Six is a perfect number, a harmonic divisor number and a superior highly composite number. The next superior highly composite number is 12,5 and 6 form a Ruth-Aaron pair under either definition. There are no Graeco-Latin squares with order 6, if n is a natural number that is not 2 or 6, then there is a Graeco-Latin square with order n. The smallest non-abelian group is the symmetric group S3 which has 3, s6, with 720 elements, is the only finite symmetric group which has an outer automorphism. This automorphism allows us to construct a number of mathematical objects such as the S Steiner system, the projective plane of order 4. This can also be expressed category theoretically, consider the category whose objects are the n element sets and this category has a non-trivial functor to itself only for n =6. 6 similar coins can be arranged around a central coin of the radius so that each coin makes contact with the central one. This makes 6 the answer to the kissing number problem. The densest sphere packing of the plane is obtained by extending this pattern to the lattice in which each circle touches just six others. 6 is the largest of the four all-Harshad numbers, a six-sided polygon is a hexagon, one of the three regular polygons capable of tiling the plane
8.
12 (number)
–
12 is the natural number following 11 and preceding 13. The product of the first three factorials, twelve is a highly composite number, divisible by 2,3,4. It is central to systems of counting, including the Western calendar and units of time. The word twelve is the largest number with a name in English. Such uses gradually disappeared with the introduction of Arabic numerals during the 12th-century Renaissance and it derives from the Old English twelf and tuelf, first attested in the 10th-century Lindisfarne Gospels Book of John. It has cognates in every Germanic language, whose Proto-Germanic ancestor has been reconstructed as *twaliƀi, from *twa and suffix *-lif- or *-liƀ- of uncertain meaning. It is sometimes compared with the Lithuanian dvýlika, although -lika is used as the suffix for all numbers from 11 to 19, every other Indo-European language instead uses a form of two+ten, such as the Latin duōdecim. The usual ordinal form is twelfth but dozenth or duodecimal is also used in some contexts, similarly, a group of twelve things is usually a dozen but may also be referred to as a duodecad. The adjective referring to a group of twelve is duodecuple, as with eleven, the earliest forms of twelve are often considered to be connected with Proto-Germanic *liƀan or *liƀan, with the implicit meaning that two is left after having already counted to ten. The Lithuanian suffix is also considered to share a similar development, the suffix *-lif- has also been connected with reconstructions of the Proto-Germanic for ten. While, as mentioned above,12 has its own name in Germanic languages such as English and German, it is a number in many other languages, e. g. Italian dodici. In Germany, according to an old tradition, the numbers 0 through 12 were spelt out, the Duden now calls this tradition outdated and no longer valid, but many writers still follow it. Another system spells out all numbers written in one or two words, Twelve is a composite number, the smallest number with exactly six divisors, its divisors being 1,2,3,4,6 and 12. Twelve is also a composite number, the next one being twenty-four. Twelve is also a highly composite number, the next one being sixty. It is the first composite number of the form p2q, a square-prime,12 has an aliquot sum of 16. Accordingly,12 is the first abundant number and demonstrates an 8-member aliquot sequence,12 is the 3rd composite number in the 3-aliquot tree, the only number which has 12 as its aliquot sum is the square 121. Only 2 other square primes are abundant, Twelve is a sublime number, a number that has a perfect number of divisors, and the sum of its divisors is also a perfect number
9.
60 (number)
–
60 is the natural number following 59 and preceding 61. Being three times 20, it is called three score in older literature. It is a number, with divisors 1,2,3,4,5,6,10,12,15,20,30. Because it is the sum of its divisors, it is a unitary perfect number. Being ten times a number, it is a semiperfect number. It is the smallest number divisible by the numbers 1 to 6 and it is the smallest number with exactly 12 divisors. It is the sum of a pair of twin primes and the sum of four consecutive primes and it is adjacent to two primes. It is the smallest number that is the sum of two odd primes in six ways, the smallest non-solvable group has order 60. There are four Archimedean solids with 60 vertices, the icosahedron, the rhombicosidodecahedron, the snub dodecahedron. The skeletons of these polyhedra form 60-node vertex-transitive graphs, there are also two Archimedean solids with 60 edges, the snub cube and the icosidodecahedron. The skeleton of the forms a 60-edge symmetric graph. There are 60 one-sided hexominoes, the polyominoes made from six squares, in geometry, it is the number of seconds in a minute, and the number of minutes in a degree. In normal space, the three angles of an equilateral triangle each measure 60 degrees, adding up to 180 degrees. Because it is divisible by the sum of its digits in base 10, a number system with base 60 is called sexagesimal. It is the smallest positive integer that is written only the smallest. The first fullerene to be discovered was buckminsterfullerene C60, an allotrope of carbon with 60 atoms in each molecule and this ball is known as a buckyball, and looks like a soccer ball. The atomic number of neodymium is 60, and cobalt-60 is an isotope of cobalt. The electrical utility frequency in western Japan, South Korea, Taiwan, the Philippines, Saudi Arabia, the United States, and several other countries in the Americas is 60 Hz
10.
120 (number)
–
120, read as one hundred twenty, is the natural number following 119 and preceding 121. In English and other Germanic languages, it was formerly known as one hundred. This hundred of six score is now obsolete, but is described as the hundred or great hundred in historical contexts. 120 is the factorial of 5, and the sum of a twin prime pair,120 is the sum of four consecutive prime numbers, four consecutive powers of 2, and four consecutive powers of 3. It is also a sparsely totient number,120 is the smallest number to appear six times in Pascals triangle. 120 is also the smallest multiple of 6 with no adjacent prime number and it is the eighth hexagonal number and the fifteenth triangular number, as well as the sum of the first eight triangular numbers, making it also a tetrahedral number. 120 is divisible by the first 5 triangular numbers and the first 4 tetrahedral numbers,120 is the first multiply perfect number of order three. The sum of its factors sum to 360, exactly three times 120, note that perfect numbers are order two by the same definition. 120 is divisible by the number of primes below it,30 in this case, however, there is no integer which has 120 as the sum of its proper divisors, making 120 an untouchable number. The sum of Eulers totient function φ over the first nineteen integers is 120,120 figures in Pierre de Fermats modified Diophantine problem as the largest known integer of the sequence 1,3,8,120. Fermat wanted to another positive integer that multiplied with any of the other numbers in the sequence yields a number that is one less than a square. Leonhard Euler also searched for this number, but failed to find it, the internal angles of a regular hexagon are all 120 degrees. 120 is a Harshad number in base 10,120 is the atomic number of Unbinilium, an element yet to be discovered. The cubits of the height of the Temple building The age at which Moses died, in astrology, when two planets in a persons chart are 120 degrees apart from each other, this is called a trine. This is supposed to bring luck in the persons life. The height in inches of a hoop in the National Basketball Association. 120 is also, The medical telephone number in China In Austria, in the US Army, a common diameter for a mortar in mm. TT scale, a scale for model trains, is 1,120. 120 film is a medium format film developed by Kodak,120, a 2008 Turkish film The Israeli national legislature, the Knesset, has 120 seats
11.
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
12.
Srinivasa Ramanujan
–
Srinivasa Iyengar Ramanujan FRS was an Indian mathematician and autodidact who lived during the British Raj. Though he had almost no training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series. Ramanujan initially developed his own research in isolation, it was quickly recognized by Indian mathematicians. When his skills became obvious and known to the mathematical community, centred in Europe at the time. The Cambridge professor realized that Srinivasa Ramanujan had produced new theorems in addition to rediscovering previously known ones, during his short life, Ramanujan independently compiled nearly 3,900 results. Nearly all his claims have now been proven correct and his original and highly unconventional results, such as the Ramanujan prime and the Ramanujan theta function, have inspired a vast amount of further research. The Ramanujan Journal, a scientific journal, was established to publish work in all areas of mathematics influenced by Ramanujan. Deeply religious, Ramanujan credited his substantial mathematical capacities to divinity, An equation for me has no meaning, he once said, the name Ramanujan means younger brother of the god Rama. Iyengar is a caste of Hindu Brahmins of Tamil origin whose members follow the Visishtadvaita philosophy propounded by Ramanuja, Ramanujan was born on 22 December 1887 into a Tamil Brahmin Iyengar family in Erode, Madras Presidency, at the residence of his maternal grandparents. His father, K. Srinivasa Iyengar, worked as a clerk in a sari shop and his mother, Komalatammal, was a housewife and also sang at a local temple. They lived in a traditional home on Sarangapani Sannidhi Street in the town of Kumbakonam. The family home is now a museum, when Ramanujan was a year and a half old, his mother gave birth to a son, Sadagopan, who died less than three months later. In December 1889, Ramanujan contracted smallpox, but unlike the thousands in the Thanjavur district who died of the disease that year and he moved with his mother to her parents house in Kanchipuram, near Madras. His mother gave birth to two children, in 1891 and 1894, but both died in infancy. On 1 October 1892, Ramanujan was enrolled at the local school, after his maternal grandfather lost his job as a court official in Kanchipuram, Ramanujan and his mother moved back to Kumbakonam and he was enrolled in the Kangayan Primary School. When his paternal grandfather died, he was sent back to his maternal grandparents and he did not like school in Madras, and tried to avoid attending. His family enlisted a local constable to make sure the boy attended school, within six months, Ramanujan was back in Kumbakonam. Since Ramanujans father was at work most of the day, his mother took care of the boy as a child and he had a close relationship with her
13.
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
14.
Colossally abundant number
–
In mathematics, a colossally abundant number is a natural number that, in a particular, rigorous sense, has many divisors. Formally, a n is colossally abundant if and only if there is an ε >0 such that for all k >1, σ n 1 + ε ≥ σ k 1 + ε where σ denotes the sum-of-divisors function. All colossally abundant numbers are also superabundant numbers, but the converse is not true. The first 15 colossally abundant numbers,2,6,12,60,120,360,2520,5040,55440,720720,1441440,4324320,21621600,367567200,6983776800 are also the first 15 superior highly composite numbers. Colossally abundant numbers were first studied by Ramanujan and his findings were intended to be included in his 1915 paper on highly composite numbers. The class of numbers was reconsidered in a stronger form in a 1944 paper of Leonidas Alaoglu. Colossally abundant numbers are one of several classes of integers that try to capture the notion of having many divisors, for a positive integer n, the sum-of-divisors function σ gives the sum of all those numbers that divide n, including 1 and n itself. Paul Bachmann showed that on average, σ is around π²n /6. Hence colossally abundant numbers capture the notion of having many divisors by requiring them to maximise, for some ε >0, Bachmann and Grönwalls results ensure that for every ε >0 this function has a maximum and that as ε tends to zero these maxima will increase. Thus there are infinitely many colossally abundant numbers, although they are rather sparse, for every ε the above function has a maximum, but it is not obvious, and in fact not true, that for every ε this maximum value is unique. Alaoglu and Erdős studied how different values of n could give the same maximal value of the above function for a given value of ε. They showed that for most values of ε there would be an integer n maximising the function. Later, however, Erdős and Jean-Louis Nicolas showed that for a set of discrete values of ε there could be two or four different values of n giving the same maximal value. In their 1944 paper, Alaoglu and Erdős conjectured that the ratio of two consecutive colossally abundant numbers was always a prime number, the quotient can never be the square of a prime. Alaoglu and Erdőss conjecture remains open, although it has been checked up to at least 107, Alaoglu and Erdőss conjecture would also mean that no value of ε gives four different integers n as maxima of the above function. In the 1980s Guy Robin showed that the Riemann hypothesis is equivalent to the assertion that the inequality is true for all n >5040. The inequality is now known as Robins inequality after his work
15.
Radix
–
In mathematical numeral systems, the radix or base is the number of unique digits, including zero, used to represent numbers in a positional numeral system. For example, for the system the radix is ten. For example,10 represents the one hundred, while 2 represents the number four. Radix is a Latin word for root, root can be considered a synonym for base in the arithmetical sense. In the system with radix 13, for example, a string of such as 398 denotes the number 3 ×132 +9 ×131 +8 ×130. More generally, in a system with radix b, a string of digits d1 … dn denotes the number d1bn−1 + d2bn−2 + … + dnb0, commonly used numeral systems include, For a larger list, see List of numeral systems. The octal and hexadecimal systems are used in computing because of their ease as shorthand for binary. Every hexadecimal digit corresponds to a sequence of four binary digits, a similar relationship holds between every octal digit and every possible sequence of three binary digits, since eight is the cube of two. However, other systems are possible, e. g. golden ratio base. Base Radix economy Non-standard positional numeral systems Base Convert, a floating-point base calculator MathWorld entry on base
16.
Binary number
–
The base-2 system is a positional notation with a radix of 2. Because of its implementation in digital electronic circuitry using logic gates. Each digit is referred to as a bit, the modern binary number system was devised by Gottfried Leibniz in 1679 and appears in his article Explication de lArithmétique Binaire. Systems related to binary numbers have appeared earlier in multiple cultures including ancient Egypt, China, Leibniz was specifically inspired by the Chinese I Ching. The scribes of ancient Egypt used two different systems for their fractions, Egyptian fractions and Horus-Eye fractions, the method used for ancient Egyptian multiplication is also closely related to binary numbers. This method can be seen in use, for instance, in the Rhind Mathematical Papyrus, the I Ching dates from the 9th century BC in China. The binary notation in the I Ching is used to interpret its quaternary divination technique and it is based on taoistic duality of yin and yang. Eight trigrams and a set of 64 hexagrams, analogous to the three-bit and six-bit binary numerals, were in use at least as early as the Zhou Dynasty of ancient China. The Song Dynasty scholar Shao Yong rearranged the hexagrams in a format that resembles modern binary numbers, the Indian scholar Pingala developed a binary system for describing prosody. He used binary numbers in the form of short and long syllables, Pingalas Hindu classic titled Chandaḥśāstra describes the formation of a matrix in order to give a unique value to each meter. The binary representations in Pingalas system increases towards the right, the residents of the island of Mangareva in French Polynesia were using a hybrid binary-decimal system before 1450. Slit drums with binary tones are used to encode messages across Africa, sets of binary combinations similar to the I Ching have also been used in traditional African divination systems such as Ifá as well as in medieval Western geomancy. The base-2 system utilized in geomancy had long been applied in sub-Saharan Africa. Leibnizs system uses 0 and 1, like the modern binary numeral system, Leibniz was first introduced to the I Ching through his contact with the French Jesuit Joachim Bouvet, who visited China in 1685 as a missionary. Leibniz saw the I Ching hexagrams as an affirmation of the universality of his own beliefs as a Christian. Binary numerals were central to Leibnizs theology and he believed that binary numbers were symbolic of the Christian idea of creatio ex nihilo or creation out of nothing. Is not easy to impart to the pagans, is the ex nihilo through Gods almighty power. In 1854, British mathematician George Boole published a paper detailing an algebraic system of logic that would become known as Boolean algebra
17.
Senary
–
The senary numeral system has six as its base. It has been adopted independently by a number of cultures. Like decimal, it is a semiprime, though being the product of the two consecutive numbers that are both prime it has a high degree of mathematical properties for its size. As six is a highly composite number, many of the arguments made in favor of the duodecimal system also apply to this base-6. Senary may be considered interesting in the study of numbers, since all primes other than 2 and 3. That is, for every number p greater than 3, one has the modular arithmetic relations that either p ≡1 or 5. This property maximizes the probability that the result of an integer multiplication will end in zero, E. g. if three fingers are extended on the left hand and four on the right, 34senary is represented. This is equivalent to 3 ×6 +4 which is 22decimal, flipping the sixes hand around to its backside may help to further disambiguate which hand represents the sixes and which represents the units. While most developed cultures count by fingers up to 5 in very similar ways, beyond 5 non-Western cultures deviate from Western methods, such as with Chinese number gestures. More abstract finger counting systems, such as chisanbop or finger binary, allow counting to 99,1,023, or even higher depending on the method. The English monk and historian Bede, in the first chapter of De temporum ratione, titled Tractatus de computo, vel loquela per gestum digitorum, the Ndom language of Papua New Guinea is reported to have senary numerals. Mer means 6, mer an thef means 6 ×2 =12, nif means 36, another example from Papua New Guinea are the Morehead-Maro languages. In these languages, counting is connected to ritualized yam-counting and these languages count from a base six, employing words for the powers of six, running up to 66 for some of the languages. One example is Kómnzo with the numerals, nimbo, féta, tarumba, ntamno, wärämäkä. Some Niger-Congo languages have been reported to use a number system, usually in addition to another. For some purposes, base 6 might be too small a base for convenience. The choice of 36 as a radix is convenient in that the digits can be represented using the Arabic numerals 0–9 and the Latin letters A–Z, this choice is the basis of the base36 encoding scheme. Base36 encoding scheme Binary Ternary Duodecimal Sexagesimal Shacks Base Six Dialectic Digital base 6 clock Analog Clock Designer capable of rendering a base 6 clock Senary base conversion
18.
Duodecimal
–
The duodecimal system is a positional notation numeral system using twelve as its base. In this system, the number ten may be written by a rotated 2 and this notation was introduced by Sir Isaac Pitman. These digit forms are available as Unicode characters on computerized systems since June 2015 as ↊ and ↋, other notations use A, T, or X for ten and B or E for eleven. The number twelve is written as 10 in duodecimal, whereas the digit string 12 means 1 dozen and 2 units. Similarly, in duodecimal 100 means 1 gross,1000 means 1 great gross, the number twelve, a superior highly composite number, is the smallest number with four non-trivial factors, and the smallest to include as factors all four numbers within the subitizing range. As a result, duodecimal has been described as the number system. Of its factors,2 and 3 are prime, which means the reciprocals of all 3-smooth numbers have a representation in duodecimal. In particular, the five most elementary fractions all have a terminating representation in duodecimal. This all makes it a convenient number system for computing fractions than most other number systems in common use, such as the decimal, vigesimal, binary. Although the trigesimal and sexagesimal systems do even better in respect, this is at the cost of unwieldy multiplication tables. In this section, numerals are based on decimal places, for example,10 means ten,12 means twelve. Languages using duodecimal number systems are uncommon, germanic languages have special words for 11 and 12, such as eleven and twelve in English. However, they are considered to come from Proto-Germanic *ainlif and *twalif, historically, units of time in many civilizations are duodecimal. There are twelve signs of the zodiac, twelve months in a year, traditional Chinese calendars, clocks, and compasses are based on the twelve Earthly Branches. There are 12 inches in a foot,12 troy ounces in a troy pound,12 old British pence in a shilling,24 hours in a day. The Romans used a system based on 12, including the uncia which became both the English words ounce and inch. The importance of 12 has been attributed to the number of cycles in a year. It is possible to count to 12 with the acting as a pointer
19.
Degree (angle)
–
A degree, usually denoted by °, is a measurement of a plane angle, defined so that a full rotation is 360 degrees. It is not an SI unit, as the SI unit of measure is the radian. Because a full rotation equals 2π radians, one degree is equivalent to π/180 radians, the original motivation for choosing the degree as a unit of rotations and angles is unknown. One theory states that it is related to the fact that 360 is approximately the number of days in a year. Ancient astronomers noticed that the sun, which follows through the path over the course of the year. Some ancient calendars, such as the Persian calendar, used 360 days for a year, the use of a calendar with 360 days may be related to the use of sexagesimal numbers. The earliest trigonometry, used by the Babylonian astronomers and their Greek successors, was based on chords of a circle, a chord of length equal to the radius made a natural base quantity. One sixtieth of this, using their standard sexagesimal divisions, was a degree, Aristarchus of Samos and Hipparchus seem to have been among the first Greek scientists to exploit Babylonian astronomical knowledge and techniques systematically. Timocharis, Aristarchus, Aristillus, Archimedes, and Hipparchus were the first Greeks known to divide the circle in 360 degrees of 60 arc minutes, eratosthenes used a simpler sexagesimal system dividing a circle into 60 parts. Furthermore, it is divisible by every number from 1 to 10 except 7 and this property has many useful applications, such as dividing the world into 24 time zones, each of which is nominally 15° of longitude, to correlate with the established 24-hour day convention. Finally, it may be the case more than one of these factors has come into play. For many practical purposes, a degree is a small enough angle that whole degrees provide sufficient precision. When this is not the case, as in astronomy or for geographic coordinates, degree measurements may be written using decimal degrees, with the symbol behind the decimals. Alternatively, the sexagesimal unit subdivisions can be used. One degree is divided into 60 minutes, and one minute into 60 seconds, use of degrees-minutes-seconds is also called DMS notation. These subdivisions, also called the arcminute and arcsecond, are represented by a single and double prime. For example,40. 1875° = 40° 11′ 15″, or, using quotation mark characters, additional precision can be provided using decimals for the arcseconds component. The older system of thirds, fourths, etc. which continues the sexagesimal unit subdivision, was used by al-Kashi and other ancient astronomers, but is rarely used today
20.
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
21.
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
22.
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
23.
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
24.
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
25.
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
26.
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
27.
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
28.
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
29.
Semiprime
–
In mathematics, a semiprime is a natural number that is the product of two prime numbers. The semiprimes less than 100 are 4,6,9,10,14,15,21,22,25,26,33,34,35,38,39,46,49,51,55,57,58,62,65,69,74,77,82,85,86,87,91,93,94, and 95. Semiprimes that are not perfect squares are called discrete, or distinct, by definition, semiprime numbers have no composite factors other than themselves. For example, the number 26 is semiprime and its factors are 1,2,13. The total number of prime factors Ω for a n is two, by definition. A semiprime is either a square of a prime or square-free, the square of any prime number is a semiprime, so the largest known semiprime will always be the square of the largest known prime, unless the factors of the semiprime are not known. It is conceivable, but unlikely, that a way could be found to prove a number is a semiprime without knowing the two factors. A composite n non-divisible by primes ≤ n 3 is semiprime, various methods, such as elliptic pseudo-curves and the Goldwasser-Kilian ECPP theorem have been used to create provable, unfactored semiprimes with hundreds of digits. These are considered novelties, since their construction method might prove vulnerable to factorization, for a semiprime n = pq the value of Eulers totient function is particularly simple when p and q are distinct, φ = = p q − +1 = n − +1. If otherwise p and q are the same, φ = φ = p = p2 − p = n − p and these methods rely on the fact that finding two large primes and multiplying them together is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offered prizes for the factoring of specific large semiprimes, the most recent such challenge closed in 2007. In practical cryptography, it is not sufficient to choose just any semiprime, the factors p and q of n should both be very large, around the same order of magnitude as the square root of n, this makes trial division and Pollards rho algorithm impractical. At the same time they should not be too close together, or else the number can be quickly factored by Fermats factorization method. The number may also be chosen so that none of p −1, p +1, q −1, or q +1 are smooth numbers, protecting against Pollards p −1 algorithm or Williams p +1 algorithm. However, these checks cannot take future algorithms or secret algorithms into account, in 1974 the Arecibo message was sent with a radio signal aimed at a star cluster. It consisted of 1679 binary digits intended to be interpreted as a 23×73 bitmap image, the number 1679 = 23×73 was chosen because it is a semiprime and therefore can only be broken down into 23 rows and 73 columns, or 73 rows and 23 columns. Chens theorem Weisstein, Eric W. Semiprime
30.
Pronic number
–
A pronic number is a number which is the product of two consecutive integers, that is, a number of the form n. The study of these dates back to Aristotle. They are also called oblong numbers, heteromecic numbers, or rectangular numbers, however, the rectangular number name has also been applied to the composite numbers. The first few numbers are,0,2,6,12,20,30,42,56,72,90,110,132,156,182,210,240,272,306,342,380,420,462 …. The nth pronic number is also the difference between the odd square 2 and the st centered hexagonal number. The sum of the reciprocals of the numbers is a telescoping series that sums to 1,1 =12 +16 +112 ⋯ = ∑ i =1 ∞1 i. The partial sum of the first n terms in this series is ∑ i =1 n 1 i = n n +1, the nth pronic number is the sum of the first n even integers. It follows that all numbers are even, and that 2 is the only prime pronic number. It is also the only number in the Fibonacci sequence. The number of entries in a square matrix is always a pronic number. The fact that consecutive integers are coprime and that a number is the product of two consecutive integers leads to a number of properties. Each distinct prime factor of a number is present in only one of the factors n or n+1. Thus a pronic number is squarefree if and only if n and n +1 are also squarefree, the number of distinct prime factors of a pronic number is the sum of the number of distinct prime factors of n and n +1. If 25 is appended to the representation of any pronic number. This is because 2 =100 n 2 +100 n +25 =100 n +25
31.
Sphenic number
–
In number theory, a sphenic number is a positive integer that is the product of three distinct prime numbers. A sphenic number is a product pqr where p, q and this definition is more stringent than simply requiring the integer to have exactly three prime factors. For instance,60 =22 ×3 ×5 has exactly 3 prime factors, the smallest sphenic number is 30 =2 ×3 ×5, the product of the smallest three primes. The first few numbers are 30,42,66,70,78,102,105,110,114,130,138,154,165. As of January 2016 the largest known number is × ×. It is the product of the three largest known primes, all sphenic numbers have exactly eight divisors. If we express the number as n = p ⋅ q ⋅ r, where p, q. For example,24 is not a number, but it has exactly eight divisors. All sphenic numbers are by definition squarefree, because the factors must be distinct. The Möbius function of any number is −1. The cyclotomic polynomials Φ n, taken over all sphenic numbers n, the first case of two consecutive sphenic integers is 230 = 2×5×23 and 231 = 3×7×11. The first case of three is 1309 = 7×11×17,1310 = 2×5×131, and 1311 = 3×19×23, there is no case of more than three, because every fourth consecutive positive integer is divisible by 4 = 2×2 and therefore not squarefree. The numbers 2013,2014, and 2015 are all sphenic, the next three consecutive sphenic years will be 2665,2666 and 2667. Semiprimes, products of two prime numbers
32.
Square-free integer
–
In mathematics, a square-free, or quadratfrei integer, is an integer which is divisible by no other perfect square than 1. For example,10 is square-free but 18 is not, as 18 is divisible by 9 =32. The smallest positive square-free numbers are 1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23,26,29,30,31,33,34,35,37,38,39. The radical of an integer is its largest square-free factor, an integer is square-free if and only if it is equal to its radical. Any arbitrary positive integer n can be represented in a way as the product of a powerful number and a square-free integer. The square-free factor is the largest square-free divisor k of n that is coprime with n/k, a positive integer n is square-free if and only if in the prime factorization of n, no prime factor occurs with an exponent larger than one. Another way of stating the same is that for every prime factor p of n, also n is square-free if and only if in every factorization n = ab, the factors a and b are coprime. An immediate result of this definition is that all numbers are square-free. A positive integer n is square-free if and only if all abelian groups of n are isomorphic. This follows from the classification of finitely generated abelian groups, a integer n is square-free if and only if the factor ring Z / nZ is a product of fields. This follows from the Chinese remainder theorem and the fact that a ring of the form Z / kZ is a field if, for every positive integer n, the set of all positive divisors of n becomes a partially ordered set if we use divisibility as the order relation. This partially ordered set is always a distributive lattice and it is a Boolean algebra if and only if n is square-free. A positive integer n is square-free if and only if μ ≠0, a positive integer n is squarefree if and only if ∑ d 2 ∣ n μ =1. This results from the properties of Möbius function, and the fact that this sum is equal to ∑ d ∣ m μ, where m is the largest divisor of n such that m2 divides n. The Dirichlet generating function for the numbers is ζ ζ = ∑ n =1 ∞ | μ | n s where ζ is the Riemann zeta function. This is easily seen from the Euler product ζ ζ = ∏ p = ∏ p, let Q denote the number of square-free integers between 1 and x. For large n, 3/4 of the positive integers less than n are not divisible by 4, 8/9 of these numbers are not divisible by 9, and so on. Under the Riemann hypothesis, the term can be further reduced to yield Q = x ζ + O =6 x π2 + O
33.
Powerful number
–
A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a number is the product of a square and a cube, that is, a number m of the form m = a2b3. Powerful numbers are known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful, in the other direction, suppose that m is powerful, with prime factorization m = ∏ p i α i, where each αi ≥2. Define γi to be three if αi is odd, and zero otherwise, and define βi = αi - γi. Then, all values βi are nonnegative integers, and all values γi are either zero or three, so m = =23 supplies the desired representation of m as a product of a square. Informally, given the prime factorization of m, take b to be the product of the factors of m that have an odd exponent. Because m is powerful, each prime factor with an odd exponent has an exponent that is at least 3, in addition, each prime factor of m/b3 has an even exponent, so m/b3 is a perfect square, so call this a2, then m = a2b3. The representation m = a2b3 calculated in this way has the property that b is squarefree, the sum of the reciprocals of the powerful numbers converges. More generally, the sum of the reciprocals of the sth powers of the numbers is equal to ζ ζ ζ whenever it converges. Let k denote the number of numbers in the interval. Then k is proportional to the root of x. More precisely, c x 1 /2 −3 x 1 /3 ≤ k ≤ c x 1 /2, c = ζ / ζ =2.173 …, the two smallest consecutive powerful numbers are 8 and 9. However, one of the two numbers in a pair formed in this way must be a square. According to Guy, Erdős has asked whether there are many pairs of consecutive powerful numbers such as in which neither number in the pair is a square. Jaroslaw Wroblewski showed that there are indeed infinitely many such pairs by showing that 33c2 +1 = 73d2 has infinitely many solutions and it is a conjecture of Erdős, Mollin, and Walsh that there are no three consecutive powerful numbers. Any odd number is a difference of two squares,2 = k2 + 2k +1, so 2 − k2 = 2k +1. Similarly, any multiple of four is a difference of the squares of two numbers that differ by two,2 − k2 = 4k +4
34.
Perfect power
–
In mathematics, a perfect power is a positive integer that can be expressed as an integer power of another positive integer. More formally, n is a perfect power if there exist natural numbers m >1, in this case, n may be called a perfect kth power. If k =2 or k =3, then n is called a square or perfect cube. Sometimes 1 is also considered a perfect power. The sum of the reciprocals of the perfect powers p without duplicates is, ∑ p 1 p = ∑ k =2 ∞ μ ≈0.874464368 … where μ is the Möbius function and this is sometimes known as the Goldbach-Euler theorem. Detecting whether or not a natural number n is a perfect power may be accomplished in many different ways. One of the simplest such methods is to all possible values for k across each of the divisors of n. This method can immediately be simplified by considering only prime values of k. This is because if n = m k for a composite k = a p p is prime. Because of this result, the value of k must necessarily be prime. As an example, consider n = 296·360·724, since gcd =12, n is a perfect 12th power. In 2002 Romanian mathematician Preda Mihăilescu proved that the pair of consecutive perfect powers is 23 =8 and 32 =9. Pillais conjecture states that for any positive integer k there are only a finite number of pairs of perfect powers whose difference is k. As an alternate way to perfect powers, the recursive approach has yet to be found useful. It is based on the observation that the difference between ab and b where a > b may not be constant, but if you take the difference of differences, b times. For example,94 =6561, and 104 is 10000, the difference between 84 and 94 is 2465, meaning the difference of differences is 974. A step further and you have 204, one step further, and you have 24, which is equal to 4. One step further and collating this key row from progressively larger exponents yields a similar to Pascals
35.
Achilles number
–
An Achilles number is a number that is powerful but not a perfect power. A positive integer n is a number if, for every prime factor p of n. In other words, every prime factor appears at least squared in the factorization, however, not all powerful numbers are Achilles numbers, only those that cannot be represented as mk, where m and k are positive integers greater than 1. Achilles numbers were named by Henry Bottomley after Achilles, a hero of the Trojan war, strong Achilles numbers are Achilles numbers whose Euler totients are also Achilles numbers. A number n = p1a1 p2a2 … pkak is powerful if min ≥2, if in addition gcd =1 the number is an Achilles number. The smallest pair of consecutive Achilles numbers is,5425069447 =73 ×412 ×9725425069448 =23 ×260412108 is a powerful number and its prime factorization is 22 ·33, and thus its prime factors are 2 and 3. Both 22 =4 and 32 =9 are divisors of 108, however,108 cannot be represented as mk, where m and k are positive integers greater than 1, so 108 is an Achilles number. 360 is not an Achilles number because it is not powerful, one of its prime factors is 5 but 360 is not divisible by 52 =25. Finally,784 is not an Achilles number and it is a powerful number, because not only are 2 and 7 its only prime factors, but also 22 =4 and 72 =49 are divisors of it. Nonetheless, it is a power,784 =24 ⋅72 =2 ⋅72 =2 =282. So it is not an Achilles number
36.
Smooth number
–
In number theory, a smooth number is an integer which factors completely into small prime numbers. The term seems to have coined by Leonard Adleman. Smooth numbers are important in cryptography relying on factorization. The 2-smooth numbers are just the powers of 2, a positive integer is called B-smooth if none of its prime factors is greater than B. For example,1,620 has prime factorization 22 ×34 ×5 and this definition includes numbers that lack some of the smaller prime factors, for example, both 10 and 12 are 5-smooth, despite the fact that they miss out prime factors 3 and 5 respectively. Note that B does not have to be a prime factor, if the largest prime factor of a number is p then the number is B-smooth for any B ≥ p. Usually B is given as a prime, but composite numbers work as well, a number is B-smooth if and only if it is p-smooth, where p is the largest prime less than or equal to B. By using B-smooth numbers, one ensures that the cases of this recursion are small primes. 5-smooth or regular numbers play a role in Babylonian mathematics. They are also important in theory, and the problem of generating these numbers efficiently has been used as a test problem for functional programming. Smooth numbers have a number of applications to cryptography, although most applications involve cryptanalysis, the VSH hash function is one example of a constructive use of smoothness to obtain a provably secure design. Let Ψ denote the number of y-smooth integers less than or equal to x, if the smoothness bound B is fixed and small, there is a good estimate for Ψ, Ψ ∼1 π. ∏ p ≤ B log x log p. where π denotes the number of less than or equal to B. Otherwise, define the parameter u as u = log x / log y, then, Ψ = x ⋅ ρ + O where ρ is the Dickman function. The average size of the part of a number of given size is known as ζ. Further, m is called B-powersmooth if all prime powers p ν dividing m satisfy, for example,720 is 5-smooth but is not 5-powersmooth. It is 16-powersmooth since its greatest prime factor power is 24 =16, the number is also 17-powersmooth, 18-powersmooth, etc. B-smooth and B-powersmooth numbers have applications in number theory, such as in Pollards p −1 algorithm, for example, the Pohlig–Hellman algorithm for computing discrete logarithms has a running time of O for groups of B-smooth order