Scribd
Upload
115 views

Ps 1

This document contains a problem set from a mathematics for computer science course. It includes 5 problems related to topics covered in the first 3 chapters of the course notes, such as proving certain numbers are irrational, showing a polynomial cannot map integers to primes, describing an algorithm to generate truth tables, and proving the equivalence of two propositional formulas. Students are to complete the problems and submit their solutions along with a collaboration statement by the due date of September 18.

Uploaded by

Ilya Volodarsky
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
115 views

Ps 1

This document contains a problem set from a mathematics for computer science course. It includes 5 problems related to topics covered in the first 3 chapters of the course notes, such as proving certain numbers are irrational, showing a polynomial cannot map integers to primes, describing an algorithm to generate truth tables, and proving the equivalence of two propositional formulas. Students are to complete the problems and submit their solutions along with a collaboration statement by the due date of September 18.

Uploaded by

Ilya Volodarsky
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Massachusetts Institute of Technology

6.042J/18.062J, Fall ’09: Mathematics for Computer Science September 11


Prof. Albert R. Meyer revised September 15, 2009, 1097 minutes

Problem Set 1
Due: September 18

Reading: Notes Chapters 1–3.

Problem 1.
A recent class problem proved that the were irrational numbers a, b such that ab was rational. Un-
fortunately, that proof was nonconstructive:√ it didn’t reveal a specific pair, a, b, with this property.
But in fact, it’s easy to do this: let a ::= 2 and b ::= 2 log2 3.
√
We know 2 is irrational, and obviously ab = 3. Finish the proof that this a, b pair works, by
showing that 2 log2 3 is irrational.

Problem 2.
In Chapter 1 of the Class Notes, it took until n = 40 to find a nonnegative integer argument such
that p(n) ::= n2 + n + 41 was not prime. But we could have predicted based on general principles
that no nonconstant polynomial, q(n), with integer coefficients can map each nonnegative integer
into a prime number. Prove it.
Hint: Let c ::= q(0) be the constant term of q. Consider two cases: c is not prime, and c is prime. In
the second case, note that q(cn) is a multiple of c for all n ∈ Z. You may assume the familiar fact
that the magnitude (absolute value) of any nonconstant polynomial, q(n), grows unboundedly as
n grows.

Problem 3.
Describe a simple recursive procedure which, given a positive integer argument, n, produces a
truth table whose rows are all the assignments of truth values to n propositional variables. For
example, for n = 2, the table might look like:

T T
T F
F T
F F

Your description can be in English, or a simple program in some familiar language (say Scheme
or Java), but if you do write a program, be sure to include some sample output.

Creative Commons 2009, Prof. Albert R. Meyer.


2 Problem Set 1

Problem 4.
Prove that the propositional formulas

P OR Q OR R

and
(P AND NOT Q) OR (Q AND NOT R) OR (R AND NOT P ) OR (P AND Q AND R).
are equivalent.

Problem 5.
Use the Well Ordering Principle to prove that

n ≤ 3n/3 (1)

for every nonnegative integer, n.


Hint: Verify (1) for n ≤ 4 by explicit calculation.
Massachusetts Institute of Technology Solutions cover sheet
6.042J/18.062J, Fall ’09: Mathematics for Computer Science September 11
Prof. Albert R. Meyer

Student’s Solutions to Problem Set 1

Your name:

Due date: September 18

Submission date:

Circle your TA/LA: Jodyann Justin Megumi Rajeev


Richard Steven Tom

Collaboration statement: Circle one of the two choices and provide all pertinent info.

1. I worked alone and only with course materials.

2. I collaborated on this assignment with:

got help from:1

and referred to:2

DO NOT WRITE BELOW THIS LINE

Problem Score
1
2
3
4
5
Total

Creative Commons 2009, Prof. Albert R. Meyer.


1
People other than course staff.
2
Give citations to texts and material other than the Fall ’09 course materials.

You might also like