If ƒ(x ) = 3x + 1 and and ƒ -1 = , then the ordered pair of ƒ -1(10) = (10, 31) (10, 3) (3, 10)

1 answer:

6 0

      f(x) = 3x + 1
   y = 3x + 1
      y - 1 = 3x + 1 - 1
<u>y - 1</u> = <u>3x</u>
       3    3
¹/₃y - ¹/₃ = x
   y = ¹/₃x - ¹/₃
    f⁻¹(x) = ¹/₃x - ¹/₃
    f⁻¹(10) = ¹/₃(10) - ¹/₃
    f⁻¹(10) = 3¹/₃ - ¹/₃
    f⁻¹(10) = 3
It is equal too (10, 3).

You might be interested in

Mike is preparing refreshments for a party. To make a smoothie, he will mix 3 1⁄2 quarts of strawberry puree with 2 pints of lem

Shkiper50 [21]

Let's convert all volumes into pint:

1 Quart = 2 pints → 3.5 quart of strawberry = 2 x 3.5 = 7 pints Strawberry
1 Gallon = 8 pints →1.25 Ga. water = 1.25 x 8 = 10 pints Water
2 pints of limonade = 2 pints of limonade

Add up all pints Total = 7+10+2 = 19 pints of smoothie

Or in quart 9.5

Or in Gal 2.375

7 0

2 years ago

Read 2 more answers

93 27 14 what is next in the sequence?

Assoli18 [71]

Answer:

Step-by-step explanation:

9×3=27

2×7=14

1×4=4

nice logic

6 0

2 years ago

Three straight lines intersect at $O$, and ray $\overrightarrow{OD}$ divides $\angle COE$ into two angles of equal measure. The

riadik2000 [5.3K]

Answer:

Step-by-step explanation:

m xxq

8 0

2 years ago

A bin of 5 transistors is known to contain 2 that are defective. The transistors are to be tested, one at a time, until the defe

xxMikexx [17]

Answer:

$P(N_1 = a , N_2 = b)= \frac{1}{5-a C 1} * \frac{5-a C 1}{5C2} = \frac{1}{5C2}=\frac{1}{10}$

Step-by-step explanation:

For the random variable $N_1$ we define the possible values for this variable on this case $[1,2,3,4,5]$ . We know that we have 2 defective transistors so then we have 5C2 (where C means combinatory) ways to select or permute the transistors in order to detect the first defective:

$5C2 = \frac{5!}{2! (5-2)!}= \frac{5*4*3!}{2! 3!}= \frac{5*4}{2*1}=10$

We want the first detective transistor on the ath place, so then the first a-1 places are non defective transistors, so then we can define the probability for the random variable $N_1$ like this:

$P(N_1 = a) = \frac{5-a C 1}{5C2}$

For the distribution of $N_2$ we need to take in count that we are finding a conditional distribution. $N_2$ given $N_1 =a$ , for this case we see that $N_2 \in [1,2,...,5-a]$ , so then exist $5-a C 1$ ways to reorder the remaining transistors. And if we want b additional steps to obtain a second defective transistor we have the following probability defined: