The number of primes is finite

DOI10.1090/S0025-5718-99-00990-4zbMATH Open0918.11014OpenAlexW2124042897MaRDI QIDQ4221990FDOQ4221990

Authors: Miodrag Živković 

Publication date: 3 December 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-00990-4

Recommendations

• On the number of primes in \(n!\)
• On the primality of \(n! \pm 1\) and \(2 \times 3 \times 5 \times \dotsm \times p \pm 1\)
• On the Primality of n! ± 1 and 2 ⋅3 ⋅5 ⋯p ± 1
• On the Greatest and Least Prime Factors of n !+1

zbMATH Keywords

divisibilityPrime numbersleft factorial

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Binomial coefficients; factorials; (q)-identities (11B65) Primes (11A41) Calculation of integer sequences (11Y55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Prime numbers and computer methods for factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• On remarkable properties of primes near factorials and primorials
• Bell numbers, determinants and series
• Searching for a counterexample to Kurepa's conjecture
• Title not available (Why is that?)
• Bell numbers modulo a prime number, traces and trinomials
• On the number of primes in \(n!\)

Uses Software

• UBASIC

This page was built for publication: The number of primes is finite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221990)