Q: How many square n a 16ftx16ft bulding?

Write your answer...

Submit

Still have questions?

Related questions

Do you mean building, like "I go to work in a building"? Otherwise, you spell bulding b u l d i n g.

printf ("square of %d is %d\n", $n, $n*$n);

It is n*(n + 1)*(2*n + 1)/6

formula for computing square of number n is n*n or n2

The number of squares in an n-by-n square is 1^2 + 2^2 + 3^2 + ... + n^2 This sum is given by the formula n(n + 1)(2n + 1)/6 Jai

the fourmula is 2n square n= # of shells

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 8 edges

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 8 edges.

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges. 5 vertices

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges.

A pyramid with an n-sided base will have n + 1 vertices, n + 1 faces, and 2n edges.

For n to be a perfect square n = m2 where m can have one of the values 1, 2, 3, ... 1, 2, 3, ... are the counting numbers. There are an infinite number of counting numbers, so there are an infinite number of perfect squares (n = m2).