Related papers: Odd, spoof perfect factorizations
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…
The number of solutions of the diophantine equation $\sum_{i=1}^k \frac{1}{x_i}=1,$ in particular when the $x_i$ are distinct odd positive integers is investigated. The number of solutions $S(k)$ in this case is, for odd $k$: \[\exp \left(…
The multiplicative structure of an odd perfect number $n$, if any, is $n=\pi^\alpha M^2$, where $\pi$ is prime, $\gcd(\pi,M)=1$ and $\pi\equiv \alpha\equiv1\pmod{4}$. An additive structure of $n$, established by Touchard, is that…
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an…
We call an odd positive integer $n$ a $\textit{Descartes number}$ if there exist positive integers $k,m$ such that $n = km$ and \begin{equation} \sigma(k)(m+1) = 2km \end{equation} Currently, $\mathcal{D} = 3^{2}7^{2}11^{2}13^{2}22021$ is…
We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…
In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
The problem is analyzed of extrapolating power series, derived for an asymptotically small variable, to the region of finite values of this variable. The consideration is based on the self-similar approximation theory. A new method is…
Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…
Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…
A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to…
Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…
We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed $\Omega$ (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs and…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their…
From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…
While the general form of even perfect numbers is well-known, the existence or non-existence of odd perfect numbers is still an open problem. We address this problem and prove that if a natural number is odd, then it's not perfect.