|
Quadratic Irrational
In mathematics, a quadratic irrational number (also known as a quadratic irrational, a quadratic irrationality or quadratic surd) is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ration ...s. Since fractions in the coefficients of a quadratic equation can be cleared by multiplying both sides by their least common denominator, a quadratic irrational is an irrational root of some quadratic equation with integer coefficients. The quadratic irrational numbers, a subset of the complex numbers, are algebraic numbers of Algebraic number#Properties, degree 2, and can therefore be expressed as :, for integers ; with , and non-zero, and with Square-free in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book ''Disquisitiones Arithmeticae'', published in 1801. A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in , but clocks "wrap around" every 12 hours. Because the hour number starts over at zero when it reaches 12, this is arithmetic ''modulo'' 12. In terms of the definition below, 15 is ''congruent'' to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock. Congruence Given an integer , called a modulus, two integers and are said to be congruent modulo , if is a divisor of their difference (that is, if there is an integer such that ). Congruence modulo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gauss–Kuzmin–Wirsing Operator
In mathematics, the Gauss–Kuzmin–Wirsing operator is the transfer operator of the Gauss map that takes a positive number to the fractional part of its reciprocal. (This is not the same as the Gauss map in differential geometry.) It is named after Carl Gauss, Rodion Kuzmin, and Eduard Wirsing. It occurs in the study of continued fractions; it is also related to the Riemann zeta function. Relationship to the maps and continued fractions The Gauss map The Gauss function (map) ''h'' is : :h(x)=1/x-\lfloor 1/x \rfloor. where \lfloor 1/x \rfloor denotes the floor function. It has an infinite number of jump discontinuities at ''x'' = 1/''n'', for positive integers ''n''. It is hard to approximate it by a single smooth polynomial. Operator on the maps The Gauss–Kuzmin–Wirsing operator G acts on functions f as : fx) = \int_0^1 \delta(x-h(y)) f(y) d y = \sum_^\infty \frac f \left(\frac \right). Eigenvalues of the operator The first eigenfunction of this ope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dyadic Transformation
The dyadic transformation (also known as the dyadic map, bit shift map, 2''x'' mod 1 map, Bernoulli map, doubling map or sawtooth map) is the mapping (i.e., recurrence relation) : T: , 1) \to [0, 1)^\infty : x \mapsto (x_0, x_1, x_2, \ldots) (where [0, 1)^\infty is the set of sequences from [0, 1)) produced by the rule : x_0 = x : \text n \ge 0,\ x_ = (2 x_n) \bmod 1. Equivalently, the dyadic transformation can also be defined as the iterated function map of the piecewise linear function : T(x)=\begin2x & 0 \le x < \frac \\2x-1 & \frac \le x < 1. \end The name ''bit shift map'' arises because, if the value of an iterate is written in notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero. The dyadic transform ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Periodic Orbit
In mathematics, in the study of iterated functions and dynamical systems, a periodic point of a function is a point which the system returns to after a certain number of function iterations or a certain amount of time. Iterated functions Given a mapping ''f'' from a set ''X'' into itself, :f: X \to X, a point ''x'' in ''X'' is called periodic point if there exists an ''n'' so that :\ f_n(x) = x where f_n is the ''n''th iterate of ''f''. The smallest positive integer ''n'' satisfying the above is called the ''prime period'' or ''least period'' of the point ''x''. If every point in ''X'' is a periodic point with the same period ''n'', then ''f'' is called ''periodic'' with period ''n'' (this is not to be confused with the notion of a periodic function). If there exist distinct ''n'' and ''m'' such that :f_n(x) = f_m(x) then ''x'' is called a preperiodic point. All periodic points are preperiodic. If ''f'' is a diffeomorphism of a differentiable manifold, so that the derivative f_n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minkowski's Question Mark Function
In mathematics, the Minkowski question-mark function, denoted , is a function with unusual fractal properties, defined by Hermann Minkowski in 1904. It maps quadratic irrational numbers to rational numbers on the unit interval, via an expression relating the continued fraction expansions of the quadratics to the binary expansions of the rationals, given by Arnaud Denjoy in 1938. It also maps rational numbers to dyadic rationals, as can be seen by a recursive definition closely related to the Stern–Brocot tree. Definition and intuition One way to define the question-mark function involves the correspondence between two different ways of representing fractional numbers using finite or infinite binary sequences. Most familiarly, a string of 0's and 1's with a single point mark ".", like "11.001001000011111..." can be interpreted as the binary representation of a number. In this case this number is 2+1+\frac18+\frac1+\cdots=\pi. There is a different way of interpreting the same s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Periodic Continued Fraction
In mathematics, an infinite periodic continued fraction is a continued fraction that can be placed in the form : x = a_0 + \cfrac where the initial block of ''k'' + 1 partial denominators is followed by a block 'a''''k''+1, ''a''''k''+2,...''a''''k''+''m''of partial denominators that repeats over and over again, ''ad infinitum''. For example, \sqrt2 can be expanded to a periodic continued fraction, namely as ,2,2,2,... The partial denominators can in general be any real or complex numbers. That general case is treated in the article convergence problem. The remainder of this article is devoted to the subject of simple continued fractions that are also periodic. In other words, the remainder of this article assumes that all the partial denominators ''a''''i'' (''i'' ≥ 1) are positive integers. Purely periodic and periodic fractions Since all the partial numerators in a regular continued fraction are equal to unity we can adopt a shorthand notation in which t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continued Fraction
In mathematics, a continued fraction is an expression (mathematics), expression obtained through an iterative process of representing a number as the sum of its integer part and the multiplicative inverse, reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression (mathematics), infinite expression. In either case, all integers in the sequence, other than the first, must be positive number, positive. The integers a_i are called the coefficients or terms of the continued fraction. It is generally assumed that the numerator of all of the fractions is 1. If arbitrary values and/or function (mathematics), functions are used in place of one or more of the numerat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multiplicative Inverse
In mathematics, a multiplicative inverse or reciprocal for a number ''x'', denoted by 1/''x'' or ''x''−1, is a number which when Multiplication, multiplied by ''x'' yields the multiplicative identity, 1. The multiplicative inverse of a rational number, fraction ''a''/''b'' is ''b''/''a''. For the multiplicative inverse of a real number, divide 1 by the number. For example, the reciprocal of 5 is one fifth (1/5 or 0.2), and the reciprocal of 0.25 is 1 divided by 0.25, or 4. The reciprocal function, the Function (mathematics), function ''f''(''x'') that maps ''x'' to 1/''x'', is one of the simplest examples of a function which is its own inverse (an Involution (mathematics), involution). Multiplying by a number is the same as Division (mathematics), dividing by its reciprocal and vice versa. For example, multiplication by 4/5 (or 0.8) will give the same result as division by 5/4 (or 1.25). Therefore, multiplication by a number followed by multiplication by its reciprocal yiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Field
In algebraic number theory, a quadratic field is an algebraic number field of degree two over \mathbf, the rational numbers. Every such quadratic field is some \mathbf(\sqrt) where d is a (uniquely defined) square-free integer different from 0 and 1. If d>0, the corresponding quadratic field is called a real quadratic field, and, if d<0, it is called an imaginary quadratic field or a complex quadratic field, corresponding to whether or not it is a subfield of the field of the s. Quadratic fields have been studied in great depth, initially as part of the theory of s. There remain some unsolved prob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
