There is a game which has a board which looks just like a chess board, with n rows and n columns, only n is any odd integer greater than 7. Numbers are filled in this board subject to the following rules(I) Any number is the negative of the number directly above it, if there is an number directly above it. (II) Any number is double the number directly to its left, if there is an number directly to its left. If the number in the upper left corner (first row and first column) is 1, what is the sum of all the numbers in the table?

n² – 1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

n² + 1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

2ⁿ – 1

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

2ⁿ + 1

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C 2ⁿ – 1
The point to note here is that although it is mentioned that $n > 7$ , the pattern will hold good for all odd values of n. at n=1, the answer will be 1, which is obtained only

at option (d)

Hence, the sum=31. Answer is option (d)

Suggest Corrections

Similar questions

Q. There is a game which has a board which looks just like a chess board, with n rows and n columns, only n is any odd integer greater than 7. Numbers are filled in this board subject to the following rules-
(I) Any number is the negative of the number directly above it, if there is a number directly above it.
(II) Any number is double the number directly to its left if there is a number directly to its left.
If the number is in the upper left corner (first row and first column) is 1, what is the sum of all the numbers in the table?

Q. We number both the rows and the columns of an

8

\times

8

chess-board with the numbers

1

8

. A number of grains are placed onto each square, in such a way that the number of grains on a certain square equals the product of its row and column numbers. How many grains are there on the entire chessboard?

Q. A positive integer is written in each square of an

n^{2} \times n^{2}

chess board. The difference between the numbers in any adjacent squares (sharing an edge) is less than or equal to n. Prove that at least

⌊ \frac{n}{2} ⌋ + 1

squares contain the same number.

Q. There are 625 dots on a sheet and the number of rows is equal to the number of columns. If the number of rows is reduced by 5 and the number of columns is doubled then how many dots will be there in total?

1.A two digit number is four times the sum and three time the product of its digits .find the numbers.

2.if the sum of first n even natural number is 420.find the value of n.

3.A chess board contains 64equal squares and the area of each square is 6.25cm².a border round the board is 2cm wide. Find the length of the side of the chess board.

Join BYJU'S Learning Program

The correct option is C 2n – 1The point to note here is that although it is mentioned that n>7, the pattern will hold good for all odd values of n. at n=1, the answer will be 1, which is obtained only at option (d) Hence, the sum=31. Answer is option (d)

The correct option is C 2ⁿ – 1
The point to note here is that although it is mentioned that $n > 7$ , the pattern will hold good for all odd values of n. at n=1, the answer will be 1, which is obtained only

at option (d)

Hence, the sum=31. Answer is option (d)