Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
From MaRDI portal
Publication:5575670
DOI10.24033/bsmf.1676zbMath0184.07202OpenAlexW1532059873MaRDI QIDQ5575670
Publication date: 1969
Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=BSMF_1969__97__129_0
Related Items (12)
The sum of divisors function and the Riemann hypothesis ⋮ On the size of inverse semigroups given by generators ⋮ The largest prime factor of Landau's function ⋮ Unnamed Item ⋮ On deterministic finite automata and syntactic monoid size ⋮ Algorithms related to the decomposition of polynomials ⋮ Landau's function for one million billions ⋮ Highly composite numbers and the Riemann hypothesis ⋮ Some open questions ⋮ Unnamed Item ⋮ Effective Bounds for the Maximal Order of an Element in the Symmetric Group ⋮ Majoration explicite de l'ordre maximum d'un élément du groupe symétrique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eine Bemerkung zur Konstruktion großer Primzahllücken
- Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
- The Difference between Consecutive Prime Numbers V
- The Difference between Consecutive Prime Numbers
- On Highly Composite and Similar Numbers
- On Highly Composite Numbers
This page was built for publication: Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»