A 7x1 board is completely covered by mx1 tiles without overlap; each tile may cover any number of consecutive squares, and each tile lies completely on the board. Each tile is either red, blue, or green. Let N be the number of tilings of the 7x1 board in which all three colors are used at least once. For example, a 1x1 red tile followed by a 2x1 green tile, a 1x1 green tile, a 2x1 blue tile, and a 1x1 green tile is a valid tiling. Note that if the 2x1 blue tile is replaced by two 1x1 blue tiles, this results in a different tiling. Find the remainder when N is divided by 1000.

table 3 represents a direct variation function. : )

the answer is b: 18

step-by-step explanation:

use the pythagorean theorem to .

a^2+b^2=c^2

plug 18 for "r"

the 2 legs are 18 and 24

18^2+24^2=c^2

324+576=c^2

900=c^2

c=30

30-12=18

18 is the radius

: )

g(x) = 3*(8(3^(x−2))+2)

g(x) = 24 (3^(x-2) )+6

the factor is 2

step-by-step explanation:

let f(x)=8(3^(x−2)+2)

to stretch a graph by 3, it would be 3f(x)

g(x) =3f(x)

g(x) = 3*(8(3^(x−2))+2)

g(x) = 24 (3^(x-2) )+6

x     −2     0     2     4     6

f(x) 1/64 1/16   1/4     1     4

1/64 * z * z = 1/16

i multiplies by z twice because it its 2 steps from -2 to 0

1/64 z^2 = 1/16

multiply by 64 to clear the fraction on the left side

1/4 * 64 z^2 =1/16 *64

z^2 = 4

take the square root of each side

sqrt(z^2) = ±sqrt(4)

z = ±2  

we are multiplying by 2 each time.

i dont know

step-by-step explanation:

the reason i dont know is because i have not taken this class and for that reason i haven't learned this stuff

hope i could