1.
Irrational number
–
In mathematics, the irrational numbers are all the real numbers, which are not rational numbers, the latter being the numbers constructed from ratios of integers. Irrational numbers may also be dealt with via non-terminating continued fractions, for example, the decimal representation of the number π starts with 3.14159265358979, but no finite number of digits can represent π exactly, nor does it repeat. Mathematicians do not generally take terminating or repeating to be the definition of the concept of rational number, as a consequence of Cantors proof that the real numbers are uncountable and the rationals countable, it follows that almost all real numbers are irrational. The first proof of the existence of numbers is usually attributed to a Pythagorean. The then-current Pythagorean method would have claimed that there must be sufficiently small. However, Hippasus, in the 5th century BC, was able to deduce that there was in no common unit of measure. His reasoning is as follows, Start with a right triangle with side lengths of integers a, b. The ratio of the hypotenuse to a leg is represented by c, b, assume a, b, and c are in the smallest possible terms. By the Pythagorean theorem, c2 = a2+b2 = b2+b2 = 2b2, since c2 = 2b2, c2 is divisible by 2, and therefore even. Since c2 is even, c must be even, since c is even, dividing c by 2 yields an integer. Squaring both sides of c = 2y yields c2 =2, or c2 = 4y2, substituting 4y2 for c2 in the first equation gives us 4y2= 2b2. Dividing by 2 yields 2y2 = b2, since y is an integer, and 2y2 = b2, b2 is divisible by 2, and therefore even. Since b2 is even, b must be even and we have just show that both b and c must be even. Hence they have a factor of 2. However this contradicts the assumption that they have no common factors and this contradiction proves that c and b cannot both be integers, and thus the existence of a number that cannot be expressed as a ratio of two integers. Greek mathematicians termed this ratio of incommensurable magnitudes alogos, or inexpressible. ”Another legend states that Hippasus was merely exiled for this revelation, the discovery of incommensurable ratios was indicative of another problem facing the Greeks, the relation of the discrete to the continuous. Brought into light by Zeno of Elea, who questioned the conception that quantities are discrete and composed of a number of units of a given size. ”However Zeno found that in fact “ in general are not discrete collections of units. That in fact, these divisions of quantity must necessarily be infinite, for example, consider a line segment, this segment can be split in half, that half split in half, the half of the half in half, and so on
2.
Square root of 3
–
The square root of 3 is the positive real number that, when multiplied by itself, gives the number 3. It is more called the principal square root of 3. The square root of 3 is an irrational number and it is also known as Theodorus constant, named after Theodorus of Cyrene, who proved its irrationality. The fraction 97/56 for the root of three can be used as an approximation. Despite having a denominator of only 56, it differs from the value by less than 1/10,000. The rounded value of 1.732 is correct to within 0. 01% of the actual value, archimedes reported 2 >3 >2, accurate to 1/608400 and 2/23409, respectively. It can be expressed as the fraction, expanded on the right. It can also be expressed by generalized continued fractions such as =2 −14 −14 −14 − ⋱ which is evaluated at every second term. The following nested square expressions converge to 3,3 =2 −22 =74 −42. This irrationality proof for the root of 3 uses Fermats method of infinite descent, Suppose that √3 is rational. Therefore, multiplying by 1 will give an expression, m n where q is the largest integer smaller than √3. Note that both the numerator and the denominator have been multiplied by a smaller than 1. An alternate proof of this is, assuming √3 = m/n with m/n being a reduced fraction. Since the left side is divisible by 3, so is the right side, thus, as both n and m are divisible by 3, they have a common factor and m/n is not a fully reduced fraction, contradicting the original premise. The square root of 3 can be found as the leg length of a triangle that encompasses a circle with a diameter of 1. From this the trigonometric function tangent of 60 degrees equals √3, and the sine of 60° and it is the distance between parallel sides of a regular hexagon with sides of length 1. On the complex plane, this distance is expressed as i√3 mentioned below and it is the length of the space diagonal of a unit cube. The vesica piscis has an axis to minor axis ratio equal to 1, √3
3.
Square root of 5
–
The square root of 5 is the positive real number that, when multiplied by itself, gives the prime number 5. It is more called the principal square root of 5. This number appears in the expression for the golden ratio. It can be denoted in surd form as,5 and it is an irrational algebraic number. The first sixty significant digits of its expansion are,2. 23606797749978969640917366873127623544061835961152572427089…. Which can be rounded down to 2.236 to within 99. 99% accuracy, the approximation 161/72 for the square root of five can be used. Despite having a denominator of only 72, it differs from the value by less than 1/10,000. As of December 2013, its value in decimal has been computed to at least ten billion digits. This irrationality proof for the root of 5 uses Fermats method of infinite descent, Suppose that √5 is rational. Then √5 can be expressed in terms as 5n − 2m/m − 2n. This irrationality proof is a proof by contradiction, Suppose that √5 = a/b where a/b is in reduced form, thus 5 = a2/b2 and 5b2 = a2. If b were even, b2, a2, and a would be making the fraction a/b not in reduced form. Thus b is odd, and by following a similar process, now, let a = 2m +1 and b = 2n +1 where m and n are integers. So what this is saying is 5 × even +1 = even, there is no integer thats both even and odd thus weve reached a contradiction and √5 is irrational. Geometrically, √5 corresponds to the diagonal of a rectangle whose sides are of length 1 and 2, such a rectangle can be obtained by halving a square, or by placing two equal squares side by side. The number √5 can be algebraically and geometrically related to √2 and √3, as it is the length of the hypotenuse of a triangle with catheti measuring √2. This follows from the relationships between a cube and the quantities √2, √3 and √5. A root-5 rectangle is particularly notable in that it can be split into a square and it can also be decomposed as the union of two equal golden rectangles whose intersection forms a square
4.
Golden ratio
–
In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. The figure on the right illustrates the geometric relationship, expressed algebraically, for quantities a and b with a > b >0, a + b a = a b = def φ, where the Greek letter phi represents the golden ratio. Its value is, φ =1 +52 =1.6180339887 …, A001622 The golden ratio is also called the golden mean or golden section. Other names include extreme and mean ratio, medial section, divine proportion, divine section, golden proportion, golden cut, the golden ratio appears in some patterns in nature, including the spiral arrangement of leaves and other plant parts. The golden ratio has also used to analyze the proportions of natural objects as well as man-made systems such as financial markets. Two quantities a and b are said to be in the golden ratio φ if a + b a = a b = φ, one method for finding the value of φ is to start with the left fraction. Through simplifying the fraction and substituting in b/a = 1/φ, a + b a =1 + b a =1 +1 φ, multiplying by φ gives φ +1 = φ2 which can be rearranged to φ2 − φ −1 =0. First, the line segment A B ¯ is about doubled and then the semicircle with the radius A S ¯ around the point S is drawn, now the semicircle is drawn with the radius A B ¯ around the point B. The arising intersection point E corresponds 2 φ, next up, the perpendicular on the line segment A E ¯ from the point D will be establish. The subsequent parallel F S ¯ to the line segment C M ¯, produces, as it were and it is well recognizable, this triangle and the triangle M S C are similar to each other. The hypotenuse F S ¯ has due to the cathetuses S D ¯ =1 and D F ¯ =2 according the Pythagorean theorem, finally, the circle arc is drawn with the radius 5 around the point F. The golden ratio has been claimed to have held a fascination for at least 2,400 years. But the fascination with the Golden Ratio is not confined just to mathematicians, biologists, artists, musicians, historians, architects, psychologists, and even mystics have pondered and debated the basis of its ubiquity and appeal. In fact, it is fair to say that the Golden Ratio has inspired thinkers of all disciplines like no other number in the history of mathematics. Ancient Greek mathematicians first studied what we now call the golden ratio because of its frequent appearance in geometry, the division of a line into extreme and mean ratio is important in the geometry of regular pentagrams and pentagons. Euclid explains a construction for cutting a line in extreme and mean ratio, throughout the Elements, several propositions and their proofs employ the golden ratio. The golden ratio is explored in Luca Paciolis book De divina proportione, since the 20th century, the golden ratio has been represented by the Greek letter φ or less commonly by τ. Timeline according to Priya Hemenway, Phidias made the Parthenon statues that seem to embody the golden ratio, plato, in his Timaeus, describes five possible regular solids, some of which are related to the golden ratio
5.
Silver ratio
–
This defines the silver ratio as an irrational mathematical constant, whose value of one plus the square root of 2 is approximately 2.4142135623. The silver ratio is denoted by δS and these fractions provide accurate rational approximations of the silver ratio, analogous to the approximation of the golden ratio by ratios of consecutive Fibonacci numbers. Multiplying by δS and rearranging gives δ S2 −2 δ S −1 =0, using the quadratic formula, two solutions can be obtained. In fact it is the second smallest quadratic PV number after the golden ratio and this means the distance from δ n S to the nearest integer is 1/δ n S ≈0. 41n. Thus, the sequence of parts of δ n S, n =1,2,3. In particular, this sequence is not equidistributed mod 1, the paper sizes under ISO216 are rectangles in the proportion 1, √2, sometimes called A4 rectangles. Removing a largest possible square from a sheet of such paper leaves a rectangle with proportions 1, √2 −1 which is the same as 1 + √2,1, removing a largest square from one of these sheets leaves one again with aspect ratio 1, √2. A rectangle whose aspect ratio is the ratio is sometimes called a silver rectangle by analogy with golden rectangles. Confusingly, silver rectangle can also refer to the paper sizes specified by ISO216, however, only the 1, √2 rectangles have the property that by cutting the rectangle in half across its long side produces two smaller rectangles of the same aspect ratio. The silver rectangle is connected to the regular octagon, if the edge length of a regular octagon is t, then the inradius of the octagon is δSt, and the area of the octagon is 2δSt2. Metallic means Ammann–Beenker tiling Buitrago, Antonia Redondo, polygons, Diagonals, and the Bronze Mean, Nexus Network Journal 9,2, Architecture and Mathematics, p. 321-2. An Introduction to Continued Fractions, The Silver Means, Fibonacci Numbers, Silver rectangle and its sequence at Tartapelago by Giorgio Pietrocola
6.
Pi
–
The number π is a mathematical constant, the ratio of a circles circumference to its diameter, commonly approximated as 3.14159. It has been represented by the Greek letter π since the mid-18th century, being an irrational number, π cannot be expressed exactly as a fraction. Still, fractions such as 22/7 and other numbers are commonly used to approximate π. The digits appear to be randomly distributed, in particular, the digit sequence of π is conjectured to satisfy a specific kind of statistical randomness, but to date no proof of this has been discovered. Also, π is a number, i. e. a number that is not the root of any non-zero polynomial having rational coefficients. This transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass, ancient civilizations required fairly accurate computed values for π for practical reasons. It was calculated to seven digits, using techniques, in Chinese mathematics. The extensive calculations involved have also used to test supercomputers. Because its definition relates to the circle, π is found in many formulae in trigonometry and geometry, especially those concerning circles, ellipses, and spheres. Because of its role as an eigenvalue, π appears in areas of mathematics. It is also found in cosmology, thermodynamics, mechanics, attempts to memorize the value of π with increasing precision have led to records of over 70,000 digits. In English, π is pronounced as pie, in mathematical use, the lowercase letter π is distinguished from its capitalized and enlarged counterpart ∏, which denotes a product of a sequence, analogous to how ∑ denotes summation. The choice of the symbol π is discussed in the section Adoption of the symbol π, π is commonly defined as the ratio of a circles circumference C to its diameter d, π = C d The ratio C/d is constant, regardless of the circles size. For example, if a circle has twice the diameter of another circle it will also have twice the circumference, preserving the ratio C/d. This definition of π implicitly makes use of geometry, although the notion of a circle can be extended to any curved geometry. Here, the circumference of a circle is the arc length around the perimeter of the circle, a quantity which can be defined independently of geometry using limits. An integral such as this was adopted as the definition of π by Karl Weierstrass, definitions of π such as these that rely on a notion of circumference, and hence implicitly on concepts of the integral calculus, are no longer common in the literature. One such definition, due to Richard Baltzer, and popularized by Edmund Landau, is the following, the cosine can be defined independently of geometry as a power series, or as the solution of a differential equation
7.
Binary numeral system
–
The base-2 system is a positional notation with a radix of 2. Because of its implementation in digital electronic circuitry using logic gates. Each digit is referred to as a bit, the modern binary number system was devised by Gottfried Leibniz in 1679 and appears in his article Explication de lArithmétique Binaire. Systems related to binary numbers have appeared earlier in multiple cultures including ancient Egypt, China, Leibniz was specifically inspired by the Chinese I Ching. The scribes of ancient Egypt used two different systems for their fractions, Egyptian fractions and Horus-Eye fractions, the method used for ancient Egyptian multiplication is also closely related to binary numbers. This method can be seen in use, for instance, in the Rhind Mathematical Papyrus, the I Ching dates from the 9th century BC in China. The binary notation in the I Ching is used to interpret its quaternary divination technique and it is based on taoistic duality of yin and yang. Eight trigrams and a set of 64 hexagrams, analogous to the three-bit and six-bit binary numerals, were in use at least as early as the Zhou Dynasty of ancient China. The Song Dynasty scholar Shao Yong rearranged the hexagrams in a format that resembles modern binary numbers, the Indian scholar Pingala developed a binary system for describing prosody. He used binary numbers in the form of short and long syllables, Pingalas Hindu classic titled Chandaḥśāstra describes the formation of a matrix in order to give a unique value to each meter. The binary representations in Pingalas system increases towards the right, the residents of the island of Mangareva in French Polynesia were using a hybrid binary-decimal system before 1450. Slit drums with binary tones are used to encode messages across Africa, sets of binary combinations similar to the I Ching have also been used in traditional African divination systems such as Ifá as well as in medieval Western geomancy. The base-2 system utilized in geomancy had long been applied in sub-Saharan Africa. Leibnizs system uses 0 and 1, like the modern binary numeral system, Leibniz was first introduced to the I Ching through his contact with the French Jesuit Joachim Bouvet, who visited China in 1685 as a missionary. Leibniz saw the I Ching hexagrams as an affirmation of the universality of his own beliefs as a Christian. Binary numerals were central to Leibnizs theology and he believed that binary numbers were symbolic of the Christian idea of creatio ex nihilo or creation out of nothing. Is not easy to impart to the pagans, is the ex nihilo through Gods almighty power. In 1854, British mathematician George Boole published a paper detailing an algebraic system of logic that would become known as Boolean algebra
8.
Decimal
–
This article aims to be an accessible introduction. For the mathematical definition, see Decimal representation, the decimal numeral system has ten as its base, which, in decimal, is written 10, as is the base in every positional numeral system. It is the base most widely used by modern civilizations. Decimal fractions have terminating decimal representations and other fractions have repeating decimal representations, Decimal notation is the writing of numbers in a base-ten numeral system. Examples are Brahmi numerals, Greek numerals, Hebrew numerals, Roman numerals, Roman numerals have symbols for the decimal powers and secondary symbols for half these values. Brahmi numerals have symbols for the nine numbers 1–9, the nine decades 10–90, plus a symbol for 100, Chinese numerals have symbols for 1–9, and additional symbols for powers of ten, which in modern usage reach 1072. Positional decimal systems include a zero and use symbols for the ten values to represent any number, positional notation uses positions for each power of ten, units, tens, hundreds, thousands, etc. The position of each digit within a number denotes the multiplier multiplied with that position has a value ten times that of the position to its right. There were at least two independent sources of positional decimal systems in ancient civilization, the Chinese counting rod system. Ten is the number which is the count of fingers and thumbs on both hands, the English word digit as well as its translation in many languages is also the anatomical term for fingers and toes. In English, decimal means tenth, decimate means reduce by a tenth, however, the symbols used in different areas are not identical, for instance, Western Arabic numerals differ from the forms used by other Arab cultures. A decimal fraction is a fraction the denominator of which is a power of ten. g, Decimal fractions 8/10, 1489/100, 24/100000, and 58900/10000 are expressed in decimal notation as 0.8,14.89,0.00024,5.8900 respectively. In English-speaking, some Latin American and many Asian countries, a period or raised period is used as the separator, in many other countries, particularly in Europe. The integer part, or integral part of a number is the part to the left of the decimal separator. The part from the separator to the right is the fractional part. It is usual for a number that consists only of a fractional part to have a leading zero in its notation. Any rational number with a denominator whose only prime factors are 2 and/or 5 may be expressed as a decimal fraction and has a finite decimal expansion. 1/2 =0.5 1/20 =0.05 1/5 =0.2 1/50 =0.02 1/4 =0.25 1/40 =0.025 1/25 =0.04 1/8 =0.125 1/125 =0.008 1/10 =0
9.
Hexadecimal
–
In mathematics and computing, hexadecimal is a positional numeral system with a radix, or base, of 16. It uses sixteen distinct symbols, most often the symbols 0–9 to represent values zero to nine, Hexadecimal numerals are widely used by computer system designers and programmers. As each hexadecimal digit represents four binary digits, it allows a more human-friendly representation of binary-coded values, one hexadecimal digit represents a nibble, which is half of an octet or byte. For example, a byte can have values ranging from 00000000 to 11111111 in binary form. In a non-programming context, a subscript is typically used to give the radix, several notations are used to support hexadecimal representation of constants in programming languages, usually involving a prefix or suffix. The prefix 0x is used in C and related languages, where this value might be denoted as 0x2AF3, in contexts where the base is not clear, hexadecimal numbers can be ambiguous and confused with numbers expressed in other bases. There are several conventions for expressing values unambiguously, a numerical subscript can give the base explicitly,15910 is decimal 159,15916 is hexadecimal 159, which is equal to 34510. Some authors prefer a text subscript, such as 159decimal and 159hex, or 159d and 159h. example. com/name%20with%20spaces where %20 is the space character, thus ’, represents the right single quotation mark, Unicode code point number 2019 in hex,8217. In the Unicode standard, a value is represented with U+ followed by the hex value. Color references in HTML, CSS and X Window can be expressed with six hexadecimal digits prefixed with #, white, CSS allows 3-hexdigit abbreviations with one hexdigit per component, #FA3 abbreviates #FFAA33. *nix shells, AT&T assembly language and likewise the C programming language, to output an integer as hexadecimal with the printf function family, the format conversion code %X or %x is used. In Intel-derived assembly languages and Modula-2, hexadecimal is denoted with a suffixed H or h, some assembly languages use the notation HABCD. Ada and VHDL enclose hexadecimal numerals in based numeric quotes, 16#5A3#, for bit vector constants VHDL uses the notation x5A3. Verilog represents hexadecimal constants in the form 8hFF, where 8 is the number of bits in the value, the Smalltalk language uses the prefix 16r, 16r5A3 PostScript and the Bourne shell and its derivatives denote hex with prefix 16#, 16#5A3. For PostScript, binary data can be expressed as unprefixed consecutive hexadecimal pairs, in early systems when a Macintosh crashed, one or two lines of hexadecimal code would be displayed under the Sad Mac to tell the user what went wrong. Common Lisp uses the prefixes #x and #16r, setting the variables *read-base* and *print-base* to 16 can also used to switch the reader and printer of a Common Lisp system to Hexadecimal number representation for reading and printing numbers. Thus Hexadecimal numbers can be represented without the #x or #16r prefix code, MSX BASIC, QuickBASIC, FreeBASIC and Visual Basic prefix hexadecimal numbers with &H, &H5A3 BBC BASIC and Locomotive BASIC use & for hex. TI-89 and 92 series uses a 0h prefix, 0h5A3 ALGOL68 uses the prefix 16r to denote hexadecimal numbers, binary, quaternary and octal numbers can be specified similarly
10.
Square root of 2
–
The square root of 2, or the th power of 2, written in mathematics as √2 or 2 1⁄2, is the positive algebraic number that, when multiplied by itself, gives the number 2. Technically, it is called the square root of 2. Geometrically the square root of 2 is the length of a diagonal across a square sides of one unit of length. It was probably the first number known to be irrational, the rational approximation of the square root of two,665, 857/470,832, derived from the fourth step in the Babylonian algorithm starting with a0 =1, is too large by approx. 1. 6×10−12, its square is 2. 0000000000045… The rational approximation 99/70 is frequently used, despite having a denominator of only 70, it differs from the correct value by less than 1/10,000. The numerical value for the root of two, truncated to 65 decimal places, is,1. 41421356237309504880168872420969807856967187537694807317667973799….41421296 ¯. That is,1 +13 +13 ×4 −13 ×4 ×34 =577408 =1.4142156862745098039 ¯. This approximation is the seventh in a sequence of increasingly accurate approximations based on the sequence of Pell numbers, despite having a smaller denominator, it is only slightly less accurate than the Babylonian approximation. Pythagoreans discovered that the diagonal of a square is incommensurable with its side, or in modern language, little is known with certainty about the time or circumstances of this discovery, but the name of Hippasus of Metapontum is often mentioned. For a while, the Pythagoreans treated as a secret the discovery that the square root of two is irrational, and, according to legend, Hippasus was murdered for divulging it. The square root of two is occasionally called Pythagoras number or Pythagoras constant, for example by Conway & Guy, there are a number of algorithms for approximating √2, which in expressions as a ratio of integers or as a decimal can only be approximated. The most common algorithm for this, one used as a basis in many computers and calculators, is the Babylonian method of computing square roots, which is one of many methods of computing square roots. It goes as follows, First, pick a guess, a0 >0, then, using that guess, iterate through the following recursive computation, a n +1 = a n +2 a n 2 = a n 2 +1 a n. The more iterations through the algorithm, the approximation of the square root of 2 is achieved. Each iteration approximately doubles the number of correct digits, starting with a0 =1 the next approximations are 3/2 =1.5 17/12 =1.416. The value of √2 was calculated to 137,438,953,444 decimal places by Yasumasa Kanadas team in 1997, in February 2006 the record for the calculation of √2 was eclipsed with the use of a home computer. Shigeru Kondo calculated 1 trillion decimal places in 2010, for a development of this record, see the table below. Among mathematical constants with computationally challenging decimal expansions, only π has been calculated more precisely, such computations aim to check empirically whether such numbers are normal
11.
Hypotenuse
–
In geometry, a hypotenuse is the longest side of a right-angled triangle, the side opposite of the right angle. For example, if one of the sides has a length of 3. The length of the hypotenuse is the root of 25. The word ὑποτείνουσα was used for the hypotenuse of a triangle by Plato in the Timaeus 54d, a folk etymology says that tenuse means side, so hypotenuse means a support like a prop or buttress, but this is inaccurate. The length of the hypotenuse is calculated using the square root function implied by the Pythagorean theorem. Using the common notation that the length of the two legs of the triangle are a and b and that of the hypotenuse is c, many computer languages support the ISO C standard function hypot, which returns the value above. The function is designed not to fail where the straightforward calculation might overflow or underflow, some scientific calculators provide a function to convert from rectangular coordinates to polar coordinates. This gives both the length of the hypotenuse and the angle the hypotenuse makes with the line at the same time when given x and y. The angle returned will normally be given by atan2. Orthographic projections, The length of the hypotenuse equals the sum of the lengths of the projections of both catheti. And The square of the length of a cathetus equals the product of the lengths of its projection on the hypotenuse times the length of this. Given the length of the c and of a cathetus b. The adjacent angle of the b, will be α = 90° – β One may also obtain the value of the angle β by the equation. Cathetus Triangle Space diagonal Nonhypotenuse number Taxicab geometry Trigonometry Special right triangles Pythagoras Hypotenuse at Encyclopaedia of Mathematics Weisstein, Eric W. Hypotenuse
12.
Right triangle
–
A right triangle or right-angled triangle is a triangle in which one angle is a right angle. The relation between the sides and angles of a triangle is the basis for trigonometry. The side opposite the angle is called the hypotenuse. The sides adjacent to the angle are called legs. Side a may be identified as the adjacent to angle B and opposed to angle A, while side b is the side adjacent to angle A. If the lengths of all three sides of a triangle are integers, the triangle is said to be a Pythagorean triangle. As with any triangle, the area is equal to one half the base multiplied by the corresponding height. In a right triangle, if one leg is taken as the then the other is height. As a formula the area T is T =12 a b where a and b are the legs of the triangle and this formula only applies to right triangles. From this, The altitude to the hypotenuse is the mean of the two segments of the hypotenuse. Each leg of the triangle is the mean proportional of the hypotenuse, in equations, f 2 = d e, b 2 = c e, a 2 = c d where a, b, c, d, e, f are as shown in the diagram. Moreover, the altitude to the hypotenuse is related to the legs of the triangle by 1 a 2 +1 b 2 =1 f 2. For solutions of this equation in integer values of a, b, f, the altitude from either leg coincides with the other leg. Since these intersect at the vertex, the right triangles orthocenter—the intersection of its three altitudes—coincides with the right-angled vertex. The Pythagorean theorem states that, In any right triangle, the area of the square whose side is the hypotenuse is equal to the sum of the areas of the squares whose sides are the two legs. This can be stated in equation form as a 2 + b 2 = c 2 where c is the length of the hypotenuse, Pythagorean triples are integer values of a, b, c satisfying this equation. The radius of the incircle of a triangle with legs a and b. The radius of the circumcircle is half the length of the hypotenuse, thus the sum of the circumradius and the inradius is half the sum of the legs, R + r = a + b 2
13.
Power of 2
–
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
14.
Algebraic number
–
An algebraic number is any complex number that is a root of a non-zero polynomial in one variable with rational coefficients. All integers and rational numbers are algebraic, as are all roots of integers, the same is not true for all real and complex numbers because they also include transcendental numbers such as π and e. Almost all real and complex numbers are transcendental, the rational numbers, expressed as the quotient of two integers a and b, b not equal to zero, satisfy the above definition because x = a/b is the root of bx − a. The quadratic surds are algebraic numbers, if the quadratic polynomial is monic then the roots are quadratic integers. The constructible numbers are numbers that can be constructed from a given unit length using straightedge. These include all quadratic surds, all numbers, and all numbers that can be formed from these using the basic arithmetic operations. Any expression formed from algebraic numbers using any combination of the arithmetic operations. Polynomial roots that cannot be expressed in terms of the arithmetic operations. This happens with many, but not all, polynomials of degree 5 or higher, gaussian integers, those complex numbers a + bi where both a and b are integers are also quadratic integers. Trigonometric functions of rational multiples of π, that is, the trigonometric numbers, for example, each of cos π/7, cos 3π/7, cos 5π/7 satisfies 8x3 − 4x2 − 4x +1 =0. This polynomial is irreducible over the rationals, and so these three cosines are conjugate algebraic numbers. Likewise, tan 3π/16, tan 7π/16, tan 11π/16, tan 15π/16 all satisfy the irreducible polynomial x4 − 4x3 − 6x2 + 4x +1, and so are conjugate algebraic integers. Some irrational numbers are algebraic and some are not, The numbers √2 and 3√3/2 are algebraic since they are roots of polynomials x2 −2 and 8x3 −3, the golden ratio φ is algebraic since it is a root of the polynomial x2 − x −1. The numbers π and e are not algebraic numbers, hence they are transcendental, the set of algebraic numbers is countable. Hence, the set of numbers has Lebesgue measure zero. Given an algebraic number, there is a monic polynomial of least degree that has the number as a root. This polynomial is called its minimal polynomial, if its minimal polynomial has degree n, then the algebraic number is said to be of degree n. An algebraic number of degree 1 is a rational number, a real algebraic number of degree 2 is a quadratic irrational
15.
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
16.
Square root
–
In mathematics, a square root of a number a is a number y such that y2 = a, in other words, a number y whose square is a. For example,4 and −4 are square roots of 16 because 42 =2 =16, every nonnegative real number a has a unique nonnegative square root, called the principal square root, which is denoted by √a, where √ is called the radical sign or radix. For example, the square root of 9 is 3, denoted √9 =3. The term whose root is being considered is known as the radicand, the radicand is the number or expression underneath the radical sign, in this example 9. Every positive number a has two roots, √a, which is positive, and −√a, which is negative. Together, these two roots are denoted ± √a, although the principal square root of a positive number is only one of its two square roots, the designation the square root is often used to refer to the principal square root. For positive a, the square root can also be written in exponent notation. Square roots of numbers can be discussed within the framework of complex numbers. In Ancient India, the knowledge of theoretical and applied aspects of square and square root was at least as old as the Sulba Sutras, a method for finding very good approximations to the square roots of 2 and 3 are given in the Baudhayana Sulba Sutra. Aryabhata in the Aryabhatiya, has given a method for finding the root of numbers having many digits. It was known to the ancient Greeks that square roots of positive numbers that are not perfect squares are always irrational numbers, numbers not expressible as a ratio of two integers. This is the theorem Euclid X,9 almost certainly due to Theaetetus dating back to circa 380 BC, the particular case √2 is assumed to date back earlier to the Pythagoreans and is traditionally attributed to Hippasus. Mahāvīra, a 9th-century Indian mathematician, was the first to state that square roots of negative numbers do not exist, a symbol for square roots, written as an elaborate R, was invented by Regiomontanus. An R was also used for Radix to indicate square roots in Gerolamo Cardanos Ars Magna, according to historian of mathematics D. E. Smith, Aryabhatas method for finding the root was first introduced in Europe by Cataneo in 1546. According to Jeffrey A. Oaks, Arabs used the letter jīm/ĝīm, the letter jīm resembles the present square root shape. Its usage goes as far as the end of the century in the works of the Moroccan mathematician Ibn al-Yasamin. The symbol √ for the root was first used in print in 1525 in Christoph Rudolffs Coss
17.
Unit square
–
In mathematics, a unit square is a square whose sides have length 1. Often, the unit square refers specifically to the square in the Cartesian plane with corners at the four points, and. In a Cartesian coordinate system with coordinates the unit square is defined as the square consisting of the points where x and y lie in a closed unit interval from 0 to 1. That is, the square is the Cartesian product I × I. The unit square can also be thought of as a subset of the complex plane, in this view, the four corners of the unit square are at the four complex numbers 0,1, i, and 1 + i. It is not known whether any point in the plane is a distance from all four vertices of the unit square. However, no point is on an edge of the square. Unit circle Unit sphere Unit cube Weisstein, Eric W. Unit square
18.
Pythagorean theorem
–
In mathematics, the Pythagorean theorem, also known as Pythagorass theorem, is a fundamental relation in Euclidean geometry among the three sides of a right triangle. It states that the square of the hypotenuse is equal to the sum of the squares of the two sides. There is some evidence that Babylonian mathematicians understood the formula, although little of it indicates an application within a mathematical framework, Mesopotamian, Indian and Chinese mathematicians all discovered the theorem independently and, in some cases, provided proofs for special cases. The theorem has been given numerous proofs – possibly the most for any mathematical theorem and they are very diverse, including both geometric proofs and algebraic proofs, with some dating back thousands of years. The Pythagorean theorem was known long before Pythagoras, but he may well have been the first to prove it, in any event, the proof attributed to him is very simple, and is called a proof by rearrangement. The two large squares shown in the figure each contain four triangles, and the only difference between the two large squares is that the triangles are arranged differently. Therefore, the space within each of the two large squares must have equal area. Equating the area of the white space yields the Pythagorean theorem and that Pythagoras originated this very simple proof is sometimes inferred from the writings of the later Greek philosopher and mathematician Proclus. Several other proofs of this theorem are described below, but this is known as the Pythagorean one, If the length of both a and b are known, then c can be calculated as c = a 2 + b 2. If the length of the c and of one side are known. The Pythagorean equation relates the sides of a triangle in a simple way. Another corollary of the theorem is that in any triangle, the hypotenuse is greater than any one of the other sides. A generalization of this theorem is the law of cosines, which allows the computation of the length of any side of any triangle, If the angle between the other sides is a right angle, the law of cosines reduces to the Pythagorean equation. This theorem may have more known proofs than any other, the book The Pythagorean Proposition contains 370 proofs, Let ABC represent a right triangle, with the right angle located at C, as shown on the figure. Draw the altitude from point C, and call H its intersection with the side AB, point H divides the length of the hypotenuse c into parts d and e. By a similar reasoning, the triangle CBH is also similar to ABC, the proof of similarity of the triangles requires the triangle postulate, the sum of the angles in a triangle is two right angles, and is equivalent to the parallel postulate. Similarity of the leads to the equality of ratios of corresponding sides. The first result equates the cosines of the angles θ, whereas the second result equates their sines, the role of this proof in history is the subject of much speculation
19.
Denominator
–
A fraction represents a part of a whole or, more generally, any number of equal parts. When spoken in everyday English, a fraction describes how many parts of a certain size there are, for example, one-half, eight-fifths, three-quarters. A common, vulgar, or simple fraction consists of an integer numerator displayed above a line, numerators and denominators are also used in fractions that are not common, including compound fractions, complex fractions, and mixed numerals. The numerator represents a number of parts, and the denominator. For example, in the fraction 3/4, the numerator,3, tells us that the fraction represents 3 equal parts, the picture to the right illustrates 34 or ¾ of a cake. Fractional numbers can also be written without using explicit numerators or denominators, by using decimals, percent signs, an integer such as the number 7 can be thought of as having an implicit denominator of one,7 equals 7/1. Other uses for fractions are to represent ratios and to represent division, thus the fraction ¾ is also used to represent the ratio 3,4 and the division 3 ÷4. The test for a number being a number is that it can be written in that form. In a fraction, the number of parts being described is the numerator. Informally, they may be distinguished by placement alone but in formal contexts they are separated by a fraction bar. The fraction bar may be horizontal, oblique, or diagonal and these marks are respectively known as the horizontal bar, the slash or stroke, the division slash, and the fraction slash. In typography, horizontal fractions are known as en or nut fractions and diagonal fractions as em fractions. The denominators of English fractions are expressed as ordinal numbers. When the denominator is 1, it may be expressed in terms of wholes but is commonly ignored. When the numerator is one, it may be omitted, a fraction may be expressed as a single composition, in which case it is hyphenated, or as a number of fractions with a numerator of one, in which case they are not. Fractions should always be hyphenated when used as adjectives, alternatively, a fraction may be described by reading it out as the numerator over the denominator, with the denominator expressed as a cardinal number. The term over is used even in the case of solidus fractions, Fractions with large denominators that are not powers of ten are often rendered in this fashion while those with denominators divisible by ten are typically read in the normal ordinal fashion. A simple fraction is a number written as a/b or a b
20.
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
21.
YBC 7289
–
The square root of 2, or the th power of 2, written in mathematics as √2 or 2 1⁄2, is the positive algebraic number that, when multiplied by itself, gives the number 2. Technically, it is called the square root of 2. Geometrically the square root of 2 is the length of a diagonal across a square sides of one unit of length. It was probably the first number known to be irrational, the rational approximation of the square root of two,665, 857/470,832, derived from the fourth step in the Babylonian algorithm starting with a0 =1, is too large by approx. 1. 6×10−12, its square is 2. 0000000000045… The rational approximation 99/70 is frequently used, despite having a denominator of only 70, it differs from the correct value by less than 1/10,000. The numerical value for the root of two, truncated to 65 decimal places, is,1. 41421356237309504880168872420969807856967187537694807317667973799….41421296 ¯. That is,1 +13 +13 ×4 −13 ×4 ×34 =577408 =1.4142156862745098039 ¯. This approximation is the seventh in a sequence of increasingly accurate approximations based on the sequence of Pell numbers, despite having a smaller denominator, it is only slightly less accurate than the Babylonian approximation. Pythagoreans discovered that the diagonal of a square is incommensurable with its side, or in modern language, little is known with certainty about the time or circumstances of this discovery, but the name of Hippasus of Metapontum is often mentioned. For a while, the Pythagoreans treated as a secret the discovery that the square root of two is irrational, and, according to legend, Hippasus was murdered for divulging it. The square root of two is occasionally called Pythagoras number or Pythagoras constant, for example by Conway & Guy, there are a number of algorithms for approximating √2, which in expressions as a ratio of integers or as a decimal can only be approximated. The most common algorithm for this, one used as a basis in many computers and calculators, is the Babylonian method of computing square roots, which is one of many methods of computing square roots. It goes as follows, First, pick a guess, a0 >0, then, using that guess, iterate through the following recursive computation, a n +1 = a n +2 a n 2 = a n 2 +1 a n. The more iterations through the algorithm, the approximation of the square root of 2 is achieved. Each iteration approximately doubles the number of correct digits, starting with a0 =1 the next approximations are 3/2 =1.5 17/12 =1.416. The value of √2 was calculated to 137,438,953,444 decimal places by Yasumasa Kanadas team in 1997, in February 2006 the record for the calculation of √2 was eclipsed with the use of a home computer. Shigeru Kondo calculated 1 trillion decimal places in 2010, for a development of this record, see the table below. Among mathematical constants with computationally challenging decimal expansions, only π has been calculated more precisely, such computations aim to check empirically whether such numbers are normal
22.
Babylonia
–
Babylonia was an ancient Akkadian-speaking state and cultural area based in central-southern Mesopotamia. A small Amorite-ruled state emerged in 1894 BC, which contained at this time the city of Babylon. Babylon greatly expanded during the reign of Hammurabi in the first half of the 18th century BC, during the reign of Hammurabi and afterwards, Babylonia was called Māt Akkadī the country of Akkad in the Akkadian language. It was often involved in rivalry with its older fellow Akkadian-speaking state of Assyria in northern Mesopotamia and it retained the Sumerian language for religious use, but by the time Babylon was founded, this was no longer a spoken language, having been wholly subsumed by Akkadian. The earliest mention of the city of Babylon can be found in a tablet from the reign of Sargon of Akkad. During the 3rd millennium BC, a cultural symbiosis occurred between Sumerian and Akkadian-speakers, which included widespread bilingualism. The influence of Sumerian on Akkadian and vice versa is evident in all areas, from lexical borrowing on a scale, to syntactic, morphological. This has prompted scholars to refer to Sumerian and Akkadian in the millennium as a sprachbund. Traditionally, the religious center of all Mesopotamia was the city of Nippur. The empire eventually disintegrated due to decline, climate change and civil war. Sumer rose up again with the Third Dynasty of Ur in the late 22nd century BC and they also seem to have gained ascendancy over most of the territory of the Akkadian kings of Assyria in northern Mesopotamia for a time. The states of the south were unable to stem the Amorite advance, King Ilu-shuma of the Old Assyrian Empire in a known inscription describes his exploits to the south as follows, The freedom of the Akkadians and their children I established. I established their freedom from the border of the marshes and Ur and Nippur, Awal, past scholars originally extrapolated from this text that it means he defeated the invading Amorites to the south, but there is no explicit record of that. More recently, the text has been taken to mean that Asshur supplied the south with copper from Anatolia and these policies were continued by his successors Erishum I and Ikunum. During the first centuries of what is called the Amorite period and his reign was concerned with establishing statehood amongst a sea of other minor city states and kingdoms in the region. However Sumuabum appears never to have bothered to give himself the title of King of Babylon, suggesting that Babylon itself was only a minor town or city. He was followed by Sumu-la-El, Sabium, Apil-Sin, each of whom ruled in the same manner as Sumuabum. Sin-Muballit was the first of these Amorite rulers to be regarded officially as a king of Babylon, the Elamites occupied huge swathes of southern Mesopotamia, and the early Amorite rulers were largely held in vassalage to Elam
23.
History of India
–
Evidence of anatomically modern humans in the Indian subcontinent is recorded as long as 75,000 years ago, or with earlier hominids including Homo erectus from about 500,000 years ago. A sophisticated and technologically advanced urban culture developed in the Mature Harappan period and this civilisation collapsed at the start of the second millennium BCE and was later followed by the Iron Age Vedic Civilisation. The era saw the composition of the Vedas, the texts of Hinduism. The Vedic Civilisation extended over much of the Indo-Gangetic plain and witnessed the rise of major polities known as the Mahajanapadas, in one of these kingdoms, Magadha, Gautama Buddha and Mahavira propagated their Shramanic philosophies during the fifth and sixth century BCE. Most of the subcontinent was conquered by the Maurya Empire during the 4th, from the 3rd century BCE onwards Prakrit and Pali literature in the north and the Tamil Sangam literature in southern India started to flourish. Wootz steel originated in south India in the 3rd century BCE and was exported to foreign countries, various parts of India were ruled by numerous dynasties for the next 1,500 years, among which the Gupta Empire stands out. This period, witnessing a Hindu religious and intellectual resurgence, is known as the classical or Golden Age of India, Indian cultural influence spread over many parts of Southeast Asia which led to the establishment of Indianised kingdoms in Southeast Asia. Southern India saw the rise of imperial powers from the middle of the fifth century, most notable being the Chalukya, Chola, Pallava, Chera, Pandyan. The Chola dynasty conquered southern India and successfully invaded parts of Southeast Asia, Sri Lanka, Maldives, the early medieval period Indian mathematics influenced the development of mathematics and astronomy in the Arab world and the Hindu numerals were introduced. The 15th century saw the emergence of Sikhism, in the 16th century, Mughals came from Central Asia and gradually covered most of India. From the late 18th century to the century, large areas of India were annexed by the British East India Company of the British Empire. James Mill, in his The History of British India, distinguished three phases in the history of India, namely Hindu, Muslim and British civilisations and this periodisation has been influential, but has also been criticised for the misconceptions it gave rise to. Another influential periodisation is the division into ancient, classical, medieval and modern periods, according to Thapar, a periodisation could also be based on significant social and economic changes, which are not strictly related to a change of ruling powers. Tools crafted by proto-humans that have dated back two million years have been discovered in the northwestern part of the subcontinent. The ancient history of the region some of South Asias oldest settlements. The earliest archaeological site in the subcontinent is the Palaeolithic hominid site in the Soan River valley, soanian sites are found in the Sivalik region across what are now India, Pakistan, and Nepal. The first confirmed semi-permanent settlements appeared 9,000 years ago in the Bhimbetka rock shelters in modern Madhya Pradesh, early Neolithic culture in the Indian subcontinent is represented by the Bhirrana findings in Haryana, India as well as Mehrgarh findings in Balochistan, Pakistan. The Edakkal Caves are pictorial writings believed to date to at least 6,000 BCE, from the Neolithic man, the Stone Age carvings of Edakkal are rare and are the only known examples from South India
24.
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
25.
Pythagoreanism
–
Later revivals of Pythagorean doctrines led to what is now called Neopythagoreanism or Neoplatonism. Pythagorean ideas exercised an influence on Aristotle, and Plato. According to tradition, pythagoreanism developed at some point into two schools of thought, the mathēmatikoi and the akousmatikoi. There is the inner and outer circle John Burnet noted Lastly, we have one admitted instance of a philosophic guild, that of the Pythagoreans. And it will be found that the hypothesis, if it is to be called by that name, of a regular organisation of scientific activity will alone explain all the facts. The development of doctrine in the hands of Thales, Anaximander, according to Iamblichus in The life of Pythagoras, by Thomas Taylor There were also two forms of philosophy, for the two genera of those that pursued it, the Acusmatici and the Mathematici. The latter are acknowledged to be Pythagoreans by the rest but the Mathematici do not admit that the Acusmatici derived their instructions from Pythagoras, memory was the most valued faculty. All these auditions were of three kinds, some signifying what a thing is, others what it especially is, others what ought or ought not to be done. By musical sounds alone unaccompanied with words they healed the passions of the soul and certain diseases, enchanting in reality and it is probable that from hence this name epode, i. e. enchantment, came to be generally used. Each of these he corrected through the rule of virtue, attempering them through appropriate melodies, therefore its function is none of what are called ‘parts of virtue’, for it is better than all of them and the end produced is always better than the knowledge that produces it. Nor is every virtue of the soul in that way a function, nor is success, for if it is to be productive, different ones will produce different things, as the skill of building produces a house. However, intelligence is a part of virtue and of success, according to historians like Thomas Gale, Thomas Taler, or Cantor, Archytas became the head of the school, about a century after the murder of Pythagoras. According to August Böckh, who cites Nicomachus, Philolaus was the successor of Pythagoras, and according to Cicero, Philolaus was teacher of Archytas of Tarentum. According to the historians from the Stanford Encyclopedia of Philosophy, Philolaus and Eurytus are identified by Aristoxenus as teachers of the last generation of Pythagoreans, a Echecrates is mentioned by Aristoxenus as a student of Philolaus and Eurytus. The mathēmatikoi were supposed to have extended and developed the more mathematical, the mathēmatikoi did think that the akousmatikoi were Pythagorean, but felt that their own group was more representative of Pythagoras. Commentary from Sir William Smith, Dictionary of Greek and Roman Biography, Aristotle states the fundamental maxim of the Pythagoreans in various forms. According to Philolaus, number is the dominant and self-produced bond of the continuance of things. But number has two forms, the even and the odd, and a third, resulting from the mixture of the two, the even-odd and this third species is one itself, for it is both even and odd
26.
Hippasus
–
Hippasus of Metapontum, was a Pythagorean philosopher. Little is known about his life or his beliefs, but he is credited with the discovery of the existence of irrational numbers. The discovery of irrational numbers is said to have been shocking to the Pythagoreans, the discovery of irrationality is not specifically ascribed to Hippasus by any ancient writer. Some modern scholars though have suggested that he discovered the irrationality of √2, little is known about the life of Hippasus. He may have lived in the late 5th century BC, about a century after the time of Pythagoras, Metapontum in Italy is usually referred to as his birthplace, although according to Iamblichus some claim Metapontum to be his birthplace, while others the nearby city of Croton. Hippasus is recorded under the city of Sybaris in Iamblichus list of each citys Pythagoreans, according to Iamblichus in The life of Pythagoras, by Thomas Taylor There were also two forms of philosophy, for the two genera of those that pursued it, the Acusmatici and the Mathematici. The latter are acknowledged to be Pythagoreans by the rest but the Mathematici do not admit that the Acusmatici derived their instructions from Pythagoras, memory was the most valued faculty. All these auditions were of three kinds, some signifying what a thing is, others what it especially is, others what ought or ought not to be done. Diogenes Laërtius tells us that Hippasus believed that there is a time which the changes in the universe take to complete. According to one statement, Hippasus left no writings, according to another he was the author of the Mystic Discourse, written to bring Pythagoras into disrepute. A scholium on Platos Phaedo notes him as an experimenter in music theory, claiming that he made use of bronze disks to discover the fundamental musical ratios,4,3,3,2. Hippasus is sometimes credited with the discovery of the existence of irrational numbers, Pythagoreans preached that all numbers could be expressed as the ratio of integers, and the discovery of irrational numbers is said to have shocked them. However, the evidence linking the discovery to Hippasus is confused, pappus merely says that the knowledge of irrational numbers originated in the Pythagorean school, and that the member who first divulged the secret perished by drowning. Iamblichus gives a series of inconsistent reports, Iamblichus clearly states that the drowning at sea was a punishment from the gods for impious behaviour. These stories are taken together to ascribe the discovery of irrationals to Hippasus. In principle, the stories can be combined, since it is possible to discover irrational numbers when constructing dodecahedrons, irrationality, by infinite reciprocal subtraction, can be easily seen in the Golden ratio of the regular pentagon. Some modern scholars prefer to credit Hippasus with the discovery of the irrationality of √2. Plato in his Theaetetus, describes how Theodorus of Cyrene proved the irrationality of √3, √5, etc. up to √17, in the hands of modern writers this combination of vague ancient reports and modern guesswork has sometimes evolved into a much more emphatic and colourful tale
27.
Methods of computing square roots
–
In numerical analysis, a branch of mathematics, there are several square root algorithms or methods of computing the principal square root of a non-negative real number. For the square roots of a negative or complex number, see below, finding S is the same as solving the equation f = x 2 − S =0 for a positive x. Therefore, any general numerical root-finding algorithm can be used, many square root algorithms require an initial seed value. If the initial seed value is far away from the square root. It is therefore useful to have an estimate, which may be very inaccurate. For S =125348 =12.5348 ×104, for S =125348 =111101001101001002 =1.11101001101001002 ×216 the binary approximation gives S ≈28 =1000000002 =256. These approximations are useful to find better seeds for iterative algorithms and it can be derived from Newtons method. The process of updating is iterated until desired accuracy is obtained and this is a quadratically convergent algorithm, which means that the number of correct digits of the approximation roughly doubles with each iteration. It proceeds as follows, Begin with a positive starting value x0. Let xn +1 be the average of xn and S/xn, repeat step 2 until the desired accuracy is achieved. It can also be represented as, x 0 ≈ S, x n +1 =12, S = lim n → ∞ x n. Let the relative error in xn be defined by ε n = x n S −1 and thus x n = S ⋅. Then it can be shown that ε n +1 = ε n 22 and thus that 0 ≤ ε n +2 ≤ min and consequently that convergence is assured provided that x0 and S are both positive. If using the rough estimate above with the Babylonian method, then the least accurate cases in ascending order are as follows, S =1, x 0 =2, x 1 =1.250, ε1 =0.250. S =10, x 0 =2, x 1 =3.500, S =10, x 0 =6, x 1 =3.833, ε1 <0.213. S =100, x 0 =6, x 1 =11.333, thus in any case, ε1 ≤2 −2. ε8 <2 −383 <10 −115, rounding errors will slow the convergence. It is recommended to keep at least one extra digit beyond the desired accuracy of the xn being calculated to minimize round off error and this is a method to find each digit of the square root in a sequence
28.
Recursion
–
Recursion occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic, the most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines a number of instances, it is often done in such a way that no loop or infinite chain of references can occur. The ancestors of ones ancestors are also ones ancestors, the Fibonacci sequence is a classic example of recursion, Fib =0 as base case 1, Fib =1 as base case 2, For all integers n >1, Fib, = Fib + Fib. Many mathematical axioms are based upon recursive rules, for example, the formal definition of the natural numbers by the Peano axioms can be described as,0 is a natural number, and each natural number has a successor, which is also a natural number. By this base case and recursive rule, one can generate the set of all natural numbers, recursively defined mathematical objects include functions, sets, and especially fractals. There are various more tongue-in-cheek definitions of recursion, see recursive humor, Recursion is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself. A procedure that goes through recursion is said to be recursive, to understand recursion, one must recognize the distinction between a procedure and the running of a procedure. A procedure is a set of steps based on a set of rules, the running of a procedure involves actually following the rules and performing the steps. An analogy, a procedure is like a recipe, running a procedure is like actually preparing the meal. Recursion is related to, but not the same as, a reference within the specification of a procedure to the execution of some other procedure. For instance, a recipe might refer to cooking vegetables, which is another procedure that in turn requires heating water, for this reason recursive definitions are very rare in everyday situations. An example could be the procedure to find a way through a maze. Proceed forward until reaching either an exit or a branching point, If the point reached is an exit, terminate. Otherwise try each branch in turn, using the procedure recursively, if every trial fails by reaching only dead ends, return on the path led to this branching point. Whether this actually defines a terminating procedure depends on the nature of the maze, in any case, executing the procedure requires carefully recording all currently explored branching points, and which of their branches have already been exhaustively tried. This can be understood in terms of a definition of a syntactic category. A sentence can have a structure in which what follows the verb is another sentence, Dorothy thinks witches are dangerous, so a sentence can be defined recursively as something with a structure that includes a noun phrase, a verb, and optionally another sentence
29.
Trillion (short scale)
–
This list contains selected positive numbers in increasing order, including counts of things, dimensionless quantity and probabilities. Mathematics – Writing, Approximately 10−183,800 is a rough first estimate of the probability that a monkey, however, taking punctuation, capitalization, and spacing into account, the actual probability is far lower, around 10−360,783. Computing, The number 1×10−6176 is equal to the smallest positive non-zero value that can be represented by a quadruple-precision IEEE decimal floating-point value, Computing, The number 6. 5×10−4966 is approximately equal to the smallest positive non-zero value that can be represented by a quadruple-precision IEEE floating-point value. Computing, The number 3. 6×10−4951 is approximately equal to the smallest positive non-zero value that can be represented by a 80-bit x86 double-extended IEEE floating-point value. Computing, The number 1×10−398 is equal to the smallest positive non-zero value that can be represented by a double-precision IEEE decimal floating-point value, Computing, The number 4. 9×10−324 is approximately equal to the smallest positive non-zero value that can be represented by a double-precision IEEE floating-point value. Computing, The number 1×10−101 is equal to the smallest positive non-zero value that can be represented by a single-precision IEEE decimal floating-point value, Mathematics, The probability in a game of bridge of all four players getting a complete suit is approximately 4. 47×10−28. ISO, yocto- ISO, zepto- Mathematics, The probability of matching 20 numbers for 20 in a game of keno is approximately 2.83 × 10−19. ISO, atto- Mathematics, The probability of rolling snake eyes 10 times in a row on a pair of dice is about 2. 74×10−16. ISO, micro- Mathematics – Poker, The odds of being dealt a flush in poker are 649,739 to 1 against. Mathematics – Poker, The odds of being dealt a flush in poker are 72,192 to 1 against. Mathematics – Poker, The odds of being dealt a four of a kind in poker are 4,164 to 1 against, for a probability of 2.4 × 10−4. ISO, milli- Mathematics – Poker, The odds of being dealt a full house in poker are 693 to 1 against, for a probability of 1.4 × 10−3. Mathematics – Poker, The odds of being dealt a flush in poker are 507.8 to 1 against, Mathematics – Poker, The odds of being dealt a straight in poker are 253.8 to 1 against, for a probability of 4 × 10−3. Physics, α =0.007297352570, the fine-structure constant, ISO, deci- Mathematics – Poker, The odds of being dealt only one pair in poker are about 5 to 2 against, for a probability of 0.42. Demography, The population of Monowi, a village in Nebraska. Mathematics, √2 ≈1.414213562373095489, the ratio of the diagonal of a square to its side length. Mathematics, φ ≈1.618033988749895848, the golden ratio Mathematics, the number system understood by most computers, human scale, There are 10 digits on a pair of human hands, and 10 toes on a pair of human feet. Mathematics, The number system used in life, the decimal system, has 10 digits,0,1,2,3,4,5,6,7,8,9
30.
Rational number
–
In mathematics, a rational number is any number that can be expressed as the quotient or fraction p/q of two integers, a numerator p and a non-zero denominator q. Since q may be equal to 1, every integer is a rational number. The set of all numbers, often referred to as the rationals, is usually denoted by a boldface Q, it was thus denoted in 1895 by Giuseppe Peano after quoziente. The decimal expansion of a rational number always either terminates after a number of digits or begins to repeat the same finite sequence of digits over and over. Moreover, any repeating or terminating decimal represents a rational number and these statements hold true not just for base 10, but also for any other integer base. A real number that is not rational is called irrational, irrational numbers include √2, π, e, and φ. The decimal expansion of an irrational number continues without repeating, since the set of rational numbers is countable, and the set of real numbers is uncountable, almost all real numbers are irrational. Rational numbers can be defined as equivalence classes of pairs of integers such that q ≠0, for the equivalence relation defined by ~ if. In abstract algebra, the numbers together with certain operations of addition and multiplication form the archetypical field of characteristic zero. As such, it is characterized as having no proper subfield or, alternatively, finite extensions of Q are called algebraic number fields, and the algebraic closure of Q is the field of algebraic numbers. In mathematical analysis, the numbers form a dense subset of the real numbers. The real numbers can be constructed from the numbers by completion, using Cauchy sequences, Dedekind cuts. The term rational in reference to the set Q refers to the fact that a number represents a ratio of two integers. In mathematics, rational is often used as a noun abbreviating rational number, the adjective rational sometimes means that the coefficients are rational numbers. However, a curve is not a curve defined over the rationals. Any integer n can be expressed as the rational number n/1, a b = c d if and only if a d = b c. Where both denominators are positive, a b < c d if and only if a d < b c. If either denominator is negative, the fractions must first be converted into equivalent forms with positive denominators, through the equations, − a − b = a b, two fractions are added as follows, a b + c d = a d + b c b d
31.
Root of a function
–
In other words, a zero of a function is an input value that produces an output of zero. A root of a polynomial is a zero of the polynomial function. If the function maps real numbers to real numbers, its zeroes are the x-coordinates of the points where its graph meets the x-axis, an alternative name for such a point in this context is an x-intercept. Every equation in the unknown x may be rewritten as f =0 by regrouping all terms in the left-hand side and it follows that the solutions of such an equation are exactly the zeros of the function f. Every real polynomial of odd degree has an odd number of roots, likewise. Consequently, real odd polynomials must have at least one real root, the fundamental theorem of algebra states that every polynomial of degree n has n complex roots, counted with their multiplicities. The non-real roots of polynomials with real coefficients come in conjugate pairs, vietas formulas relate the coefficients of a polynomial to sums and products of its roots. Computing roots of functions, for polynomial functions, frequently requires the use of specialised or approximation techniques. However, some functions, including all those of degree no greater than 4. In topology and other areas of mathematics, the set of a real-valued function f, X → R is the subset f −1 of X. Zero sets are important in many areas of mathematics. One area of importance is algebraic geometry, where the first definition of an algebraic variety is through zero-sets. For instance, for each set S of polynomials in k, one defines the zero-locus Z to be the set of points in An on which the functions in S simultaneously vanish, that is to say Z =. Then a subset V of An is called an algebraic set if V = Z for some S. These affine algebraic sets are the building blocks of algebraic geometry. Zero Pole Fundamental theorem of algebra Newtons method Sendovs conjecture Mardens theorem Vanish at infinity Zero crossing Weisstein, Eric W. Root
32.
Euclidean algorithm
–
It is named after the ancient Greek mathematician Euclid, who first described it in Euclids Elements. It is an example of an algorithm, a procedure for performing a calculation according to well-defined rules. It can be used to reduce fractions to their simplest form, the Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example,21 is the GCD of 252 and 105, since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the two numbers. By reversing the steps, the GCD can be expressed as a sum of the two numbers each multiplied by a positive or negative integer, e. g.21 =5 ×105 + ×252. The fact that the GCD can always be expressed in this way is known as Bézouts identity, the version of the Euclidean algorithm described above can take many subtraction steps to find the GCD when one of the given numbers is much bigger than the other. A more efficient version of the algorithm shortcuts these steps, instead replacing the larger of the two numbers by its remainder when divided by the smaller of the two. With this improvement, the algorithm never requires more steps than five times the number of digits of the smaller integer and this was proven by Gabriel Lamé in 1844, and marks the beginning of computational complexity theory. Additional methods for improving the algorithms efficiency were developed in the 20th century, the Euclidean algorithm has many theoretical and practical applications. It is used for reducing fractions to their simplest form and for performing division in modular arithmetic, finally, it can be used as a basic tool for proving theorems in number theory such as Lagranges four-square theorem and the uniqueness of prime factorizations. This led to abstract algebraic notions such as Euclidean domains. The Euclidean algorithm calculates the greatest common divisor of two numbers a and b. The greatest common divisor g is the largest natural number that divides both a and b without leaving a remainder, synonyms for the GCD include the greatest common factor, the highest common factor, the highest common divisor, and the greatest common measure. The greatest common divisor is often written as gcd or, more simply, as, although the notation is also used for other mathematical concepts. If gcd =1, then a and b are said to be coprime and this property does not imply that a or b are themselves prime numbers. For example, neither 6 nor 35 is a prime number, nevertheless,6 and 35 are coprime. No natural number other than 1 divides both 6 and 35, since they have no prime factors in common
33.
Coprime
–
In number theory, two integers a and b are said to be relatively prime, mutually prime, or coprime if the only positive integer that divides both of them is 1. That is, the common positive factor of the two numbers is 1. This is equivalent to their greatest common divisor being 1, the numerator and denominator of a reduced fraction are coprime. In addition to gcd =1 and =1, the notation a ⊥ b is used to indicate that a and b are relatively prime. For example,14 and 15 are coprime, being divisible by only 1. The numbers 1 and −1 are the only integers coprime to every integer, a fast way to determine whether two numbers are coprime is given by the Euclidean algorithm. The number of integers coprime to an integer n, between 1 and n, is given by Eulers totient function φ. A set of integers can also be called if its elements share no common positive factor except 1. A set of integers is said to be pairwise coprime if a and b are coprime for every pair of different integers in it, a number of conditions are individually equivalent to a and b being coprime, No prime number divides both a and b. There exist integers x and y such that ax + by =1, the integer b has a multiplicative inverse modulo a, there exists an integer y such that by ≡1. In other words, b is a unit in the ring Z/aZ of integers modulo a, the least common multiple of a and b is equal to their product ab, i. e. LCM = ab. As a consequence of the point, if a and b are coprime and br ≡ bs. That is, we may divide by b when working modulo a, as a consequence of the first point, if a and b are coprime, then so are any powers ak and bl. If a and b are coprime and a divides the product bc and this can be viewed as a generalization of Euclids lemma. In a sense that can be made precise, the probability that two randomly chosen integers are coprime is 6/π2, which is about 61%, two natural numbers a and b are coprime if and only if the numbers 2a −1 and 2b −1 are coprime. As a generalization of this, following easily from the Euclidean algorithm in base n >1, a set of integers S = can also be called coprime or setwise coprime if the greatest common divisor of all the elements of the set is 1. For example, the integers 6,10,15 are coprime because 1 is the positive integer that divides all of them. If every pair in a set of integers is coprime, then the set is said to be pairwise coprime, pairwise coprimality is a stronger condition than setwise coprimality, every pairwise coprime finite set is also setwise coprime, but the reverse is not true