Sur un problème concernant les nombres k 2ⁿ + 1
From MaRDI portal
Recommendations
Cited in
(22)- Distinct covering systems in number fields
- Covering systems with restricted divisibility
- Sierpiński and Carmichael numbers
- A covering system with least modulus 25
- Verifying Sierpiński and Riesel numbers in ACL2
- An equation involving arithmetic functions and Riesel numbers
- On binomial coefficients associated with Sierpiński and Riesel numbers
- Nonlinear Sierpiński and Riesel numbers
- Ruth-Aaron pairs containing Riesel or Sierpiński numbers
- Generalized Sierpiński numbers
- On the density of odd integers of the form \((p-1)2^{-n}\) and related questions
- On Cullen numbers which are both Riesel and Sierpiński numbers
- Tight upper and lower bounds for the reciprocal sum of Proth primes
- On powers associated with Sierpiński numbers, Riesel numbers and Polignac's conjecture
- Covering subsets of the integers by congruences
- On integers of the forms \(k-2^n\) and \(k2^n+1\)
- On integers of the forms \(k^r-2^n\) and \(k^r2^n+1\).
- Wacław Franciszek Sierpiński (1882--1969) and the phenomenon of Polish set theory school
- Integers not of the form \(2^n +p^{\alpha} q^{\beta}\)
- scientific article; zbMATH DE number 3033470 (Why is no real title available?)
- Sierpiński and Riesel numbers in Narayana's cow sequence
- Consecutive primes which are widely digitally delicate
This page was built for publication: Sur un problème concernant les nombres \(k\cdot 2^n + 1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q772252)
