Related papers: Odd, spoof perfect factorizations
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…
James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…
We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…
Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…
If the product of two monic polynomials with real nonnegative coefficients has all coefficients equal to 0 or 1, does it follow that all the coefficients of the two factors are also equal to 0 or 1? Here is an equivalent formulation of this…
In this work, we compute the perfect forms for all imaginary quadratic fields of absolute discriminant up to $5000$ and study the number and types of the polytopes that arise. We prove a bound on the combinatorial types of polytopes that…
Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…
The equality between the number of odd spin structures on a Riemann surface of genus g, with $2^g - 1$ being a Mersenne prime, and the even perfect numbers, is an indication that the action of the modular group on the set of spin structures…
We investigate a variation of Nicomachus's identity in which one term in the cubic sum is replaced by a different cube. Specifically, we study the Diophantine identity \[ \sum_{j=1}^{n} j^3 + x^3 - k^3 = \left( \sum_{j=1}^{n} j + x - k…
Two approximations, derived from continuous expansions of Riemann-Liouville fractional derivatives into series involving integer order derivatives, are studied. Using those series, one can formally transform any problem that contains…
We consider foliations given by deformations $dF+\epsilon\omega$ of exact forms $dF$ in $\mathbb{C}^2$ in a neighborhood of a family of cycles $\gamma(t)\subset F^{-1}(t)$. In 1996 Francoise gave an algorithm for calculating the first…
Integer factorization is a famous computational problem unknown whether being solvable in the polynomial time. With the rise of deep neural networks, it is interesting whether they can facilitate faster factorization. We present an approach…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
We give several results related to inhomogeneous approximations to two real numbers and badly approximable numbers. Our results are related to classical theorems by A. Khintchine (1926) and to an original method invented by Y. Peres and W.…
Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…
We prove that there are at least $1.284 \cdot \sqrt{s/\log s}$ irrational numbers among $\zeta(3)$, $\zeta(5)$, $\zeta(7)$, $\ldots$, $\zeta(s-1)$ for any sufficiently large even integer $s$. This result improves upon the previous finding…