Results 11 to 20 of about 7,521 (156)
Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Building on theoretical insights and rich experimental data of our preprints, we present here new theoretical and experimental results in three interrelated approaches to the Collatz problem and its generalizations: \emphalgorithmic decidability, random ...
Edward G. Belaga, Maurice Mignotte
doaj +1 more source
Rational solutions of pairs of diagonal equations, one cubic and one quadratic [PDF]
, 2014 We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine equations, one ...
Baker +20 more
core +6 more sources
Two exponential Diophantine equations [PDF]
Glasgow Mathematical Journal, 1997 In [3], two open problems were whether either of the diophantine equationswith n ∈ Z and f a prime number, is solvable if ω > 3 and 3 √ ω, but in this paper we allow f to be any (rational) integer and also 3 | ω. Equations of this form and more general ones can effectively be solved [5] with an advanced method based on analytical results, but the ...
openaire +1 more source
An exponential diophantine equation [PDF]
Bulletin of the Australian Mathematical Society, 2001 Let p be an odd prime with p > 3. In this paper we give all positive integer solutions (x, y, m, n) of the equation x2 + p2m = yn, gcd (x, y) = 1, n > 2 satisfying 2 | n of 2 ∤ n and p ≢ (−1)(p−1)/2(mod 4n.
openaire +1 more source
Two exponential diophantine equations [PDF]
Journal de théorie des nombres de Bordeaux, 2017 The equation 3 a +5 b -7 c =1, to be solved in non-negative rational integers a,b,c, has been mentioned by Masser as an example for which there is still no algorithm to solve completely. Despite this, we find here all the solutions. The equation y 2 =3 a +2 b +1, to be solved in non-negative rational integers a,b and a rational integer y, has been ...
openaire +1 more source
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
Vinogradov's mean value theorem via efficient congruencing [PDF]
, 2011 We obtain estimates for Vinogradov's integral which for the first time approach those conjectured to be the best possible. Several applications of these new bounds are provided.
Arkhipov +13 more
core +6 more sources
The Exponential Diophantine Equation 4m2+1x+5m2-1y=(3m)z
Abstract and Applied Analysis, 2014 Let m be a positive integer. In this paper, using some properties of exponential diophantine equations and some results on the existence of primitive divisors of Lucas numbers, we prove that if m>90 and 3|m, then the equation 4m2+1x + 5m2-1y=(3m)z has ...
Juanli Su, Xiaoxue Li
doaj +1 more source
, 2007 We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by rep- resenting integers as vertices and by drawing cliques between M
Bedogne, C, Masucci, AP, Rodgers, GJ
core +2 more sources
Small two-variable exponential Diophantine equations [PDF]
Mathematics of Computation, 1993 We examine exponential Diophantine equations of the form a b x = c d y + e a{b^x} = c{d^y} + e . Consider a ≤ 50 a \leq 50 , c ≤
openaire +1 more source