Problem 1172. Wheat on a chessboard pt 1

Created by Robert Turner

Solve Later

If a chessboard were to have wheat placed upon each square such that one grain were placed on the first square and each successive square after had double the amount of grains as the square before. How many grains of wheat would be on the chessboard at the finish?

Assume the chess board is n by n squares.

Solve

Solution Stats

Last solution submitted on Oct 06, 2019

Last 200 Solutions

Problem Comments

7 Comments

7 Comments

Show 4 older comments

Ken Campbell on 5 Jan 2013

Shouldn't the solution for n=-1 be NaN, rather than 'NaN' which is a character array?

Aurelien Queffurust on 7 Jan 2013

I agree with Ken , we expect NaN and not the string 'NaN'

James on 7 Jan 2013

I believe you should also change the assert for the case n=-1 to be isequalwithnan, since isequal(NaN,NaN) is false.

Aurelien Queffurust on 8 Jan 2013

yeap you have just rescored the problem but you need to use isequalwithnan,

Prateep Mukherjee on 8 Jan 2013

actually you need to use isequalwithequalnans

Jan Orwat on 11 Apr 2014

tests 5 and 6 does not work properly. those numbers are out of precision, and for test 6 it couldn't be fixed even with uint64 used instead of type double

Massimo Zanetti on 19 Oct 2016

This problem is simply wrong. The right answer is

sum(1:2^(n^2-1))

if we where to sum ALL the grains on the board....

Solution Comments

Solution 498402

1 Comment

1 Comment

Grzegorz Knor on 10 Sep 2014

Sorry for cheating, I didn't notice that there is string 'NaN' in test suite.

Problem Recent Solvers70

Problem Tags

Problem 1172. Wheat on a chessboard pt 1

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers70

Suggested Problems

More from this Author4

Problem Tags

Problem 1172. Wheat on a chessboard pt 1

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers70

Suggested Problems

More from this Author4

Problem Tags

Players