Su ppose the best algorithm known today for finding the prime factors of an n-bit number runs in time 2 ^{c*n*3 (log₂ n)^2/3} . Assuming 4Ghz computers and c = 1 (and that the units of the given expression are clockcycles), estimate the size of numbers that cannot be factored for the next 100 years.