In pyhton q1. consider an experiment that consists of recording the birthday for each of 20 randomly selected persons. ignoring leap years, we assume that there are only 365 possible distinct birthdays. furthermore, we assume that each of the possible sets of birthdays is equi-probable (1)what is the probability that each person in the 20 has a different birthday? (2)find the minimum number of persons such that the probability of two or more people have a same birthday is at least 50%.(3)find the minimum number of persons such that the probability of two or more people have a same birthday is at least 95%.q2. poisson as an approximation to the binomial distribution. (1)generate 1000 random numbers from the binomial(n=200, p=0.01) distribution and generate 1000 random numbers from the poisson(μ=2) distribution. do not print the two data sets. show your python code only.(2)compare the mean, median, standard deviation, histogram and boxplot of the two data sets generated in part (1). what do you conclude? (3)repeat part (1) 10, 000 times and (a)calculate the difference of the sample means for each paired data sets, and draw a histogram of these 10,000 differences. what you can see from this histogram? (b)calculate the difference of the sample standard deviations for each paired data sets, and draw a histogram of these 10,000 differences. what you can see from this histogram?

sec ф = 5/3 (quadrant 4)

let x = base

y = perp

z = hypotenuse

sec ф = hypotenuse/base = 5/3

⇒ z = 5 and x = 3

finding y:

z² = x² + y²

5² = 3² + y²

y² = 25-9

y² = 16

y = 4

now finding all other geometric functions of theta:

sin ф = y/z = 4/5

sin ф = -4/5 (sin is negative in the 4th quadrant)

cos ф = x/z = 3/5

cos ф = 3/5 (cos is positive in 4th quadrant)

tan ф = y/x = 4/3

tan ф = -4/3 (tan is negative in 4th quadrant)

cosec ф = z/y = 5/4

cosec ф = -5/4 (cosec is negative in the 4th quadrant)

cot ф = x/y = 3/4

tan ф = -3/4 (tan is negative in 4th quadrant)

square root

step-by-step explanation:

translate k to n and reflect across the line containing jk.

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.