Results 21 to 30 of about 147 (145)
Diophantine Equation 41k2−nx+4kny=41k2+nz
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
Euclidean algorithms are Gaussian over imaginary quadratic fields
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
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
A circle method approach to K‐multimagic squares
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
On a conjecture on exponential Diophantine equations [PDF]
We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this is the only solution in integers greater than 1, with the possible exception of finitely many values $(c,r)$. We
Cipu, Mihai, Mignotte, Maurice
openaire +2 more sources
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
Jeśmanowicz' conjecture on exponential diophantine equations
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
Localized and Extended Phases in Square Moiré Patterns
Rotated superimposed lattices in two dimensions, the termed moiré patterns, represent a clear example of how the structure affects the physical properties of a particle moving on it. A robust numerical treatment of continuous and discrete models leads to confirm that while localized states result from angles that produce non‐commensurable lattices ...
C. Madroñero +2 more
wiley +1 more source
On an Erdős similarity problem in the large
Abstract In a recent paper, Kolountzakis and Papageorgiou ask if for every ε∈(0,1]$\epsilon \in (0,1]$, there exists a set S⊆R$S \subseteq \mathbb {R}$ such that |S∩I|⩾1−ε$\vert S \cap I\vert \geqslant 1 - \epsilon$ for every interval I⊂R$I \subset \mathbb {R}$ with unit length, but that does not contain any affine copy of a given increasing sequence ...
Xiang Gao +2 more
wiley +1 more source
Exponential diophantine equations with four terms
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

