Displaying 4501 – 4520 of 16591

Showing per page

Exponents for three-dimensional simultaneous Diophantine approximations

Nikolay Moshchevitin (2012)

Czechoslovak Mathematical Journal

Let Θ = ( θ 1 , θ 2 , θ 3 ) 3 . Suppose that 1 , θ 1 , θ 2 , θ 3 are linearly independent over . For Diophantine exponents α ( Θ ) = sup { γ > 0 : lim sup t + t γ ψ Θ ( t ) < + } , β ( Θ ) = sup { γ > 0 : lim inf t + t γ ψ Θ ( t ) < + } we prove β ( Θ ) 1 2 α ( Θ ) 1 - α ( Θ ) + α ( Θ ) 1 - α ( Θ ) 2 + 4 α ( Θ ) 1 - α ( Θ ) α ( Θ ) .

Exponents of Diophantine Approximation and Sturmian Continued Fractions

Yann Bugeaud, Michel Laurent (2005)

Annales de l’institut Fourier

Let ξ be a real number and let n be a positive integer. We define four exponents of Diophantine approximation, which complement the exponents w n ( ξ ) and w n * ( ξ ) defined by Mahler and Koksma. We calculate their six values when n = 2 and ξ is a real number whose continued fraction expansion coincides with some Sturmian sequence of positive integers, up to the initial terms. In particular, we obtain the exact exponent of approximation to such a continued fraction ξ by quadratic surds.

Exposants de Lojasiewicz dans le cas semi-algebrique p-adique

Azzeddine Fekak, Ahmed Srhir (2002)

Annales Polonici Mathematici

We prove the rationality of the Łojasiewicz exponent for p-adic semi-algebraic functions without compactness hypothesis. In the parametric case, we show that the parameter space can be divided into a finite number of semi-algebraic sets on each of which the Łojasiewicz exponent is constant.

Expressing a number as the sum of two coprime squares.

Warren Dicks, Joan Porti (1998)

Collectanea Mathematica

We use hyperbolic geometry to study the limiting behavior of the average number of ways of expressing a number as the sum of two coprime squares. An alternative viewpoint using analytic number theory is also given.

Extended Euclidean Algorithm and CRT Algorithm

Hiroyuki Okazaki, Yosiki Aoki, Yasunari Shidama (2012)

Formalized Mathematics

In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based...

Currently displaying 4501 – 4520 of 16591