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
Minchanka [31]
3 years ago
12

LOOK AT THE PHOTO PLEASE

Mathematics
1 answer:
Alex Ar [27]3 years ago
4 0

Answer:

The answer to the question provided is 11.

Step-by-step explanation:

\:  \:  \:  \:  \: 5x + 9 = 6x - 2 \\  \frac{ - 5x \:  =   - 5x }{9  = 1x - 2}  \\  \frac{ + 2  \:  \:  \:  \: =  + 2}{ \frac{11}{1} =  \frac{1x}{1}  }  \\ 11 = x

[I apologize if the answer to the question provided is inaccurate]

You might be interested in
The answer I neeed it now
slava [35]
Anser is B). Subtract smallest number
5 0
3 years ago
Freemont Run Club surveyed a random sample of 30 members about their running habit. Of the members surveyed, 9 said that they ru
atroni [7]

Answer:

i think its 420

Step-by-step explanation:

8 0
3 years ago
PLS HELP ME ITS DUE IN 4 MINS!<br><br> Subtract 2y²+7y+2 from 6y²+9y−8.
Dmitry_Shevchenko [17]

Answer:

-4y^2 - 2y + 10

Step-by-step explanation:

8 0
2 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
What is the value of A?
natali 33 [55]

Answer:

A is -8

B 27

x 3

y 6

z 12

step by step explanation:

4 0
2 years ago
Other questions:
  • What is the major difference between Fourier Transform and Z-Transform??.
    10·1 answer
  • 1 1/9 • 6= x what is x
    14·2 answers
  • Which statement correctly explains whether or not the values in the table represent a function of x
    7·1 answer
  • A trampoline gym charges $6 for 1/2 of and hour at this rate what does 1 hour cost
    11·2 answers
  • Dan earns £276 over the course of a five-day week. How much is that per day?
    9·1 answer
  • Help please will mark brainliest!!!
    9·1 answer
  • Which parent function is fx) = 1x/?
    9·1 answer
  • What is the maximum or minimum value? f(x) = -(x - 8) ^ 2 - 25
    15·1 answer
  • A washer and dryer cost a total of $964 . The cost of the washer is three times the cost of the dryer. Find the cost of each ite
    6·2 answers
  • Weiming receives a weekly pocket money of $28. If he decides to save 20% of it, find his saving in a year and spendings in a yea
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!