This famous problem involves placing grains of wheat on the squares of a chessboard. A single grain of wheat is placed on the first square. Two grains are placed on the next square and four grains on the next. The board is filled with wheat, each square receiving twice that of the preceding square, until all 64 squares are filled. Of course, the number of grains of wheat become far too great to

fit on a square, or on the entire board, or even the room that holds the board.

Express the number of grains that belong on the final square as 2 raised to a power.

The exponent associated with each square is one less than the number of the square. Therefore,
 Of course they won't all fit. There isn't even that number of grains in the world, or even in the entire universe.