In a competition, 50 people submitted the correct answer. Among them, a vacation trip to Italy and a vacation trip to Mexico, as well as four bicycles and six books, will be chosen at random. a) How many possibilities are there if each person can receive a maximum of one prize? b) How many possibilities…
How do I find out n if I have a and b? I don't understand.
I can probably calculate the Laplace but I have problems with the notation of my event space Omega and my event A For example, I have 1000 employees (600M and 400W), I have to calculate the probability that a male is drawn How do I write Omega and A now I would have said Omega…
In my script A= power set of Omega (event space) I know how to calculate it, but I don't understand the point. What's the point? What can I do with it? For example, if I have a cube, the power set is 2^6. What good is that to me? I can't think of any problem…
Hello, I don't understand how to calculate the equation of a plane. Can I simply start with a tetrahedron with points A, B, C, and S and then calculate A+r•(BA)+s•(SA) for ABS? Best regards
For the cumulative probability of a binomially distributed random variable, I can say the following: The small p is then the same in all cases for both the event and the opposite event (i.e. for 1- capital P), right? Lg
There are (n over k) paths on which one can get k hits in an n-stage Bernoulli experiment.
Hey people, I could not solve this task, but I can only write my approach There are nonempty sets A, B, C, as well as maps f: A-> B and g: B -> C, such that gof is injective, but g is not injective. Approach: A={a}, B={b}, C={c} f(a)=b g(b)=c (f○g)(a)=c ==> a=c, but g(b)=c
I can't get any further with this problem in my textbook. Thanks!
Let A = {1, 2, 3}. Determine all equivalence relations on A as subsets of A2. In particular, explain why the relations you have determined are actually equivalence relations and why your list is complete. Does this have anything to do with reflexive/transitive/symmetric?
Recall that a number p ∈ N \ {1} is called a prime number if and only if it has exactly two divisors, namely 1 and p. Prove the following theorem: Let p ∈ N \ {1, 2} be a prime number. Then there exists k ∈ N0 such that p = 4k + 1…
The internet gives me contradictory definitions.