Results 91 to 100 of about 2,597 (231)

On the Diophantine equation Ax2+22m=yn

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2001
Let h denote the class number of the quadratic field ℚ(−A) for a square free odd integer A>1, and suppose that n>2 is an odd integer with (n,h)=1 and m>1.
Fadwa S. Abu Muriefah
doaj   +1 more source

Random Diophantine equations in the primes II

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley   +1 more source

The diophantine equation ni+1=k(dn−1)

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1989
The Diophantine equation of the title is solved for i=3,4 and an infinite family of solutions were found for i≥5.
Steve Ligh, Keith Bourque
doaj   +1 more source

Tessellation Groups, Harmonic Analysis on Non‐Compact Symmetric Spaces and the Heat Kernel in View of Cartan Convolutional Neural networks

open access: yesFortschritte der Physik, Volume 74, Issue 4, April 2026.
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré   +4 more
wiley   +1 more source

General Solution of the Diophantine equation involving Mersenne Prime [PDF]

open access: yes, 2023
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers.
Ghosh, Arkabrata
core   +1 more source

Solving the n $n$‐Player Tullock Contest

open access: yesJournal of Public Economic Theory, Volume 28, Issue 2, April 2026.
ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley   +1 more source

A Diophantine equation involving one Linnik prime [PDF]

open access: yes
summary:Let $[\theta ]$ denote the integral part of the real number $\theta .$ We prove that for ...
Liu, Yuhui
core   +1 more source

Symmetric Diophantine Equations

open access: yesRocky Mountain Journal of Mathematics, 2004
The author describes a method to obtain infinite parametric solutions of some Diophantine equations of type \(f(x,y)=f(u,v)\) where \(f\) is a form (usually the product of some linear and quadratic forms) with rational coefficients. The main idea is to apply a non-singular linear transformation \(x=\alpha u+\beta v\), \(y=\gamma u+\delta v\) such that ...
openaire   +2 more sources

Separable Diophantine equations [PDF]

open access: yesTransactions of the American Mathematical Society, 1945
Theoretically, as noted by Skolem [3, p. 21(1), the general problem of algebraic diophantine analysis is reducible to the case in which occur only equations and inequalities of degree not higher than the second. For the extensive class of separable systems defined in ?6, this reduction can be performed effectively, eventuating in the complete integer ...
openaire   +2 more sources

GCD inequalities arising from codimension‐2 blowups

open access: yesBulletin 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

Home - About - Disclaimer - Privacy