Related papers: A solution of $3x+1$ problem
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…
Existence and uniqueness of solutions for $\alpha\in\left( 2,3\right] $ order fractional differential equations with three point fractional boundary and integral conditions is discussed. The results are obtained by using standard fixed…
In this paper we show how to find a closed form solution for third order difference operators in terms of solutions of second order operators. This work is an extension of previous results on finding closed form solutions of recurrence…
We consider a singularly perturbed fourth-order problem with third-order terms on the unit square. With a formal power series approach, we decompose the solution into solutions of reduced (third-order) problems and various layer parts. The…
The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…
The main objective of this paper is to investigate the explicit form, stability character and global behavior of solutions of the following two systems of rational difference equations x_{n+1}=((+(-)1)/(y_{n}(x_{n-1}+(-)1)+1)),…
A new nonlinear 3+1 dimensional evolution equation admitting the Lax pair is presented. In the case of one spatial dimension, the equation reduces to the Burgers equation. A method of construction of exact solutions, based on a class of…
We solve the Fermat-type equation \[ x^{13} + y^{13} = 3 z^7, \qquad \gcd(x,y,z) = 1 \] combining a unit sieve, the multi-Frey modular method, level raising, computations of systems of eigenvalues modulo 7 over a totally real field, and…
In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We look for particular solutions to the restricted three-body problem where the bodies are allowed to either lose or gain mass to or from a static atmosphere. In the case that all the masses are proportional to the same function of time,we…
It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…
The 3X+1 function T(n) is (3n+1)/2 if n is odd and n/2 if n is even. The total stopping time \sigma_\infty (n) for a positive integer n is the number of iterations of the 3x+1 function to reach 1 starting from n, and is \infty if 1 is never…
This is our third paper, after [4] and [5], about a joint application of the theory developed by Brezis and Mawhin in [1] with our minimax theorems ([2], [3]) to get multiple solutions of problems of the type…
It is demonstrated that the knowledge of a single and arbitrary solution of the three-dimension\-al Jacobi equations allows determining infinite families of new solutions, which are generally and explicitly constructed in what follows.…
We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.
In this work we develop exact formulas to the number of solutions of $ax+by+cz=n$ in some special cases. In 2020, Binner gave a formula for the number of non negative integer solutions, $N(a,b,c;n)$ in non-negative integer pairs $(x,y,z),$…
In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…
We present lifted linear relaxations of the OPF problem.