Search results
Results from the WOW.Com Content Network
Another version has the inventor of chess (in some tellings Sessa, an ancient Indian Minister) request his ruler give him wheat according to the wheat and chessboard problem. The ruler laughs it off as a meager prize for a brilliant invention, only to have court treasurers report the unexpectedly huge number of wheat grains would outstrip the ...
The ancient Indian Brahmin mathematician Sissa (also spelt Sessa or Sassa and also known as Sissa ibn Dahir or Lahur Sessa) is a mythical character from India, known for the invention of Chaturanga, the Indian predecessor of chess, and the wheat and chessboard problem he would have presented to the king when he was asked what reward he'd like for that invention.
Mathematics – Answer to the wheat and chessboard problem: When doubling the grains of wheat on each successive square of a chessboard, beginning with one grain of wheat on the first square, the final number of grains of wheat on all 64 squares of the chessboard when added up is 2 64 −1 = 18,446,744,073,709,551,615 (≈1.84 × 10 19).
Download as PDF; Printable version; In other projects ... Displaying a formula: 199 42 ... Wheat and chessboard problem: 54 14
Print/export Download as PDF; Printable version; In other projects Wikimedia Commons; ... Wheat and chessboard problem; Z. Zero to the power of zero
English: Illustration of "Wheat and chessboard problem" and "Second half of the chessboard" exa E 1000000000000000000 10 18; peta P 1000000000000000 10 15; tera T 1000000000000 10 12; giga G 1000000000 10 9; mega M 1000000 10 6; kilo k 1000 10 3
It's given as "On the entire chessboard there would be 2**64 - 1 = 18,446,744,073,709,551,615 grains". But iinm 2**64 is the number of grains on the last square, not the sum of the grains on all squares.
A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational mathematics.The most well-known problems of this kind are the eight queens puzzle and the knight's tour problem, which have connection to graph theory and combinatorics.