Results 71 to 80 of about 20,123 (196)
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
ABSTRACT Background Empirical studies have revealed students' development of computational thinking (CT) and mathematical thinking (MT) during programming‐based mathematical problem‐solving, highlighting specific CT concepts or practices that serve as learning goals or outcomes.
Huiyan Ye, Biyao Liang, Oi‐Lam Ng
wiley +1 more source
The diophantine equation r2+r(x+y)=kxy
The Diophantine equation of the title is solved in integers.
W. R. Utz
doaj +1 more source
Inhomogeneous Khintchine–Groshev theorem without monotonicity
Abstract The Khintchine–Groshev theorem in Diophantine approximation theory says that there is a dichotomy of the Lebesgue measure of sets of ψ$\psi$‐approximable numbers, given a monotonic function ψ$\psi$. Allen and Ramírez removed the monotonicity condition from the inhomogeneous Khintchine–Groshev theorem for cases with nm⩾3$nm\geqslant 3$ and ...
Seongmin Kim
wiley +1 more source
Diophantine equations in separated variables and polynomial power sums. [PDF]
Fuchs C, Heintze S.
europepmc +1 more source
We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.Comment: 58 pages. to appear in the Moscow Mathematical Journal vo. 4 N.1
Waldschmidt, Michel
core +3 more sources
Exponential Diophantine equations [PDF]
Brenner, J. L., Foster, Lorraine L.
openaire +3 more sources
On the integral values of a curious recurrence
We discuss a problem initially thought for the Mathematical Olympiad but which has several interpretations. The recurrence sequences involved in this problem may be generalized to recurrence sequences related to a much larger set of diophantine ...
Dvornicich, Roberto +2 more
core
Diophantine Solutions Based Permutation for Image Encryption
A permutation technique based on the resolution of the system of three independent Diophantine equations is presented. Each Diophantine equation parameters are two positive integers generated from a chaotic system.
J. S. Armand Eyebe Fouda +3 more
doaj +1 more source

