# Über die Häufigkeit vollkommener Zahlen

```@article{Hornfeck1957berDH,
title={{\"U}ber die H{\"a}ufigkeit vollkommener Zahlen},
author={Bernhard Hornfeck and Eduard Wirsing},
journal={Mathematische Annalen},
year={1957},
volume={133},
pages={431-438}
}```
• Published 1 October 1957
• Economics
• Mathematische Annalen
Decatizing apparatus comprises a steaming cylinder and a suction cylinder. Respective primary backing cloths are associated with the steaming and suction cylinders to press the fabric to be treated against the cylinders, the tension of each primary backing cloth being adjustable independently of the other backing cloth. An intermediate backing cloth is interposed between each primary backing cloth and the fabric in the zone of the cylinder, and moves over the cylinder with its associated…

### Über die Hintereinanderschaltung multiplikativer Funktionen.

worin f : !N->N eine zahlentheoretische Funktion der Menge N der natürlichen Zahlen in sich ist. Unter Verwendung der Beweisidee von Wirsing  zeigen wir, daß es unter geeigneten Bedingungen an f

### COMPORTEMENT AU VOISINAGE DE 1 DE LA FONCTION DE RÉPARTITION DE φ(n)/n

Let φ denote Euler's totient function, and G be the distribution function of φ(n)/n. Using functional equations, it is shown that φ(n)/n is statistically close to 1 essentially when prime factors of

### Wie kann man Primzahlen erkennen

Dass die Aufgabe, die Primzahlen von den zusammengesetzten zu unterscheiden und letztere in ihre Primfactoren zu zerlegen, zu den wichtigsten und nutzlichsten der gesamten Arithmetik gehort und die

### Not Always Buried Deep: A Second Course in Elementary Number Theory

Number theory is one of the few areas of mathematics where problems of substantial interest can be fully described to someone with minimal mathematical background. Solving such problems sometimes

### How to Recognize Whether a Natural Number is a Prime

The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic.

### ON THE NONEXISTENCE OF ODD PERFECT NUMBERS

In this article, we show how to prove that an odd perfect number with eight distinct prime factors is divisible by 5. A perfect number N is equal to twice the sum of its divisors: σ(N) = 2N . The

### On near-perfect numbers

• Mathematics
Acta Arithmetica
• 2020
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We

### Some problems of Erdős on the sum-of-divisors function

• Mathematics
• 2016
Let σ(n) denote the sum of all of the positive divisors of n, and let s(n) = σ(n) − n denote the sum of the proper divisors of n. The functions σ(·) and s(·) were favorite subjects of investigation

### Finiteness Theorems for Perfect Numbers and Their Kin

This paper shows how it is shown that for each fixed k, there are only finitely many odd perfect numbers with at most k distinct prime factors, and how this result, and many like it, follow from embedding the natural numbers in the supernatural numbers and imposing an appropriate topology on the latter.