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
Maurinko [17]
3 years ago
6

How to get an answer of 34 by using the following integers -1, 4, 40, and -25

Mathematics
1 answer:
umka2103 [35]3 years ago
7 0
Assuming that the integers can be repeated
40-25+4+4+4+4+4-1
You might be interested in
-73 greater than or equal to 15 + 11x
Alecsey [184]
-73 ≥ 15 + 11x 
so the first thing you should do is to add -15 on both sides of the equation so you will have:
-73 -15 ≥ 11x 
- 88 ≥ 11x 
so the answer is:
-88/11 ≥ x or -8 ≥ x :)))
i hope this is helpful
have a nice day 
5 0
3 years ago
Read 2 more answers
please help me and before you try to answer the height is not 8 in but the volume is 25.12 in if that helps thank you <3
DochEvi [55]

Answer:

25.12 in^3.

Step-by-step explanation:

Volume of the cylinder = 3.14 * r^2 * h

= 3.14 * 2^2 * 8

The volume of the preserve

= 1/4 * 3.14 * 4 * 8

= 25.12 in^3.

3 0
3 years ago
Read 2 more answers
Remainder of 8529 divided by 42
Svetradugi [14.3K]
8529\div 42=203 r3

The remainder is 3.
4 0
3 years ago
Use a=-2, b=-3 and c= 6 to write an expression that has a value of 6
DaniilM [7]

Answer:

Step-by-step explanation:

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
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:
  • How do I simply this, thanks!
    9·1 answer
  • Suppose that a box contains 45 light bulbs, of which 36 are good and the other 9 are defective. Consider randomly selecting thre
    5·1 answer
  • Y=-1/3x^2-4x-5 in vertex form
    14·1 answer
  • A boardwalk is to be erected along an ocean beach. The specifications for the boardwalk require a width of at least 155 cm., but
    6·1 answer
  • The absolute value function, f(x) = |x + 2|, is shown. If the graph is reflected over the x-axis, what is the domain of the func
    14·1 answer
  • (GIVING BRAINLIEST!!!)
    9·1 answer
  • What is the slope of the line that passes through the points (0, -3) and (0,4)?
    10·1 answer
  • AaBbCc x AaBbCc (use for all 3 questions) 1. What is the probability that this individual will: AABBcc 2. What is the probabilit
    10·1 answer
  • (picture included) brainliest
    10·1 answer
  • Help me with this question please!! :)
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!