Related papers: On Near Perfect Numbers

Let $A$ be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum $|A+k\cdot A|,$ where $k$ is a prime and $|A|$ is large. In its full…

We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…

In 1969, H. Davenport and W. Schmidt established a measure of simultaneous approximation for a real number \xi and its square by rational numbers with the same denominator, assuming only that \xi is not rational nor quadratic over Q. Here,…

The idea of the principle of nested intervals or the concept of convergent sequences which is equivalent to this idea dates back to the ancient world. Archimedes calculated the unknown in excess and deficiency, approximating with two sets…

We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…

In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

The Delannoy numbers and Schr\"oder numbers are given by \begin{align*} D_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\quad \text{and}\quad S_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\frac{1}{k+1}, \end{align*} respectively. Let $p>3$ be a…

Let a, k, h, c be positive integers and d a non zero integer. Recall that a numerical generalized almost arithmetic semigroup S is a semigroup minimally generated by relatively prime positive integers a, ha + d, ha + 2d, . . . , ha + kd, c,…

Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.

An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…

Euler explored the problem of finding three numbers such that the sum or difference of any two of them is a perfect square. He discovered a parametric solution represented by polynomials of degree 18 and identified the smallest of these…

We investigate the integer solutions of Diophantine equations related to perfect numbers. These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof'' perfect factorization $3^2\cdot 7^2\cdot 11^2\cdot 13^2\cdot…

Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…

In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…