Find a recurrence word problem.

  • #1
find a recurrence,,, word problem.

Homework Statement



A rectangular board 2cm wide and ncm long is to be covered with smaller tiles of size 2cmx2cm and 1cmx2cm. There is an unlimited supply of both types of tile.


For each n=1,2,... let an be the number of ways that a board of length n cm can be covered with the two types of tile.

a) find a recurrence relation for an , n>2.

b) find a5



Homework Equations





The Attempt at a Solution



a) im not really sure how these answers are meant to be set out... its something like an= an-1...

I imagine when n=3, there is a 2x3 board so it can be tiled with with 3(1x2) or 1(2x2)+1(1x2) tiles. so it can be done in two ways?

n=4 .... 2(2x2) or 4(1x2) or 1(2x2)+ 2(1x2) so 3 ways

n=5... 2(2x5)+1(1x2) or 1(2x2)+3(2x1) or 5(1x2) so 3 ways.

n=6 .... 3(2x2) or 2(2x2) +2(1x2) or 1(2x2) +4(1x2) or 6(1x2) so 4 ways.

am I meant to be seeing a pattern? maybe an is the same for (2n) and (2n+1)

all I can think of is that a 2cmx2cm = 2 (1cmx2cm) tiles.

I imagine that part b) has to do with part a) so I can't solve without a.

any help greatly appreciated.

Thanks
 
Last edited:

Answers and Replies

Related Threads on Find a recurrence word problem.

  • Last Post
Replies
3
Views
507
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
11
Views
3K
Replies
2
Views
6K
  • Last Post
Replies
6
Views
909
  • Last Post
Replies
1
Views
999
  • Last Post
Replies
4
Views
2K
Replies
3
Views
4K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
7
Views
2K
Top