Assignment4

# Assignment4 - A 1 if and only if they are neighbours in A 2...

This preview shows pages 1–2. Sign up to view the full content.

Math 240, Fall 2009 — Assignment 4 — Due: Monday, November 16 1. Your arch-enemy has started using RSA encryption, and has published the modulus n = 1919 and the public key e = 1213 on her blog. Find her private key d . Show all of your work. 2. Use a tree diagram to count the number of bit strings of length 6 which have three consecutive zeros or three consecutive ones. 3. (Peer reviewed problem) Prove that at a party with n 2 people, there are two people who know the same number of other people there. 4. How many ways are there to seat six people around a circular table, where two seating arrangements A 1 , A 2 are considered to be the same if ... (a) ... A 1 can be obtained from A 2 by rotating the table? (b) ... two people are neighbours in

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A 1 if and only if they are neighbours in A 2 ? 5. Show that, if n is a positive integer, then n X k =0 k n k = n 2 n-1 . 6. I wish to place n objects into k boxes, such that each box has at least one object . The number of ways in which this can be done depends upon whether the boxes and the objects are labeled or not. Boxes labeled Boxes unlabeled Objects labeled Objects unlabeled Please ll in the table with the number of ways in which these four tasks can be done. Note: some of the boxes wont have nice closed forumlas. Math 240 Assignment 4 Fall 2009 Marker: Gabriel Charette Instructor: Benjamin Young Date: Name: Student Number:...
View Full Document

## This note was uploaded on 10/03/2010 for the course MATH 240 taught by Professor Szabo during the Spring '08 term at McGill.

### Page1 / 2

Assignment4 - A 1 if and only if they are neighbours in A 2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online