Each Sierpinski (and Riesel) number and the dual of it always have the

same covering set as it is easy to see.

So we only need to find a prime for a candidate in any one of the

forms to eliminate it from the other side.

Looking at the remaining candidates in SoB and in the dual Sierpinski

search of Payam Samidoost we see that there is no number belonging to

both lists, so no one of the 6 remaining candidates at SoB can be a

solution to the problem, and the same to Payam's as well.

In fact, the only two common candidates when Payam launched his

project were 19249 and 28433.

Payam found a prime for the dual of 19249 on August 17, 2002 so when

an anonymous member of TeamPrimeRib submitted a prime for 28433 on

December 30, 2004 to SoB, the search could have been called quits.

Lélio