Scribd
Upload
41 views1 page

Assignment 03 Proofs

This document contains instructions for a discrete structures assignment with 5 problems. Problem 1 involves direct proofs of statements about integers and primes. Problem 2 involves finding counterexamples to disprove claims. Problem 3 involves proofs by contraposition. Problem 4 involves proofs involving divisibility. Challenge 5 involves advanced proofs, including showing the equivalence of statements about integers and proving a claim about days of the week.

Uploaded by

Anonymous C4grPf
Copyright
© © All Rights Reserved
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
41 views1 page

Assignment 03 Proofs

This document contains instructions for a discrete structures assignment with 5 problems. Problem 1 involves direct proofs of statements about integers and primes. Problem 2 involves finding counterexamples to disprove claims. Problem 3 involves proofs by contraposition. Problem 4 involves proofs involving divisibility. Challenge 5 involves advanced proofs, including showing the equivalence of statements about integers and proving a claim about days of the week.

Uploaded by

Anonymous C4grPf
Copyright
© © All Rights Reserved
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/ 1

Discrete Structures – Fall 2018 Assignment-03 Due: Friday, 9​th​ November

Problem 1  
Give a direct proof of the following:  
a) For any integer n , n2 + 3n + 2 is not a prime.
b) If k is an odd integer and m is even, then k 2 + m2 is odd.
c) Any product of four consecutive integers is one less than a perfect square.(Hint: Take four consecutive 
integers as m, m + 1, m + 2, m + 3 )
d) n2 − n + 3 is odd. Try case by case analysis.  
 

Problem 2  
Give counter-examples of the following claims to dis-prove these: 
a) For all integers n , n2 − n + 11 is a prime number. 
n
b) For any integer n > 1 , 2 − 1 is prime. 
p
c) For all prime numbers p , 2 − 1 is prime number. (​Such prime numbers are called Mersenne primes​)  
 
 

Problem 3  
Prove the following using contraposition: 
a) If x and y are both odd, then x + y is even. (​Be careful:​ ​You are asked to prove by Contraposition, although 
Direct Proof is easier.​) 
b) If r is irrational, then √r is irrational. 
c) If n2 is a multiple of 3, then n is a multiple of 3. 
 

Problem 4   
Prove the following:  
a) If a|b , and a|c , then a|(b − c) , and a|(2b − 3c) . N
​ ote: a​ |b means a divides b completely, b=a.q where q is an integer, called 
quotient.  
b) How many zeros are there at the end of 458 · 885 ?   
c) If today is Tuesday, what day will it be after 1000 days? 
d) Show that n2 + 5 is not divisible by 4. 
e) Square of any odd integer has the form 8m + 1 . 
 
 

CHALLENGE 5  
Show the following:  
a) Prove that these four statements about the integer n are equivalent: (i) n​2​ is odd, (ii) 1 − n is even, (iii) n​3​ is 
odd, (iv) n​2​ + 1 is even. 
b) Show that at least ten of any 64 days chosen must fall on the same day of the week. 
c) Think of an 8x8 chess-board or checker-board, as given below. We remove the upper right and lower left 
corners of the checkerboard. Can we cover the modified Checker-board with dominoes? W ​ hy or why not? 
(​Dominoes are tiles of size 1x2 or 2x1 as shown below​) 

 
 

You might also like