What is the least common multiple of 2, 3, and 10?

A candle burned at a steady rate. After 38 minutes, the candle was 11.2 inches tall. Eighteen minutes later, it was 10.75 inches

julia-pushkina [17]

Let us take time by x variable and height of the candle by y variable.

We can setup two coordinates form the given statements:

After 38 minutes, the candle was 11.2 inches tall : (38, 11.2)

Eighteen minutes later, it was 10.75 inches tall : (56,10.75).

We need to write slope -intercept form of the equation first.

Slope-intercept form is :

y-y1 = m(x-x1).

<em>In order to find slope-intercept form we need to find the slope of the given equation.</em>

Slope between (38, 11.2) and (56, 10.75) points :

$m=\frac{10.75-11.2}{56-38}$

$m=-0.025$

Let us apply slope-intercept form y-y1 = m(x-x1).

Now, we need to find the height of the candle after 4 hours.

We took time in minutes.

Therefore, 4 hours = 4× 60 = 240 minutes.

In order to find the height of the candle after 4 hours, we need to plug x=240 in above slope-intercept form.

y- 11.2 = -0.025 (240-38)

y-11.2 = -0.025 ( 202)

y-11.2 = -5.05

Adding 11.2 on both sides, we get

y-11.2+11.2 = -5.05+11.2

y = 6.15

We need to round it to the tenth place.

Therefore, y = 6.15.

<h3>Therefore, the height of the candle after 4 hours is 6.15 inches.</h3>

4 0

4 years ago

6 Knightmare Give an algorithm to find the number of ways you can place knights on an N by M (M < N) chessboard such that no

JulsSmile [24]

Answer:

Function to return the maximum number of knights that can be placed on the given chessboard such that no two knights attack each other.

Step-by-step explanation:

In this algorithm it's fully described the maximum number

#include <bits/stdc++.h>

using namespace std;

int max_knight(int n, int m)

{

// Check for corner case #1

//If row or column is 1

if (m == 1 || n == 1) {

// If yes, then simply print total blocks

// which will be the max of row or column

return max(m, n);

}

// Check for corner case #2

// If row or column is 2

else if (m == 2 || n == 2) {

// If yes, then simply calculate

// consecutive 2 rows or columns

int c = 0;

c = (max(m, n) / 4) * 4;

if (max(m, n) % 4 == 1) {

c += 2;

}

else if (max(m, n) % 4 > 1) {

c += 4;

}

return c;

}

// For general case, just print the

// half of total blocks

else {

return (((m * n) + 1) / 2);

}

// Driver code

int main()

{

int n = 4, m = 5;

cout << max_knight(n, m);

return 0;

}

7 0

3 years ago

Which complex number has an absolute value of 5?<br> someon explain

harkovskaia [24]

The absolute value of -5 is 5, and the absolute value of 5 is also 5. ∣ a + b i ∣ = a 2 + b 2 . |a+bi| = \sqrt{a^2 +b^2}.

6 0

3 years ago

In a jar there are 3 yellow candies, 3 blue candies, and 2 orange candies. What percent of the jar is filled with orange candies

Nastasia [14]

Answer: 25 percent of the jar is filled with orange candies

Step-by-step explanation:

In the jar, there are 3 yellow candies, 3 blue candies, and 2 orange candies. This means that the total number of candies inside the jar would be the sum of the yellow, blue and orange candies. It becomes

3 + 3 + 2 = 8 candies.

The percent of the jar filled with orange candies would be expressed as

number of orange candies/total number of candies × 100

It becomes

2/8 × 100 = 25%

4 0

3 years ago

Help fast I need the right answer

lord [1]

Answer:

Y=MC+X

Step-by-step explanation:

7 0

3 years ago