You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
They are the only letters in the alphabet that are not found at the beginning of the name of a state in the United States of America. The rest of the letters in the alphabet, namely ACDFGHIKLMNOPRSTUVW, start the name of at least one state. Incidentally, eight different states each start with the letters M and N, tying them for the most states starting with a particular letter. The next highest is a three-way tie between A, I and W with four each.
24. If you said 12 for January 2nd, February 2nd, etc that’s close, but you forgot about January 22nd, February 22nd and so on. If you are a math whiz and didn’t need a calculator to perform 60 x 60 x 24 x 365, then 31,536,000 works too. If you used 365.25 to account for leap year, then you are a human calculator, but even that’s not entirely accurate due to the leap second. And even accounting for that, it’s only an approximation that there are 365.2422 days in a year.