#1
|
|||
|
|||
Simple storage problem (math)
Suppose you have a "business card" CD and let's assume it
can hold 55 MB which we'll take as 440 million bits. Let's also not worry about "CD rot" (or maybe we have decided to make three copies and use a "majority rule" in case of any loss of integrity). Show that you can "essentially" store all the prime numbers less than 2.29 x 10^9 on the CD. |
|
|