All categories

3 years ago

So I need help again so here is the question “My mom is baking cookies for a party. The recipe requires 2 eggs for every 4

Mathematics

1 answer:

seraphim [82]3 years ago

4 0

Answer:

She has enough sugar.

Step-by-step explanation:

Let x = cups of sugar needed

eggs/cups of sugar = 2/4 = 1/2

12 eggs/x = 1/2

24 = x

Since she as 25 cups available and she needs 24 cups, it looks like she has enough sugar with 1 cup left over. I hope she is making chocolate chip cookies.

You might be interested in

List the exterior angles shown in the figure

nydimaria [60]

Answer:

<1 <6 and <4 because they are on the outside of the triangle!

Step-by-step explanation:

6 0

3 years ago

Lina is making trail mix for hiking trip she has2 1/2 cups of peanuts, 3 1/4 of raisins and 2 2/3 cups of banana chips how many

Zanzabum

8 5/12 because you have to get the 3 fractions denomenators to be the same. so 3, 4 and 2 all go into 12 then you need go multiply the top by the same number as the bottom

8 0

3 years ago

PLEASE HELP

andre [41]

I believe that the answer for this is that she is going over budget considering that 100$ in debt she won't be able to pay because without the debt she would have to pay 1,605 out of her 1,700 so add 100 to 1,605 and she would be over budget

3 0

3 years ago

Read 2 more answers

How many terms of the arithmetic sequence {1,22,43,64,85,…} will give a sum of 2332? Show all steps including the formulas used

MA_775_DIABLO [31]

There's a slight problem with your question, but we'll get to that...

Consecutive terms of the sequence are separated by a fixed difference of 21 (22 = 1 + 21, 43 = 22 + 21, 64 = 43 + 21, and so on), so the n-th term of the sequence, a (n), is given recursively by

• a (1) = 1

• a (n) = a (n - 1) + 21 … … … for n > 1

We can find the explicit rule for the sequence by iterative substitution:

a (2) = a (1) + 21

a (3) = a (2) + 21 = (a (1) + 21) + 21 = a (1) + 2×21

a (4) = a (3) + 21 = (a (1) + 2×21) + 21 = a (1) + 3×21

and so on, with the general pattern

a (n) = a (1) + 21 (n - 1) = 21n - 20

Now, we're told that the sum of some number N of terms in this sequence is 2332. In other words, the N-th partial sum of the sequence is

a (1) + a (2) + a (3) + … + a (N - 1) + a (N) = 2332

or more compactly,

$\displaystyle\sum_{n=1}^N a(n) = 2332$

It's important to note that N must be some positive integer.

Replace a (n) by the explicit rule:

$\displaystyle\sum_{n=1}^N (21n-20) = 2332$

Expand the sum on the left as

$\displaystyle 21 \sum_{n=1}^N n-20\sum_{n=1}^N1 = 2332$

and recall the formulas,

$\displaystyle\sum_{k=1}^n1=\underbrace{1+1+\cdots+1}_{n\text{ times}}=n$

$\displaystyle\sum_{k=1}^nk=1+2+3+\cdots+n=\frac{n(n+1)}2$

So the sum of the first N terms of a (n) is such that

21 × N (N + 1)/2 - 20N = 2332

Solve for N :

21 (N ² + N) - 40N = 4664

21 N ² - 19 N - 4664 = 0

Now for the problem I mentioned at the start: this polynomial has no rational roots, and instead

N = (19 ± √392,137)/42 ≈ -14.45 or 15.36

so there is no positive integer N for which the first N terms of the sum add up to 2332.

4 0

2 years ago

Michael is running for president. The proportion of voters who favor Michael is 0.8. A random sample of 100 voters is taken.

Anton [14]

Answer:

Michael is running for president. The proportion of voters who favor him is 0.3. A simple random sample of 100 voters is taken.

What is the expected value :: n*p = 100*0.8 = 80

standard deviation:: sqrt(n*p*q) = sqrt(80*0.2) = 16

where q is proportion of voters who do not favor Michael. (q=0.2)

and shape of the sampling distribution is binomial distribution which is approximately a bell shaped.

-------------------------

what is the probability that the number of voters in the sample who will not favor Michael will be more than 16

P(X < 16.0) = P((x - 20) / 4.0) < (16.0 - 20) / 4.0) = P(Z < -1.00) = .1587

P(X > 16.0) = 1 - 0.1587 = 0.8413

5 0

3 years ago