CS280 HW4
Due at the prelim on 10/9/03.
With the limitations of ascii, we'll use = to mean 'equivalent' if the equation is
written 'mod n'.
1. Let a, b, and c be positive integers with a and b being c
cs 280 hw2
1.
Do question 8 from hw1.
2. Prove that
(1+a)^p = (1 + a^p) mod p
<= a < p.
Is it still true if p is not prime?
if p is prime and a is an integer, 0
3. How many different binary operations
Solutions for CS 280 HW 1
(There are several ways to prove the problems involving set equations.
This is a representative solution, others are most certainly acceptable)
Problem 1
Given A+B = (A-B) U
CS 280
HW3 Solutions
1) Recall that any permutation P can be expressed as a composition of
disjoint cycles. Since these cycles are disjoint, we will present here
an algorithm to express a single cycle
To make our earlier (boxed) remark more precise, if is an equivalence relation on A, then
for any a A we dene the set [a] = cfw_ x A | x ~ a to be the equivalence class of a and
the set A/~ = cfw_ [
There are a lot of niceties in dening what a set should be, but for now well leave that to the
more esoteric regions of the foundations of mathematics, and be satised with the inherently
problematic
Consider the set 2 = of ordered pairs of integers. We call this a two-dimensional
integer lattice (think grid lines on graph paper). Now consider the relation on this dened by
(a , b) ~ (c , d) ad bc
There are some amusing things we can do to build up a collection of sets from a starting
ingredient. For example, lets start with the set A = , and notice that the set B = cfw_A = cfw_
is different f