TOPICS
Search

Search Results for ""


31 - 40 of 369 for Diophantine ApproximationSearch Results
The 10.1.2 equation A^(10)=B^(10)+C^(10) (1) is a special case of Fermat's last theorem with n=10, and so has no solution. No 10.1.n solutions are known with n<13. A 10.1.13 ...
As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...
The 6.1.2 equation A^6=B^6+C^6 (1) is a special case of Fermat's last theorem with n=6, and so has no solution. No 6.1.n solutions are known for n<=6 (Lander et al. 1967; Guy ...
As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...
The 5.1.2 fifth-order Diophantine equation A^5=B^5+C^5 (1) is a special case of Fermat's last theorem with n=5, and so has no solution. improving on the results on Lander et ...
A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...
There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...
In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...
Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
1|2|3|4|5|6|7 ... 37 Previous Next

...