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 i < j are a match if ai = aj.
What is the expected total number of matches?
What is the expected total number of matches?
1 answer:
You might be interested in
Answer:
= - 3
Step-by-step explanation:
There is a common ratio between consecutive terms of the sequence, that is
r = 9 ÷ - 3 = - 27 ÷ 9 = 81 ÷ - 27 = - 243 ÷ 81 = - 3
The recursive formula is of the form
= r
= - 3
