Ask question

Ask question

All categories

wolverine [178]

2 years ago

6

Use the following experiment. A state lottery game consists of choosing one card from each of the four suits in a standard deck

of playing cards. (There are 13 cards in each suit.)
Count the number of ways in which four 9's can be chosen.

1 answer:

Masteriza [31]2 years ago

7 0

Jupiter Saturn Mars Earth Sun

You might be interested in

Which exponential function is represented by the values in the table?

Goryan [66]

Answer:

$\displaystyle f(x)=4\cdot\left(\frac{1}{2}\right)^x$

Step-by-step explanation:

<u>Exponential Function</u>

The exponential function can be written with the general equation:

$f(x)=A\cdot r^x$

Where A is the value when x=0 and r>0 is the ratio. If r is greater than 1, the function is increasing, if r is less than 1, the function is decreasing.

The table shows the relation between values of x and values of the function y. Note that as x increases (one by one), y decreases with a ratio of 1/2. Only the last two choices have ratios of r=1/2. We only have to test which one of them has the correct value of y=4 when x=0.

Substituting in the third function:

$\displaystyle f(x)=4\cdot\left(\frac{1}{2}\right)^x$

$\displaystyle f(0)=4\cdot\left(\frac{1}{2}\right)^0$

$f(0) = 4$

This gives the correct value of f(0)=4.

Substituting in the fourth function:

$\displaystyle f(x)=\frac{1}{2}\cdot\left(\frac{1}{2}\right)^x$

$\displaystyle f(0)=\frac{1}{2}\cdot\left(\frac{1}{2}\right)^0$

$f(0) = \frac{1}{2}$

This choice is wrong

Correct choice:

$\boxed{\displaystyle f(x)=4\cdot\left(\frac{1}{2}\right)^x}$

8 0

2 years ago

In order to get to her Grandmother's house, Little Red Riding Hood walks 6 miles

Vesnalui [34]

Answer:

4.4 miles

Step-by-step explanation:

c= sqrt 6^2+10^2

sqrt 36+100

Sqrt 136=11.66190378

10+6=16

16-11.66190378=4.33809622

3 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

2 years ago

What is the square root of 134

OleMash [197]

Answer:

11.5758369028

Step-by-step explanation:

4 0

3 years ago

Read 2 more answers

Write <img src="https://tex.z-dn.net/?f=3x%5E%7B2%7D%20-x-3%2Bx%5E%7B3%7D" id="TexFormula1" title="3x^{2} -x-3+x^{3}" alt="3x^{2

Elza [17]

Answer:

Standard form: $x^3+3x^2-x-3$

Leading coefficient: 1

Step-by-step explanation:

$3x^2-x-3+x^3=\\x^3+3x^2-x-3$

The leading coefficient is 1 because the leading term is $x^3$ .

5 0

2 years ago