1.
Number theory
–
Number theory or, in older usage, arithmetic is a branch of pure mathematics devoted primarily to the study of the integers. It is sometimes called The Queen of Mathematics because of its place in the discipline. Number theorists study prime numbers as well as the properties of objects out of integers or defined as generalizations of the integers. Integers can be considered either in themselves or as solutions to equations, questions in number theory are often best understood through the study of analytical objects that encode properties of the integers, primes or other number-theoretic objects in some fashion. One may also study real numbers in relation to rational numbers, the older term for number theory is arithmetic. By the early century, it had been superseded by number theory. The use of the arithmetic for number theory regained some ground in the second half of the 20th century. In particular, arithmetical is preferred as an adjective to number-theoretic. The first historical find of a nature is a fragment of a table. The triples are too many and too large to have been obtained by brute force, the heading over the first column reads, The takiltum of the diagonal which has been subtracted such that the width. The tables layout suggests that it was constructed by means of what amounts, in language, to the identity 2 +1 =2. If some other method was used, the triples were first constructed and then reordered by c / a, presumably for use as a table. It is not known what these applications may have been, or whether there could have any, Babylonian astronomy, for example. It has been suggested instead that the table was a source of examples for school problems. While Babylonian number theory—or what survives of Babylonian mathematics that can be called thus—consists of this single, striking fragment, late Neoplatonic sources state that Pythagoras learned mathematics from the Babylonians. Much earlier sources state that Thales and Pythagoras traveled and studied in Egypt, Euclid IX 21—34 is very probably Pythagorean, it is very simple material, but it is all that is needed to prove that 2 is irrational. Pythagorean mystics gave great importance to the odd and the even, the discovery that 2 is irrational is credited to the early Pythagoreans. This forced a distinction between numbers, on the one hand, and lengths and proportions, on the other hand, the Pythagorean tradition spoke also of so-called polygonal or figurate numbers
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.
2 (number)
–
2 is a number, numeral, and glyph. It is the number following 1 and preceding 3. The number two has many properties in mathematics, an integer is called even if it is divisible by 2. For integers written in a system based on an even number, such as decimal and hexadecimal. If it is even, then the number is even. In particular, when written in the system, all multiples of 2 will end in 0,2,4,6. In numeral systems based on an odd number, divisibility by 2 can be tested by having a root that is even. Two is the smallest and first prime number, and the only prime number. Two and three are the two consecutive prime numbers. 2 is the first Sophie Germain prime, the first factorial prime, the first Lucas prime, the first Ramanujan prime, and it is an Eisenstein prime with no imaginary part and real part of the form 3n −1. It is also a Stern prime, a Pell number, the first Fibonacci prime, and it is the third Fibonacci number, and the second and fourth Perrin numbers. Despite being prime, two is also a highly composite number, because it is a natural number which has more divisors than any other number scaled relative to the number itself. The next superior highly composite number is six, vulgar fractions with only 2 or 5 in the denominator do not yield infinite decimal expansions, as is the case with all other primes, because 2 and 5 are factors of ten, the decimal base. Two is the number x such that the sum of the reciprocals of the powers of x equals itself. In symbols ∑ k =0 ∞12 k =1 +12 +14 +18 +116 + ⋯ =2. This comes from the fact that, ∑ k =0 ∞1 n k =1 +1 n −1 for all n ∈ R >1, powers of two are central to the concept of Mersenne primes, and important to computer science. Two is the first Mersenne prime exponent, the square root of 2 was the first known irrational number. The smallest field has two elements, in the set-theoretical construction of the natural numbers,2 is identified with the set
4.
5 (number)
–
5 is a number, numeral, and glyph. It is the number following 4 and preceding 6. Five is the prime number. Because it can be written as 221 +1, five is classified as a Fermat prime, therefore a regular polygon with 5 sides is constructible with compass and unmarked straightedge. 5 is the third Sophie Germain prime, the first safe prime, the third Catalan number, Five is the first Wilson prime and the third factorial prime, also an alternating factorial. Five is the first good prime and it is an Eisenstein prime with no imaginary part and real part of the form 3n −1. It is also the number that is part of more than one pair of twin primes. Five is conjectured to be the only odd number and if this is the case then five will be the only odd prime number that is not the base of an aliquot tree. Five is also the only prime that is the sum of two primes, namely 2 and 3. The number 5 is the fifth Fibonacci number, being 2 plus 3,5 is also a Pell number and a Markov number, appearing in solutions to the Markov Diophantine equation. Whereas 5 is unique in the Fibonacci sequence, in the Perrin sequence 5 is both the fifth and sixth Perrin numbers,5 is the length of the hypotenuse of the smallest integer-sided right triangle. In bases 10 and 20,5 is a 1-automorphic number,5 and 6 form a Ruth–Aaron pair under either definition. There are five solutions to Známs problem of length 6 and this is related to the fact that the symmetric group Sn is a solvable group for n ≤4 and not solvable for n ≥5. While all graphs with 4 or fewer vertices are planar, there exists a graph with 5 vertices which is not planar, K5, Five is also the number of Platonic solids. A polygon with five sides is a pentagon, figurate numbers representing pentagons are called pentagonal numbers. Five is also a square pyramidal number, Five is the only prime number to end in the digit 5, because all other numbers written with a 5 in the ones-place under the decimal system are multiples of five. As a consequence of this,5 is in base 10 a 1-automorphic number, vulgar fractions with 5 or 2 in the denominator do not yield infinite decimal expansions, unlike expansions with all other prime denominators, because they are prime factors of ten, the base. When written in the system, all multiples of 5 will end in either 5 or 0
5.
95 (number)
–
95 is the natural number following 94 and preceding 96. 95 is, the thirtieth distinct semiprime and the fifth of the form, the third composite number in the 6-aliquot tree. The aliquot sum of 95 is 25 within the aliquot sequence, the last member in the third triplet of distinct semiprimes 93,94 and 95. At ninety-five, the Mertens function sets a new high of 2, further, the Saros number of the lunar eclipse series which began on 331 April and ended on 1611 May, with a duration of 1280.1 years and 72 lunar eclipses. Ninety-five is also, The atomic number of americium, an actinide, the number of theses in Martin Luthers 95 Theses. 95 Poems by E. E. Cummings The book The Prince, Utopia, Ninety-Five Thesis by Sir Thomas More The designation of American Interstate 95, U. S. Highway 95, a freeway that runs through the western part of the United States. In Toy Story 3, Woody is seen driving a locomotive at the beginning of the film. The steam locomotives number is 95 in reference to Lightning McQueens racing number, OC Transpo Route 95, A Transitway bus route in Ottawa, Ontario Part of the designation of, Z-95 Headhunter, a fictitious starfighter from the Star Wars Expanded Universe. STS-95 Space Shuttle Discovery mission launched October 28,1998 and it was the historic second space flight for Senator John Glenn. ANSI/ISA-95, or ISA-95, is a standard for developing an automated interface between enterprise and control systems Presidents signal in Phillips Code. A telegraph wire signal used to indicate top priority, +95 is the ITU country code for the Union of Myanmar
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.
Mathematician
–
A mathematician is someone who uses an extensive knowledge of mathematics in his or her work, typically to solve mathematical problems. Mathematics is concerned with numbers, data, quantity, structure, space, models, one of the earliest known mathematicians was Thales of Miletus, he has been hailed as the first true mathematician and the first known individual to whom a mathematical discovery has been attributed. He is credited with the first use of deductive reasoning applied to geometry, the number of known mathematicians grew when Pythagoras of Samos established the Pythagorean School, whose doctrine it was that mathematics ruled the universe and whose motto was All is number. It was the Pythagoreans who coined the term mathematics, and with whom the study of mathematics for its own sake begins, the first woman mathematician recorded by history was Hypatia of Alexandria. She succeeded her father as Librarian at the Great Library and wrote works on applied mathematics. Because of a dispute, the Christian community in Alexandria punished her, presuming she was involved, by stripping her naked. Science and mathematics in the Islamic world during the Middle Ages followed various models and it was extensive patronage and strong intellectual policies implemented by specific rulers that allowed scientific knowledge to develop in many areas. As these sciences received wider attention from the elite, more scholars were invited and funded to study particular sciences, an example of a translator and mathematician who benefited from this type of support was al-Khawarizmi. A notable feature of many working under Muslim rule in medieval times is that they were often polymaths. Examples include the work on optics, maths and astronomy of Ibn al-Haytham, the Renaissance brought an increased emphasis on mathematics and science to Europe. As time passed, many gravitated towards universities. Moving into the 19th century, the objective of universities all across Europe evolved from teaching the “regurgitation of knowledge” to “encourag productive thinking. ”Thus, seminars, overall, science became the focus of universities in the 19th and 20th centuries. Students could conduct research in seminars or laboratories and began to produce doctoral theses with more scientific content. According to Humboldt, the mission of the University of Berlin was to pursue scientific knowledge. ”Mathematicians usually cover a breadth of topics within mathematics in their undergraduate education, and then proceed to specialize in topics of their own choice at the graduate level. In some universities, a qualifying exam serves to test both the breadth and depth of an understanding of mathematics, the students, who pass, are permitted to work on a doctoral dissertation. Mathematicians involved with solving problems with applications in life are called applied mathematicians. Applied mathematicians are mathematical scientists who, with their knowledge and professional methodology. With professional focus on a variety of problems, theoretical systems
8.
Physician
–
Both the role of the physician and the meaning of the word itself vary around the world. Degrees and other qualifications vary widely, but there are common elements, such as medical ethics requiring that physicians show consideration, compassion. Around the world the term refers to a specialist in internal medicine or one of its many sub-specialties. This meaning of physician conveys a sense of expertise in treatment by drugs or medications and this term is at least nine hundred years old in English, physicians and surgeons were once members of separate professions, and traditionally were rivals. Henry VIII granted a charter to the London Royal College of Physicians in 1518 and it was not until 1540 that he granted the Company of Barber/Surgeons its separate charter. In the same year, the English monarch established the Regius Professorship of Physic at the University of Cambridge, newer universities would probably describe such an academic as a professor of internal medicine. Hence, in the 16th century, physic meant roughly what internal medicine does now, currently, a specialist physician in the United States may be described as an internist. Another term, hospitalist, was introduced in 1996, to describe US specialists in internal medicine who work largely or exclusively in hospitals, such hospitalists now make up about 19% of all US general internists, who are often called general physicians in Commonwealth countries. In such places, the more general English terms doctor or medical practitioner are prevalent, in Commonwealth countries, specialist pediatricians and geriatricians are also described as specialist physicians who have sub-specialized by age of patient rather than by organ system. Around the world, the term physician and surgeon is used to describe either a general practitioner or any medical practitioner irrespective of specialty. This usage still shows the meaning of physician and preserves the old difference between a physician, as a practitioner of physic, and a surgeon. The term may be used by state medical boards in the United States of America, in modern English, the term physician is used in two main ways, with relatively broad and narrow meanings respectively. This is the result of history and is often confusing and these meanings and variations are explained below. In the United States and Canada, the term physician describes all medical practitioners holding a professional medical degree, the American Medical Association, established in 1847, as well as the American Osteopathic Association, founded in 1897, both currently use the term physician to describe members. However, the American College of Physicians, established in 1915, does not, its title uses physician in its original sense. A physician trained in the United States has either a Doctor of Medicine degree, all boards of certification now require that physicians demonstrate, by examination, continuing mastery of the core knowledge and skills for a chosen specialty. Recertification varies by particular specialty between every seven and every ten years, graduates of osteopathic medical schools in the United States should not be confused with osteopaths, who are trained in the European and Commonwealth nations. Their training is similar to physical therapy and they are not licensed to prescribe medications or perform surgeries, also in the United States, the American Podiatric Medical Association defines podiatrists as physicians and surgeons that fall under the department of surgery in hospitals
9.
Astronomer
–
An astronomer is a scientist in the field of astronomy who concentrates their studies on a specific question or field outside of the scope of Earth. They look at stars, planets, moons, comets and galaxies, as well as other celestial objects — either in observational astronomy. Examples of topics or fields astronomers work on include, planetary science, solar astronomy, there are also related but distinct subjects like physical cosmology which studies the Universe as a whole. Astronomers usually fit into two types, Observational astronomers make direct observations of planets, stars and galaxies, and analyze the data, theoretical astronomers create and investigate models of things that cannot be observed. They use this data to create models or simulations to theorize how different celestial bodies work, there are further subcategories inside these two main branches of astronomy such as planetary astronomy, galactic astronomy or physical cosmology. Today, that distinction has disappeared and the terms astronomer. Professional astronomers are highly educated individuals who typically have a Ph. D. in physics or astronomy and are employed by research institutions or universities. They spend the majority of their time working on research, although quite often have other duties such as teaching, building instruments. The number of astronomers in the United States is actually quite small. The American Astronomical Society, which is the organization of professional astronomers in North America, has approximately 7,000 members. This number includes scientists from other such as physics, geology. The International Astronomical Union comprises almost 10,145 members from 70 different countries who are involved in research at the Ph. D. level. Before CCDs, photographic plates were a method of observation. Modern astronomers spend relatively little time at telescopes usually just a few weeks per year, analysis of observed phenomena, along with making predictions as to the causes of what they observe, takes the majority of observational astronomers time. Astronomers who serve as faculty spend much of their time teaching undergraduate and graduate classes, most universities also have outreach programs including public telescope time and sometimes planetariums as a public service to encourage interest in the field. Those who become astronomers usually have a background in maths, sciences. Taking courses that teach how to research, write and present papers are also invaluable, in college/university most astronomers get a Ph. D. in astronomy or physics. Keeping in mind how few there are it is understood that graduate schools in this field are very competitive
10.
Translation
–
Translation is the communication of the meaning of a source-language text by means of an equivalent target-language text. While interpreting—the facilitating of oral or sign-language communication between users of different languages—antedates writing, translation began only after the appearance of written literature, there exist partial translations of the Sumerian Epic of Gilgamesh into Southwest Asian languages of the second millennium BCE. Translators always risk inappropriate spill-over of source-language idiom and usage into the target-language translation, on the other hand, spill-overs have imported useful source-language calques and loanwords that have enriched the target languages. Indeed, translators have helped substantially to shape the languages into which they have translated, because of the laboriousness of translation, since the 1940s engineers have sought to automate translation or to mechanically aid the human translator. The rise of the Internet has fostered a world-wide market for services and has facilitated language localization. Translation studies systematically study the theory and practice of translation, the English word translation derives from the Latin word translatio, which comes from trans, across + ferre, to carry or to bring. Thus translatio is a carrying across or a bringing across, in this case, the Germanic languages and some Slavic languages have calqued their words for the concept of translation on translatio. The Romance languages and the remaining Slavic languages have derived their words for the concept of translation from an alternative Latin word, traductio, the Ancient Greek term for translation, μετάφρασις, has supplied English with metaphrase — as contrasted with paraphrase. Metaphrase corresponds, in one of the more recent terminologies, to formal equivalence, nevertheless, metaphrase and paraphrase may be useful as ideal concepts that mark the extremes in the spectrum of possible approaches to translation. Discussions of the theory and practice of translation reach back into antiquity, the ancient Greeks distinguished between metaphrase and paraphrase. Literally graceful, it were an injury to the author that they should be changed, Dryden cautioned, however, against the license of imitation, i. e. of adapted translation, When a painter copies from the life. He has no privilege to alter features and lineaments, despite occasional theoretical diversity, the actual practice of translation has hardly changed since antiquity. The grammatical differences between languages and free-word-order languages have been no impediment in this regard. The particular syntax characteristics of a source language are adjusted to the syntactic requirements of the target language. When a target language has lacked terms that are found in a language, translators have borrowed those terms. However, due to shifts in ecological niches of words, an etymology is sometimes misleading as a guide to current meaning in one or the other language. For example, the English actual should not be confused with the cognate French actuel, the Polish aktualny, the Swedish aktuell, the translators role as a bridge for carrying across values between cultures has been discussed at least since Terence, the 2nd-century-BCE Roman adapter of Greek comedies. The translators role is, however, by no means a passive, mechanical one, the main ground seems to be the concept of parallel creation found in critics such as Cicero
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
12.
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
13.
Distributed computing
–
Distributed computing is a field of computer science that studies distributed systems. A distributed system is a model in which components located on networked computers communicate and coordinate their actions by passing messages, the components interact with each other in order to achieve a common goal. Three significant characteristics of distributed systems are, concurrency of components, lack of a global clock, examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications. A computer program that runs in a system is called a distributed program. There are many alternatives for the message passing mechanism, including pure HTTP, RPC-like connectors, Distributed computing also refers to the use of distributed systems to solve computational problems. In distributed computing, a problem is divided into many tasks, each of which is solved by one or more computers, which communicate with each other by message passing. The terms are used in a much wider sense, even referring to autonomous processes that run on the same physical computer. The entities communicate with each other by message passing, a distributed system may have a common goal, such as solving a large computational problem, the user then perceives the collection of autonomous processors as a unit. Other typical properties of distributed systems include the following, The system has to tolerate failures in individual computers. The structure of the system is not known in advance, the system may consist of different kinds of computers and network links, each computer has only a limited, incomplete view of the system. Each computer may know one part of the input. Distributed systems are groups of networked computers, which have the goal for their work. The terms concurrent computing, parallel computing, and distributed computing have a lot of overlap, the same system may be characterized both as parallel and distributed, the processors in a typical distributed system run concurrently in parallel. Parallel computing may be seen as a tightly coupled form of distributed computing. In distributed computing, each processor has its own private memory, Information is exchanged by passing messages between the processors. The figure on the right illustrates the difference between distributed and parallel systems, figure shows a parallel system in which each processor has a direct access to a shared memory. The situation is complicated by the traditional uses of the terms parallel and distributed algorithm that do not quite match the above definitions of parallel. The use of concurrent processes that communicate by message-passing has its roots in operating system architectures studied in the 1960s, the first widespread distributed systems were local-area networks such as Ethernet, which was invented in the 1970s
14.
PrimeGrid
–
PrimeGrid is a distributed computing project for searching for prime numbers of world-record size. It makes use of the Berkeley Open Infrastructure for Network Computing platform, PrimeGrid started in June 2005 under the name Message@home and tried to decipher text fragments hashed with MD5. Message@home was a test to port the BOINC scheduler to Perl to obtain greater portability, after a while the project attempted the RSA factoring challenge trying to factor RSA-640. After RSA-640 was factored by a team in November 2005. With the chance to succeed too small, it discarded the RSA challenges, was renamed to PrimeGrid, at 210,000,000,000 the primegen subproject was stopped. In June 2006, dialog started with Riesel Sieve to bring their project to the BOINC community, PrimeGrid provided PerlBOINC support and Riesel Sieve was successful in implementing their sieve as well as a prime finding application. With collaboration from Riesel Sieve, PrimeGrid was able to implement the LLR application in partnership with another prime finding project, in November 2006, the TPS LLR application was officially released at PrimeGrid. Less than two months later, January 2007, the twin was found by the original manual project. PrimeGrid and TPS then advanced their search for even larger twin primes, the summer of 2007 was very active as the Cullen and Woodall prime searches were launched. In the Fall, more prime searches were added through partnerships with the Prime Sierpinski Problem, additionally, two sieves were added, the Prime Sierpinski Problem combined sieve which includes supporting the Seventeen or Bust sieve, and the combined Cullen/Woodall sieve. In the Fall of 2007, PrimeGrid migrated its systems from PerlBOINC to standard BOINC software, since September 2008, PrimeGrid is also running a Proth prime sieving subproject. In January 2010 the subproject Seventeen or Bust was added, the calculations for the Riesel problem followed in March 2010. In addition, PrimeGrid is helping test for a record Sophie Germain prime. As of March 2016, PrimeGrid is working on or has worked on the projects,321 Prime Search is a continuation of Paul Underwoods 321 Search which looked for primes of the form 3 · 2n −1. PrimeGrid added the +1 form and continues the search up to n = 25M, the search was successful in April 2010 with the finding of the first known AP26,43142746595714191 +23681770 · 23# · n is prime for n =0. 23# = 2·3·5·7·11·13·17·19·23 =223092870, or 23 primorial, is the product of all primes up to 23, PrimeGrid is also running a search for Cullen prime numbers, yielding the two largest known Cullen primes. The first one being the 14th largest known prime at the time of discovery, as of 9 March 2014 PrimeGrid has eliminated 14 values of k from the Riesel problem and is continuing the search to eliminate the 50 remaining numbers. Primegrid then worked with the Twin Prime Search to search for a twin prime at approximately 58700 digits
15.
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
16.
Mersenne prime
–
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a number that can be written in the form Mn = 2n −1 for some integer n. They are named after Marin Mersenne, a French Minim friar, the first four Mersenne primes are 3,7,31, and 127. If n is a number then so is 2n −1. The definition is therefore unchanged when written Mp = 2p −1 where p is assumed prime, more generally, numbers of the form Mn = 2n −1 without the primality requirement are called Mersenne numbers. The smallest composite pernicious Mersenne number is 211 −1 =2047 =23 ×89, Mersenne primes Mp are also noteworthy due to their connection to perfect numbers. As of January 2016,49 Mersenne primes are known, the largest known prime number 274,207,281 −1 is a Mersenne prime. Since 1997, all newly found Mersenne primes have been discovered by the “Great Internet Mersenne Prime Search”, many fundamental questions about Mersenne primes remain unresolved. It is not even whether the set of Mersenne primes is finite or infinite. The Lenstra–Pomerance–Wagstaff conjecture asserts that there are infinitely many Mersenne primes,23 | M11,47 | M23,167 | M83,263 | M131,359 | M179,383 | M191,479 | M239, and 503 | M251. Since for these primes p, 2p +1 is congruent to 7 mod 8, so 2 is a quadratic residue mod 2p +1, since p is a prime, it must be p or 1. The first four Mersenne primes are M2 =3, M3 =7, M5 =31, a basic theorem about Mersenne numbers states that if Mp is prime, then the exponent p must also be prime. This follows from the identity 2 a b −1 = ⋅ = ⋅ and this rules out primality for Mersenne numbers with composite exponent, such as M4 =24 −1 =15 =3 ×5 = ×. Though the above examples might suggest that Mp is prime for all p, this is not the case. The evidence at hand does suggest that a randomly selected Mersenne number is more likely to be prime than an arbitrary randomly selected odd integer of similar size. Nonetheless, prime Mp appear to grow increasingly sparse as p increases, in fact, of the 2,270,720 prime numbers p up to 37,156,667, Mp is prime for only 45 of them. The lack of any simple test to determine whether a given Mersenne number is prime makes the search for Mersenne primes a difficult task, the Lucas–Lehmer primality test is an efficient primality test that greatly aids this task. The search for the largest known prime has somewhat of a cult following, consequently, a lot of computer power has been expended searching for new Mersenne primes, much of which is now done using distributed computing
17.
Pythagorean prime
–
A Pythagorean prime is a prime number of the form 4n +1. Pythagorean primes are exactly the odd numbers that are the sum of two squares. For instance, the number 5 is a Pythagorean prime, √5 is the hypotenuse of a triangle with legs 1 and 2. The first few Pythagorean primes are 5,13,17,29,37,41,53,61,73,89,97,101,109,113, by Dirichlets theorem on arithmetic progressions, this sequence is infinite. More strongly, for n, the numbers of Pythagorean and non-Pythagorean primes up to n are approximately equal. However, the number of Pythagorean primes up to n is frequently smaller than the number of non-Pythagorean primes. For example, the values of n up to 600000 for which there are more Pythagorean than non-Pythagorean odd primes are 26861 and 26862. Sum of one odd square and one square is congruent to 1 mod 4. Fermats theorem on sums of two states that the prime numbers that can be represented as sums of two squares are exactly 2 and the odd primes congruent to 1 mod 4. The representation of such number is unique, up to the ordering of the two squares. Another way to understand this representation as a sum of two squares involves Gaussian integers, the numbers whose real part and imaginary part are both integers. The norm of a Gaussian integer x + yi is the number x2 + y2, thus, the Pythagorean primes occur as norms of Gaussian integers, while other primes do not. Within the Gaussian integers, the Pythagorean primes are not considered to be prime numbers, similarly, their squares can be factored in a different way than their integer factorization, as p2 =22 =. The real and imaginary parts of the factors in these factorizations are the leg lengths of the right triangles having the given hypotenuses, in the finite field Z/p with p a Pythagorean prime, the polynomial equation x2 = −1 has two solutions. This may be expressed by saying that −1 is a quadratic residue mod p, in contrast, this equation has no solution in the finite fields Z/p where p is an odd prime but is not Pythagorean. Pythagorean Primes, including 5,13 and 137, sloanes A007350, Where prime race 4n-1 vs. 4n+1 changes leader. The On-Line Encyclopedia of Integer Sequences
18.
Pierpont prime
–
A Pierpont prime is a prime number of the form 2 u 3 v +1 for some nonnegative integers u and v. That is, they are the prime numbers p for which p −1 is 3-smooth. They are named after the mathematician James Pierpont, who introduced them in the study of regular polygons that can be constructed using conic sections. It is possible to prove that if v =0 and u >0, then u must be a power of 2, if v is positive then u must also be positive, and the Pierpont prime is of the form 6k +1. Empirically, the Pierpont primes do not seem to be rare or sparsely distributed. There are 36 Pierpont primes less than 106,59 less than 109,151 less than 1020, there are few restrictions from algebraic factorisations on the Pierpont primes, so there are no requirements like the Mersenne prime condition that the exponent must be prime. As there are Θ numbers of the form in this range. Andrew M. Gleason made this explicit, conjecturing there are infinitely many Pierpont primes. According to Gleasons conjecture there are Θ Pierpont primes smaller than N, when 2 u >3 v, the primality of 2 u 3 v +1 can be tested by Proths theorem. As part of the ongoing search for factors of Fermat numbers. The following table gives values of m, k, and n such that k ⋅2 n +1 divides 22 m +1, the left-hand side is a Pierpont prime when k is a power of 3, the right-hand side is a Fermat number. As of 2017, the largest known Pierpont prime is 3 ×210829346 +1, whose primality was discovered by Sai Yik Tang, in the mathematics of paper folding, the Huzita axioms define six of the seven types of fold possible. It has been shown that these folds are sufficient to allow the construction of the points that solve any cubic equation. It follows that they allow any regular polygon of N sides to be formed, as long as N >3 and of the form 2m3nρ and this is the same class of regular polygons as those that can be constructed with a compass, straightedge, and angle-trisector. Regular polygons which can be constructed with compass and straightedge are the special case where n =0 and ρ is a product of distinct Fermat primes, themselves a subset of Pierpont primes. In 1895, James Pierpont studied the same class of regular polygons, Pierpont generalized compass and straightedge constructions in a different way, by adding the ability to draw conic sections whose coefficients come from previously constructed points. As he showed, the regular N-gons that can be constructed with these operations are the ones such that the totient of N is 3-smooth. Since the totient of a prime is formed by subtracting one from it, however, Pierpont did not describe the form of the composite numbers with 3-smooth totients. As Gleason later showed, these numbers are exactly the ones of the form 2m3nρ given above, the smallest prime that is not a Pierpont prime is 11, therefore, the hendecagon is the smallest regular polygon that cannot be constructed with compass, straightedge and angle trisector