Scribd
Upload
2 views

Assignment 3 Question

This document outlines Assignment No. 3 for the CSC102 Discrete Structures course at COMSATS University, Islamabad, focusing on methods of proof. It includes instructions for students on how to approach the assignment, which consists of various proof-related questions worth a total of 10 marks. The assignment is due on May 20, 2025, with a final deadline of May 23, 2025, and emphasizes the importance of original work.

Uploaded by

furqanjee.softengr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Assignment 3 Question

This document outlines Assignment No. 3 for the CSC102 Discrete Structures course at COMSATS University, Islamabad, focusing on methods of proof. It includes instructions for students on how to approach the assignment, which consists of various proof-related questions worth a total of 10 marks. The assignment is due on May 20, 2025, with a final deadline of May 23, 2025, and emphasizes the importance of original work.

Uploaded by

furqanjee.softengr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

COMSATS University, Islamabad

Islamabad Campus
Department of Computer Science

Read before Attempt


CLO 3: Solve a computing problem using a specific set, function, or relation
model. and
CLO 4: Use recurrence relation and counting formalisms to solve real-world
problems.
Assignment No. 3: Methods of Proof
Course code and Title: CSC102, DISCRETE STRUCTURES
Instructor: Dr.Quratulain Alam
Assigned Date: 16-5-2025 Due Date: 20-5-2025
Total Marks: 10
Instructions:
1. Try to get the concepts, consolidate your concepts and ideas from these questions
2. You should concern recommended books for clarify your concepts as handouts are not
sufficient.
3. Try to make solution by yourself and protect your work from other students. If I found
the solution files of some students are same then I will reward zero marks to all those
students.
4. Deadline for this assignment is 23-5-2025. This deadline will not be extended.

Spring2025 Page 1
Question # 1 5 marks
i. Using the definitions of even integer and odd integer, give a direct proof that this statement is true for
all integers n: If n is odd, then 5n + 3 is even.
ii. Using the definitions of even integer and odd integer, give a proof by contraposition that this
statement is true for all integers n: If 3n − 5 is even, then n is odd.
iii. Prove that following given statement is true for all integers n, using the definitions of even integer and
odd integer: If 7n − 5 is odd, then n is even.
iv. Suppose a, b, and c are odd integers. Prove that the roots of ax2 + bx + c = 0 are not rational.
v. Give a proof by contradiction of: “If n is an even integer, then 3n + 7 is odd.”
vi. Prove that this statement is true for all integers n: n is odd if and only if 5n + 3 is even.
vii. Show that the statement “Every integer is less than its cube” is false by finding a counterexample.
viii. Prove that there is only one pair of positive integers that is a solution to 3x2 + 2y2 = 30.
ix. Prove that the square of every even integer ends in 0, 4, or 6.
x. Prove that the following is true for all real numbers x and y: max(x, y) = 1/2 (x + y + |x − y|).
xi. Prove that the square of every odd integer ends in 1, 5, or 9.
xii. Prove that there are numbers x and y whose sum is 5 and whose product is 2. (Note that we are
only required to show that x and y exist; we are not required to find specific values for x and y.)
xiii. Show that if x is a nonzero rational number, then there is a unique rational number y such that xy = 2.
xiv. Prove that the square of every odd integer has the form 8k + 1, where k is an integer.
xv. Suppose a and b are integers such that 2a = b2 + 3. Prove that a is the sum of three squares.
xvi. Prove or disprove the following conjecture: For all real numbers x, x2 > x.
xvii. Prove or disprove the statement “The square of every integer ends in 0, 1, 4, 5, or 9.”
xviii. Prove or disprove the statement “There is a number x such that x > x + 2.”
xix. Suppose that a, b, c are real numbers and each is less than the sum of the other two. Prove that all three
numbers are positive.
xx. Suppose N is the sum of squares of two integers. Prove that 2N is also the sum of squares of
two integers.
xxi. Suppose n > 1 is not prime. (A prime number is a positive integer greater than 1 that has no
positive integer divisors other than 1 and itself.) Are there positive integers x, y, and z such that
n = xy+yz+zx+1?
Question # 2 5 marks
i. Use mathematical induction to prove that
n1
 i1
i2i  n  2n2  2, for all integers n  0
ii. Use mathematical induction to prove that
 1   1   1  n 1 for all integers n 2
1  1 1 
 2   2   2 
 2   3   n  2n
iii. Prove by mathematical induction
n
 i1
i(i!)  (n 1)!1
for all integers n1
iv. Use mathematical induction to prove the generalization of the following De Morgan’s Law:
n
Aj n
Aj
j1 j1

where A1, A2, …, An are subsets of a universal set U and n2.

Spring2025 Page 2
v. Use mathematical induction to prove that n3 - n is divisible by 3 whenever n is a positive integer.

vi. Use mathematical induction to prove that for all integers n1, 22n-1 is divisible by 3.

vii. Use mathematical induction to show that the product of any two consecutive positive integers
is divisible by 2.

viii. Prove by mathematical induction n3 - n is divisible by 6, for each integer n  2.

ix. Prove by mathematical induction. For any integer n  1, xn - yn is divisible by x - y, where x and y
are any two integers with x  y.

x. Use mathematical induction to prove that for all integers n 


3. 2n + 1 < 2n

xi. Show by mathematical induction


1 + n x  (1+x)n for all real numbers x > - 1 and integers n  2

xii. Define a sequence a1, a2,a3, … as follows:


a1 = 2
ak = 5ak-1 for all integers k  2.........................(1)
Use mathematical induction to show that the terms of the sequence satisfy the
formula. an = 2·5n-1 for all integers n  1
xiii. A sequence d1, d2, d3, … is defined by letting d1 = 2 and
2
for all integers k  2. Show that d  for all integers n  1, using mathematical induction.
n
n!
xiv. Prove by mathematical induction that
1 1 1 1
1     2 
4 9 n2 n
Whenever n is a positive integer greater than 1.

Spring2025 Page 3

You might also like