Results 81 to 90 of about 983 (218)
Padovan and Perrin numbers of the form 7ᵗ-5ᶻ-3ʸ-2ˣ [PDF]
Notes on Number Theory and Discrete MathematicsConsider the Padovan sequence (pₙ)ₙ≥₀ given by pₙ₊₃=pₙ₊₁+pₙ with p₀=p₁=p₂=1. Its companion sequence, the Perrin sequence (℘ₙ)ₙ≥₀, follows the same recursive formula as the Padovan numbers, but with different initial values: p₀=3, p₁=0 and p₂=2.
Djamel Bellaouar +2 more
doaj +1 more source
GCD inequalities arising from codimension‐2 blowups
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract Assuming a deep Diophantine geometry conjecture by Vojta, Silverman proved an inequality giving an upper bound for the greatest common divisor (GCD). In this paper, we unconditionally prove a weaker version of this inequality. The main ingredient is the Ru–Vojta theory, which provides an efficient method of using Schmidt subspace theorem.
Yu Yasufuku
wiley +1 more source
Diophantine linear equations, quadratics and applications [PDF]
, 2017 Este trabalho é resultado de uma pesquisa bibliográfica sobre Diofanto e as equações que levam seu nome, as equações diofantinas. Mais especificamente, apresentamos as equações diofantinas lineares e alguns casos particulares das equações diofantinas ...
Souza, Romario Sidrone [UNESP]
core
Some bounds related to the 2‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 2, April 2026.Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
On efficiently characterizing solutions of linear diophantine equations and its application to data dependence analysis [PDF]
, 1992 In this paper we present severals sets of mathematical tools for characterizing the solutions of linear Diophantine equations. First, a number of methods are given for reducing the complexity of the computations.
Temam, Olivier +2 more
core +3 more sources
Mathematika, Volume 72, Issue 2, April 2026.Abstract In 2019 Kleinbock and Wadleigh proved a “zero‐one law” for uniform inhomogeneous Diophantine approximations. We generalize this statement to arbitrary weight functions and establish a new and simple proof of this statement, based on the transference principle. We also give a complete description of the sets of g$g$‐Dirichlet pairs with a fixed
Vasiliy Neckrasov
wiley +1 more source
NP-completeness conditions for some types of systems of linear diophantine dis-equations consistency checking [PDF]
, 2016 Three series of number-theoretic problems concerning systems of Diophantine linear dis-equations with explicitly pointed out parameters are proposed in this part of the paper. Conditions upon the parameters implying that every problem of a series is an
Kosovskii, Nikolai N. +2 more
core +1 more source
Discovery of Exact Equations for Integer Sequences
MathematicsEquation discovery, also known as symbolic regression, is the field of machine learning that studies algorithms for discovering quantitative laws, expressed as closed-form equations or formulas, in collections of observed data.
Boštjan Gec +2 more
doaj +1 more source
Diophantine Equations and Linear Recurrences [PDF]
, 2020 Ph.D. Thesis defense.
openaire +1 more source
Distribution of integer points on determinant surfaces and a mod‐p analogue
Mathematika, Volume 72, Issue 2, April 2026.Abstract We establish an asymptotic formula for counting integer solutions with smooth weights to an equation of the form xy−zw=r$xy-zw=r$, where r$r$ is a non‐zero integer, with an explicit main term and a strong bound on the error term in terms of the size of the variables x,y,z,w$x, y, z, w$ as well as of r$r$.
Satadal Ganguly, Rachita Guria
wiley +1 more source