Answer:
(5 pt) Which question is being asked in this story problem? Dorothy has a stamp collection. She bought 300 stamps and some pages
1 answer:
You might be interested in
Check the picture below.
recall that negative angles go "clockwise".
Answer:
Do you want to be extremely boring?
Since the value is 2 at both 0 and 1, why not make it so the value is 2 everywhere else?
is a valid solution.
Want something more fun? Why not a parabola? .
At this point you have three parameters to play with, and from the fact that we can already fix one of them, in particular
. At this point I would recommend picking an easy value for one of the two, let's say
(or even
, it will just flip everything upside down) and find out b accordingly:
Our function becomes
Notice that it works even by switching sign in the first two terms:
Want something even more creative? Try playing with a cosine tweaking it's amplitude and frequency so that it's period goes to 1 and it's amplitude gets to 2:
Since cosine is bound between -1 and 1, in order to reach the maximum at 2 we need , and at that point the first condition is guaranteed; using the second to find k we get
Or how about a sine wave that oscillates around 2? with a similar reasoning you get
Sky is the limit.
Answer:
The sample space for selecting the group to test contains <u>2,300</u> elementary events.
Step-by-step explanation:
There are a total of <em>N</em> = 25 aluminum castings.
Of these 25 aluminum castings, <em>n</em>₁ = 4 castings are defective (D) and <em>n</em>₂ = 21 are good (G).
It is provided that a quality control inspector randomly selects three of the twenty-five castings without replacement to test.
In mathematics, the procedure to select k items from n distinct items, without replacement, is known as combinations.
The formula to compute the combinations of k items from n is given by the formula:
Compute the number of samples that are possible as follows:
The sample space for selecting the group to test contains <u>2,300</u> elementary events.