in Combinatory
200 views
0 votes
0 votes
  1. Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if the tiles are red, green, or gray, so that no two red tiles are adjacent and tiles of the same color are considered indistinguishable.
  2. What are the initial conditions for the recurrence relation in part $(A)?$ 
  3.  How many ways are there to lay out a path of seven tiles as described in part $(A)?$
in Combinatory
by
200 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true