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
Likurg_2 [28]
3 years ago
5

What is the answer (4×-12)+(-x+7)

Mathematics
2 answers:
Bogdan [553]3 years ago
7 0

Answer:

x-41

Step-by-step explanation:

use the foil method

Ivanshal [37]3 years ago
4 0

Answer:

8/(x+3) = [8*(x+1)] / [(x+3)(x+1)] = (8x+8) / [(x+3)(x+1)]  

5/(x+1) = [5*(x+3)] / [(x+3)(x+1)] = (5x+15) / [(x+3)(x+1)]  

(8x+8 - (5x+15)) / [(x+3)(x+1)] =  

= (3x-7) / [(x+3)(x+1)]

Step-by-step explanation:

You might be interested in
There are 20 boys and 25 girls in a classroom what is the ratio of girls to boys
VMariaS [17]
20:25 now simp that and you will have your answer
7 0
3 years ago
Read 2 more answers
What is the standard form?
suter [353]
34.12    thirty four=34   and=. twelve hundredths=.12
5 0
3 years ago
max and his friend zeke are comparing their ages. they figure out that if they double maxs age from 3 years ago and add it to ze
Gre4nikov [31]
Let m be max's age
Let z be zekes age
2m+z=26
Sub in zekes age
2m+8=26
2m=26-8
2m=18
M=18/2
M=9
Remember: this is Max's age THREE YEARS AGO. Therefore, add three to get his current age
9+3=12
Therefore, Max is currently 12
Hope this helps!
4 0
3 years ago
Read 2 more answers
"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim
iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that  since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0
3 years ago
Looking for a gamer to play with I'm a girl btw
Alex17521 [72]

Answer:

What games do you play

Step-by-step explanation:

3 0
2 years ago
Read 2 more answers
Other questions:
  • Regular Hourly Rate = $6.50 Total Work Hours = 48 Overtime Rate = Time
    6·1 answer
  • Many people say you shouldn't spend more than 30% of your income on Housing. If Kendra earns $24,000 a year how much does this r
    6·1 answer
  • If I have 160 pills and I take 20 a day, how many months will they last​
    7·2 answers
  • -8(2a-3b)-5(6b)-5(-4a)
    11·2 answers
  • The graph shows f(x) = |x – h| + k. What is the value of h?
    13·1 answer
  • 29, 19, 9, -1, ... <br> please help me out;(
    6·2 answers
  • A=24<br> C=26<br> What is the length of b?
    6·1 answer
  • Solve the system by substitution.<br> y = -4x<br> 23 - 5y = 44
    5·1 answer
  • What is the distance between -12 and 15?
    9·2 answers
  • Jessica sells 50.5 ounces of lemonade for a total of 20.20.
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!