# Riesel problem

This article is only a stub. You can help PrimeWiki by expanding it. |

The **Riesel problem** consists in determining the smallest Riesel number.

In 1956, Hans Riesel showed that there are an infinite number of integers *k* such that *k × 2 ^{n} − 1* is not prime for any integer

*n*. He showed that the number

*n = 509,203*has this property.