Scribd
Upload
6 views1 page

DMS Tutorial Sheet 5

The document outlines a B.Tech core course on Discrete Mathematical Structures for the School of Computer Science Engineering and Technology, scheduled for the even semester of 2025. It includes course objectives focused on methods of proofs and mathematical induction, along with a set of questions for students to demonstrate their understanding of these concepts. The questions require proofs using various methods including mathematical induction, direct proof, and indirect proof.

Uploaded by

Siva Sai
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
6 views1 page

DMS Tutorial Sheet 5

The document outlines a B.Tech core course on Discrete Mathematical Structures for the School of Computer Science Engineering and Technology, scheduled for the even semester of 2025. It includes course objectives focused on methods of proofs and mathematical induction, along with a set of questions for students to demonstrate their understanding of these concepts. The questions require proofs using various methods including mathematical induction, direct proof, and indirect proof.

Uploaded by

Siva Sai
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

School of Computer Science Engineering and Technology

Course-B.Tech Type- Core


Course Code- CSET106 Course Name- Discrete Mathematical Structures

Year- 2025 Semester- Even


Date- 17/02/2025 Batch- 2024-2028

CO-Mapping
Q1 Q2 Q3 Q4 Q5 Q6 Q7
CO1       
CO2    
CO3

Objectives
1. Students will be able to learn the methods of proofs.
2. Students will be able to learn about mathematical induction.

Questions:

1. By using Principle of Mathematical Induction, show that n3+2n is divisible by 3 for all positive
integers.

2. By using Principle of Mathematical Induction, show that 8n-3n is divisible by 5 for all positive
integers.

3. By using Principle of Mathematical Induction, for all positive integers show that

( )(2 )
12 + 22 + 32 + ⋯ + 𝑛2 = .

4. Show that 2 > 𝑛3 𝑓𝑜𝑟 𝑛 ≥ 10.

5. Using method of direct proof show that for all positive integers if n is even then n2 is even.

6. Using method of direct proof show that difference of square of two consecutive integers is an
odd integer.

7. Using indirect proof show that 3n+2 is odd, then n is odd.

8. Prove that 21/2 is irrational.

You might also like