2 problems
- 0 votes0 replies1 view
Erdős's conjecture on the smallest prime divisors of Sierpiński sequences
Let be a Sierpiński number, meaning that is composite for every positive integer . For each positive integer , let the smallest prime divisor of…
- 0 votes0 replies0 views
Simultaneous Sierpiński–Riesel binomial coefficient conjecture
Let be a positive integer. A positive integer is a Sierpiński number if is composite for every positive integer , and a Riesel number if is…