1.
Belgium
–
Belgium, officially the Kingdom of Belgium, is a sovereign state in Western Europe bordered by France, the Netherlands, Germany, Luxembourg, and the North Sea. It is a small, densely populated country which covers an area of 30,528 square kilometres and has a population of about 11 million people. Additionally, there is a group of German-speakers who live in the East Cantons located around the High Fens area. Historically, Belgium, the Netherlands and Luxembourg were known as the Low Countries, the region was called Belgica in Latin, after the Roman province of Gallia Belgica. From the end of the Middle Ages until the 17th century, today, Belgium is a federal constitutional monarchy with a parliamentary system of governance. It is divided into three regions and three communities, that exist next to each other and its two largest regions are the Dutch-speaking region of Flanders in the north and the French-speaking southern region of Wallonia. The Brussels-Capital Region is a bilingual enclave within the Flemish Region. A German-speaking Community exists in eastern Wallonia, Belgiums linguistic diversity and related political conflicts are reflected in its political history and complex system of governance, made up of six different governments. Upon its independence, declared in 1830, Belgium participated in the Industrial Revolution and, during the course of the 20th century, possessed a number of colonies in Africa. This continuing antagonism has led to several far-reaching reforms, resulting in a transition from a unitary to a federal arrangement during the period from 1970 to 1993. Belgium is also a member of the Eurozone, NATO, OECD and WTO. Its capital, Brussels, hosts several of the EUs official seats as well as the headquarters of major international organizations such as NATO. Belgium is also a part of the Schengen Area, Belgium is a developed country, with an advanced high-income economy and is categorized as very high in the Human Development Index. A gradual immigration by Germanic Frankish tribes during the 5th century brought the area under the rule of the Merovingian kings, a gradual shift of power during the 8th century led the kingdom of the Franks to evolve into the Carolingian Empire. Many of these fiefdoms were united in the Burgundian Netherlands of the 14th and 15th centuries, the Eighty Years War divided the Low Countries into the northern United Provinces and the Southern Netherlands. The latter were ruled successively by the Spanish and the Austrian Habsburgs and this was the theatre of most Franco-Spanish and Franco-Austrian wars during the 17th and 18th centuries. The reunification of the Low Countries as the United Kingdom of the Netherlands occurred at the dissolution of the First French Empire in 1815, although the franchise was initially restricted, universal suffrage for men was introduced after the general strike of 1893 and for women in 1949. The main political parties of the 19th century were the Catholic Party, French was originally the single official language adopted by the nobility and the bourgeoisie
2.
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
3.
Frequency
–
Frequency is the number of occurrences of a repeating event per unit time. It is also referred to as frequency, which emphasizes the contrast to spatial frequency. The period is the duration of time of one cycle in a repeating event, for example, if a newborn babys heart beats at a frequency of 120 times a minute, its period—the time interval between beats—is half a second. Frequency is an important parameter used in science and engineering to specify the rate of oscillatory and vibratory phenomena, such as vibrations, audio signals, radio waves. For cyclical processes, such as rotation, oscillations, or waves, in physics and engineering disciplines, such as optics, acoustics, and radio, frequency is usually denoted by a Latin letter f or by the Greek letter ν or ν. For a simple motion, the relation between the frequency and the period T is given by f =1 T. The SI unit of frequency is the hertz, named after the German physicist Heinrich Hertz, a previous name for this unit was cycles per second. The SI unit for period is the second, a traditional unit of measure used with rotating mechanical devices is revolutions per minute, abbreviated r/min or rpm. As a matter of convenience, longer and slower waves, such as ocean surface waves, short and fast waves, like audio and radio, are usually described by their frequency instead of period. Spatial frequency is analogous to temporal frequency, but the axis is replaced by one or more spatial displacement axes. Y = sin = sin d θ d x = k Wavenumber, in the case of more than one spatial dimension, wavenumber is a vector quantity. For periodic waves in nondispersive media, frequency has a relationship to the wavelength. Even in dispersive media, the frequency f of a wave is equal to the phase velocity v of the wave divided by the wavelength λ of the wave. In the special case of electromagnetic waves moving through a vacuum, then v = c, where c is the speed of light in a vacuum, and this expression becomes, f = c λ. When waves from a monochrome source travel from one medium to another, their remains the same—only their wavelength. For example, if 71 events occur within 15 seconds the frequency is, the latter method introduces a random error into the count of between zero and one count, so on average half a count. This is called gating error and causes an error in the calculated frequency of Δf = 1/, or a fractional error of Δf / f = 1/ where Tm is the timing interval. This error decreases with frequency, so it is a problem at low frequencies where the number of counts N is small, an older method of measuring the frequency of rotating or vibrating objects is to use a stroboscope
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.
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
6.
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
7.
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
8.
International Standard Serial Number
–
An International Standard Serial Number is an eight-digit serial number used to uniquely identify a serial publication. The ISSN is especially helpful in distinguishing between serials with the same title, ISSN are used in ordering, cataloging, interlibrary loans, and other practices in connection with serial literature. The ISSN system was first drafted as an International Organization for Standardization international standard in 1971, ISO subcommittee TC 46/SC9 is responsible for maintaining the standard. When a serial with the content is published in more than one media type. For example, many serials are published both in print and electronic media, the ISSN system refers to these types as print ISSN and electronic ISSN, respectively. The format of the ISSN is an eight digit code, divided by a hyphen into two four-digit numbers, as an integer number, it can be represented by the first seven digits. The last code digit, which may be 0-9 or an X, is a check digit. Formally, the form of the ISSN code can be expressed as follows, NNNN-NNNC where N is in the set, a digit character. The ISSN of the journal Hearing Research, for example, is 0378-5955, where the final 5 is the check digit, for calculations, an upper case X in the check digit position indicates a check digit of 10. To confirm the check digit, calculate the sum of all eight digits of the ISSN multiplied by its position in the number, the modulus 11 of the sum must be 0. There is an online ISSN checker that can validate an ISSN, ISSN codes are assigned by a network of ISSN National Centres, usually located at national libraries and coordinated by the ISSN International Centre based in Paris. The International Centre is an organization created in 1974 through an agreement between UNESCO and the French government. The International Centre maintains a database of all ISSNs assigned worldwide, at the end of 2016, the ISSN Register contained records for 1,943,572 items. ISSN and ISBN codes are similar in concept, where ISBNs are assigned to individual books, an ISBN might be assigned for particular issues of a serial, in addition to the ISSN code for the serial as a whole. An ISSN, unlike the ISBN code, is an identifier associated with a serial title. For this reason a new ISSN is assigned to a serial each time it undergoes a major title change, separate ISSNs are needed for serials in different media. Thus, the print and electronic versions of a serial need separate ISSNs. Also, a CD-ROM version and a web version of a serial require different ISSNs since two different media are involved, however, the same ISSN can be used for different file formats of the same online serial
9.
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
10.
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
11.
Amicable numbers
–
Amicable numbers are two different numbers so related that the sum of the proper divisors of each is equal to the other number. A pair of amicable numbers constitutes a sequence of period 2. A related concept is that of a number, which is a number that equals the sum of its own proper divisors. Numbers that are members of a sequence with period greater than 2 are known as sociable numbers. The smallest pair of numbers is. The first ten amicable pairs are, and, Amicable numbers were known to the Pythagoreans, who credited them with many mystical properties. A general formula by some of these numbers could be derived was invented circa 850 by the Iraqi mathematician Thābit ibn Qurra. Other Arab mathematicians who studied amicable numbers are al-Majriti, al-Baghdadi, the Iranian mathematician Muhammad Baqir Yazdi discovered the pair, though this has often been attributed to Descartes. Much of the work of Eastern mathematicians in this area has been forgotten, Thābit ibn Qurras formula was rediscovered by Fermat and Descartes, to whom it is sometimes ascribed, and extended by Euler. It was extended further by Borho in 1972, Fermat and Descartes also rediscovered pairs of amicable numbers known to Arab mathematicians. Euler also discovered dozens of new pairs, the second smallest pair, was discovered in 1866 by a then teenage B. Paganini, having been overlooked by earlier mathematicians, by 1946 there were 390 known pairs, but the advent of computers has allowed the discovery of many thousands since then. Exhaustive searches have been carried out to find all pairs less than a bound, this bound being extended from 108 in 1970, to 1010 in 1986,1011 in 1993,1017 in 2015. As of April 2016, there are over 1,000,000,000 known amicable pairs, while these rules do generate some pairs of amicable numbers, many other pairs are known, so these rules are by no means comprehensive. The Thābit ibn Qurra theorem is a method for discovering amicable numbers invented in the century by the Arab mathematician Thābit ibn Qurra. This formula gives the pairs for n =2, for n =4, and for n =7, Numbers of the form 3×2n −1 are known as Thabit numbers. In order for Ibn Qurras formula to produce an amicable pair, to establish the theorem, Thâbit ibn Qurra proved nine lemmas divided into two groups. The first three deal with the determination of the aliquot parts of a natural integer