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
Anna11 [10]
3 years ago
14

which ordered pair is a solution of the equation y=4x-7 A. only (2,1) B. only (4,9) C. Both (2,1) and ( 4,9) D Neither

Mathematics
1 answer:
Sphinxa [80]3 years ago
7 0

Hey there! :)

Answer:

C. Both (2,1) and (4,9)

Step-by-step explanation:

To solve this question, simply plug in the coordinates of answer choices given into y = 4x - 7:

A.

1 = 4(2) - 7

1 = 8 - 7

1 = 1. A is correct.

B.

9 = 4(4) - 7

9 = 16 - 7

9 = 9. B is correct.

Therefore, the correct answer is C. Both (2,1) and (4,9) are solutions to this equation.

You might be interested in
Jalil and Victoria are each asked to solve the equation ax – c = bx + d for x. Jalil says it is not possible to isolate x becaus
Llana [10]
Ask google because I’m so dumb I can’t even read this ! Have a great day I hope you find your answer
8 0
3 years ago
Is 13/8 rational have to add more letters lol
Serhud [2]
I do not believe so but dont quote me on it.
7 0
3 years ago
There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th
N76 [4]

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

                                                        = 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth.  This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

                    = 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

                    = 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

3 0
3 years ago
Look at screenshot and answer question
goblinko [34]

Answer:

32x +20

Step-by-step explanation:

6 0
3 years ago
Read 2 more answers
If one point is located at (-6, 2) and another point is
Luba_88 [7]

Answer:

it is the square root of 145

Step-by-step explanation:

use distance formula

7 0
3 years ago
Other questions:
  • Triangle DEF is congruent to GHJ by the SSS theorem. Which rigid transformation is required to map DEF onto GHJ?
    15·2 answers
  • Suppose you go shopping for a new futon bed for your apartment/home. The model you really like happens to be on sale for $1100.
    6·1 answer
  • Why is it better to use the median instead of the mode on a dot plot?
    5·1 answer
  • Can anyone please help me??? It’s for a test
    5·1 answer
  • A recent national survey indicated that 73 percent of respondents try to include locally grown foods in their diets. A 95 percen
    10·2 answers
  • Mathematical Literacy , What does a basic fee mean?​
    11·2 answers
  • Tim earns $31 after 2 hours, $46.5 after three hours,
    14·1 answer
  • I need help can someone help? Please
    8·2 answers
  • Graph the points (0,-2), (4,0) and (2,0). If you want to create a parallelogram, which of the following points should used for t
    8·1 answer
  • Convert 72 miles per hour into meters per second.
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!