We draw two tickets with replacement from the box with n
tickets.
Let's first look at what sum of two positive integers yield (in
terms of even and odd result)
Even + Even = Even
Even + Odd = Odd
Odd + Odd = Even
Suppose n is even:
Then there are n/2 odd tickets and n/2 even tickets
P(Even ticket) = 0.50
P(Odd ticket) = 0.50
P(Sum of two tickets even) = P(First ticket even).P(Second ticket
even) + P(First ticket odd).P(Second ticket odd) = 0.50 x 0.50 +
0.50 x 0.50 = 0.50
P(Sum of two tickets is Even) = 1/2
Suppose n is odd:
Then there are (n-1)/2 even tickets and (n+1)/2 odd tickets
P(Even ticket) = (n-1)/2n
P(Odd ticket) = (n+1)/2n
P(Sum of two tickets even) = P(First ticket even).P(Second ticket
even) + P(First ticket odd).P(Second ticket odd):
= (n-1)2 / 4n2 + (n+1)2 /
4n2 = (n2 + 1) / 2n2 =
(n2/2n2) + (1/2n2) = 1/2 +
(1/2n2)
P(Sum of two tickets even) = 1/2 + (1/2n2)
i.e. P(Sum of two tickets even) > 1/2
So, in case n is even: P(Sum of two tickets even) = 1/2 and in case
n is odd P(Sum of two tickets even) > 1/2,
Overall, P(Sum of two tickets even) ≥
1/2
In a box, there are n tickets, each has a positive integer on it. We choose...
Problem 2. Let n be a positive integer. We sample n numbers ai,...,an from the set 1, 2,...,n} uniformly at random, with replacement. Say that the picks i and j with i < j are a match if a -aj. What is the expected total number of matches? Hint: Use indicators. Wİ
Let n be a positive integer with n > 20 , and let
with
1. Show that S possess two disjoint subsets, the sum of whose
elements are equal.
S 1,2,., 1n2) We were unable to transcribe this image
Let n be a positive integer. We sample n numbers a1, a2,..., an from the set {1,...,n} uniformly at random, with replacement. We say that picks i and j with are a match if ai = aj, i < j. What is the expected total number of matches? Use indicators.
3 For each positive integer n, define E(n) 2+4++2n (a) Give a recursive definition for E(n). (b) Let P(n) be the statement E(n) nn1)." Complete the steps below to give a proof by induction that P(n) holds for every neZ+ i. Verify P(1) is true. (This is the base step.) ii. Let k be some positive integer. We assume P(k) is true. What exactly are we assuming is true? (This is the inductive hypothesis.) iii. What is the statement P(k...
DEFINITION: For a positive integer n, τ(n) is the number of
positive divisors of n and σ(n) is the sum of those divisors.
4. The goal of this problem is to prove the inequality in part (b), that o(1)+(2)+...+on) < nº for each positive integer n. The first part is a stepping-stone for that. (a) (10 points.) Fix positive integers n and k with 1 <ksn. (i) For which integers i with 1 <i<n is k a term in the...
9. A box contains 9 tickets numbered from 1 to 9 (inclusive). If 3 tickets are drawn from the box one at a time without replacement, find the probability they are alternately either fodd, even odd or feven, odd, even.
Let n be an odd positive integer. Consider a list of n consecutive integers, not necessarily starting with 1. Show that the average is the middle number (that is the number in the middle of the list when they are arranged in an increasing order). What is the average when n is an even positive integer instead. We learned that for the odd numbers, we would have to show why n-1/2(2k+n)+(k+n) all over n equals k+(n+1)/2.
I randomly pick two integers from 1 to n without replacement (n a positive integer). Let X be the maximum of the two numbers. (a) Find the probability mass function of X. (b) Find E(X) and simplify as much as possible (use formulas for the sum and sum of squares of the first n integers which you can find online).
Challenge activity: A partition of a positive integer n is the expression of n as the sum of positive integers, where order does not matter. For example, two partitions of 7 are 7 1+1+1+4 and 7=1+1+1+2+2. A partition of n is perfect if every integer from 1 to n can be written uniquely as the sum of elements in the partition. 1+1+1+4 is perfect since 1-7 are expressed only as 1, 1+1, 1+1+1, 4, 1+4, 1+1+4 and 1+1+1+4, but 1+1+1+2+2...
Two tickets are drawn from a box with 5 tickets numbered as follows: 1,1,3,3,5. If the tickets are drawn with replacement, find the probability that the first ticket is a 1 and the second ticket is a 5. If the tickets are drawn without replacement, find the probability that the first ticket is a 1 and the second ticket is a 3. If the tickets are drawn without replacement, find the probability that the first ticket is a 1 and...