Posted by **Anonymous** on Tuesday, July 30, 2013 at 12:13pm.

Alex wants to cover a 30 by 30 board perfectly with 450 1 by 2 dominos. He also wants to ensure that he can trace a path between any 2 dominos that connect through at most N dominos. What is the minimum possible value of N which would allow Alex to form such a configuration?

- math -
**Alestair**, Friday, August 2, 2013 at 10:24am
16

- math -
**Ashok**, Saturday, August 3, 2013 at 5:11am
you r wrong

- math -
**Reynan**, Saturday, August 3, 2013 at 10:23pm
what is the answer

## Answer This Question

## Related Questions

- help math - Alex wants to cover a 30 by 30 board perfectly with 450 1 by 2 ...
- Math - A set of dominoes has 28 dominos. There are 7 dominos called doubles ...
- Equivalent Algebraic Expressions - The game shown at the right consists of eight...
- geometry - You are putting hexagon-shaped tiles on the path through the garden...
- math - for piecewise functions do I connect all the functions? Ex: f(x): 2+x x ...
- Physics - Trace by drawing the path of a ray of light shown in 90 degrees. This ...
- Math - Mr Townes created a 2foot wide garden path around a circular garden. The ...
- calculus - the path of a particle in the xy-plane is vector r = (cos2t, sint) ...
- Calculus - the path of a particle in the xy-plane is vector r = (cos2t, sint) ...
- physics - A bullet is fired with a speed of 450 m/s through a board 20cm thick. ...

More Related Questions