相关论文: On the Form of Odd Perfect Gaussian Integers

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

We derive special forms of the Poisson summation formula for even and odd functions, which are applied to obtain representations for Euler-type numbers and to sum various series related to elliptic functions.

We shall give some results for an integer divisible by its unitary totient.

We give necessary conditions for perfection of some families of odd numbers with special multiplicative forms. Extending earlier work of Steuerwald, Kanold, McDaniel et al.

We generalise the sum-of-divisors-function $\sigma$ and evenness to the rings of integers of certain algebraic number fields. In particular, we present necessary and sufficient conditions for even Eisenstein integers to be (norm-)perfect…

Let $\taue_k \colon \Z\to\Z$ be a multiplicative function such that $ \taue_k(p^a) = \sum_{d_1... d_k=a} 1 $. In the present paper we introduce generalizations of $\taue_k$ over the ring of Gaussian integers $\Zi$. We determine their…

This paper derives Touchard's theorem from Euler's form for odd perfect numbers. It also fine-tunes Euler's form.

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let $\k$ be a primitive multiplicative character of order $N$ over finite field $\fq$. This paper studies the problem…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…

In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.