3. (01.02 LC) Some steps to construct an angle MNT congruent to angle PQR are listed below. Step 3 is not listed:
Step 1: Draw a segment NT.
Step 2: Use a compass to draw an arc from point Q which intersects the side PQ of angle PQR at point A and the side QR at point B.
Step 3:
Step 4: Adjust the width of the compass to AB and draw an arc from point X such that it intersects the arc drawn from N in a point Y.
Step 5: Join points N and Y using a straightedge.
Which statement describes step 3 correctly? (5 points)
Without changing the compass width, draw an arc from point A which intersects the segment NT at a point X.
Without changing the compass width, draw an arc from point N which intersects the segment NT at a point x.
O without changing the compass width, draw an arc from point B which intersects the segment NT at a point x.
O without changing the compass width, draw an arc from point T which intersects the segment NT at a point X.

the answer   is 200

step-by-step explanation:

this is a problem about poisson probabilities.   i don't know if you've

already studied poisson distributions, or if you have a place to look

to read more about the subject.  

here's how you can see a poisson distribution coming.   when there are

a lot of events that may happen at any time (or any place), and when

you're counting how many of them happen at a particular time (or a

particular place), and each event is independent of the others, then

the result is a poisson distribution.   this is roughly true for the

chocolate chips; one chip being in a cookie has only a small effect on

the probability that another chip will be in the cookie.

once you know you have a poisson distribution, you know a lot.   there

is only one parameter to a poisson distribution, so if you know the

mean, you know everything.   the form of the distribution is

  probability of n chips = {[e^(-x)]*(x^n)} / (n! )

step-by-step explanation:

if x = 2 you have to find x to finish the problem

10010010001010010101001001010010100101010010101010010010101010110010001011010010010001

step-by-step explanation: