Tile Covering

Probability Level pending

You have a horizontal strip length N N and width 1 1 . You have infinite supply of 1 × 1 1 \times 1 tile and 2 × 1 2 \times 1 tile. You plan to cover the horizontal strip with these two types of tiles.

If N N is 1, you can cover the strip in only one way.(placing a 1 × 1 1 \times 1 tile). For N = 2 N = 2 , there are two ways, placing two 1 × 1 1 \times 1 block or placing one 2 × 1 2 \times 1 block.

What are last three digits of the number of ways to cover a horizontal strip of length 23 ( N = 23 N = 23 )?


The answer is 368.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...