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 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.
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
5.
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
6.
On-Line Encyclopedia of Integer Sequences
–
The On-Line Encyclopedia of Integer Sequences, also cited simply as Sloanes, is an online database of integer sequences. It was created and maintained by Neil Sloane while a researcher at AT&T Labs, Sloane continues to be involved in the OEIS in his role as President of the OEIS Foundation. OEIS records information on integer sequences of interest to professional mathematicians and amateurs, and is widely cited. As of 30 December 2016 it contains nearly 280,000 sequences, the database is searchable by keyword and by subsequence. Neil Sloane started collecting integer sequences as a student in 1965 to support his work in combinatorics. The database was at first stored on punched cards and he published selections from the database in book form twice, A Handbook of Integer Sequences, containing 2,372 sequences in lexicographic order and assigned numbers from 1 to 2372. The Encyclopedia of Integer Sequences with Simon Plouffe, containing 5,488 sequences and these books were well received and, especially after the second publication, mathematicians supplied Sloane with a steady flow of new sequences. The collection became unmanageable in book form, and when the database had reached 16,000 entries Sloane decided to go online—first as an e-mail service, as a spin-off from the database work, Sloane founded the Journal of Integer Sequences in 1998. The database continues to grow at a rate of some 10,000 entries a year, Sloane has personally managed his sequences for almost 40 years, but starting in 2002, a board of associate editors and volunteers has helped maintain the database. In 2004, Sloane celebrated the addition of the 100, 000th sequence to the database, A100000, in 2006, the user interface was overhauled and more advanced search capabilities were added. In 2010 an OEIS wiki at OEIS. org was created to simplify the collaboration of the OEIS editors and contributors, besides integer sequences, the OEIS also catalogs sequences of fractions, the digits of transcendental numbers, complex numbers and so on by transforming them into integer sequences. Sequences of rationals are represented by two sequences, the sequence of numerators and the sequence of denominators, important irrational numbers such as π =3.1415926535897. are catalogued under representative integer sequences such as decimal expansions, binary expansions, or continued fraction expansions. The OEIS was limited to plain ASCII text until 2011, yet it still uses a form of conventional mathematical notation. Greek letters are represented by their full names, e. g. mu for μ. Every sequence is identified by the letter A followed by six digits, sometimes referred to without the leading zeros, individual terms of sequences are separated by commas. Digit groups are not separated by commas, periods, or spaces, a represents the nth term of the sequence. Zero is often used to represent non-existent sequence elements, for example, A104157 enumerates the smallest prime of n² consecutive primes to form an n×n magic square of least magic constant, or 0 if no such magic square exists. The value of a is 2, a is 1480028129, but there is no such 2×2 magic square, so a is 0
7.
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
8.
Integer
–
An integer is a number that can be written without a fractional component. For example,21,4,0, and −2048 are integers, while 9.75, 5 1⁄2, the set of integers consists of zero, the positive natural numbers, also called whole numbers or counting numbers, and their additive inverses. This is often denoted by a boldface Z or blackboard bold Z standing for the German word Zahlen, ℤ is a subset of the sets of rational and real numbers and, like the natural numbers, is countably infinite. The integers form the smallest group and the smallest ring containing the natural numbers, in algebraic number theory, the integers are sometimes called rational integers to distinguish them from the more general algebraic integers. In fact, the integers are the integers that are also rational numbers. Like the natural numbers, Z is closed under the operations of addition and multiplication, that is, however, with the inclusion of the negative natural numbers, and, importantly,0, Z is also closed under subtraction. The integers form a ring which is the most basic one, in the following sense, for any unital ring. This universal property, namely to be an object in the category of rings. Z is not closed under division, since the quotient of two integers, need not be an integer, although the natural numbers are closed under exponentiation, the integers are not. The following lists some of the properties of addition and multiplication for any integers a, b and c. In the language of algebra, the first five properties listed above for addition say that Z under addition is an abelian group. As a group under addition, Z is a cyclic group, in fact, Z under addition is the only infinite cyclic group, in the sense that any infinite cyclic group is isomorphic to Z. The first four properties listed above for multiplication say that Z under multiplication is a commutative monoid. However, not every integer has an inverse, e. g. there is no integer x such that 2x =1, because the left hand side is even. This means that Z under multiplication is not a group, all the rules from the above property table, except for the last, taken together say that Z together with addition and multiplication is a commutative ring with unity. It is the prototype of all objects of algebraic structure. Only those equalities of expressions are true in Z for all values of variables, note that certain non-zero integers map to zero in certain rings. The lack of zero-divisors in the means that the commutative ring Z is an integral domain
9.
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
10.
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
11.
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
12.
University of Kinshasa
–
The University of Kinshasa, is one of three universities, along with University of Kisangani and University of Lubumbashi, created following the division of the National University of Zaire. The university had an enrollment of 26,186 and a faculty and research staff of 1,530 in the 2006-2007 academic year, the university is located about 15 kilometers south of central Kinshasa, in the suburb of Lemba. Many of the facilities have deteriorated and are in poor condition, or lack proper instructional tools - in 2003. Since 2001, the university has hosted Cisco Academy, a joint project sponsored by the American software company Cisco, the academy focuses on providing recent technology, training students to install and operate computer networks and all coursework is online. The university was established in 1954 as the University of Lovanium by Belgian colonial authorities following criticism that they had too little to educate the Congolese people. The university was affiliated with the Catholic University of Leuven in Belgium. In August 1971, the university was merged with the Protestant Autonomous University of Congo, ties were cut with the Catholic University of Leuven, and funding for the university began to drop precipitously. At this point, the university had an enrollment capacity of just 5,000, the decision to merge the private universities into one centralized system was made, at least partially, to counter concerns about political demonstrations on campuses. The entire higher education system was run by a rector and faculty. Newly independent, the University of Kinshasa continued to struggle throughout the 1980s. By 1985, the campus was in decline, strewn with trash, the universitys cafeteria stopped serving meals and pay for professors slipped as low as $15. Through the 1980s, as much as 90 percent of the budget was paid for by the government. By 2002, the government only contributed $8,000 of the universitys estimated $4.3 million annual budget, the first nuclear reactor in Africa was built at the University of Kinshasa in 1958. The reactor, known as TRICO I, is a TRIGA reactor built by General Atomics, TRICO stands for a combination of TRIGA or “Training Isotopes General Atomic” and Congo. The reactor was built while the country was still under Belgian control, TRIGA I was estimated to have a 50-kilowatt capacity and was shut down in 1970. In 1967, the African Union established a research center, the Regional Center for Nuclear Studies. The second reactor, TRICO II, is believed to have a capacity and was brought online in 1972. In 2001, the TRICO II reactor was reported to be operational, the government of the Democratic Republic of Congo stopped funding the program in the late 1980s, and the United States has since refused to ship replacement parts
13.
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
14.
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
15.
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
16.
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
17.
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
18.
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
19.
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
20.
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
21.
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
22.
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
23.
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
24.
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
25.
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
26.
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
27.
Regular number
–
Regular numbers are numbers that evenly divide powers of 60. As an example,602 =3600 =48 ×75, equivalently, they are the numbers whose only prime divisors are 2,3, and 5. The numbers that divide the powers of 60 arise in several areas of mathematics and its applications. In number theory, these numbers are called 5-smooth, because they can be characterized as having only 2,3 and this is a specific case of the more general k-smooth numbers, i. e. a set of numbers that have no prime factor greater than k. In music theory, regular numbers occur in the ratios of tones in five-limit just intonation, in computer science, regular numbers are often called Hamming numbers, after Richard Hamming, who proposed the problem of finding computer algorithms for generating these numbers in order. Formally, a number is an integer of the form 2i·3j·5k, for nonnegative integers i, j. Such a number is a divisor of 60 max, the regular numbers are also called 5-smooth, indicating that their greatest prime factor is at most 5. The first few numbers are 1,2,3,4,5,6,8,9,10,12,15,16,18,20,24,25,27,30,32,36,40,45,48,50,54,60. Several other sequences at OEIS have definitions involving 5-smooth numbers, although the regular numbers appear dense within the range from 1 to 60, they are quite sparse among the larger integers. Therefore, the number of numbers that are at most N can be estimated as the volume of this tetrahedron. A similar formula for the number of 3-smooth numbers up to N is given by Srinivasa Ramanujan in his first letter to G. H. Hardy, in the Babylonian sexagesimal notation, the reciprocal of a regular number has a finite representation, thus being easy to divide by. Specifically, if n divides 60k, then the representation of 1/n is just that for 60k/n. For instance, suppose we wish to divide by the regular number 54 =2133,54 is a divisor of 603, and 603/54 =4000, so dividing by 54 in sexagesimal can be accomplished by multiplying by 4000 and shifting three places. In sexagesimal 4000 = 1×3600 + 6×60 + 40×1, or 1,6,40, thus, 1/54, in sexagesimal, is 1/60 + 6/602 + 40/603, also denoted 1,6,40 as Babylonian notational conventions did not specify the power of the starting digit. Conversely 1/4000 = 54/603, so division by 1,6,40 =4000 can be accomplished by multiplying by 54. The Babylonians used tables of reciprocals of regular numbers, some of which still survive and these tables existed relatively unchanged throughout Babylonian times. Thus, for an instrument with this tuning, all pitches are regular-number harmonics of a fundamental frequency. Each of these 31 scales shares with diatonic just intonation the property that all intervals are ratios of regular numbers, eulers tonnetz provides a convenient graphical representation of the pitches in any 5-limit tuning, by factoring out the octave relationships so that the remaining values form a planar grid
28.
Rough number
–
Every odd positive integer is 3-rough. Every positive integer that is congruent to 1 or 5 mod 6 is 5-rough, every positive integer is 2-rough, since all its prime factors, being prime numbers, exceed 1. Buchstab function, used to count rough numbers Smooth number Weisstein, tanush Shaska and Engjell Hasimaj, IOS Press,2009, ISBN9781607500193
29.
Unusual number
–
In number theory, an unusual number is a natural number n whose largest prime factor is strictly greater than n. A k-smooth number has all its prime factors less than or equal to k, therefore, for any prime p, its multiples less than p² are unusual, that is p. p, which have a density 1/p in the interval. In other words, lim n → ∞ u n = ln =0.693147 …
30.
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
31.
Quasiperfect number
–
In mathematics, a quasiperfect number is a theoretical natural number n for which the sum of all its divisors is equal to 2n +1. Equivalently, n is the sum of its non-trivial divisors, the quasiperfect numbers are the abundant numbers of minimal abundance 1. No quasiperfect numbers have been found so far, but if a number exists. Numbers do exist where the sum of all the divisors σ is equal to 2n +2,20,104,464,650,1952,130304,522752. Many of these numbers are of the form 2n−1 where 2n −3 is prime Brown, E. Abbott, H. Aull, odd integers N with five distinct prime factors for which 2−10−12 < σ/N < 2+10−12. On odd perfect numbers, multiperfect numbers and quasiperfect numbers, elementary number theory in nine chapters. Sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, eds
32.
Multiply perfect number
–
In mathematics, a multiply perfect number is a generalization of a perfect number. For a given number k, a number n is called k-perfect if and only if the sum of all positive divisors of n is equal to kn. A number that is k-perfect for a k is called a multiply perfect number. As of 2014, k-perfect numbers are known for value of k up to 11. It can be proven that, For a given prime p, if n is p-perfect and p does not divide n. This implies that an n is a 3-perfect number divisible by 2 but not by 4, if and only if n/2 is an odd perfect number. If 3n is 4k-perfect and 3 does not divide n, then n is 3k-perfect, the number of multiperfect numbers less than X is o for all positive ε. The only known odd multiply perfect number is 1, a number n with σ = 2n is perfect. A number n with σ = 3n is triperfect, an odd triperfect number must exceed 1070, have at least 12 distinct prime factors, the largest exceeding 105. Odd triperfect numbers are divisible by twelve distinct prime factors, the abundancy ratio, a measure of perfection. Sorli, Ronald M. Algorithms in the study of multiperfect and odd perfect numbers Ryan, a simpler dense proof regarding the abundancy index. Odd multiperfect numbers of abundancy 4, sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, eds. The Multiply Perfect Numbers page The Prime Glossary, Multiply perfect numbers
33.
Superperfect number
–
In mathematics, a superperfect number is a positive integer n that satisfies σ2 = σ =2 n, where σ is the divisor summatory function. Superperfect numbers are a generalization of perfect numbers, the term was coined by Suryanarayana. The first few numbers are 2,4,16,64,4096,65536,262144,1073741824. If n is a superperfect number, then n must be a power of 2, 2k. It is not known whether there are any odd superperfect numbers, an odd superperfect number n would have to be a square number such that either n or σ is divisible by at least three distinct primes. There are no odd superperfect numbers below 7×1024, perfect and superperfect numbers are examples of the wider class of m-superperfect numbers, which satisfy σ m =2 n, corresponding to m=1 and 2 respectively. For m ≥3 there are no even m-superperfect numbers, the m-superperfect numbers are in turn examples of -perfect numbers which satisfy σ m = k n. With this notation, perfect numbers are -perfect, multiperfect numbers are -perfect, superperfect numbers are -perfect and m-superperfect numbers are -perfect, examples of classes of -perfect numbers are
34.
Unitary perfect number
–
A unitary perfect number is an integer which is the sum of its positive proper unitary divisors, not including the number itself. Some perfect numbers are not unitary perfect numbers, and some unitary perfect numbers are not regular perfect numbers. 60 is a perfect number, because 1,3,4,5,12,15 and 20 are its proper unitary divisors. 13305631471496232960000 +20908849455208366080000 +48787315395486187520000 There are no odd perfect numbers. This follows since one has 2d* dividing the sum of the divisors of an odd number. It is not known whether or not there are infinitely many perfect numbers. A sixth such number would have at least nine odd prime factors and my Numbers, My Friends, Popular Lectures on Number Theory. Sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, eds
35.
Semiperfect number
–
In number theory, a semiperfect number or pseudoperfect number is a natural number n that is equal to the sum of all or some of its proper divisors. A semiperfect number that is equal to the sum of all its divisors is a perfect number. The first few numbers are 6,12,18,20,24,28,30,36,40. Every multiple of a number is semiperfect. A semiperfect number that is not divisible by any smaller number is primitive. Every number of the form 2mp for a number m. In particular, every number of the form 2m is semiperfect, the smallest odd semiperfect number is 945. A semiperfect number is necessarily either perfect or abundant, an abundant number that is not semiperfect is called a weird number. With the exception of 2, all primary pseudoperfect numbers are semiperfect, every practical number that is not a power of two is semiperfect. The natural density of the set of semiperfect numbers exists, a primitive semiperfect number is a semiperfect number that has no semiperfect proper divisor. The first few semiperfect numbers are 6,20,28,88,104,272,304,350. There are infinitely many such numbers, all numbers of the form 2mp, with p a prime between 2m and 2m+1, are primitive semiperfect, but this is not the only form, for example,770. Hemiperfect number Erdős–Nicolas number Friedman, Charles N, sums of divisors and Egyptian fractions. Weisstein, Eric W. Primitive semiperfect number
36.
Practical number
–
In number theory, a practical number or panarithmic number is a positive integer n such that all smaller positive integers can be represented as sums of distinct divisors of n. Practical numbers were used by Fibonacci in his Liber Abaci in connection with the problem of representing rational numbers as Egyptian fractions, Fibonacci does not formally define practical numbers, but he gives a table of Egyptian fraction expansions for fractions with practical denominators. The name practical number is due to Srinivasan and he noted that the subdivision of money, weights and measures involved numbers like 4,12,16,20 and 28 which are usually supposed to be so inconvenient as to deserve replacement by powers of 10. He rediscovered the number theoretical property of such numbers and was the first to attempt a classification of numbers that was completed by Stewart. This characterization makes it possible to determine whether a number is practical by examining its prime factorization, every even perfect number and every power of two is also a practical number. Practical numbers have also shown to be analogous with prime numbers in many of their properties. If the ordered set of all divisors of the number n is d 1, d 2. D j with d 1 =1 and d j = n, in other words the ordered sequence of all divisors d 1 < d 2 <. < d j of a number has to be a complete sub-sequence. This partial characterization was extended and completed by Stewart and Sierpiński who showed that it is straightforward to determine whether a number is practical from its prime factorization, a positive integer greater than one with prime factorization n = p 1 α1. P k α k is if and only if each of its prime factors p i is small enough for p i −1 to have a representation as a sum of smaller divisors. The condition stated above is necessary and sufficient for a number to be practical, in the other direction, the condition is sufficient, as can be shown by induction. Since q ≤ σ and n / p k α k can be shown by induction to be practical, we can find a representation of q as a sum of divisors of n / p k α k. The divisors representing r, together with p k α k times each of the divisors representing q, the only odd practical number is 1, because if n >2 is an odd number, then 2 cannot be expressed as the sum of distinct divisors of n. More strongly, Srinivasan observes that other than 1 and 2, the product of two practical numbers is also a practical number. More strongly the least common multiple of any two numbers is also a practical number. Equivalently, the set of all numbers is closed under multiplication. From the above characterization by Stewart and Sierpiński it can be seen that if n is a practical number, in the set of all practical numbers there is a primitive set of practical numbers
37.
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
38.
Primitive abundant number
–
In mathematics a primitive abundant number is an abundant number whose proper divisors are all deficient numbers. For example,20 is an abundant number because, The sum of its proper divisors is 1 +2 +4 +5 +10 =22. The sums of the divisors of 1,2,4,5 and 10 are 0,1,3,1 and 8 respectively. The first few primitive abundant numbers are,20,70,88,104,272,304,368,464,550,572, the smallest odd primitive abundant number is 945. A variant definition is abundant numbers having no abundant proper divisor and it starts,12,18,20,30,42,56,66,70,78,88,102,104,114 Every multiple of a primitive abundant number is an abundant number. Every abundant number is a multiple of an abundant number or a multiple of a perfect number. Every primitive abundant number is either a primitive semiperfect number or a weird number, there are an infinite number of primitive abundant numbers. The number of primitive abundant numbers less than or equal to n is o
39.
Highly abundant number
–
In mathematics, a highly abundant number is a natural number with the property that the sum of its divisors is greater than the sum of the divisors of any smaller natural number. Highly abundant numbers and several classes of numbers were first introduced by Pillai. The first few highly abundant numbers are 1,2,3,4,6,8,10,12,16,18,20,24,30,36,42,48,60, the only odd highly abundant numbers are 1 and 3. Although the first eight factorials are highly abundant, not all factorials are highly abundant, for example, σ = σ =1481040, but there is a smaller number with larger sum of divisors, σ =1572480, so 9. is not highly abundant. Alaoglu and Erdős noted that all superabundant numbers are highly abundant and this question was answered affirmatively by Jean-Louis Nicolas. Despite the terminology, not all highly abundant numbers are abundant numbers, in particular, none of the first seven highly abundant numbers is abundant. 7200 is the largest powerful number that is highly abundant. Therefore,7200 is also the largest highly abundant number with an odd sum of divisors, on highly composite and similar numbers. Transactions of the American Mathematical Society, ordre maximal dun élément du groupe Sn des permutations et highly composite numbers
40.
Superabundant number
–
In mathematics, a superabundant number is a certain kind of natural number. A natural number n is called superabundant precisely when, for all m < n σ m < σ n where σ denotes the sum-of-divisors function. The first few superabundant numbers are 1,2,4,6,12,24,36,48,60,120. For example, the number 5 is not a superabundant number because for 1,2,3,4, and 5, the sigma is 1,3,4,7,6, Superabundant numbers were defined by Leonidas Alaoglu and Paul Erdős. Unknown to Alaoglu and Erdős, about 30 pages of Ramanujans 1915 paper Highly Composite Numbers were suppressed and those pages were finally published in The Ramanujan Journal 1, 119–153. In section 59 of that paper, Ramanujan defines generalized highly composite numbers, Leonidas Alaoglu and Paul Erdős proved that if n is superabundant, then there exist a k and a1, a2. Ak such that n = ∏ i =1 k a i where pi is the prime number. That is, they proved that if n is superabundant, the decomposition of n has non-increasing exponents. Then in particular any superabundant number is an integer. In fact, the last exponent ak is equal to 1 except when n is 4 or 36, Superabundant numbers are closely related to highly composite numbers. Not all superabundant numbers are composite numbers. In fact, only 449 superabundant and highly composite numbers are the same, for instance,7560 is highly composite but not superabundant. Alaoglu and Erdős observed that all superabundant numbers are highly abundant, not all superabundant numbers are Harshad numbers. The first exception is the 105th SA number,149602080797769600, the digit sum is 81, but 81 does not divide evenly into this SA number. If this inequality has a counterexample, proving the Riemann hypothesis to be false. Akbary, Amir, Friggstad, Zachary, Superabundant numbers and the Riemann hypothesis, American Mathematical Monthly,116, 273–275, doi,10. 4169/193009709X470128
41.
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
42.
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
43.
Superior highly composite number
–
In mathematics, a superior highly composite number is a natural number which has more divisors than any other number scaled relative to some power of the number itself. It is a stronger restriction than that of a composite number. The first 10 superior highly composite numbers and their factorization are listed, the term was coined by Ramanujan. All superior highly composite numbers are highly composite, an effective construction of the set of all superior highly composite numbers is given by the following monotonic mapping from the positive real numbers. Let e p = ⌊1 p x −1 ⌋ for any number p. Then s = ∏ p ∈ P p e p is a highly composite number. Note that the product need not be computed indefinitely, because if p >2 x then e p =0, also note that in the definition of e p,1 / x is analogous to ε in the implicit definition of a superior highly composite number. Moreover, for each superior highly composite number s ′ exists a half-open interval I ⊂ R + such that ∀ x ∈ I, s = s ′, in other words, the quotient of two successive superior highly composite numbers is a prime number. For example, Binary Senary Duodecimal Sexagesimal 120 appears as the long hundred, reprinted in Collected Papers, New York, Chelsea, pp. 78–129,1962 Sándor, József, Mitrinović, Dragoslav S. Crstici, Borislav, eds. Weisstein, Eric W. Superior highly composite number