All categories

3 years ago

CAN SOMEONE HELPPPPPP PLEASE?!??!!!!?

Mathematics

1 answer:

iris [78.8K]3 years ago

8 0

If AM=10, then AC=10 because both are radii. TC is a diameter so that’ll just be the radius doubled. TC=20!

You might be interested in

Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach

jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

for(int i = 0;i < MAX;++i)

id[i] = i;

}

int root(int x)

{

while(id[x] != x)

{

id[x] = id[id[x]];

x = id[x];

}

return x;

}

void union1(int x, int y)

{

int p = root(x);

int q = root(y);

id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

int x, y;

long long cost, minimumCost = 0;

for(int i = 0;i < edges;++i)

{

// Selecting edges one by one in increasing order from the beginning

x = p[i].second.first;

y = p[i].second.second;

cost = p[i].first;

// Check if the selected edge is creating a cycle or not

if(root(x) != root(y))

{

minimumCost += cost;

union1(x, y);

}

return minimumCost;

}

int main()

{

int x, y;

long long weight, cost, minimumCost;

initialize();

cin >> nodes >> edges;

for(int i = 0;i < edges;++i)

{

cin >> x >> y >> weight;

p[i] = make_pair(weight, make_pair(x, y));

}

// Sort the edges in the ascending order

sort(p, p + edges);

minimumCost = kruskal(p);

cout << minimumCost << endl;

return 0;

}

8 0

3 years ago

The median of the marks 10, 13, 3x-1, 3x+1, 18, 18 arranged in ascending order is

Lorico [155]

Answer:

a. Marks = 10, 13, 14, 16, 18, 18

b. mode = 18

c. Range = 8

Step-by-step explanation:

==>Given the following data set arranged in ascending order:

10, 13, 3x-1, 3x+1, 18, 18

Median = 15

==>Required:

a. Marks:

To get each marks, let's find the value of x since we know median to be 15.

10, 13, [3x-1, 3x+1], 18, 18

Our median in this even number of data set would be the average of the 2 middle values which would give us 15.

Thus, we have:

[(3x-1) + (3x+1)] ÷ 2 = 15

[3x-1 + 3x+1] ÷ 2 = 15

[3x+3x-1+1] ÷ 2 = 15

6x/2 = 15

Multiply 2 by both sides

6x = 30

Divide 6 by both sides

x = 5

Now let's plug in the value of x to get out marks:

10, 13, 3(5)-1, 3(5)+1, 18, 18

10, 13, 14, 16, 18, 18

b. Mode is the most appeared data value, which is 18

c. Range is the difference between the highest and lowest value = 18 - 10 = 8

5 0

3 years ago

Frank is having the car pets in his house cleaned. The cost of the cleaning is calculated from the area of the carpets. C= the c

asambeis [7]

Answer:

Cost of the cleaning, C is the dependent variable

Area of the carpet, a is the independent variable

Step-by-step explanation:

cost of the cleaning is calculated from the area of the carpets

C= the cost of the cleaning a= the area of the carpets.

Cost of the cleaning, C is the dependent variable

Area of the carpet, a is the independent variable

A dependent variable is a variable which depends on other factors to exist. They take their values based on other factors. Their value is changed as a result of a change in independent variable

An independent variable is a variable which does not change as a result of the change in other factors. They take their values irrespective of external factors around them.

5 0

3 years ago

X2 – 3x + 10<br><br> What is the answer to this?

Tpy6a [65]

Answer:

-1x+10

Step-by-step explanation:

6 0

3 years ago

Read 2 more answers

in how many ways of the permutations of 10 different things taken 4 at a time will one particular thing always occur

olganol [36]

Answer:

do as direct

which one of the following is square of 4

4 0

3 years ago