How to solve this equation to find f(n), where
f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We...
How to solve this equation to find f(n), where
f(n)=1+p*f(n+1)+q*f(n-1). p,q are constant and p+q=1. We already
know two point f(0)=f(d)=0, d is a constant number.
what is f(n) as a function with p,q,d,n?
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C...
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C = {u, v, w},
Define f : A→B by f(p) = m, f(q) = k, f(r) = l, and f(s) = n, and
define g : B→C by g(k) = v, g(l) = w, g(m) = u, and g(n) = w. Also
define h : A→C by h = g ◦ f. (a) Write out the values of h. (b) Why
is it that...
Let X Geom(p). For positive integers n, k define
P(X = n + k | X...
Let X Geom(p). For positive integers n, k define
P(X = n + k | X > n) = P(X = n + k) / P(X > n) :
Show that P(X = n + k | X > n) = P(X = k) and then briefly
argue, in words, why this is true for geometric random
variables.
Suppose that n is a product of two k-bit primes p and q. Suppose
also that...
Suppose that n is a product of two k-bit primes p and q. Suppose
also that it is known that
|p-q|<2t, where t is small. DESCRIBE a way to find the
factorization of n in t steps. (Note: in terms of RSA, it shows
that although we want p and q to be of similar size, it is also
undesirable that p and q are very close)
Show if X ~ F( p, q) , then [(p/q) X]/[1+(p/q)X] ~ beta (p/2,
q/2). Use...
Show if X ~ F( p, q) , then [(p/q) X]/[1+(p/q)X] ~ beta (p/2,
q/2). Use transformation method.
Prove that if f(x) =
akx^k
+ak−1x^k+1
+ak−2x^k+2+...+a1x+a0
is a polynomial in Q[x] and ak
̸=...
Prove that if f(x) =
akx^k
+ak−1x^k+1
+ak−2x^k+2+...+a1x+a0
is a polynomial in Q[x] and ak
̸= 0, and f (x) factors as f
(x) = g(x)h(x),
where g(x) and h(x) are
polynomials in Q[x], then deg f = deg
g+ deg h.