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.
Infinite series
–
In mathematics, a series is, informally speaking, the sum of the terms of an infinite sequence. The sum of a sequence has defined first and last terms. To emphasize that there are a number of terms, a series is often called an infinite series. In order to make the notion of an infinite sum mathematically rigorous, given an infinite sequence, the associated series is the expression obtained by adding all those terms together, a 1 + a 2 + a 3 + ⋯. These can be written compactly as ∑ i =1 ∞ a i, by using the summation symbol ∑. The sequence can be composed of any kind of object for which addition is defined. A series is evaluated by examining the finite sums of the first n terms of a sequence, called the nth partial sum of the sequence, and taking the limit as n approaches infinity. If this limit does not exist, the infinite sum cannot be assigned a value, and, in this case, the series is said to be divergent. On the other hand, if the partial sums tend to a limit when the number of terms increases indefinitely, then the series is said to be convergent, and the limit is called the sum of the series. An example is the series from Zenos dichotomy and its mathematical representation, ∑ n =1 ∞12 n =12 +14 +18 + ⋯. The study of series is a part of mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures, in addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance. For any sequence of numbers, real numbers, complex numbers, functions thereof. By definition the series ∑ n =0 ∞ a n converges to a limit L if and this definition is usually written as L = ∑ n =0 ∞ a n ⇔ L = lim k → ∞ s k. When the index set is the natural numbers I = N, a series indexed on the natural numbers is an ordered formal sum and so we rewrite ∑ n ∈ N as ∑ n =0 ∞ in order to emphasize the ordering induced by the natural numbers. Thus, we obtain the common notation for a series indexed by the natural numbers ∑ n =0 ∞ a n = a 0 + a 1 + a 2 + ⋯. When the semigroup G is also a space, then the series ∑ n =0 ∞ a n converges to an element L ∈ G if. This definition is usually written as L = ∑ n =0 ∞ a n ⇔ L = lim k → ∞ s k, a series ∑an is said to converge or to be convergent when the sequence SN of partial sums has a finite limit

3.
Geometric series
–
In mathematics, a geometric series is a series with a constant ratio between successive terms. For example, the series 12 +14 +18 +116 + ⋯ is geometric, Geometric series are among the simplest examples of infinite series with finite sums, although not all of them have this property. Historically, geometric series played an important role in the development of calculus. Geometric series are used throughout mathematics, and they have important applications in physics, engineering, biology, economics, computer science, queueing theory, the terms of a geometric series form a geometric progression, meaning that the ratio of successive terms in the series is constant. This relationship allows for the representation of a series using only two terms, r and a. The term r is the ratio, and a is the first term of the series. In the case above, where r is one half, the series has the sum one, if r is greater than one or less than minus one the terms of the series become larger and larger in magnitude. The sum of the terms also gets larger and larger, if r is equal to one, all of the terms of the series are the same. If r is one the terms take two values alternately. The sum of the oscillates between two values. This is a different type of divergence and again the series has no sum, see for example Grandis series,1 −1 +1 −1 + ···. The sum can be computed using the self-similarity of the series, consider the sum of the following geometric series, s =1 +23 +49 +827 + ⋯. This series has common ratio 2/3, if we multiply through by this common ratio, then the initial 1 becomes a 2/3, the 2/3 becomes a 4/9, and so on,23 s =23 +49 +827 +1681 + ⋯. This new series is the same as the original, except that the first term is missing, subtracting the new series s from the original series s cancels every term in the original but the first, s −23 s =1, so s =3. A similar technique can be used to evaluate any self-similar expression, as n goes to infinity, the absolute value of r must be less than one for the series to converge. When a =1, this can be simplified to 1 + r + r 2 + r 3 + ⋯ =11 − r, the formula also holds for complex r, with the corresponding restriction, the modulus of r is strictly less than one. Since = 1−rn+1 and rn+1 →0 for | r | <1, convergence of geometric series can also be demonstrated by rewriting the series as an equivalent telescoping series. Consider the function, g = r K1 − r

4.
Series (mathematics)
–
In mathematics, a series is, informally speaking, the sum of the terms of an infinite sequence. The sum of a sequence has defined first and last terms. To emphasize that there are a number of terms, a series is often called an infinite series. In order to make the notion of an infinite sum mathematically rigorous, given an infinite sequence, the associated series is the expression obtained by adding all those terms together, a 1 + a 2 + a 3 + ⋯. These can be written compactly as ∑ i =1 ∞ a i, by using the summation symbol ∑. The sequence can be composed of any kind of object for which addition is defined. A series is evaluated by examining the finite sums of the first n terms of a sequence, called the nth partial sum of the sequence, and taking the limit as n approaches infinity. If this limit does not exist, the infinite sum cannot be assigned a value, and, in this case, the series is said to be divergent. On the other hand, if the partial sums tend to a limit when the number of terms increases indefinitely, then the series is said to be convergent, and the limit is called the sum of the series. An example is the series from Zenos dichotomy and its mathematical representation, ∑ n =1 ∞12 n =12 +14 +18 + ⋯. The study of series is a part of mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures, in addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance. For any sequence of numbers, real numbers, complex numbers, functions thereof. By definition the series ∑ n =0 ∞ a n converges to a limit L if and this definition is usually written as L = ∑ n =0 ∞ a n ⇔ L = lim k → ∞ s k. When the index set is the natural numbers I = N, a series indexed on the natural numbers is an ordered formal sum and so we rewrite ∑ n ∈ N as ∑ n =0 ∞ in order to emphasize the ordering induced by the natural numbers. Thus, we obtain the common notation for a series indexed by the natural numbers ∑ n =0 ∞ a n = a 0 + a 1 + a 2 + ⋯. When the semigroup G is also a space, then the series ∑ n =0 ∞ a n converges to an element L ∈ G if. This definition is usually written as L = ∑ n =0 ∞ a n ⇔ L = lim k → ∞ s k, a series ∑an is said to converge or to be convergent when the sequence SN of partial sums has a finite limit

5.
Limit of a sequence
–
In mathematics, the limit of a sequence is the value that the terms of a sequence tend to. If such a limit exists, the sequence is called convergent, a sequence which does not converge is said to be divergent. The limit of a sequence is said to be the fundamental notion on which the whole of analysis ultimately rests, limits can be defined in any metric or topological space, but are usually first encountered in the real numbers. The Greek philosopher Zeno of Elea is famous for formulating paradoxes that involve limiting processes, leucippus, Democritus, Antiphon, Eudoxus and Archimedes developed the method of exhaustion, which uses an infinite sequence of approximations to determine an area or a volume. Archimedes succeeded in summing what is now called a geometric series, Newton dealt with series in his works on Analysis with infinite series, Method of fluxions and infinite series and Tractatus de Quadratura Curvarum. In the latter work, Newton considers the binomial expansion of n which he then linearizes by taking limits, at the end of the century, Lagrange in his Théorie des fonctions analytiques opined that the lack of rigour precluded further development in calculus. Gauss in his etude of hypergeometric series for the first time rigorously investigated under which conditions a series converged to a limit, the modern definition of a limit was given by Bernhard Bolzano and by Karl Weierstrass in the 1870s. In the real numbers, a number L is the limit of the if the numbers in the sequence become closer and closer to L. If x n = c for some constant c, then x n → c, if x n =1 n, then x n →0. If x n =1 / n when n is even, given any real number, one may easily construct a sequence that converges to that number by taking decimal approximations. For example, the sequence 0.3,0.33,0.333,0.3333, note that the decimal representation 0.3333. is the limit of the previous sequence, defined by 0.3333. ≜ lim n → ∞ ∑ i =1 n 310 i, finding the limit of a sequence is not always obvious. Two examples are lim n → ∞ n and the Arithmetic–geometric mean, the squeeze theorem is often useful in such cases. In other words, for measure of closeness ϵ, the sequences terms are eventually that close to the limit. The sequence is said to converge to or tend to the limit x, symbolically, this is, ∀ ϵ >0 ∃ N ∈ R ∀ n ∈ N. If a sequence converges to some limit, then it is convergent, limits of sequences behave well with respect to the usual arithmetic operations. For any continuous function f, if x n → x then f → f, in fact, any real-valued function f is continuous if and only if it preserves the limits of sequences. Some other important properties of limits of sequences include the following

6.
Zeno's paradoxes
–
It is usually assumed, based on Platos Parmenides, that Zeno took on the project of creating these paradoxes because other philosophers had created paradoxes against Parmenides view. Plato has Socrates claim that Zeno and Parmenides were essentially arguing exactly the same point, some of Zenos nine surviving paradoxes are essentially equivalent to one another. Aristotle offered a refutation of some of them, three of the strongest and most famous—that of Achilles and the tortoise, the Dichotomy argument, and that of an arrow in flight—are presented in detail below. Zenos arguments are perhaps the first examples of a method of proof called reductio ad absurdum also known as proof by contradiction and they are also credited as a source of the dialectic method used by Socrates. Some mathematicians and historians, such as Carl Boyer, hold that Zenos paradoxes are simply mathematical problems, some philosophers, however, say that Zenos paradoxes and their variations remain relevant metaphysical problems. The origins of the paradoxes are somewhat unclear, Diogenes Laertius, a fourth source for information about Zeno and his teachings, citing Favorinus, says that Zenos teacher Parmenides was the first to introduce the Achilles and the tortoise paradox. But in a passage, Laertius attributes the origin of the paradox to Zeno. In a race, the quickest runner can never overtake the slowest, since the pursuer must first reach the point whence the pursued started, so that the slower must always hold a lead. – as recounted by Aristotle, Physics VI,9, 239b15 In the paradox of Achilles, Achilles allows the tortoise a head start of 100 meters, for example. If we suppose that each racer starts running at constant speed, then after some finite time, Achilles will have run 100 meters. During this time, the tortoise has run a shorter distance. Thus, whenever Achilles reaches somewhere the tortoise has been, he still has farther to go, therefore, because there are an infinite number of points Achilles must reach where the tortoise has already been, he can never overtake the tortoise. That which is in locomotion must arrive at the stage before it arrives at the goal. – as recounted by Aristotle, Physics VI,9. Before he can get there, he must get halfway there, before he can get halfway there, he must get a quarter of the way there. Before traveling a quarter, he must travel one-eighth, before an eighth, one-sixteenth, the resulting sequence can be represented as, This description requires one to complete an infinite number of tasks, which Zeno maintains is an impossibility. This sequence also presents a problem in that it contains no first distance to run, for any possible first distance could be divided in half. Hence, the trip cannot even begin, the paradoxical conclusion then would be that travel over any finite distance can neither be completed nor begun, and so all motion must be an illusion. An alternative conclusion, proposed by Henri Bergson, is that motion is not actually divisible and this argument is called the Dichotomy because it involves repeatedly splitting a distance into two parts

7.
Eye of Horus
–
The Eye of Horus is an ancient Egyptian symbol of protection, royal power and good health. The eye is personified in the goddess Wadjet, the Eye of Horus is similar to the Eye of Ra, which belongs to a different god, Ra, but represents many of the same concepts. Wadjet was one of the earliest of Egyptian deities who later associated with other goddesses such as Bast, Sekhmet, Mut. She was the deity of Lower Egypt and the major Delta shrine the per-nu was under her protection. Hathor is also depicted with this eye, funerary amulets were often made in the shape of the Eye of Horus. The Wadjet or Eye of Horus is the element of seven gold, faience, carnelian. The Wedjat was intended to protect the pharaoh in the afterlife, Ancient Egyptian and Middle-Eastern sailors would frequently paint the symbol on the bow of their vessel to ensure safe sea travel. Horus was the ancient Egyptian sky god who was depicted as a falcon. His right eye was associated with the sun god, Ra, the eye symbol represents the marking around the eye of the falcon, including the teardrop marking sometimes found below the eye. The mirror image, or left eye, sometimes represented the moon, in one myth, when Set and Horus were fighting for the throne after Osiriss death, Set gouged out Horuss left eye. The majority of the eye was restored by either Hathor or Thoth, when Horuss eye was recovered, he offered it to his father, Osiris, in hopes of restoring his life. Hence, the eye of Horus was often used to sacrifice, healing, restoration. There are seven different hieroglyphs used to represent the eye, most commonly ir. t in Egyptian, in Egyptian myth the eye was not the passive organ of sight but more an agent of action, protection or wrath. The Eye of Horus was represented as a hieroglyph, designated D10 in Gardiners sign list and it is represented in the Unicode character block for Egyptian hieroglyphs as U+13080. In Ancient Egyptian most fractions were written as the sum of two or more unit fractions, with scribes possessing tables of answers, thus instead of 3⁄4, one would write 1⁄2 + 1⁄4. Studies from the 1970s to this day in Egyptian mathematics have clearly shown this theory was fallacious, the evolution of the symbols used in mathematics, although similar to the different parts of the Eye of Horus, is now known to be distinct. Wadjet eye tatoos associated with Hathor depicted on 3, 000-year-old mummy

8.
Dotted note
–
In Western musical notation, a dotted note is a note with a small dot written after it. In modern practice the first dot increases the duration of the note by half of its original value. A dotted note is equivalent to writing the basic note tied to a note of half the value, or with more than one dot, a rhythm using longer notes alternating with shorter notes is sometimes called a dotted rhythm. Historical examples of performance styles using dotted rhythm include notes inégales. The precise performance of dotted rhythms can be a complex issue, even in notation that includes dots, their performed values may be longer than the dot mathematically indicates, a practice known as over-dotting. If the note to be dotted is on a space, the dot goes on the space, while if the note is on a line. Theoretically, any note value can be dotted, as can rests of any value, if the rest is in its normal position, dots are always placed in third staff space from the bottom. The use of a dot for augmentation of a note dates back at least to the 10th century, although the amount of augmentation is disputed. More than one dot may be added, each dot adds half of the duration added by the previous dot, a double-dotted note is a note with two small dots written after it. Its duration is 1 3⁄4 times its basic note value, the double-dotted note is used less frequently than the dotted note. Typically, as in the example below, it is followed by a note whose duration is one-quarter the length of the note value. Before the mid 18th century, double dots were not used, until then, in some circumstances, single dots could mean double dots. Example 2 is a fragment of the movement of Joseph Haydns string quartet, Op.74. Haydns theme was adapted for piano by a composer, the adapted version can be heard here. In a French overture, notes written as dotted notes are often interpreted to mean double-dotted notes, a triple-dotted note is a note with three dots written after it, its duration is 1 7⁄8 times its basic note value. Use of a note value is not common in the Baroque and Classical periods. An example of the use of double- and triple-dotted notes is the Prelude in G major for piano, Op.28, the piece, in common time, contains running semiquavers in the left hand. Several times during the piece Chopin asks for the hand to play a triple-dotted minim

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

10.
Sequence
–
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed. Like a set, it contains members, the number of elements is called the length of the sequence. Unlike a set, order matters, and exactly the elements can appear multiple times at different positions in the sequence. Formally, a sequence can be defined as a function whose domain is either the set of the numbers or the set of the first n natural numbers. The position of an element in a sequence is its rank or index and it depends on the context or of a specific convention, if the first element has index 0 or 1. For example, is a sequence of letters with the letter M first, also, the sequence, which contains the number 1 at two different positions, is a valid sequence. Sequences can be finite, as in these examples, or infinite, the empty sequence is included in most notions of sequence, but may be excluded depending on the context. A sequence can be thought of as a list of elements with a particular order, Sequences are useful in a number of mathematical disciplines for studying functions, spaces, and other mathematical structures using the convergence properties of sequences. In particular, sequences are the basis for series, which are important in differential equations, Sequences are also of interest in their own right and can be studied as patterns or puzzles, such as in the study of prime numbers. There are a number of ways to denote a sequence, some of which are useful for specific types of sequences. One way to specify a sequence is to list the elements, for example, the first four odd numbers form the sequence. This notation can be used for sequences as well. For instance, the sequence of positive odd integers can be written. Listing is most useful for sequences with a pattern that can be easily discerned from the first few elements. Other ways to denote a sequence are discussed after the examples, the prime numbers are the natural numbers bigger than 1, that have no divisors but 1 and themselves. Taking these in their natural order gives the sequence, the prime numbers are widely used in mathematics and specifically in number theory. The Fibonacci numbers are the integer sequence whose elements are the sum of the two elements. The first two elements are either 0 and 1 or 1 and 1 so that the sequence is, for a large list of examples of integer sequences, see On-Line Encyclopedia of Integer Sequences

11.
Geometric progression
–
For example, the sequence 2,6,18,54. is a geometric progression with common ratio 3. Similarly 10,5,2.5,1.25. is a sequence with common ratio 1/2. Examples of a sequence are powers rk of a fixed number r, such as 2k. The general form of a sequence is a, a r, a r 2, a r 3, a r 4, … where r ≠0 is the common ratio. The n-th term of a sequence with initial value a. Such a geometric sequence also follows the relation a n = r a n −1 for every integer n ≥1. Generally, to whether a given sequence is geometric, one simply checks whether successive entries in the sequence all have the same ratio. The common ratio of a sequence may be negative, resulting in an alternating sequence, with numbers switching from positive to negative. For instance 1, −3,9, −27,81, the behaviour of a geometric sequence depends on the value of the common ratio. If the common ratio is, Positive, the terms will all be the sign as the initial term. Negative, the terms will alternate between positive and negative, greater than 1, there will be exponential growth towards positive or negative infinity. 1, the progression is a constant sequence, between −1 and 1 but not zero, there will be exponential decay towards zero. −1, the progression is an alternating sequence Less than −1, for the absolute values there is exponential growth towards infinity, due to the alternating sign. Geometric sequences show exponential growth or exponential decay, as opposed to the growth of an arithmetic progression such as 4,15,26,37,48. This result was taken by T. R. Malthus as the foundation of his Principle of Population. A geometric series is the sum of the numbers in a geometric progression, for example,2 +10 +50 +250 =2 +2 ×5 +2 ×52 +2 ×53. The formula works for any real numbers a and r. For example, −2 π +4 π2 −8 π3 = −2 π +2 +3 = −2 π1 − = −2 π1 +2 π ≈ −214.855

12.
Square number
–
In mathematics, a square number or perfect square is an integer that is the square of an integer, in other words, it is the product of some integer with itself. For example,9 is a number, since it can be written as 3 × 3. The usual notation for the square of a n is not the product n × n. The name square number comes from the name of the shape, another way of saying that a integer is a square number, is that its square root is again an integer. For example, √9 =3, so 9 is a square number, a positive integer that has no perfect square divisors except 1 is called square-free. For a non-negative integer n, the nth square number is n2, the concept of square can be extended to some other number systems. If rational numbers are included, then a square is the ratio of two integers, and, conversely, the ratio of two square integers is a square, e. g.49 =2. Starting with 1, there are ⌊√m⌋ square numbers up to and including m, the squares smaller than 602 =3600 are, The difference between any perfect square and its predecessor is given by the identity n2 −2 = 2n −1. Equivalently, it is possible to count up square numbers by adding together the last square, the last squares root, and the current root, that is, n2 =2 + + n. The number m is a number if and only if one can compose a square of m equal squares. Hence, a square with side length n has area n2, the expression for the nth square number is n2. This is also equal to the sum of the first n odd numbers as can be seen in the above pictures, the formula follows, n 2 = ∑ k =1 n. So for example,52 =25 =1 +3 +5 +7 +9, there are several recursive methods for computing square numbers. For example, the nth square number can be computed from the square by n2 =2 + + n =2 +. Alternatively, the nth square number can be calculated from the two by doubling the th square, subtracting the th square number, and adding 2. For example, 2 × 52 −42 +2 = 2 × 25 −16 +2 =50 −16 +2 =36 =62, a square number is also the sum of two consecutive triangular numbers. The sum of two square numbers is a centered square number. Every odd square is also an octagonal number

13.
Cube (algebra)
–
In arithmetic and algebra, the cube of a number n is its third power, the result of the number multiplied by itself twice, n3 = n × n × n. It is also the number multiplied by its square, n3 = n × n2 and this is also the volume formula for a geometric cube with sides of length n, giving rise to the name. The inverse operation of finding a number whose cube is n is called extracting the cube root of n and it determines the side of the cube of a given volume. It is also n raised to the one-third power, both cube and cube root are odd functions,3 = −. The cube of a number or any other mathematical expression is denoted by a superscript 3, a cube number, or a perfect cube, or sometimes just a cube, is a number which is the cube of an integer. The perfect cubes up to 603 are, Geometrically speaking, an integer m is a perfect cube if and only if one can arrange m solid unit cubes into a larger. For example,27 small cubes can be arranged into one larger one with the appearance of a Rubiks Cube, the difference between the cubes of consecutive integers can be expressed as follows, n3 −3 = 3n +1. There is no minimum perfect cube, since the cube of an integer is negative. For example, −4 × −4 × −4 = −64, unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25,75 and 00 can be the last two digits, any pair of digits with the last digit odd can be a perfect cube. With even cubes, there is considerable restriction, for only 00, o2, e4, o6, some cube numbers are also square numbers, for example,64 is a square number and a cube number. This happens if and only if the number is a perfect sixth power, the last digits of each 3rd power are, It is, however, easy to show that most numbers are not perfect cubes because all perfect cubes must have digital root 1,8 or 9. That is their values modulo 9 may be only −1,1 and 0, every positive integer can be written as the sum of nine positive cubes. The equation x3 + y3 = z3 has no solutions in integers. In fact, it has none in Eisenstein integers, both of these statements are also true for the equation x3 + y3 = 3z3. The sum of the first n cubes is the nth triangle number squared,13 +23 + ⋯ + n 3 =2 =2. Proofs Charles Wheatstone gives a simple derivation, by expanding each cube in the sum into a set of consecutive odd numbers. Indeed, he begins by giving the identity n 3 = + + + ⋯ + ⏟ n consecutive odd numbers, kanim provides a purely visual proof, Benjamin & Orrison provide two additional proofs, and Nelsen gives seven geometric proofs

14.
Factorial
–
In mathematics, the factorial of a non-negative integer n, denoted by n. is the product of all positive integers less than or equal to n. =5 ×4 ×3 ×2 ×1 =120, the value of 0. is 1, according to the convention for an empty product. The factorial operation is encountered in areas of mathematics, notably in combinatorics, algebra. Its most basic occurrence is the fact there are n. ways to arrange n distinct objects into a sequence. This fact was known at least as early as the 12th century, fabian Stedman, in 1677, described factorials as applied to change ringing. After describing a recursive approach, Stedman gives a statement of a factorial, Now the nature of these methods is such, the factorial function is formally defined by the product n. = ∏ k =1 n k, or by the relation n. = {1 if n =0. The factorial function can also be defined by using the rule as n. All of the above definitions incorporate the instance 0, =1, in the first case by the convention that the product of no numbers at all is 1. This is convenient because, There is exactly one permutation of zero objects, = n. ×, valid for n >0, extends to n =0. It allows for the expression of many formulae, such as the function, as a power series. It makes many identities in combinatorics valid for all applicable sizes, the number of ways to choose 0 elements from the empty set is =0. More generally, the number of ways to choose n elements among a set of n is = n. n, the factorial function can also be defined for non-integer values using more advanced mathematics, detailed in the section below. This more generalized definition is used by advanced calculators and mathematical software such as Maple or Mathematica, although the factorial function has its roots in combinatorics, formulas involving factorials occur in many areas of mathematics. There are n. different ways of arranging n distinct objects into a sequence, often factorials appear in the denominator of a formula to account for the fact that ordering is to be ignored. A classical example is counting k-combinations from a set with n elements, one can obtain such a combination by choosing a k-permutation, successively selecting and removing an element of the set, k times, for a total of n k _ = n ⋯ possibilities. This however produces the k-combinations in an order that one wishes to ignore, since each k-combination is obtained in k. different ways. This number is known as the coefficient, because it is also the coefficient of Xk in n

15.
Power of two
–
In mathematics, a power of two means a number of the form 2n where n is an integer, i. e. the result of exponentiation with number two as the base and integer n as the exponent. In a context where only integers are considered, n is restricted to values, so we have 1,2. Because two is the base of the numeral system, powers of two are common in computer science. Written in binary, a power of two always has the form 100…000 or 0. 00…001, just like a power of ten in the decimal system, a word, interpreted as an unsigned integer, can represent values from 0 to 2n −1 inclusively. Corresponding signed integer values can be positive, negative and zero, either way, one less than a power of two is often the upper bound of an integer in binary computers. As a consequence, numbers of this show up frequently in computer software. For example, in the original Legend of Zelda the main character was limited to carrying 255 rupees at any time. Powers of two are used to measure computer memory. A byte is now considered eight bits (an octet, resulting in the possibility of 256 values, the prefix kilo, in conjunction with byte, may be, and has traditionally been, used, to mean 1,024. However, in general, the term kilo has been used in the International System of Units to mean 1,000, binary prefixes have been standardized, such as kibi meaning 1,024. Nearly all processor registers have sizes that are powers of two,32 or 64 being most common, powers of two occur in a range of other places as well. For many disk drives, at least one of the size, number of sectors per track. The logical block size is almost always a power of two. Numbers that are not powers of two occur in a number of situations, such as video resolutions, but they are often the sum or product of two or three powers of two, or powers of two minus one. For example,640 =512 +128 =128 ×5, put another way, they have fairly regular bit patterns. A prime number that is one less than a power of two is called a Mersenne prime, for example, the prime number 31 is a Mersenne prime because it is 1 less than 32. Similarly, a number that is one more than a positive power of two is called a Fermat prime—the exponent itself is a power of two. A fraction that has a power of two as its denominator is called a dyadic rational, the numbers that can be represented as sums of consecutive positive integers are called polite numbers, they are exactly the numbers that are not powers of two

16.
Power of 10
–
In mathematics, a power of 10 is any of the integer powers of the number ten, in other words, ten multiplied by itself a certain number of times. By definition, the one is a power of ten. The first few powers of ten are,1,10,100,1000,10000,100000,1000000,10000000. In decimal notation the nth power of ten is written as 1 followed by n zeroes and it can also be written as 10n or as 1En in E notation. See order of magnitude and orders of magnitude for named powers of ten, there are two conventions for naming positive powers of ten, called the long and short scales. Where a power of ten has different names in the two conventions, the long scale namme is shown in brackets, googolplex, a much larger power of ten, was also introduced in that book. Scientific notation is a way of writing numbers of very large, a number written in scientific notation has a significand multiplied by a power of ten. Sometimes written in the form, m × 10n Or more compactly as, where n is positive, this indicates the number zeros after the number, and where the n is negative, this indicates the number of decimal places before the number. As an example,105 =100,000 10−5 =0.00001 The notation of mEn, known as E notation, is used in programming, spreadsheets and databases. Power of two SI prefix Cosmic View, inspiration for the film Powers of Ten Video Powers of Ten, US Public Broadcasting Service, made by Charles and Ray Eames. Starting at a picnic by the lakeside in Chicago, this film transports the viewer to the edges of the universe. Every ten seconds we view the point from ten times farther out until our own galaxy is visible only as a speck of light among many others. Returning to Earth with breathtaking speed, we move inward - into the hand of the sleeping picnicker - with ten times more magnification every ten seconds and our journey ends inside a proton of a carbon atom within a DNA molecule in a white blood cell

17.
Fibonacci number
–
The Fibonacci sequence is named after Italian mathematician Leonardo of Pisa, known as Fibonacci. His 1202 book Liber Abaci introduced the sequence to Western European mathematics, the sequence described in Liber Abaci began with F1 =1. Fibonacci numbers are related to Lucas numbers L n in that they form a complementary pair of Lucas sequences U n = F n and V n = L n. They are intimately connected with the ratio, for example. Fibonacci numbers appear unexpectedly often in mathematics, so much so that there is a journal dedicated to their study. The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody, in the Sanskrit tradition of prosody, there was interest in enumerating all patterns of long syllables that are 2 units of duration, and short syllables that are 1 unit of duration. Counting the different patterns of L and S of a given duration results in the Fibonacci numbers, susantha Goonatilake writes that the development of the Fibonacci sequence is attributed in part to Pingala, later being associated with Virahanka, Gopāla, and Hemachandra. He dates Pingala before 450 BC, however, the clearest exposition of the sequence arises in the work of Virahanka, whose own work is lost, but is available in a quotation by Gopala, Variations of two earlier meters. For example, for four, variations of meters of two three being mixed, five happens, in this way, the process should be followed in all mātrā-vṛttas. The sequence is also discussed by Gopala and by the Jain scholar Hemachandra, outside India, the Fibonacci sequence first appears in the book Liber Abaci by Fibonacci. The puzzle that Fibonacci posed was, how many pairs will there be in one year, at the end of the first month, they mate, but there is still only 1 pair. At the end of the month the female produces a new pair. At the end of the month, the original female produces a second pair. At the end of the month, the original female has produced yet another new pair. At the end of the nth month, the number of pairs of rabbits is equal to the number of new pairs plus the number of pairs alive last month and this is the nth Fibonacci number. The name Fibonacci sequence was first used by the 19th-century number theorist Édouard Lucas, the most common such problem is that of counting the number of compositions of 1s and 2s that sum to a given total n, there are Fn+1 ways to do this. For example, if n =5, then Fn+1 = F6 =8 counts the eight compositions, 1+1+1+1+1 = 1+1+1+2 = 1+1+2+1 = 1+2+1+1 = 2+1+1+1 = 2+2+1 = 2+1+2 = 1+2+2, all of which sum to 5. The Fibonacci numbers can be found in different ways among the set of strings, or equivalently

18.
Heptagonal number
–
A heptagonal number is a figurate number that represents a heptagon. The n-th heptagonal number is given by the formula 5 n 2 −3 n 2, like square numbers, the digital root in base 10 of a heptagonal number can only be 1,4,7 or 9. Five times a number, plus 1 equals a triangular number. A generalized heptagonal number is obtained by the formula T n + T ⌊ n 2 ⌋, where Tn is the nth triangular number. The first few generalized heptagonal numbers are,1,4,7,13,18,27,34,46,55,70,81,99,112, besides 1 and 70, no generalized heptagonal numbers are also Pell numbers. The heptagonal root of x is given by the formula n =40 x +9 +310

19.
Hexagonal number
–
A hexagonal number is a figurate number. The formula for the nth hexagonal number h n =2 n 2 − n = n =2 n ×2. The first few numbers are,1,6,15,28,45,66,91,120,153,190,231,276,325,378,435,496,561,630,703,780,861,946. Every hexagonal number is a number, but only every other triangular number is a hexagonal number. Like a triangular number, the root in base 10 of a hexagonal number can only be 1,3,6. The digital root pattern, repeating every nine terms, is 166193139. Every even perfect number is hexagonal, given by the formula M p 2 p −1 = M p /2 = h /2 = h 2 p −1 where Mp is a Mersenne prime. No odd perfect numbers are known, hence all known perfect numbers are hexagonal, for example, the 2nd hexagonal number is 2×3 =6, the 4th is 4×7 =28, the 16th is 16×31 =496, and the 64th is 64×127 =8128. The largest number that cannot be written as a sum of at most four hexagonal numbers is 130, adrien-Marie Legendre proved in 1830 that any integer greater than 1791 can be expressed in this way. Hexagonal numbers can be rearranged into rectangular numbers of n by. Hexagonal numbers should not be confused with centered hexagonal numbers, which model the standard packaging of Vienna sausages, to avoid ambiguity, hexagonal numbers are sometimes called cornered hexagonal numbers. One can efficiently test whether a positive x is an hexagonal number by computing n =8 x +1 +14. If n is an integer, then x is the nth hexagonal number, if n is not an integer, then x is not hexagonal. The nth number of the sequence can also be expressed by using Sigma notation as h n = ∑ i =0 n −1 where the empty sum is taken to be 0. Centered hexagonal number Mathworld entry on Hexagonal Number

20.
Pell number
–
In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins 1/1, 3/2, 7/5, 17/12, and 41/29, so the sequence of Pell numbers begins with 1,2,5,12, and 29. The numerators of the sequence of approximations are half the companion Pell numbers or Pell–Lucas numbers, these numbers form a second infinite sequence that begins with 2,6,14,34. As with Pells equation, the name of the Pell numbers stems from Leonhard Eulers mistaken attribution of the equation, the Pell–Lucas numbers are also named after Édouard Lucas, who studied sequences defined by recurrences of this type, the Pell and companion Pell numbers are Lucas sequences. The Pell numbers are defined by the recurrence relation P n = {0 if n =0,1 if n =1,2 P n −1 + P n −2 otherwise. In words, the sequence of Pell numbers starts with 0 and 1, and then each Pell number is the sum of twice the previous Pell number and the Pell number before that. The first few terms of the sequence are 0,1,2,5,12,29,70,169,408,985,2378,5741,13860, …. The Pell numbers can also be expressed by the closed form formula P n = n − n 22, a third definition is possible, from the matrix formula = n. Pell numbers arise historically and most notably in the rational approximation to √2. If two large integers x and y form a solution to the Pell equation x 2 −2 y 2 = ±1 and that is, the solutions have the form P n −1 + P n P n. The approximation 2 ≈577408 of this type was known to Indian mathematicians in the third or fourth century B. C, the Greek mathematicians of the fifth century B. C. also knew of this sequence of approximations, Plato refers to the numerators as rational diameters. In the 2nd century CE Theon of Smyrna used the term the side and these approximations can be derived from the continued fraction expansion of 2,2 =1 +12 +12 +12 +12 +12 + ⋱. As Knuth describes, the fact that Pell numbers approximate √2 allows them to be used for accurate rational approximations to an octagon with vertex coordinates. All vertices are equally distant from the origin, and form uniform angles around the origin. Alternatively, the points, and form approximate octagons in which the vertices are equally distant from the origin. A Pell prime is a Pell number that is prime, the first few Pell primes are 2,5,29,5741, …. The indices of these primes within the sequence of all Pell numbers are 2,3,5,11,13,29,41,53,59,89,97,101,167,181,191, … These indices are all themselves prime. As with the Fibonacci numbers, a Pell number Pn can only be prime if n itself is prime, the only Pell numbers that are squares, cubes, or any higher power of an integer are 0,1, and 169 =132. However, despite having so few squares or other powers, Pell numbers have a connection to square triangular numbers

21.
Triangular number
–
A triangular number or triangle number counts the objects that can form an equilateral triangle, as in the diagram on the right. The nth triangular number is the number of dots composing a triangle with n dots on a side and it represents the number of distinct pairs that can be selected from n +1 objects, and it is read aloud as n plus one choose two. Carl Friedrich Gauss is said to have found this relationship in his early youth, however, regardless of the truth of this story, Gauss was not the first to discover this formula, and some find it likely that its origin goes back to the Pythagoreans 5th century BC. The two formulae were described by the Irish monk Dicuil in about 816 in his Computus, the triangular number Tn solves the handshake problem of counting the number of handshakes if each person in a room with n +1 people shakes hands once with each person. In other words, the solution to the problem of n people is Tn−1. The function T is the analog of the factorial function. In the limit, the ratio between the two numbers, dots and line segments is lim n → ∞ T n L n =13, Triangular numbers have a wide variety of relations to other figurate numbers. Most simply, the sum of two triangular numbers is a square number, with the sum being the square of the difference between the two. Algebraically, T n + T n −1 = + = + = n 2 =2, alternatively, the same fact can be demonstrated graphically, There are infinitely many triangular numbers that are also square numbers, e. g.1,36,1225. Some of them can be generated by a recursive formula. All square triangular numbers are found from the recursion S n =34 S n −1 − S n −2 +2 with S0 =0 and S1 =1. Also, the square of the nth triangular number is the same as the sum of the cubes of the integers 1 to n and this can also be expressed as ∑ k =1 n k 3 =2. The sum of the all triangular numbers up to the nth triangular number is the nth tetrahedral number, more generally, the difference between the nth m-gonal number and the nth -gonal number is the th triangular number. For example, the sixth heptagonal number minus the sixth hexagonal number equals the triangular number,15. Every other triangular number is a hexagonal number, knowing the triangular numbers, one can reckon any centered polygonal number, the nth centered k-gonal number is obtained by the formula C k n = k T n −1 +1 where T is a triangular number. The positive difference of two numbers is a trapezoidal number. Triangular numbers correspond to the case of Faulhabers formula. Alternating triangular numbers are also hexagonal numbers, every even perfect number is triangular, given by the formula M p 2 p −1 = M p 2 = T M p where Mp is a Mersenne prime

22.
Cauchy sequence
–
In mathematics, a Cauchy sequence, named after Augustin-Louis Cauchy, is a sequence whose elements become arbitrarily close to each other as the sequence progresses. More precisely, given any small positive distance, all but a number of elements of the sequence are less than that given distance from each other. It is not sufficient for each term to become close to the preceding term. For instance, in the harmonic series ∑1 n a difference between consecutive terms decreases as 1 n, however the series does not converge, rather, it is required that all terms get arbitrarily close to each other, starting from some point. More formally, for any given ε >0 there exists an N such that for any m, n > N. The notions above are not as unfamiliar as they might at first appear, the customary acceptance of the fact that any real number x has a decimal expansion is an implicit acknowledgment that a particular Cauchy sequence of rational numbers has the real limit x. In some cases it may be difficult to describe x independently of such a process involving rational numbers. Generalizations of Cauchy sequences in more abstract uniform spaces exist in the form of Cauchy filters, in a similar way one can define Cauchy sequences of rational or complex numbers. Cauchy formulated such a condition by requiring x m − x n to be infinitesimal for every pair of infinite m, n, to define Cauchy sequences in any metric space X, the absolute value |xm - xn| is replaced by the distance d between xm and xn. A metric space X in which every Cauchy sequence converges to an element of X is called complete, the real numbers are complete under the metric induced by the usual absolute value, and one of the standard constructions of the real numbers involves Cauchy sequences of rational numbers. A rather different type of example is afforded by a metric space X which has the discrete metric, any Cauchy sequence of elements of X must be constant beyond some fixed point, and converges to the eventually repeating term. The rational numbers Q are not complete, There are sequences of rationals that converge to irrational numbers, if one considers this as a sequence of real numbers, however, it converges to the real number φ = /2, the Golden ratio, which is irrational. Every Cauchy sequence of numbers is bounded. Every Cauchy sequence of numbers is bounded, hence by Bolzano-Weierstrass has a convergent subsequence, hence is itself convergent. It should be noted, though, that proof of the completeness of the real numbers implicitly makes use of the least upper bound axiom. The alternative approach, mentioned above, of constructing the real numbers as the completion of the rational numbers, makes the completeness of the real numbers tautological. Such a series ∑ n =1 ∞ x n is considered to be convergent if and only if the sequence of sums is convergent. It is a matter to determine whether the sequence of partial sums is Cauchy or not

23.
Monotone sequence
–
In mathematics, a monotonic function is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was generalized to the more abstract setting of order theory. In calculus, a function f defined on a subset of the numbers with real values is called monotonic if. That is, as per Fig.1, a function that increases monotonically does not exclusively have to increase, a function is called monotonically increasing, if for all x and y such that x ≤ y one has f ≤ f, so f preserves the order. Likewise, a function is called monotonically decreasing if, whenever x ≤ y, then f ≥ f, if the order ≤ in the definition of monotonicity is replaced by the strict order <, then one obtains a stronger requirement. A function with this property is called strictly increasing, again, by inverting the order symbol, one finds a corresponding concept called strictly decreasing. The terms non-decreasing and non-increasing should not be confused with the negative qualifications not decreasing, for example, the function of figure 3 first falls, then rises, then falls again. It is therefore not decreasing and not increasing, but it is neither non-decreasing nor non-increasing, the term monotonic transformation can also possibly cause some confusion because it refers to a transformation by a strictly increasing function. Notably, this is the case in economics with respect to the properties of a utility function being preserved across a monotonic transform. A function f is said to be absolutely monotonic over an interval if the derivatives of all orders of f are nonnegative or all nonpositive at all points on the interval, F can only have jump discontinuities, f can only have countably many discontinuities in its domain. The discontinuities, however, do not necessarily consist of isolated points and these properties are the reason why monotonic functions are useful in technical work in analysis. In addition, this result cannot be improved to countable, see Cantor function, if f is a monotonic function defined on an interval, then f is Riemann integrable. An important application of functions is in probability theory. If X is a variable, its cumulative distribution function F X = Prob is a monotonically increasing function. A function is unimodal if it is monotonically increasing up to some point, when f is a strictly monotonic function, then f is injective on its domain, and if T is the range of f, then there is an inverse function on T for f. A map f, X → Y is said to be if each of its fibers is connected i. e. for each element y in Y the set f−1 is connected. A subset G of X × X∗ is said to be a set if for every pair. G is said to be monotone if it is maximal among all monotone sets in the sense of set inclusion

24.
Convergent series
–
In mathematics, a series is the sum of the terms of an infinite sequence of numbers. Given an infinite sequence, the nth partial sum S n is the sum of the first n terms of the sequence, that is, S n = ∑ k =1 n a k. A series is convergent if the sequence of its partial sums tends to a limit, that means that the partial sums become closer and closer to a given number when the number of their terms increases. More precisely, a series converges, if exists a number ℓ such that for any arbitrarily small positive number ε. If the series is convergent, the number ℓ is called the sum of the series, any series that is not convergent is said to be divergent. The reciprocals of the positive integers produce a divergent series,11 +12 +13 +14 +15 +16 + ⋯ → ∞. The reciprocals of triangular numbers produce a convergent series,11 +13 +16 +110 +115 +121 + ⋯ =2. The reciprocals of factorials produce a convergent series,11 +11 +12 +16 +124 +1120 + ⋯ = e. The reciprocals of square numbers produce a convergent series,11 +14 +19 +116 +125 +136 + ⋯ = π26. The reciprocals of powers of 2 produce a convergent series,11 +12 +14 +18 +116 +132 + ⋯ =2. Alternating the signs of reciprocals of powers of 2 also produces a convergent series,11 −12 +14 −18 +116 −132 + ⋯ =23. The reciprocals of Fibonacci numbers produce a convergent series,11 +11 +12 +13 +15 +18 + ⋯ = ψ, there are a number of methods of determining whether a series converges or diverges. The terms of the sequence are compared to those of another sequence, if, for all n,0 ≤ a n ≤ b n, and ∑ n =1 ∞ b n converges, then so does ∑ n =1 ∞ a n. However, if, for all n,0 ≤ b n ≤ a n, assume that for all n, a n >0. Suppose that there exists r such that lim n → ∞ | a n +1 a n | = r, if r <1, then the series converges. If r >1, then the series diverges, if r =1, the ratio test is inconclusive, and the series may converge or diverge. Root test or nth root test, suppose that the terms of the sequence in question are non-negative. Define r as follows, r = lim sup n → ∞ | a n | n, if r <1, then the series converges

25.
Uniform convergence
–
In the mathematical field of analysis, uniform convergence is a type of convergence stronger than pointwise convergence. Loosely speaking, this means that f n converges to f at a speed on its entire domain. In contrast, we say that f n converges to f pointwise, if exists a N. It is clear from these definitions that uniform convergence of f n to f on E implies pointwise convergence for every x ∈ E, frequently, no special symbol is used, and authors simply write f n → f u n i f o r m l y. The difference between the two types of convergence was not fully appreciated early in the history of calculus, leading to instances of faulty reasoning, Uniform convergence to a function on a given interval can be defined in terms of the uniform norm. Completely standard notions of convergence did not exist at the time, when put into the modern language, what Cauchy proved is that a uniformly convergent sequence of continuous functions has a continuous limit. While he thought it a fact when a series converged in this way, he did not give a formal definition. Independently, similar concepts were articulated by Philipp Ludwig von Seidel, suppose E is a set and f n, E → R are real-valued functions. This is the Cauchy criterion for uniform convergence, in another equivalent formulation, if we define a n = sup x ∈ E | f n − f |, then f n converges to f uniformly if and only if a n →0 as n → ∞. The sequence n ∈ N is said to be uniformly convergent with limit f if E is a metric space and for every x in E. It is easy to see that local uniform convergence implies pointwise convergence and it is also clear that uniform convergence implies local uniform convergence. Note that interchanging the order of there exists N and for all x in the definition above results in a statement equivalent to the convergence of the sequence. In explicit terms, in the case of convergence, N can only depend on ϵ, while in the case of pointwise convergence. It is therefore plain that uniform convergence implies pointwise convergence, the converse is not true, as the example in the section below illustrates. One may straightforwardly extend the concept to functions S → M, the most general setting is the uniform convergence of nets of functions S → X, where X is a uniform space. The above-mentioned theorem, stating that the limit of continuous functions is continuous. Uniform convergence admits a simplified definition in a hyperreal setting, thus, a sequence f n converges to f uniformly if for all x in the domain of f* and all infinite n, f n ∗ is infinitely close to f ∗. Then uniform convergence simply means convergence in the norm topology

26.
Riemann zeta function
–
More general representations of ζ for all s are given below. The Riemann zeta function plays a role in analytic number theory and has applications in physics, probability theory. As a function of a variable, Leonhard Euler first introduced and studied it in the first half of the eighteenth century without using complex analysis. The values of the Riemann zeta function at even positive integers were computed by Euler, the first of them, ζ, provides a solution to the Basel problem. In 1979 Apéry proved the irrationality of ζ, the values at negative integer points, also found by Euler, are rational numbers and play an important role in the theory of modular forms. Many generalizations of the Riemann zeta function, such as Dirichlet series, the Riemann zeta function ζ is a function of a complex variable s = σ + it. It can also be defined by the integral ζ =1 Γ ∫0 ∞ x s −1 e x −1 d x where Γ is the gamma function. The Riemann zeta function is defined as the continuation of the function defined for σ >1 by the sum of the preceding series. Leonhard Euler considered the series in 1740 for positive integer values of s. The above series is a prototypical Dirichlet series that converges absolutely to a function for s such that σ >1. Riemann showed that the function defined by the series on the half-plane of convergence can be continued analytically to all complex values s ≠1, for s =1 the series is the harmonic series which diverges to +∞, and lim s →1 ζ =1. Thus the Riemann zeta function is a function on the whole complex s-plane. For any positive even integer 2n, ζ = n +1 B2 n 2 n 2, where B2n is the 2nth Bernoulli number. For odd positive integers, no simple expression is known, although these values are thought to be related to the algebraic K-theory of the integers. For nonpositive integers, one has ζ = B n +1 n +1 for n ≥0 In particular, ζ = −12, Similarly to the above, this assigns a finite result to the series 1 +1 +1 +1 + ⋯. ζ ≈ −1.4603545 This is employed in calculating of kinetic boundary layer problems of linear kinetic equations, ζ =1 +12 +13 + ⋯ = ∞, if we approach from numbers larger than 1. Then this is the harmonic series, but its Cauchy principal value lim ε →0 ζ + ζ2 exists which is the Euler–Mascheroni constant γ =0. 5772…. ζ ≈2.612, This is employed in calculating the critical temperature for a Bose–Einstein condensate in a box with periodic boundary conditions, and for spin wave physics in magnetic systems

27.
Taylor series
–
In mathematics, a Taylor series is a representation of a function as an infinite sum of terms that are calculated from the values of the functions derivatives at a single point. The concept of a Taylor series was formulated by the Scottish mathematician James Gregory, a function can be approximated by using a finite number of terms of its Taylor series. Taylors theorem gives quantitative estimates on the error introduced by the use of such an approximation, the polynomial formed by taking some initial terms of the Taylor series is called a Taylor polynomial. The Taylor series of a function is the limit of that functions Taylor polynomials as the degree increases, a function may not be equal to its Taylor series, even if its Taylor series converges at every point. A function that is equal to its Taylor series in an interval is known as an analytic function in that interval. The Taylor series of a real or complex-valued function f that is differentiable at a real or complex number a is the power series f + f ′1. Which can be written in the more compact sigma notation as ∑ n =0 ∞ f n, N where n. denotes the factorial of n and f denotes the nth derivative of f evaluated at the point a. The derivative of order zero of f is defined to be f itself and 0 and 0. are both defined to be 1, when a =0, the series is also called a Maclaurin series. The Maclaurin series for any polynomial is the polynomial itself. The Maclaurin series for 1/1 − x is the geometric series 1 + x + x 2 + x 3 + ⋯ so the Taylor series for 1/x at a =1 is 1 − +2 −3 + ⋯. The Taylor series for the exponential function ex at a =0 is x 00, + ⋯ =1 + x + x 22 + x 36 + x 424 + x 5120 + ⋯ = ∑ n =0 ∞ x n n. The above expansion holds because the derivative of ex with respect to x is also ex and this leaves the terms n in the numerator and n. in the denominator for each term in the infinite sum. The Greek philosopher Zeno considered the problem of summing an infinite series to achieve a result, but rejected it as an impossibility. It was through Archimedess method of exhaustion that a number of progressive subdivisions could be performed to achieve a finite result. Liu Hui independently employed a similar method a few centuries later, in the 14th century, the earliest examples of the use of Taylor series and closely related methods were given by Madhava of Sangamagrama. The Kerala school of astronomy and mathematics further expanded his works with various series expansions, in the 17th century, James Gregory also worked in this area and published several Maclaurin series. It was not until 1715 however that a method for constructing these series for all functions for which they exist was finally provided by Brook Taylor. The Maclaurin series was named after Colin Maclaurin, a professor in Edinburgh, if f is given by a convergent power series in an open disc centered at b in the complex plane, it is said to be analytic in this disc

28.
Laurent series
–
In mathematics, the Laurent series of a complex function f is a representation of that function as a power series which includes terms of negative degree. It may be used to complex functions in cases where a Taylor series expansion cannot be applied. The Laurent series was named after and first published by Pierre Alphonse Laurent in 1843, karl Weierstrass may have discovered it first in a paper written in 1841, but it was not published until after his death. The path of integration γ is counterclockwise around a closed, rectifiable path containing no self-intersections, enclosing c, the expansion for f will then be valid anywhere inside the annulus. The annulus is shown in red in the figure on the right, along with an example of a suitable path of integration labeled γ. If we take γ to be a circle | z − c | = ϱ, where r < ϱ < R, the fact that these integrals are unchanged by a deformation of the contour γ is an immediate consequence of Greens theorem. Laurent series with complex coefficients are an important tool in complex analysis, consider for instance the function f = e −1 / x 2 with f =0. As a real function, it is differentiable everywhere, as a complex function however it is not differentiable at x =0. By replacing x by −1/x2 in the series for the exponential function. The graph opposite shows e−1/x2 in black and its Laurent approximations ∑ n =0 N n x −2 n n. for N =1,2,3,4,5,6,7 and 50. As N → ∞, the approximation becomes exact for all x except at the singularity x =0. More generally, Laurent series can be used to express holomorphic functions defined on an annulus, suppose ∑ n = − ∞ ∞ a n n is a given Laurent series with complex coefficients an and a complex center c. Then there exists an inner radius r and outer radius R such that. To say that the Laurent series converges, we mean that both the positive degree power series and the negative degree power series converge, furthermore, this convergence will be uniform on compact sets. Finally, the convergent series defines a holomorphic function ƒ on the open annulus, outside the annulus, the Laurent series diverges. That is, at point of the exterior of A. It is possible that r may be zero or R may be infinite, at the other extreme, its not necessarily true that r is less than R. These radii can be computed as follows, r = lim sup n → ∞ | a − n |1 n 1 R = lim sup n → ∞ | a n |1 n and we take R to be infinite when this latter lim sup is zero

29.
Fourier series
–
In mathematics, a Fourier series is a way to represent a function as the sum of simple sine waves. More formally, it decomposes any periodic function or periodic signal into the sum of a set of simple oscillating functions, the discrete-time Fourier transform is a periodic function, often defined in terms of a Fourier series. The Z-transform, another example of application, reduces to a Fourier series for the important case |z|=1, Fourier series are also central to the original proof of the Nyquist–Shannon sampling theorem. The study of Fourier series is a branch of Fourier analysis, the Mémoire introduced Fourier analysis, specifically Fourier series. Through Fouriers research the fact was established that a function can be represented by a trigonometric series. The first announcement of this discovery was made by Fourier in 1807. The heat equation is a differential equation. These simple solutions are now sometimes called eigensolutions, Fouriers idea was to model a complicated heat source as a superposition of simple sine and cosine waves, and to write the solution as a superposition of the corresponding eigensolutions. This superposition or linear combination is called the Fourier series, from a modern point of view, Fouriers results are somewhat informal, due to the lack of a precise notion of function and integral in the early nineteenth century. Later, Peter Gustav Lejeune Dirichlet and Bernhard Riemann expressed Fouriers results with greater precision, in this section, s denotes a function of the real variable x, and s is integrable on an interval, for real numbers x0 and P. We will attempt to represent s in that interval as a sum, or series. Outside the interval, the series is periodic with period P and it follows that if s also has that property, the approximation is valid on the entire real line. We can begin with a summation, s N = A02 + ∑ n =1 N A n ⋅ sin . S N is a function with period P. The inverse relationships between the coefficients are, A n = a n 2 + b n 2 ϕ n = atan2 , when the coefficients are computed as follows, s N approximates s on, and the approximation improves as N → ∞. The infinite sum, s ∞, is called the Fourier series representation of s, both components of a complex-valued function are real-valued functions that can be represented by a Fourier series. This is the formula as before except cn and c−n are no longer complex conjugates. In particular, the Fourier series converges absolutely and uniformly to s whenever the derivative of s is square integrable, if a function is square-integrable on the interval, then the Fourier series converges to the function at almost every point

30.
Mathematical analysis
–
Mathematical analysis is the branch of mathematics dealing with limits and related theories, such as differentiation, integration, measure, infinite series, and analytic functions. These theories are studied in the context of real and complex numbers. Analysis evolved from calculus, which involves the elementary concepts and techniques of analysis, analysis may be distinguished from geometry, however, it can be applied to any space of mathematical objects that has a definition of nearness or specific distances between objects. Mathematical analysis formally developed in the 17th century during the Scientific Revolution, early results in analysis were implicitly present in the early days of ancient Greek mathematics. For instance, a geometric sum is implicit in Zenos paradox of the dichotomy. The explicit use of infinitesimals appears in Archimedes The Method of Mechanical Theorems, in Asia, the Chinese mathematician Liu Hui used the method of exhaustion in the 3rd century AD to find the area of a circle. Zu Chongzhi established a method that would later be called Cavalieris principle to find the volume of a sphere in the 5th century, the Indian mathematician Bhāskara II gave examples of the derivative and used what is now known as Rolles theorem in the 12th century. In the 14th century, Madhava of Sangamagrama developed infinite series expansions, like the power series and his followers at the Kerala school of astronomy and mathematics further expanded his works, up to the 16th century. The modern foundations of analysis were established in 17th century Europe. During this period, calculus techniques were applied to approximate discrete problems by continuous ones, in the 18th century, Euler introduced the notion of mathematical function. Real analysis began to emerge as an independent subject when Bernard Bolzano introduced the definition of continuity in 1816. In 1821, Cauchy began to put calculus on a firm logical foundation by rejecting the principle of the generality of algebra widely used in earlier work, instead, Cauchy formulated calculus in terms of geometric ideas and infinitesimals. Thus, his definition of continuity required a change in x to correspond to an infinitesimal change in y. He also introduced the concept of the Cauchy sequence, and started the theory of complex analysis. Poisson, Liouville, Fourier and others studied partial differential equations, the contributions of these mathematicians and others, such as Weierstrass, developed the -definition of limit approach, thus founding the modern field of mathematical analysis. In the middle of the 19th century Riemann introduced his theory of integration, the last third of the century saw the arithmetization of analysis by Weierstrass, who thought that geometric reasoning was inherently misleading, and introduced the epsilon-delta definition of limit. Then, mathematicians started worrying that they were assuming the existence of a continuum of numbers without proof. Around that time, the attempts to refine the theorems of Riemann integration led to the study of the size of the set of discontinuities of real functions, also, monsters began to be investigated