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
AlekseyPX
3 years ago
5

help it is due today and not links or files of downloads of anything like that just type in your answer plz and thank u :)

Mathematics
2 answers:
pantera1 [17]3 years ago
4 0
The answer should be x=4
nirvana33 [79]3 years ago
3 0

Answer:

4

Step-by-step explanation:

X = 4 because

25x = 13 + 87

25x = 100

(25x)/25 = 100/25

X = 4

the 25 on the left cancels out and 25 goes into 100 4 times

You might be interested in
Find the equation of a line with slope -6 that goes through the point (-2,23)
elena55 [62]
Y - 23 = - 6 ( x + 2 )
Y - 23 = - 6x - 12
Y = - 6x + 11
Y + 6x = 11
Thanks me if it is correct !!
6 0
3 years ago
Can someone help me compare the shape of the box plots
djyliett [7]
I think it might be C or B I'm honestly not 100% sure.
8 0
3 years ago
Read 2 more answers
1/2 + (-1/4)=????????????
erica [24]

Answer:

\frac{1}{4}

Step-by-step explanation:

\frac{1}{2} = \frac{2}{4}  We need a common denominator before we can add.

\frac{2}{4} + \frac{-1}{4}  means the same thing as

\frac{2}{4} - \frac{1}{4} = \frac{1}{4}

5 0
2 years ago
A restaurant charges an automatic gratuity of 18% on tables with more than 6 people. A party of 8 had a bill of p. Which express
Bond [772]
0.18p

a brainliest would be appreciated ❤️
7 0
3 years ago
"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
Other questions:
  • I need help with number 2
    10·2 answers
  • Evaluate the expression. m×n, when m=13 and n=12
    10·1 answer
  • Jack rented a moving truck for 7 hours and paid $153.65. how much did it cost per hour?
    6·1 answer
  • Find the number of 1 cm cubes that can be placed in the box that right
    14·2 answers
  • Selena brought 3.75 pounds of meat for $4.64 per round. what was the total cost of meat?
    13·1 answer
  • Lola pulls two marbles fro. A bag that contains four red marbles four blue marbles and 12 yellow marbles without replacing them
    6·1 answer
  • N Over 33 = 4 Over 11
    13·1 answer
  • Each tile is 3/2 feet by 3/2 feet. There are 10 tiles on the bathroom floor.
    13·1 answer
  • X. y
    14·2 answers
  • The tree diagram represents an
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!