1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
lora16 [44]
3 years ago
15

Hey can you please help me posted picture of question

Mathematics
1 answer:
Zinaida [17]3 years ago
7 0
The inverse functions have a property that the composition of two inverse functions always results is x. 

From the given options, only the pair given in option B result in the composition equal to x.

F(x)= \frac{12}{x}-18 \\  \\ 
G(x)= \frac{12}{x+18} \\  \\ 
F(G(x))= \frac{12}{ \frac{12}{x+18} }-18 \\  \\ 
F(G(x))= \frac{12(x+18)}{12}-18 \\  \\ 
F(G(x))=x+18-18=x

This proves, F(x) and G(x) are inverse of each other.

So the answer to this question is Option B
You might be interested in
7 1/2 divided by 2 1/2
Andrew [12]

Answer:

3

Step-by-step explanation:

6 0
3 years ago
A spinner has five equal sections that are numbered 1 through 5.
ankoles [38]

Answer:

Step-by-step explanation:

X has a binomial distribution when the probability of X is the same for each spin.

When the spinner is spun four times, X is the number of times the spinner does not land on an odd number.

When the spinner is spun five times, X is the number of times the spinner lands on 1.

3 0
3 years ago
Read 2 more answers
I don’t get it can I get help
klio [65]

Answer:

The ratio is 2:30

Step-by-step explanation:

For every 2 hours, 30 cakes are baked.

Or for every 1 hour, 15 cakes are baked.

8 0
3 years ago
Read 2 more answers
Suppose you have a complete, weighted graph with 8 vertices. How many Hamilton Circuits are there in this graph?
Natali5045456 [20]

The number of Hamilton Circuits with 8 vertices are 5040.

Given that, a complete, weighted graph with 8 vertices.

<h3>What are Hamilton Circuits?</h3>

A Hamiltonian circuit is a circuit that visits every vertex once with no repeats. Being a circuit, it must start and end at the same vertex. A Hamiltonian path also visits every vertex once with no repeats, but does not have to start and end at the same vertex.

For N vertices in a complete graph, there will be (n−1)!=(n−1)(n−2)(n−3)…3⋅2⋅1 routes. Half of these are duplicates in reverse order, so there are (n−1)!/2 unique circuits.

A complete graph with 8 vertices would have = 5040 possible Hamiltonian circuits. Half of the circuits are duplicates of other circuits but in reverse order, leaving 2520 unique routes.

Therefore, the number of Hamilton Circuits with 8 vertices are 5040.

Learn more about the Hamilton Circuits here:

brainly.com/question/24725745.

#SPJ1

7 0
1 year ago
Math question<br><br><br><br> I have 3 for you
Reptile [31]
#1-answer c
#2-answer b
#3-answer a
8 0
3 years ago
Read 2 more answers
Other questions:
  • What is the measure of def 78° PLEASE HELP
    7·1 answer
  • Which recursive function describes the number of bacteria observed at the 7th hour?
    15·1 answer
  • Barry’s mountain bike weighs 6 pounds more than andy’s. Their bike weigh 42 pound together . Write an equation that represent th
    7·1 answer
  • Carmelita recently purchased a home entertainment center with cash. Which of the following would best describe this purchase in
    8·1 answer
  • The length of a rectangular driveway is five feet more than three times the width. The area is 350ft2. Find the width and length
    5·1 answer
  • in a city of 88,000 people, there are 33,000 people under 25 years of age. What percent of the population is under 25 years of a
    12·1 answer
  • What is 4x - 3 = -2x + 9
    8·1 answer
  • I need help please i’ll give u a brainliest
    15·1 answer
  • Please let me know the answer to this
    5·1 answer
  • The tangent is longer than the diameter.<br><br> A) never true<br><br> B) always true
    9·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!