Prime graph components of finite almost simple groups

Maria Silvia Lucido

Processing math: 0%

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Prime graph components of finite almost simple groups”

Addendum to : “Prime graph components of finite almost simple groups” [Rend. Sem. Mat. Univ. Padova 102 (1999), 1–22]

Maria Silvia Lucido (2002)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

On the prime density of Lucas sequences

Pieter Moree (1996)

Journal de théorie des nombres de Bordeaux

Similarity:

The density of primes dividing at least one term of the Lucas sequence ${\{L_{n} (P)\}}_{n = 0}^{\infty}$ , defined by $L_{0} (P) = 2, L_{1} (P) = P$ and $L_{n} (P) = P L_{n - 1} (P) + L_{n - 2} (P)$ for $n \geq 2$ , with $P$ an arbitrary integer, is determined.

A problem of Erdös concerning power residue sums.

P. Elliott (1967)

Acta Arithmetica

Similarity:

On Hirzebruch sums and a theorem of Schinzel

P. Chowla, S. Chowla (1973)

Acta Arithmetica

Similarity:

An application of dihedral fields to representations of primes by binary quadratic forms

Pierre Kaplan, Kenneth Williams, Yoshihiko Yamamoto (1984)

Acta Arithmetica

Similarity:

Prime divisors of Lucas sequences

Pieter Moree, Peter Stevenhagen (1997)

Acta Arithmetica

Similarity:

Lehmer's numbers

A. Rotkiewicz, R. Wasén (1980)

Acta Arithmetica

Similarity:

Artin's primitive root conjecture for quadratic fields

Hans Roskam (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

Fix an element $α$ in a quadratic field $K$ . Define $S$ as the set of rational primes $p$ , for which $α$ has maximal order modulo $p$ . Under the assumption of the generalized Riemann hypothesis, we show that $S$ has a density. Moreover, we give necessary and sufficient conditions for the density of $S$ to be positive.

Computations of Iwasawa invariants and $𝐊_{2}$

Alan Candiotti (1974)

Compositio Mathematica

Similarity: