Related papers: Catalan's Equation For Even Primes over Quadratic …
Let $q\ge 2$ be a prime power. In this note we present a formulation for obtaining the known $(q+1,8)$-cages which has allowed us to construct small $(k,g)$--graphs for $k=q-1, q$ and $g=7,8$. Furthermore, we also obtain smaller…
Let K = Q(t1,..,tk) and a,b,c in K. We give a simple algorithm to find, if it exists, X,Y,Z in K, not all zero, for which aX^2 + bY^2 + cZ^2 = 0.
In this paper we give a general condition on the absorption term of the 1-Laplace elliptic equation for the existence of suitable large solutions. This condition can be considered as the correspondent Keller-Osserman condition for the…
We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
We study the exponential Diophantine equation $x^2+p^mq^n=2y^p$ in positive integers $x,y,m,n$, and odd primes $p$ and $q$ using primitive divisors of Lehmer sequences in combination with elementary number theory. We discuss the solvability…
We prove two results concerning the generalized Fermat equation $x^4+y^4=z^p$. In particular we prove that the First Case is true if $p \neq 7$.
Let $n \in \mathbb{Z}_{\geq 2}$. We study the generalized Fermat equation \[x^{13}+y^{13}=z^n, \quad x,y,z \in \mathbb{Z}, \quad \gcd(x,y,z)=1.\] Using a combination of techniques, including the modular method, classical descent, unit…
This article presents the maximal regularity approach to the primitive equations. It is proved that the $3D$ primitive equations on cylindrical domains admit a unique, global strong solution for initial data lying in the critical solonoidal…
Let $K$ be a totally real number field and consider a Fermat-type equation $Aa^p+Bb^q=Cc^r$ over $K$. We call the triple of exponents $(p,q,r)$ the signature of the equation. We prove various results concerning the solutions to the Fermat…
In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…
In this paper, we show that every pair of large even integers satisfying certain necessary conditions can be expressed as a pair of one prime, one prime square, two prime cubes and 56 powers of 2.
In this paper, we show that for almost all primes p there is an integer solution x in [2,p-1] to the congruence x^x == x mod p. The solutions can be interpretated as fixed points of the map x -> x^x mod p, and we study numerically and…
This paper deals with the existence and multiplicity of solutions for the generalized $(p, q)$-Laplacian equation \begin{align*} &-{\text{ div}}(A(x, u)|\nabla u|^{p-2}\nabla u) +\frac1p A_t(x, u)|\nabla u|^p -{\text{ div}}(B(x, u)|\nabla…
In this paper we consider the recurrent equation $$\Lambda_{p+1}=\frac1p\sum_{q=1}^pf\bigg(\frac{q}{p+1}\bigg)\Lambda_{q}\Lambda_{p+1-q}$$ for $p\ge 1$ with $f\in C[0,1]$ and $\Lambda_1=y>0$ given. We give conditions on $f$ that guarantee…
The higher $q,t$-Catalan polynomial $C^{(m)}_n(q,t)$ can be defined combinatorially as a weighted sum of lattice paths contained in certain triangles, or algebraically as a complicated sum of rational functions indexed by partitions of $n$.…
In this paper, we assume that $q>0$, $p>1$ and $s\in(0,1)$ , and consider the following nonlinear fractional p-Laplacian equations on finite graphs: \begin{equation*} \left\{ \begin{array}{lll} \partial_t u^q(x,t)+(-\Delta)_p^su=0,\\[15pt]…
In this paper, we prove that for each number field $F$ there exists a uniform bound on the prime levels $p$ of elliptic curves $E/F$ for which $F(E[p])=F(\zeta_p)$. Under the Generalized Riemann Hypothesis, we also give uniform bounds on…
In this paper, we find all the generic polynomials for geometric $\ell$-cyclic function field extensions over the finite fields $\mathbb{F}_q$ where $q= p^n$, $p$ prime integer such that $q \equiv -1 \mod \ell$ and $(\ell , p)=1$.
This text evolves from the lecture notes for my course on Catalan's conjecture in winter term 2025/26. The ultimate goal is to give full details of Mih\u{a}ilescu's proof. Current chapters: 1. Euler's theorem: $x^2-y^3=1$; 2. V. Lebesgue's…