Prove that each nonzero integer may be uniquely represented in the form

where
and each
is equal to -1, 0, or 1.

Prove that each nonzero integer may be uniquely represented in the form where and each is...
Use the Eisenstein Criterion to prove that if
is a squarefree integer, then
is irreducible in
for every
. Conclude that there are irreducible polynomials in
of every degree
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this image
a) Suppose we know that the series
is convergent, where the sequence an is nonzero. Show
that the series
is divergent by applying the appropriate test.
b) Suppose we know that the series
is convergent, where the sequence cn consists of
exclusively positive terms. Show that the series
is convergent by applying the appropriate test.
We were unable to transcribe this imageX 1 in n=1 We were unable to transcribe this imageWe were unable to transcribe this image
Use mathematical induction to prove summation formulae. Be sure
to identify where you use the inductive hypothesis.
Let
be the statement
for the positive integer
We were unable to transcribe this image13 + 23 + ... + n] = n(n +1) 2 +1), We were unable to transcribe this image
Prove that for every positive real (important: is not
necessarily an integer), that
.
Hint: For every , the function
is
strictly growing.
We were unable to transcribe this imageWe were unable to transcribe this imagebe(n") (n log, n) > 0 n
Prove the following
Let
with
Then:
i)
if and only if
where the double inequality
means
and
ii) If
,
if and only if
.
-2, E ER We were unable to transcribe this imageWe were unable to transcribe this image-E <<E, We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imagea ER We were unable to transcribe this imageWe were unable to transcribe this image
Prove that if
is mesurable then E is mesurable when
and
where
is the complement of E
We were unable to transcribe this imageE CIR We were unable to transcribe this imageWe were unable to transcribe this image
Suppose is a
directed graph represented by a adjacency lists. Divise a linear
time algorithm that, given such a , returns a list of all
the source vertices of . (Note, this list may
be empty.) Prove your algorithm runs in -time.
Hint: There is a simple solution that
does not involve any DFS’s or BFS’s.
G (V. E) We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this image
Let V be a finite-dimensional vector space and let T L(V) be an operator. In this problem you show that there is a nonzero polynomial such that p(T) = 0. (a) What is 0 in this context? A polynomial? A linear map? An element of V? (b) Define by . Prove that is a linear map. (c) Prove that if where V is infinite-dimensional and W is finite-dimensional, then S cannot be injective. (d) Use the preceding parts to prove...
1. Let and be subspaces of
. Prove
that is also a
subspace of .
We were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this imageWe were unable to transcribe this image
(b) Use the identities above and the formula for the sum of a geometric series to prove that if n is an integer and je[1,2,..., n) then sin2 (2ntj/n) = n/2 t-1 so long as jメ1n/21, where Ir] is the greatest integer that is smaller than or equal to x. We were unable to transcribe this image
(b) Use the identities above and the formula for the sum of a geometric series to prove that if n is an integer...