All categories

3 years ago

List three integers that are between -22 and -10 PLEASE HELP ASAP

Mathematics

1 answer:

DiKsa [7]3 years ago

7 0

Answer:

-21, -20, -19, --18, -17, -16, -15, -14, -13, -12, -11

Step-by-step explanation:

There is no step by step explanation.

You might be interested in

Trust Fund A deposit of $10,000 is made in a trust fund that pays 7% interest,compounded continuously.it is specified that the b

kvasek [131]

Answer:

After 50 years college will receive a amount of $294570.25

Step-by-step explanation:

We have given deposited amount P = $10000

Rate of interest r = 7 %

Time is given t = 50 years

We have to find the amount after 50 years which college receive

Amount is given by

$A=P(1+\frac{r}{100})^n$

$A=10000(1+\frac{7}{100})^{50}=294570.25$

So after 50 years college will receive a amount of $294570.25

3 0

3 years ago

What is the greatest common factor of 24 and 30

romanna [79]

The greatest common factor of 24 and 30 is 6.

4 0

3 years ago

Read 2 more answers

Evaluate the expression. StartFraction 9 factorial Over 3 factorial EndFraction 3 6 60,480 362,874

REY [17]

Answer:

60,480 is the correct answer.

Step-by-step explanation:

First of all, let us have a look at the formula of factorial of a number 'n':

$n! = n \times (n-1) \times (n-2) \times ...... \times 1$

i.e. multiply n with (n-1) then by (n-2) upto 1.

Keep on subtracting 1 from the number and keep on multiplying until we reach to 1.

So, $9!$ can be written as: $9 \times 8 \times 7 \times ...... \times 1$

Similarly $3!$ can be written as: $3 \times 2 \times 1$

Re-writing $9 !$ :

$9 \times 8 \times 7 \times ...... 3 \times 2 \times 1\\\Rightarrow 9 \times 8 \times 7 \times ...... 3 !$

Now, the expression to be evaluated:

$\dfrac{9!}{3!} = \dfrac{9 \times 8 \times 7 \times ..... \times 3!}{3!}\\\Rightarrow 9 \times 8 \times 7 \times 6 \times 5 \times 4\\\Rightarrow 60480$

5 0

3 years ago

Read 2 more answers

Use cylindrical coordinates to evaluate the triple integral ∭ where E is the solid bounded by the circular paraboloid z = 9 - 16

4vir4ik [10]

Answer:

$\mathbf{\iiint_E E \sqrt{x^2+y^2} \ dV =\dfrac{81 \ \pi}{80}}$

Step-by-step explanation:

The Cylindrical coordinates are:

x = rcosθ, y = rsinθ and z = z

From the question, on the xy-plane;

$9 -16 (x^2 + y^2) = 0 \\ \\ 16 (x^2 + y^2) = 9 \\ \\ x^2+y^2 = \dfrac{9}{16}$

$x^2+y^2 = (\dfrac{3}{4})^2$

where:

0 ≤ r ≤ $\dfrac{3}{4}$ and 0 ≤ θ ≤ 2π

∴

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} \int ^{\dfrac{3}{4}}_{0} \int ^{9-16r^2}_{0} \ r \times rdzdrd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} \int ^{\dfrac{3}{4}}_{0} r^2 z|^{z= 9-16r^2}_{z=0} \ \ \ drd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} \int ^{\dfrac{3}{4}}_{0} r^2 ( 9-16r^2}) \ drd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} \int ^{\dfrac{3}{4}}_{0} ( 9r^2-16r^4}) \ drd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} ( \dfrac{9r^3}{3}-\dfrac{16r^5}{5}})|^{\dfrac{3}{4}}_{0} \ drd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} ( 3r^3}-\dfrac{16r^5}{5}})|^{\dfrac{3}{4}}_{0} \ drd \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV = \int^{2 \pi}_{0} ( 3(\dfrac{3}{4})^3}-\dfrac{16(\dfrac{3}{4})^5}{5}}) d \theta$

$\iiint_E E \sqrt{x^2+y^2} \ dV =( 3(\dfrac{3}{4})^3}-\dfrac{16(\dfrac{3}{4})^5}{5}}) \theta |^{2 \pi}_{0}$

$\iiint_E E \sqrt{x^2+y^2} \ dV =( 3(\dfrac{3}{4})^3}-\dfrac{16(\dfrac{3}{4})^5}{5}})2 \pi$

$\iiint_E E \sqrt{x^2+y^2} \ dV =(\dfrac{81}{64}}-\dfrac{243}{320}})2 \pi$

$\iiint_E E \sqrt{x^2+y^2} \ dV =(\dfrac{81}{160}})2 \pi$

$\mathbf{\iiint_E E \sqrt{x^2+y^2} \ dV =\dfrac{81 \ \pi}{80}}$

4 0

3 years ago

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