All categories

3 years ago

The legs of a isosceles triangle are 0.3 foot less then twice the base . The perimeter of the triangle is 4.9 feet .

Mathematics

2 answers:

iris [78.8K]3 years ago

4 0

Answer:

Step-by-step explanation:

REY [17]3 years ago

3 0

Answer:

Hey

Step-by-step explanation:

I bevlive your answer is B. If you multiply the two numbers you get 1.4

You might be interested in

What’s 1 fourth of 1490

Kazeer [188]

1490/4 =372.5................

4 0

3 years ago

Read 2 more answers

What is.... 36 + 25.2 + 180? :)

Marysya12 [62]

The answer would be 241.2

5 0

3 years ago

Read 2 more answers

What's the answer to -7=c-6

son4ous [18]

Simple...

you have: -7=c-6

You want to isolate the variable c

-7=c-6

-7=c-6
+6 +6

-1=c

Thus, your answer.

6 0

3 years ago

Find a linear second-order differential equation f(x, y, y', y'') = 0 for which y = c1x + c2x3 is a two-parameter family of solu

Alisiya [41]

Let $y=C_1x+C_2x^3=C_1y_1+C_2y_2$ . Then $y_1$ and $y_2$ are two fundamental, linearly independent solution that satisfy

$f(x,y_1,{y_1}',{y_1}'')=0$
$f(x,y_2,{y_2}',{y_2}'')=0$

Note that ${y_1}'=1$ , so that $x{y_1}'-y_1=0$ . Adding $y''$ doesn't change this, since ${y_1}''=0$ .

So if we suppose

$f(x,y,y',y'')=y''+xy'-y=0$

then substituting $y=y_2$ would give

$6x+x(3x^2)-x^3=6x+2x^3\neq0$

To make sure everything cancels out, multiply the second degree term by $-\dfrac{x^2}3$ , so that

$f(x,y,y',y'')=-\dfrac{x^2}3y''+xy'-y$

Then if $y=y_1+y_2$ , we get

$-\dfrac{x^2}3(0+6x)+x(1+3x^2)-(x+x^3)=-2x^3+x+3x^3-x-x^3=0$

as desired. So one possible ODE would be

$-\dfrac{x^2}3y''+xy'-y=0\iff x^2y''-3xy'+3y=0$

(See "Euler-Cauchy equation" for more info)

6 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