32 views

Uploaded by Ilya Volodarsky

Attribution Non-Commercial (BY-NC)

- Data Sufficiency Part - 2
- Mathematics - 9.1
- Mathematics Class IX
- Sbp Junior Officer Og 1 Sample Test and Areas
- WEEK1
- Problems 28 2
- Chapter 1 - Number System 2012-10-06
- 16
- Practice
- Chapter 01 Surds.pdf
- lesson 1-3 prof
- mat120cegkernsspring2019
- year 6 t1 unit1 mathematics term
- binomail theorem notes maths.pdf
- Chapter 1 - Number System
- Gr8 Vocab Cards
- Integer Math
- Mcq
- Data Sufficicent 56786
- ISPROG1 Loops Exam Practice Set1

You are on page 1of 3

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

Problem Set 1

Due: September 18

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.

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)

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

Your name:

Submission date:

Richard Steven Tom

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

Problem Score

1

2

3

4

5

Total

1

People other than course staff.

2

Give citations to texts and material other than the Fall ’09 course materials.

- Data Sufficiency Part - 2Uploaded bydharmsmart19
- Mathematics - 9.1Uploaded byKireeti Mara
- Mathematics Class IXUploaded byKulachi Hansraj Model School
- Sbp Junior Officer Og 1 Sample Test and AreasUploaded byIrfan Baloch
- WEEK1Uploaded byTristan Ryan Gagni Tingson
- Problems 28 2Uploaded byErin Sylvia
- Chapter 1 - Number System 2012-10-06Uploaded byTonto007
- 16Uploaded byPraveen Kumar
- PracticeUploaded byEddy R. Vélez
- Chapter 01 Surds.pdfUploaded byHelloPirr
- lesson 1-3 profUploaded byapi-397066792
- mat120cegkernsspring2019Uploaded byapi-238365771
- year 6 t1 unit1 mathematics termUploaded byapi-267136654
- binomail theorem notes maths.pdfUploaded byKapil Gupta
- Chapter 1 - Number SystemUploaded bySavita Shukla
- Gr8 Vocab CardsUploaded byTấn Phát Trần
- Integer MathUploaded byapi-3812198
- McqUploaded byXyz
- Data Sufficicent 56786Uploaded byCindy Lee
- ISPROG1 Loops Exam Practice Set1Uploaded bySandra Borja
- Chapter-1Uploaded byKarthiik88
- 2013-2014 math 9 year plans webUploaded byapi-171445363
- Grade7-318240-11-9506Uploaded byAnimesh
- w4_5Uploaded byMarian Celeste
- Grid-ins No KeyUploaded bygeeeum24
- PadeTalkUploaded byTopology2
- PROGRAMMING_ASSIGNMENT_ONE.pdfUploaded byAaron Goldsmith
- Pgmath2018 SolutionsUploaded byChoudharyAk roj
- copro1probUploaded byAiza Sanchez
- Latex Guiamoy Real AnalysisUploaded byRudolf Guiamoy

- A SHORT DISCUSSION ON THE PARADOX.pdfUploaded byfoterovega
- Godel & Penrose-Yesterday's AlgorithmUploaded byGrigorie Gheorghe
- IGNOU - B.Sc. - MTE01 : CalculusUploaded byephunt
- Summation of Series SummaryUploaded byyslnju
- STLD Question BankUploaded bySatish Bojjawar
- book1.pdfUploaded byeulaliaurora
- Origins of Boolean Algebra in the Logic of Classes - John Venn and C S Pierce 22-5-2011Uploaded byJargons Nether En
- Fundamentos de Circuitos Elc3a9ctricos 3edi SadikuUploaded byNatsolar Ingenieria
- Enlish Statement ExampleUploaded byFrancis Gutierrez Balazon
- Directed Graphs, Boolean Matrices,And RelationsUploaded byamb03
- 02 - Graphs of Polynomial FunctionsUploaded byKristine Henson
- 0 PrelimUploaded byKalai Vani
- Real Analysis Lecture NotesUploaded byMohd Zafar
- Tomek Bartoszynski, Haim Judah and Saharon Shelah- The Cichon DiagramUploaded byHutsDM
- Preprint Sultanow Volkov CoxUploaded byEldar Sultanow
- chap2.pdfUploaded bysanmitraz
- Intro MeasuretheoryUploaded bybmandar
- The Impact of the Incompleteness Theorems on Mathematics Feferman, Solomon -Uploaded bycx5caf
- Msci603 f2018 6 IntroipUploaded byMridul Gupta
- C++Training 4Uploaded byParvinder Singh
- M2.doneUploaded bysubhan ullah
- Qb Cs2303 Toc Ut1Uploaded byMaalavica Ramakrishnan
- Aaby, Proof Methods in Logic [16 pgs]Uploaded bygzalzalkovia
- artificial intelligence_ch9_logic1bUploaded byupender_kalwa
- page_6599737Uploaded byRobin Celis
- BCK-Algebras Blok RafteryUploaded byFernando Ramos
- alorithm basicsUploaded byankit pandey
- Ai Alife HowtoUploaded by4U6ogj8b9snylkslkn3n
- LectureNotes237.pdfUploaded byhjfdjfda
- Barnes-The Law of ContradictionUploaded byOscar Leandro González Ruiz