Lesson 23: Year to overflow for linearly increasing values

Question 1: 1 Token is minted per day. That token has 18 decimals. How large a uint is needed to store it so there is no overflow for 10_000 years? Give your answer as the type. For example, write uint32 instead of 32

Question 2: A counter increases by at most 100_000 times per day. How large a uint is needed to store it so there is no overflow for 10_000 years?

Question 3: Every 30 days, a protocol mints 1 million tokens. The token has 18 decimals. How large a uint is needed to store it so there is no overflow for 10_000 years?

Question 4: One token is minted every second. That token has 18 decimals. How large a uint is needed to store it so there is no overflow for 10_000 years?

Question 5: A user gets 100 points for each day they use the application. The user might pass the account to their children, so a single account might use the application for 10_000 years in the worst case. A point is represented by a single digit (no decimals, it is not sub-dividable). How large a uint is needed so there is no overflow for 10_000 years?