(a) How many vectors (x1, x2, x3, . . . , xn) are
there for which each xi is either 0 or 1 and
x1 + x2 + · · · + xn = k.
(b) Do the same problem as before but under the condition
that
x1 + x2 + · · · + xn ≥ k.
(a) How many vectors (x1, x2, x3, . . . , xn) are there for which...
For a given k, 1 ≤ k ≤ n, how many vectors (x1, x2, . . . , xk) are there for which each xi is a positive integer such that 1 ≤ x1 < x2 < · · · < xk ≤ n?
For a given k, 1 ≤ k ≤ n, how many vectors (x1, x2, . . . , xk) are there for which each xi is a positive integer such that 1 ≤ x1 < x2 < · · · < xk ≤ n?
1. Consider a set of vectors S = {X1, X2, X3 } in which X1 = (1,0,0), X2 = (a, 1, -a), X3 = (1, 2, 3a +1) Determine the value (or values) of a for which the set Sabove is linearly independent (LI). 2. Consider a set of vectors T = {y1, y2.ya} in which yı = (1,2,0), y2 = (1, m,5), and y3 = (0,4, n) Determine a condition on m and n such that the set T...
How many integer solutions are there for the inequality : x1 + x2 + x3 + x4 ≤ 15 (a) if xi ≥ 0 (b) if 6 ≥ x1 ≥ 1, 6 ≥ x2 ≥ 1, x3 ≥ 0, x4 > 0 How many integer solutions are there for the inequality : x++ (a) if z 20 How many integer solutions are there for the inequality : x++ (a) if z 20
how to calculate cov(x1,x2), cov(x2,x3),cov(x3,x1)? and how to calculate var(x1),var(x2),var(x3)? Given three random variables Xi, X2, and X such that X[Xi X2 X 20 -1 E [X] ,1-10 | and var(X)=Σ-| 0 3 0. 1 0.5 1 compuite: 2
Check if the given vectors are optimal solutions of the corresponding problems. 1. XI + 4X2 + X3 → max. 4X1 + 11X2 + 3X3 7, rI X2-X3=0, X1+ 13, .y20, j = 1.2.3. Check if the given vectors are optimal solutions of the corresponding problems. 1. XI + 4X2 + X3 → max. 4X1 + 11X2 + 3X3 7, rI X2-X3=0, X1+ 13, .y20, j = 1.2.3.
Let X1, X2, X3 … be independent random variable with P(Xi = 1) = p = 1-P(Xi=0), i ≥ 1. Define: N1 = min {n: X1+…+ Xn =5}, N2 = 3 if X1 = 0, 5 if X1 = 1. N3 = 3 if X4 = 0, 2 if X4 = 1. Which of the Ni are stopping times for the sequence X1, …?
Suppose you are given the following feature vectors: x1 = (1,0), x2 = (4,2), x3 = (0,-1), x4 = (-1,-1), x5 = (-2,1) Their corresponding labels are y1 = 1, y2 = 1, y3 = -1, y4 = -1, y5 = -1 Note: there is no bias term in this problem. Suppose we run perceptron on this dataset starting with w0 = (0,0). Write down the values of w1,w2,w3,w4 and w5 after each training instance, that is, wi is the...
a set of distinct elements {x1, x2, x3.... , xn} . and you draw at random with replacement n elements samples, how many distinct elements samples can be created? example suppose you have {a,b,c} then sample with replacement = {a,a, a} , {a,a,b,}, {b,b,b}
Problem 1. Simplify the logic expression using Boolean Algebra. f(x1 ,x2, x3) = x1'x2'x3' + x1x2'x3' + x1'x2'x3 + x1x2x3 + x1x2'x3 Problem 2. Simplify the logic expression given in problem 1 using K map.