Abstract
In 1969, Riesel proposed a primality test for natural numbers of the form $h \cdot 2^n-1$, which includes the case $h=n$, the Woodall numbers $W_ {n} = n \cdot 2 ^ {n} -1$. In this paper, we utilize Riesel's primality test for Woodall numbers, and propose a primality testing algorithm for Woodall numbers. The implementations of the algorithm and its optimization are discussed.
