Barry has 4 wooden identically shaped and sized blocks. 2 are blue, 1 is red and 1 is green. How many distinct ways can barry arrange the 4 blocks in a row? Barry's friend Billie is colour-blind and cannot distinguish between red and green. How many of Barry's distinct arrangements would Billie see different?

The distinct arrangement Billie would see is P(n,r)=P(4,2)  =4! ÷ (4−2)! = 12

Step-by-step explanation:

From the question, we recall the following:

Blue = 2, red =1 green =1

The way this can be solved for which Barry can arrange the wooden shaped blocks is applying the method called permutation

So,

4 permutation 3 = P(n,r)=P(4,3)  =4! ÷ (4−3)! = 24

The ways Billie's would see  the permutation arrangement  is 4 permutation 2

With the expression given as

P(n,r)=P(4,2)  =4! ÷ (4−2)! = 12

guess at question:

a vertical line intersects the graph of g(x,y) = 0 at two points. what conclusion follows about the function f(x) implicitly defined by g(x,f(x)) = 0?

the domain of f(x) cannot include the x coordinate of any such vertical line.

informally, f(x) is not a function, and

g(x,y)=0 cannot be solved for y uniquely.

the relation r = {(x,y) such that g(x,y) = 0} is a function if

for all (a,b) ∊ r and (c,d) ∊ r, a=c implies b=d.

step-by-step explanation: