Related papers: An Interesting Number Theoretic Problem
Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{ a,b,c \} >1$. Let $N(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. We show that if $(a,b,c)$ is a triple of distinct…
Let $d$ be a positive integer. Let $p$ be a prime number. Let $\alpha$ be a real algebraic number of degree $d+1$. We establish that there exist a positive constant $c$ and infinitely many algebraic numbers $\xi$ of degree $d$ such that…
The aim of this note is to present a numerical method to solve the Stokes problem in a bounded domain with a Dirac source term, which preserves optimality for any approximation order by the finite-element method. It is based on the…
It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…
We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.
Let $K$ be a totally real field. By the asymptotic Fermat's Last Theorem over $K$ we mean the statement that there is a constant $B_K$ such that for prime exponents $p>B_K$ the only solutions to the Fermat equation $a^p + b^p + c^p = 0$…
Take an odd number x >0. Then 3x+1 is even and one can find an integer k> 0 so that y= 3x+1/2^k is again odd. We get in this way the mapping T, Tx=y. The paper contains two theorems describing statistical properties of T. The first…
Some superlinear fourth order elliptic equations are considered. Ground states are proved to exist and to concentrate at a point in the limit. The proof relies on variational methods, where the existence and concentration of nontrivial…
We present here a note which synthesizes our previous ideas concerning some problems in cosmology, and the numerical correspondences between the physical constants that we could deduce.
The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such…
Let $p$ be a prime and ${\mathcal{P}_{p}}$ the set of positive integers which are prime to $p$. We establish the following interesting congruence \[\sum\limits_{\begin{smallmatrix} i+j+k={{p}^{r}} i,j,k\in {\mathcal{P}_{p}}…
Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…
We show that a large class of stochastic heat equations can be approximated by systems of interacting stochastic differential equations. As a consequence, we prove various comparison principles extending earlier results. Among other things,…
We obtain the solution of the fourth order difference equation $$ x_{n+1}=\frac{ \alpha x_{n-3}}{A+B x_{n-1}x_{n-3}}$$ with the initial conditions; $x_{-3}=d,$ $x_{-2}=c,$ $x_{-1}=b,$ and $x_{0}=a$ are arbitrary nonzero real numbers,…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…
We propose an implementable, neural network-based structure preserving probabilistic numerical approximation for a generalized obstacle problem describing the value of a zero-sum differential game of optimal stopping with asymmetric…
For relatively prime integers $a$ and $b$ both greater than one and odd integer $c$, there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x + b^y = c^z$. There are an infinite number of $(a,b,c)$ giving exactly…