Best Answer

You'll need 2 to the power of 63 coins for the last square. This number is so large that there isn't enough room on the website. The total number of coins is (2 to the power of 64) -1, which is almost twice as many For a board of N squares you need (2 to the power N) - 1 coins. As an illustration, for a 2 x 2 (or 1 x 4) board you would need 1 + 2 + 4 + 8 coins, ie 15 which is (2 to the power 4) - 1.

Q: If you put a coin on a square than 2 coins on the next square than 4 than 8 than 16....althe way to the 64th square how many coins will you have and what is a formula for finding any number of squares?

Write your answer...

Submit

Still have questions?

Continue Learning about Algebra

The square of the number of tiles on each row or column. Generally a chess board has 64 squares. This answer given above by one of our friends is true only incase of squares of same size. But as we consider all possible squares of different sizes, then it will be calcualted using the formula, 12+22+32+42+52+62+72+82

Yes and it is: sum of interior angles/number of sides

There are 49 of the smallest squares. However, any grid forms "squares" that consist of more than one of the smallest squares. For example, there are four different 6x6 squares that each include 36 of the small squares, nine different 5x5 squares, sixteen 4x4 squares, twenty-five 3 x 3 squares, and thirty-six different squares that contain 4 of the small squares. One could therefore discern 140 distinct "squares." The number can be calculated from the formula [(n)(n+1)(2n+1)] / 6 where n is the grid size.

The formula for finding the number of distinguishable permutations is: N! -------------------- (n1!)(n2!)...(nk!) where N is the amount of objects, k of which are unique.

1/2 x (a+b) x hA =is the average number of parallel sidesB = is the distance between themh=is the height

Related questions

Use squares and try it out for yourself. Get a number of squares and make a rectangle 3 squares long by 4 squares wide. Count the squares. You should have 12 squares (or 3*4). That's the best way I know to prove the formula.

There are infinitely many rays.

Any number that has only two factors is a prime number.

7 times (number of weeks)

There is no such formula; there are infinitely many number between them.

The square of the number of tiles on each row or column. Generally a chess board has 64 squares. This answer given above by one of our friends is true only incase of squares of same size. But as we consider all possible squares of different sizes, then it will be calcualted using the formula, 12+22+32+42+52+62+72+82

Sum of N2 for N=1 to X, and X is the number of squares across the top or side on the large square.

7 x 7 = 49 of the smallest squares if there are 7 squares on each side. The total number of "squares" of any size (1 to 49 of the smallest squares) is 140. The number can be calculated from the formula [(n)(n+1)(2n+1)] / 6 where n is the grid size.

multiply number of days by 24. so the formula would be '''hours = days x 24'''

The formula is:Perimeter = (length of one side) x (number of sides)

4 x 4 = 16For any grid n by n, the number of squares is equal to n2 (or n x n)

The formula for finding the sum of all angles of a polygon is: N = number of sides (N-2)180 = The sum of all angles