TOPICS
Search

Search Results for ""


41 - 50 of 369 for Diophantine ApproximationSearch Results
The Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...
Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...
A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...
Jackson's theorem is a statement about the error E_n(f) of the best uniform approximation to a real function f(x) on [-1,1] by real polynomials of degree at most n. Let f(x) ...
The Diophantine equation x^2+k=y^3, which is also an elliptic curve. The general equation is still the focus of ongoing study.
Solve the Pell equation x^2-92y^2=1 in integers. The smallest solution is x=1151, y=120.
A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).
Let E_n(f) be the error of the best uniform approximation to a real function f(x) on the interval [-1,1] by real polynomials of degree at most n. If alpha(x)=|x|, (1) then ...
1|2|3|4|5|6|7|8 ... 37 Previous Next

...