Related papers: On Near Perfect Numbers
In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally…
Hypersequent calculus G{\L}$\forall$ for first-order {\L}ukasiewicz logic was first introduced by Baaz and Metcalfe, along with a proof of its approximate completeness with respect to standard $[0,1]$-semantics. The completeness result was…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
A Skolem sequence is a sequence a_1,a_2,...,a_2n (where a_i \in A = {1,...,n }), each a_i occurs exactly twice in the sequence and the two occurrences are exactly a_i positions apart. A set A that can be used to construct Skolem sequences…
We study the problem of simultaneous approximation to a fixed family of real and p-adic numbers by roots of integer polynomials of restricted type. The method that we use for this purpose was developed by H. Davenport and W.M. Schmidt in…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…
A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…
For a positive integer $n$, if $\sigma(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $\sigma(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about…
The space $\widehat{\ell }_k$ of absolutely almost convergent series was introduced and studied by Das et al [4]; which plays an important role in summability theory, approximation theory, Fourier analysis, etc. In the present paper we…
A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…
A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…
We generalize the universal power series of Seleznev to several variables and we allow the coefficients to depend on parameters. Then, the approximable functions may depend on the same parameters. The universal approximation holds on…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…
We study some divisibility properties of quasiperfect numbers. We show that if $N=(p_1 p_2 \cdots p_t)^{2a}=m^2$ is quasiperfect, then $2a+1$ is divisible by $3$ and $N$ has at least one prime factor smaller than $\exp 716.7944$. Moreover,…
In this paper, we investigate the existence of Sierpi\'{n}ski numbers and Riesel numbers as binomial coefficients. We show that for any odd positive integer $r$, there exist infinitely many Sierpi\'{n}ski numbers and Riesel numbers of the…
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…
In 1991, David Gale and Raphael Robinson, building on explorations carried out by Michael Somos in the 1980s, introduced a three-parameter family of rational recurrence relations, each of which (with suitable initial conditions) appeared to…