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
Butoxors [25]
3 years ago
10

Please help me solve this

Mathematics
1 answer:
Rashid [163]3 years ago
8 0

Answer:

??????????????

Step-by-step explanation:

,nooooooo

You might be interested in
(5,-3), (5,8). Find slope
anzhelika [568]

Answer: 0 slope, horizontal line.

Step-by-step explanation:

when using y2-y1/x2-x1, you would get 8-(-3)/5-5. This simplifies to 11/0, which means that the line would have 0 slope. A line with 0 slope is a horizontal line.

7 0
3 years ago
Find the distance between points P(5, 1) and Q(3, 4) to the nearest tenth
pav-90 [236]

Answer:

\sqrt{13} units

Step-by-step explanation:

The distance formula is d=\sqrt{(x_2-x_1)^2+(y_2-y_1)^2} where d is the distance between points (x_1,y_1) and (x_2,y_2). Let (x_1,y_1)\rightarrow(5,1) and (x_2,y_2)\rightarrow(3,4), thus:

d=\sqrt{(x_2-x_1)^2+(y_2-y_1)^2}\\\\d=\sqrt{(3-5)^2+(4-1)^2}\\\\d=\sqrt{(-2)^2+(3)^2}\\\\d=\sqrt{4+9}\\\\d=\sqrt{13}

Therefore, the distance between points P(5,1) and Q(3,4) is \sqrt{13} units.

8 0
2 years ago
Factorise p^2 + q^2 +5(p^2 + q^2)​
Vinvika [58]

Step-by-step explanation:

p² + q² + 5(p² + q²)

= 1(p² + q²) + 5(p² + q²)

= (1 + 5)(p² + q²)

= 6(p² + q²).

5 0
2 years ago
How can you describe a ratio as a fraction?
kap26 [50]
Let's say the ratio is 3:4. It could be written as 3/4
5 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:
  • Find the mean and median of the data.<br><br> 12, 15, 16, 18, 20, 90<br><br> please help!!!
    12·1 answer
  • What is the rotational symmetry of a rectangle
    5·1 answer
  • (-2i)(5i)(-1) how do you solve by simplifying showing the steps
    14·1 answer
  • The answer choices are
    10·2 answers
  • A car is approaching a building. When it is 300 ft away, the angle of depression from the top of the building to the car is 42°.
    13·2 answers
  • 6 + 3 • 4 evaluate the following numerical exspressions
    10·1 answer
  • Hihi , please help if able.
    14·1 answer
  • 8 x 5/6 = z<br> What is z?<br><br> A. 53/6<br> B. 40/6<br> C. 13/48<br> D. 5/48
    13·2 answers
  • Find the area of the figure
    14·1 answer
  • Help me plz and thank you
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!