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
Elanso [62]
2 years ago
13

I need help with this is dont really understand it

Mathematics
1 answer:
user100 [1]2 years ago
7 0

Answer:

y = 10x + 6.

Step-by-step explanation:

y = mx + c

Here  the slope m = 10 and c = 6 ( the y-intercept)

It's 6 because the point (0, 6) lies on the y-axis (where x = 0).

You might be interested in
HELP! I WILL MARK BRAINLIEST!
jekas [21]

Answer:

A

Step-by-step explanation:

it is A

6 0
3 years ago
IS THIS CORRECT??????????
Alika [10]
The correct answers are the 3rd and 4th ones.
7 0
3 years ago
Read 2 more answers
Simplify (7x−13)−(x+5)
igor_vitrenko [27]
Greetings!

Simplify.
(7x-13)-(x+5)
Distribute the Parenthesis.
7x-13-x-5
Combine Like Terms.
7x-x-13-5
6x-18

Hope this helps.
-Benjamin
5 0
3 years ago
Read 2 more answers
-6x+4y=-12 in slope intercept form
cricket20 [7]

Answer:

x= 2 /3 y+2

Step-by-step explanation:

Let's solve for x.

−6x+4y=−12

Step 1: Add -4y to both sides.

−6x+4y+−4y=−12+−4y

−6x=−4y−12

Step 2: Divide both sides by -6.

−6x /−6 = −4y−12 /−6 x= 2 /3 y

=x= 2 /3 y+2

<h3><u>brainliest please?</u></h3>

<u />

5 0
3 years ago
Read 2 more answers
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
Vikentia [17]

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

5 0
3 years ago
Other questions:
  • MACRS depreciates automobiles in 6 years using these percents:
    9·2 answers
  • Can someone answer this question??
    7·1 answer
  • A bottle contains red beads and white beads.
    7·1 answer
  • Use the difference of two squares to find the product of 22 and 18. Enter the correct number in each box. ( + )( − ) = ( )2 − (
    13·2 answers
  • Jayden and Chandra are cleaning the house. It has 12 rooms, and each room is about the same size. When Jayden cleans by himself,
    9·1 answer
  • on friday morning, the temperature dropped 2 degrees per hour for four hours.write and solve an equation to find the total numbe
    15·2 answers
  • Two functions, P and Q, are described as follows: Function P y = 5x + 3 Function Q The rate of change is 2 and the y-intercept i
    11·2 answers
  • Pls help me pls i need help :)
    12·1 answer
  • #1: What is the x-intercept of the line graphed below? Write your answer as an ordered pair.​
    6·2 answers
  • Need help cant find the right answer for this one
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!