<h2><em><u>it </u></em><em><u>is </u></em><em><u>helpful </u></em><em><u>for </u></em><em><u>you </u></em><em><u>♥</u></em></h2>
<em><u>a³</u></em><em><u>=</u></em><em><u>[</u></em><em><u>(</u></em><em><u>6</u></em><em><u>.</u></em><em><u>2</u></em><em><u>3</u></em><em><u>)</u></em><em><u>²</u></em><em><u>×</u></em><em><u>7</u></em><em><u>.</u></em><em><u>6</u></em><em><u>4</u></em><em><u>]</u></em><em><u> </u></em><em><u>÷</u></em><em><u>1</u></em><em><u>6</u></em>
<em><u>a</u></em><em><u>³</u></em><em><u>=</u></em><em><u>[</u></em><em><u>3</u></em><em><u>8</u></em><em><u>.</u></em><em><u>8</u></em><em><u>1</u></em><em><u>×</u></em><em><u>7</u></em><em><u>.</u></em><em><u>6</u></em><em><u>4</u></em><em><u>]</u></em><em><u>÷</u></em><em><u>1</u></em><em><u>6</u></em>
<em><u>a³</u></em><em><u>=</u></em><em><u>2</u></em><em><u>9</u></em><em><u>6</u></em><em><u>.</u></em><em><u>5</u></em><em><u>0</u></em><em><u>÷</u></em><em><u>1</u></em><em><u>6</u></em>
<em><u>a³</u></em><em><u>=</u></em><em><u>1</u></em><em><u>8</u></em><em><u>.</u></em><em><u>5</u></em><em><u>3</u></em><em><u> </u></em><em><u>ans </u></em>
Answer: I don't know
Step-by-step explanation: I don't know but have a nice day/night
Answer:
.28 = P( not winning)
Step-by-step explanation:
The probability of winning is .72
The 2 possibilitites are winning and not winning. They must total 1
1 = P(winning) +P( not winning)
1 = .72 + P( not winning)
Subtract .72 from each side
1-.72 = P( not winning)
.28 = P( not winning)
Sorry if it’s confusing i tried color coding it
the measure of angle 6 is 71.5 degrees
<span>We define
day--------------------------X
hockey cards away ------------f(X)
</span><span>He gives 2 cards away ----------------on day 1----------f(X)=2 X=1
</span>He gives 4 cards away ----------------on day 2----------f(X)=4 X=2
He gives 8 cards away ----------------on day 3----------f(X)=8 X=3
the sequence of cards away 2,4,8,16,32,64,128,256,512,1024
f(x) = 2**(x)
The answers are
D <span>Each day corresponds to a unique amount of hockey cards in this sequence.</span>
And B <span>The graph of this sequence would pass the vertical line test.
Each element of the Domain (X = day), relates to a single value of f(x) = number of hockey cards
That is, every value of X must have only one corresponding value of f(x)
(One value of y, for each input X)
This can also be checked by using the vertical line test.
If we plot f(x) and we draw vertical lines in the curve, we can verify that at every input the line intersects only one point of f(x)</span>