1.
Inverse trigonometric functions
–
In mathematics, the inverse trigonometric functions are the inverse functions of the trigonometric functions. Specifically, they are the inverses of the sine, cosine, tangent, cotangent, secant, and cosecant functions, inverse trigonometric functions are widely used in engineering, navigation, physics, and geometry. There are several notations used for the trigonometric functions. The most common convention is to name inverse trigonometric functions using a prefix, e. g. arcsin, arccos, arctan. This convention is used throughout the article, when measuring in radians, an angle of θ radians will correspond to an arc whose length is rθ, where r is the radius of the circle. Similarly, in programming languages the inverse trigonometric functions are usually called asin, acos. The notations sin−1, cos−1, tan−1, etc, the confusion is somewhat ameliorated by the fact that each of the reciprocal trigonometric functions has its own name—for example, −1 = sec. Nevertheless, certain authors advise against using it for its ambiguity, since none of the six trigonometric functions are one-to-one, they are restricted in order to have inverse functions. There are multiple numbers y such that sin = x, for example, sin =0, when only one value is desired, the function may be restricted to its principal branch. With this restriction, for x in the domain the expression arcsin will evaluate only to a single value. These properties apply to all the trigonometric functions. The principal inverses are listed in the following table, if x is allowed to be a complex number, then the range of y applies only to its real part. Trigonometric functions of trigonometric functions are tabulated below. This is derived from the tangent addition formula tan = tan + tan 1 − tan tan , like the sine and cosine functions, the inverse trigonometric functions can be calculated using power series, as follows. For arcsine, the series can be derived by expanding its derivative,11 − z 2, as a binomial series, the series for arctangent can similarly be derived by expanding its derivative 11 + z 2 in a geometric series and applying the integral definition above. Arcsin = z + z 33 + z 55 + z 77 + ⋯ = ∑ n =0 ∞, for example, arccos x = π /2 − arcsin x, arccsc x = arcsin , and so on. Alternatively, this can be expressed, arctan z = ∑ n =0 ∞22 n 2. There are two cuts, from −i to the point at infinity, going down the imaginary axis and it works best for real numbers running from −1 to 1

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

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

4.
15 (number)
–
15 is the natural number following 14 and preceding 16. In English, it is the smallest natural number with seven letters in its spelled name, in spoken English, the numbers 15 and 50 are often confused because they sound similar. When carefully enunciated, they differ in which syllable is stressed,15 /fɪfˈtiːn/ vs 50 /ˈfɪfti/, however, in dates such as 1500 or when contrasting numbers in the teens, the stress generally shifts to the first syllable,15 /ˈfɪftiːn/. In a 24-hour clock, the hour is in conventional language called three or three oclock. A composite number, its divisors being 1,3 and 5. A repdigit in binary and quaternary, in hexadecimal, as well as all higher bases,15 is represented as F. the 4th discrete semiprime and the first member of the discrete semiprime family. It is thus the first odd discrete semiprime, the number proceeding 15,14 is itself a discrete semiprime and this is the first such pair of discrete semiprimes. The next example is the pair commencing 21, the smallest number that can be factorized using Shors quantum algorithm. With only two exceptions, all prime quadruplets enclose a multiple of 15, with 15 itself being enclosed by the quadruplet, the aliquot sum of 15 is 9, a square prime 15 has an aliquot sequence of 6 members. 15 is the composite number in the 3-aliquot tree. The abundant 12 is also a member of this tree, fifteen is the aliquot sum of the consecutive 4-power 16, and the discrete semiprime 33. 15 and 16 form a Ruth-Aaron pair under the definition in which repeated prime factors are counted as often as they occur. There are 15 solutions to Známs problem of length 7, if a positive definite quadratic form with integer matrix represents all positive integers up to 15, then it represents all positive integers via the 15 and 290 theorems. Group 15 of the table are sometimes known as the pnictogens. 15 Madadgar is designated as a number in Pakistan, for mobile phones, similar to the international GSM emergency number 112, if 112 is used in Pakistan. 112 can be used in an emergency if the phone is locked. The Hanbali Sunni madhab states that the age of fifteen of a solar or lunar calendar is when ones taklif begins and is the stage whereby one has his deeds recorded. In the Hebrew numbering system, the number 15 is not written according to the method, with the letters that represent 10 and 5

5.
Natural number
–
In mathematics, the natural numbers are those used for counting and ordering. In common language, words used for counting are cardinal numbers, texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, but in other writings, that term is used instead for the integers. These chains of extensions make the natural numbers canonically embedded in the number systems. Properties of the numbers, such as divisibility and the distribution of prime numbers, are studied in number theory. Problems concerning counting and ordering, such as partitioning and enumerations, are studied in combinatorics, the most primitive method of representing a natural number is to put down a mark for each object. Later, a set of objects could be tested for equality, excess or shortage, by striking out a mark, the first major advance in abstraction was the use of numerals to represent numbers. This allowed systems to be developed for recording large numbers, the ancient Egyptians developed a powerful system of numerals with distinct hieroglyphs for 1,10, and all the powers of 10 up to over 1 million. A stone carving from Karnak, dating from around 1500 BC and now at the Louvre in Paris, depicts 276 as 2 hundreds,7 tens, and 6 ones, and similarly for the number 4,622. A much later advance was the development of the idea that 0 can be considered as a number, with its own numeral. The use of a 0 digit in place-value notation dates back as early as 700 BC by the Babylonians, the Olmec and Maya civilizations used 0 as a separate number as early as the 1st century BC, but this usage did not spread beyond Mesoamerica. The use of a numeral 0 in modern times originated with the Indian mathematician Brahmagupta in 628, the first systematic study of numbers as abstractions is usually credited to the Greek philosophers Pythagoras and Archimedes. Some Greek mathematicians treated the number 1 differently than larger numbers, independent studies also occurred at around the same time in India, China, and Mesoamerica. In 19th century Europe, there was mathematical and philosophical discussion about the nature of the natural numbers. A school of Naturalism stated that the numbers were a direct consequence of the human psyche. Henri Poincaré was one of its advocates, as was Leopold Kronecker who summarized God made the integers, in opposition to the Naturalists, the constructivists saw a need to improve the logical rigor in the foundations of mathematics. In the 1860s, Hermann Grassmann suggested a recursive definition for natural numbers thus stating they were not really natural, later, two classes of such formal definitions were constructed, later, they were shown to be equivalent in most practical applications. The second class of definitions was introduced by Giuseppe Peano and is now called Peano arithmetic and it is based on an axiomatization of the properties of ordinal numbers, each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent with several systems of set theory