Related papers: A Constructive Proof of Beal's Conjecture

In this short article we do not prove Fermat's last theorem. We show that the number 2 is an exceptional number in this theorem.

In \cite{bf} Br\'ezis and Friedman prove that certain nonlinear parabolic equations, with the $\delta$-measure as initial data, have no solution. However in \cite{cl} Colombeau and Langlais prove that these equations have a unique solution…

This paper is devoted to study the following Choquard equation \begin{eqnarray*}\left\{ \begin{array}{lll} (-\triangle)^{\alpha/2}u=(|x|^{\beta-n}\ast u^p)u^{p-1},~~~&x\in R^n, u\geq0,\,\,&x\in R^n, \end{array} \right. \end{eqnarray*} where…

We show that the naive adaptation of Malle's conjecture to fair counting functions is not true in general.

We present the long sought visual pattern in the Collatz problem with the aid of a logarithmic spiral. Using this newly discovered pattern, we show that the Collatz problem is linked to primes via Jacobsthal numbers. We then prove that no…

We prove that a generic holomorphic foliation on a weighted projective plane has no algebraic solutions when the degree is big enough. We also prove an analogous result for foliations on Hirzebruch surfaces.

Let $f,g:{\Bbb R}\to{\Bbb R}$ be integrable functions, $f$ nowhere zero, and $\phi (u)=\int du/f(u)$ be invertible. An exact solution to the generalized nonhomogeneous inviscid Burgers' equation $u_t+g(u).u_x=f(u)$ is given, by quadratures.

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

An integral formula is developed which applies to an essentially arbitrary function. An application is made to the Riemann zeta function.

In a recent paper, Freitas and Siksek proved an asypmtotic version of Fermat's Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form $A x^p+B y^p+ C z^p=0$, where $A$,…

We prove that n independent abelian functions admit an algebraic addition theorem, with no appeal to theta functions.

We prove a single sum formula for the linearization coefficients of the Bessel polynomials. In two special cases we show that our formula reduces indeed to Berg and Vignat's formulas in their proof of the positivity results about these…

We prove, using a fixed point theorem in a Banach algebra, an existence result for a fractional functional differential equation in the Riemann-Liouville sense. Dependence of solutions with respect to initial data and an uniqueness result…

We show that for any positive integer $N$, there are only finitely many holomorphic eta quotients of level $N$, none of which is a product of two holomorphic eta quotients other than 1 and itself. This result is an analog of Zagier's…

This paper presents a nonnegative polynomial that cannot be represented with nonnegative coefficients in the simplicial Bernstein basis by subdividing the standard simplex. The example shows that Bernstein Theorem cannot be extended to…

Let $f(x)=x^{2}(x^{2}-1)(x^{2}-2)(x^{2}-3).$ We prove that the Diophantine equation $ f(x)=2f(y)$ has no solutions in positive integers $x$ and $y$, except $(x, y)=(1, 1)$.

In this note, we show that a very general system of algebraic linear partial differential equations has zero kernel, applying basic techniques of the theory of jet-modules and elementary base change theory. In particular, in contrast to the…

In this paper, we develop the modular method for the generalized Fermat equation appearing in the title, within the framework of Darmon's program and using Frey hyperelliptic curves. As an application, we study a conjecture of Laradji,…

The non-zero integer solution set is derived for C^n = A^n + B^n. The non-zero integer solution set for n = 2 is [C - (a + b)]^2 = 2ab. The variables a and b equal (C - A) and (C - B) respectively and are nonzero integer factors of 2M^2…