How to solve piecewise functions step by step?

1 answer:

5 0

If you can graph a function, you can graph piecewise functions. Each one of them is a different line or curve within the domain for that specific line of curve. If the domain states it's less than or greater than a number, you circle that point on the line. If the domain states it's also possibly equal to the point at the beginning or the end, you make a closed dot.

I"m sure that's clear as mud, please respond with any additional questions.

You might be interested in

Find the rule, solve for n

Andrej [43]

Try this option:
note, that the difference between 8 and 10 is 2, between 9 and 12 is 3, between 11 and 16 is 5. It is possible when f(x) is linear function, 2x-6, therefore f(14)=2*14-6=22

Answer: 22.

6 0

3 years ago

How many permutations of the 26 letters of the English alphabet do not contain any of the strings fish, rat, or bird

NARA [144]

The number of permutations of the 26 letters of the English alphabet that do not contain any of the strings fish, rat, or bird is 402619359782336797900800000

Let

$\mathcal{E}=\{\text{All lowercase letters of the English Alphabet}\}\\\\B=\overline{\{b,i,r,d\}} \cup \{bird\}\\\\F=\overline{\{f,i,s,h\}} \cup \{fish\}\\\\R=\overline{\{r,a,t\}} \cup \{rat\}\\\\FR=\overline{\{f,i,s,h,r,a,t\}} \cup \{fish,rat\}$

Then

$Perm(\mathcal{E})=\{\text{All orderings of all the elements of } \mathcal{E}\}\\\\Perm(B)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing bird}\}\\\\Perm(F)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing fish}\}\\\\Perm(R)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing rat}\}\\\\Perm(FR)=\{\text{All orderings of all the elements of } \mathcal{E} \text{ containing both fish and rat}\}\\$

Note that since

$F \cap R=\varnothing$ , $Perm(F)\cap Perm(R)\ne \varnothing$

But since

$B \cap R \ne \varnothing$ , $Perm(B)\cap Perm(R)= \varnothing$

and

$B \cap F \ne \varnothing$ , $Perm(B)\cap Perm(F)= \varnothing$

Since

$|\mathcal{E} |=26 \text{, then, } |Perm(\mathcal{E})|=26! \\\\|B|=26-4+1=23 \text{, then, } |Perm(B)|=23!\\\\|F|=26-4+1=23 \text{, then, } |Perm(F)|=23!\\\\|R|=26-3+1=24 \text{, then, } |Perm(R)|=24!\\\\|FR|=26-7+2=21 \text{, then, } |Perm(FR)|=21!\\$