EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 941 – 960 of 1815

On near-perfect numbers

Min Tang, Xiaoyan Ma, Min Feng (2016)

Colloquium Mathematicae

For a positive integer n, let σ(n) denote the sum of the positive divisors of n. We call n a near-perfect number if σ(n) = 2n + d where d is a proper divisor of n. We show that the only odd near-perfect number with four distinct prime divisors is 3⁴·7²·11²·19².

On Newman's conjecture and prime trees.

Robertson, Leanne, Small, Ben (2009)

Integers

On numbers containing each block infinitely often.

Bodo Volkmann, Peter Szüsz (1983)

Journal für die reine und angewandte Mathematik

On Obláth's problem.

Gica, Alexandru, Panaitopol, Laurenţiu (2003)

Journal of Integer Sequences [electronic only]

On partition functions and divisor sums.

Robbins, Neville (2002)

Journal of Integer Sequences [electronic only]

On Pascal’s triangle modulo $p^{2}$

James Huard, Blair Spearman, Kenneth Williams (1997)

Colloquium Mathematicae

On perfect numbers connected with the composition of arithmetic functions.

Sándor, József, Kovács, Lehel István (2009)

Acta Universitatis Sapientiae. Mathematica

On perfect totient numbers.

Iannucci, Douglas E., Deng, Moujie, Cohen, Graeme L. (2003)

Journal of Integer Sequences [electronic only]

On periodic mod p sequences and G-functions (On a conjecture of Ruzsa).

Umberto Zannier (1996)

Manuscripta mathematica

On power residues

Andrzej Schinzel (1975)

Acta Arithmetica

On power residues

A. Schinzel, M. Skałba (2003)

Acta Arithmetica

On prime divisors of Mersenne numbers

Paul Erdős, Péter Kiss, Carl Pomerance (1991)

Acta Arithmetica

On prime factors of sums of integers I

K. Györy, C. L. Stewart, R. Tijdeman (1986)

Compositio Mathematica

On prime factors of sums of integers III

Kalman Győry, C. Stewart, R. Tijdeman (1988)

Acta Arithmetica

On prime numbers p,q and r such that pq, pr, and qr are pseudoprimes

K. Szymiczek (1964)

Colloquium Mathematicae

On prime values of reducible quadratic polynomials

W. Narkiewicz, T. Pezda (2002)

Colloquium Mathematicae

It is shown that Dickson’s Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer $N_{r}$ such that the polynomial $f (X) / N_{r}$ represents at least r distinct primes.

Currently displaying 941 – 960 of 1815

Previous Page 48 Next

Displaying 941 – 960 of 1815

On near-perfect numbers

On Newman's conjecture and prime trees.

On numbers containing each block infinitely often.

On Obláth's problem.

On partition functions and divisor sums.

On Pascal’s triangle modulo $p^{2}$

On perfect numbers connected with the composition of arithmetic functions.

On perfect totient numbers.

On periodic mod p sequences and G-functions (On a conjecture of Ruzsa).

On power residues

On power residues

On prime divisors of Mersenne numbers

On prime factors of sums of integers I

On prime factors of sums of integers III

On prime numbers p,q and r such that pq, pr, and qr are pseudoprimes

On prime values of reducible quadratic polynomials

On prime-detecting sequences from Apéry's recurrence formulae for $ζ (3)$ and $ζ (2)$ .

On primitive roots.

On properties of systems of arithmetic sequences

On pseudoprime numbers of special form

Currently displaying 941 – 960 of 1815