CMSC250 Spring 2004 Homework 6: Problems in Number Theory, Assignments of Discrete Structures and Graph Theory

The sixth homework assignment for the cmsc250: introduction to algorithms course offered in spring 2004. The assignment covers various topics in number theory, including prime numbers, perfect squares, and standard factored form. Students are required to write out their solutions on paper and turn them in during their discussion section.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-zhv
koofers-user-zhv 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMSC250, Spring 2004 Homework 6
Due Wednesday, March 10 at the beginning of your discussion section.
You must write the solutions to the problems single-sided on your own lined
paper, with all sheets stapled together, and with all answers written in sequential
order or you will lose points.
1. Let p1, p2, . . . , pnbe distinct prime numbers such that p1= 2 and n > 1, and let
a=p1p2···pn. Prove that a42.
Hint: Use the quotient-remainder theorem, and eliminate the other possibilities.
2. An integer is called squarefree if it is not divisible by the square of any prime number.
What can you deduce about the standard factored form of a squarefree number?
Hint: Examine the exponents.
3. Prove that any integer a > 1 can be written as either a perfect square, a squarefree
integer, or the product of a squarefree integer and a perfect square.
Hint: Break this into the three cases. Two of them should be easy. For the third case,
write aas (pe1
1pe2
2···pen
n) (qd1
1qd2
2···qdm
m) where all the ei’s are even and all the dj’s are
odd.
4. Prove that for all real numbers x,x1<bxc x.
5. Write the first four terms of each of the following sequences:
(a) j > 1, sj=j(j1)
(b) n0, rn=n
n!
6. Reduce each of the following expressions to a single numeric value:
(a)
4
X
i=1
1
i2+i
(b)
10
Y
h=0
h
h! + h+ 1
(c)
3
X
m=1 m
Y
n=1
m
n!
7. Write each of the following using sum and/or product notation:
(a) n+ 0 n1 + n+ 2 n3 + n+ 4
(b) 5(1) + 2(1 + 2) + 3(1+2+3)+2(1+2+3+4)+1(1+2+3+4+5)
1

Partial preview of the text

Download CMSC250 Spring 2004 Homework 6: Problems in Number Theory and more Assignments Discrete Structures and Graph Theory in PDF only on Docsity!

CMSC250, Spring 2004 Homework 6

Due Wednesday, March 10 at the beginning of your discussion section.

You must write the solutions to the problems single-sided on your own lined paper, with all sheets stapled together, and with all answers written in sequential order or you will lose points.

  1. Let p 1 , p 2 ,... , pn be distinct prime numbers such that p 1 = 2 and n > 1, and let a = p 1 p 2 · · · pn. Prove that a ≡ 4 2. Hint: Use the quotient-remainder theorem, and eliminate the other possibilities.
  2. An integer is called squarefree if it is not divisible by the square of any prime number. What can you deduce about the standard factored form of a squarefree number? Hint: Examine the exponents.
  3. Prove that any integer a > 1 can be written as either a perfect square, a squarefree integer, or the product of a squarefree integer and a perfect square. Hint: Break this into the three cases. Two of them should be easy. For the third case, write a as (pe 11 pe 22 · · · pe nn ) (qd 11 q 2 d 2 · · · qd mm ) where all the ei’s are even and all the dj ’s are odd.
  4. Prove that for all real numbers x, x − 1 < bxc ≤ x.
  5. Write the first four terms of each of the following sequences: (a) ∀j > 1 , sj = j(j − 1) (b) ∀n ≥ 0 , rn = (^) nn!
  6. Reduce each of the following expressions to a single numeric value: (a)

∑^4

i=

i^2 + i (b)

∏^10

h=

h h! + h + 1 (c)

∑^3

m=

( (^) ∏m n=

m n

  1. Write each of the following using sum and/or product notation: (a) n + 0 − n − 1 + n + 2 − n − 3 + n + 4 (b) √5(1) + 2(1 + 2) + √3(1 + 2 + 3) + √2(1 + 2 + 3 + 4) + 1(1 + 2 + 3 + 4 + 5)

1