All categories

3 years ago

Did I get this right?

Mathematics

1 answer:

zepelin [54]3 years ago

5 0

The number behind the Decimal 75 I think is correct

You might be interested in

Product of 2.9 and 6.2

skad [1K]

Answer:

17.98

Step-by-step explanation:

5 0

3 years ago

Given ABC, what is the value of x?<br><br> NEED HELP QUICK!!

ICE Princess25 [194]

Answer:

x = 49

Step-by-step explanation:

AD is an angle bisector and divides the opposite side into segments that are proportional to the other 2 sides , that is

$\frac{28}{x}$ = $\frac{8}{14}$ ( cross- multiply )

8x = 392 ( divide both sides by 8 )

x = 49

3 0

3 years ago

A rock is dropped from a height of 100 feet. Calculate the time between when the rock was dropped and when it landed. If we choo

andre [41]

The time it takes between when the rock was dropped and when it landed is 1.33 seconds.

<h3>What is the time it takes for the rock to land?</h3>

The time it takes the rock to land on the ground from where it is dropped can be determined by using the function given.

The height of the function when it hits the ground will be zero, so the function can be written as:

$\mathbf{h(t) =36t^2 -64}$

$\mathbf{0 =36t^2 -64}$

64 = 36t²

$\mathbf{t^2 = \dfrac{64}{36}}$

t² =1.778

$t = \sqrt{1.778}$

t = 1.333 seconds

Learn more about calculating the time of a function here:

brainly.com/question/26898697

#SPJ1

6 0

2 years ago

uppose that we have a function with a constant amount of work done in initialization, a call to a log-linearsorting algorithm, a

White raven [17]

Answer:

The running time is quadratic (O(n²) )

Step-by-step explanation:

For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is

C + T(n) + n*(a*n+b) = an²+bn + T + C

Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).

7 0

3 years ago

Pattie is itemizing deductions on her federal income tax return and had $4800

muminat

Answer: 1500

Step-by-step explanation:

6 0

3 years ago