  In 1980, Erd\H{o}s, Rubin and Taylor asked whether for all positive integers
$a$, $b$, and $m$, every $(a:b)$-choosable graph is also $(am:bm)$-choosable.
We provide a negative answer by exhibiting a $4$-choosable graph that is not
$(8:2)$-choosable.
