Problem 2. Let n be a positive integer. We sample n numbers ai,...,an from the set...
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.
Question 6: Let n 2 2 be an integer and let ai,a2,...,an be a permutation of the set (1, 2, . . . ,n). Define ao = 0 and an+1 = 0, and consider the sequence do, 1, d2, l3, . . . , Un, Un+1 A position i with 1 i n is called auesome, if ai > ai-1 and ai > ai+1. In words, i is awesome if the value at position i is larger than both its...
Let n be a positive integer. For each possible pair i, j of integers with 1 sisi<n, find an n x n matrix A with the property that 1 is an eigenvalue of A with g(1) = i and a(1) = j.
Let n be a positive integer. For each possible pair i, j of integers with 1<i<i <n, find an n xn matrix A with the property that 1 is an eigenvalue of A with g(1) = i and a(1) = j.
I got a C++ problem. Let n be a positive integer and let S(n) denote the number of divisors of n. For example, S(1)- 1, S(4)-3, S(6)-4 A positive integer p is called antiprime if S(n)くS(p) for all positive n 〈P. In other words, an antiprime is a number that has a larger number of divisors than any number smaller than itself. Given a positive integer b, your program should output the largest antiprime that is less than or equal...
(2) Let Pn [x] = {p € P[x] : degp <n}, where P[x] is the set of all polynomials. Let the polynomials li() defined by II;tilt - a;) i=0,1,...11 bi(T) = 11: a; - aj) where aj, j = 0,1,..., are distinct real numbers and aia . Show that (d) The change of basis transformation from the standard basis ', j = 0,1,...,n to l; () is given by the Vandermonde matrix (1 00 ... am 1 01 .01 1...
Exercise 9. Let n 2 2 be a positive integer. Let a -(ri,...,^n) ER". For any a,y E R" sphere of radius 1 centered at the origin. Let x E Sn-be fixed. Let v be a random vector that is uniformly distributed in S"1. Prove: 10Vn
1. Let m be a nonnegative integer, and n a positive integer. Using the division algorithm we can write m=qn+r, with 0 <r<n-1. As in class define (m,n) = {mc+ny: I,Y E Z} and S(..r) = {nu+ru: UV E Z}. Prove that (m,n) = S(n,r). (Remark: If we add to the definition of ged that gedan, 0) = god(0, n) = n, then this proves that ged(m, n) = ged(n,r). This result leads to a fast algorithm for computing ged(m,...
Question 6: Let n 2 1 be an integer and let A[1...n] be an array that stores a permutation of the set { 1, 2, . .. , n). If the array A s sorted. then Ak] = k for k = 1.2. .., n and, thus. TL k-1 If the array A is not sorted and Ak-i, where iメk, then Ak-서 is equal to the "distance" that the valuei must move in order to make the array sorted. Thus,...
let n be a positive integer and let x1,...,xn be real numbers. Prove that ( x1+...+xn)2 n(x12+ x22 +...+ xn2).