相关论文: Cracking the problem with 33
The search of solutions of the Diophantine equation $x^3 + y^3 + z^3 = k$ for $k<1000$ has been extended with bounds of $|x|$, $|y|$ and $|z|$ up to $10^{15}$. The first solution for $k=74$ is reported. This only leaves $k=33$ and $k=42$…
We make several improvements to methods for finding integer solutions to $x^3+y^3+z^3=k$ for small values of $k$. We implemented these improvements on Charity Engine's global compute grid of 500,000 volunteer PCs and found new…
We discuss finding large integer solutions of $d=2x^3+y^3+z^3$ by using Elsenhans and Jahnel's adaptation of Elkies' LLL-reduction method. We find 28 first solutions for $|d|<10000$.
We propose a new algorithm, call Sam to determinate the existence of the solutions for the equation $x^3+y^3+z^3=n$ for a fixed value $n > 0$ unknown.
For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…
We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…
In this short note we prove a result that is an extension of an old Olympiad problem and is a very simple variant of the question of finding an approximation for $k$, where it is a nonzero constant and it satisfies the equation $a^k+b^k=c$,…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
For an arbitrary given $k\geq3,$ we consider a possibility of representation of a positive number $n$ by the form $x_1...x_k+x_1+...+x_k, 1\leq x_1\leq ... \leq x_k.$ We also study a question on the smallest value of $k\geq3$ in such a…
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number $R(4,3,3)=30$. The number…
In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…
We find the primitive integer solutions to x^2+y^3=z^7. A nonabelian descent argument involving the simple group of order 168 reduces the problem to the determination of the set of rational points on a finite set of twists of the Klein…
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be…
In 2023, H.\,Brezis published a list of his ``favorite open problems", which he described as challenges he had ``raised throughout his career and has resisted so far". We provide a complete resolution to the first one--Open Problem 1.1--in…
In this paper we demonstrate a method for counting the number of solutions to various logic puzzles. Specifically, we remove all of the "clues" from the puzzle which help the solver to a unique solution, and instead start from an empty…
In this paper, we consider the multiplicity of solutions for a class of Kirchhoff type problems with sub-linear and critical terms on an unbounded domain. With the aid of Ekeland's variational principle and the concentration compactness…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
In this work, we investigate the fewest number of colors needed to guarantee a rainbow solution to the equation $x_1 + x_2 = k x_3$ in $\mathbb{Z}_n$. This value is called the Rainbow number and is denoted by $rb(\mathbb{Z}_n, k)$ for…
We study the problem of determining, given an integer $k$, the rational solutions to $C_{k} : x^{3}z + x^{2} y^{2} + y^{3}z = kz^{4}$. For $k \ne 0$, the curve $C_{k}$ has genus $3$ and there are maps from $C_{k}$ to three elliptic curves…
In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \leq 1$ and there are at most $k$…