Results 41 to 50 of about 7,521 (156)
Positivity Problems for Low-Order Linear Recurrence Sequences
, 2013 We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a given LRS ...
Ouaknine, Joel, Worrell, James
core +1 more source
Jeśmanowicz' conjecture on exponential diophantine equations
Functiones et Approximatio Commentarii Mathematici, 2011 Jeśmanowicz' conjecture is the following statement: If \(a\), \(b\), \(c\) are coprime positive integers such that \(a^2+b^2=c^2\) with even \(b\), then the exponential equation \(a^x+b^y=c^z\) has the only solution \((x,y,z)=(2,2,2)\) in positive integers. This paper contains various new results on this conjecture.
openaire +2 more sources
The dimension of well approximable numbers
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming from Besicovitch's result, with a focus on the mass transference principle, ubiquity and Diophantine ...
Victor Beresnevich, Sanju Velani
wiley +1 more source
Diophantine Equation 41k2−nx+4kny=41k2+nz
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let (a, b, c) be a primitive Pythagorean triple such that a2 + b2 = c2 with 2|b. In 1956, L. Jesmanowicz conjectured that, for any positive integer n, the equation (an)x + (bn)y = (cn)z has only the positive solution (x, y, z) = (2, 2, 2). In 1959, Lu Wenduan claimed that if n = 1 and (a, b, c) = (4k2 − 1, 4k, 4k2 + 1), then the conjecture is true ...
Nai-juan Deng +2 more
wiley +1 more source
Exponential diophantine equations with four terms
Indagationes Mathematicae, 1992 This article gives some examples how to make exponential diophantine equations more practical. The authors take the large exponential bounds for solutions given by Baker's method to computational available bounds. Let \(p\) and \(q\) be distinct primes less than 200. The main theorems are: (1) Every solution of the equation \(p^ x q^ y\pm p^ z \pm q^ w
Deze, Mo, Tijdeman, R.
openaire +2 more sources
Euclidean algorithms are Gaussian over imaginary quadratic fields
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract We prove that the distribution of the number of steps of the Euclidean algorithm of rationals in imaginary quadratic fields with denominators bounded by N$N$ is asymptotically Gaussian as N$N$ goes to infinity, extending a result by Baladi and Vallée for the real case.
Dohyeong Kim, Jungwon Lee, Seonhee Lim
wiley +1 more source
Iitaka fibrations and integral points: A family of arbitrarily polarized spherical threefolds
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract Studying Manin's program for a family of spherical log Fano threefolds, we determine the asymptotic number of integral points whose height associated with an arbitrary ample line bundle is bounded. This confirms a recent conjecture by Santens and sheds new light on the logarithmic analog of Iitaka fibrations, which have not yet been adequately
Ulrich Derenthal, Florian Wilsch
wiley +1 more source
Generic Nekhoroshev theory without small divisors [PDF]
, 2009 In this article, we present a new approach of Nekhoroshev theory for a generic unperturbed Hamiltonian which completely avoids small divisors problems. The proof is an extension of a method introduced by P.
Bounemoura, Abed, Niederman, Laurent
core
A circle method approach to K‐multimagic squares
Journal of the London Mathematical Society, Volume 112, Issue 3, September 2025.Abstract In this paper, we investigate K$K$‐multimagic squares of order N$N$. These are N×N$N \times N$ magic squares that remain magic after raising each element to the k$k$th power for all 2⩽k⩽K$2 \leqslant k \leqslant K$. Given K⩾2$K \geqslant 2$, we consider the problem of establishing the smallest integer N2(K)$N_2(K)$ for which there exist ...
Daniel Flores
wiley +1 more source
Computer Applications in Engineering Education, Volume 33, Issue 4, July 2025.ABSTRACT Integer and modular arithmetic is a fundamental area of mathematics, with extensive applications in computer science, and is essential for cryptographic protocols, error correction, and algorithm efficiency. However, students often struggle to understand its abstract nature, especially when transitioning from theoretical knowledge to practical
Violeta Migallón +2 more
wiley +1 more source