0% found this document useful (0 votes)
41 views1 page

Birla Institute of Technology and Science, Pilani 1 Sem. 2014-15, Logic in Computer Science (CS F214) Tutorial #4 In-Class Exercise

1. The document provides an in-class exercise and take-home exercise on using mathematical induction to prove various mathematical statements. The in-class exercise asks students to prove two statements: that the sum of the first n odd integers equals n^2, and that a number X is divisible by 3 if and only if its reverse binary representation is also divisible by 3. The take-home exercise provides four additional statements for students to prove using induction.

Uploaded by

AVISHA GUPTA
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
0% found this document useful (0 votes)
41 views1 page

Birla Institute of Technology and Science, Pilani 1 Sem. 2014-15, Logic in Computer Science (CS F214) Tutorial #4 In-Class Exercise

1. The document provides an in-class exercise and take-home exercise on using mathematical induction to prove various mathematical statements. The in-class exercise asks students to prove two statements: that the sum of the first n odd integers equals n^2, and that a number X is divisible by 3 if and only if its reverse binary representation is also divisible by 3. The take-home exercise provides four additional statements for students to prove using induction.

Uploaded by

AVISHA GUPTA
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

Birla Institute of Technology and Science, Pilani

st
1 Sem. 2014-15, Logic in Computer Science (CS F214)
Tutorial #4

In-Class Exercise:
Using mathematical induction, prove the following:

Q1. 1 + 3 + 5 + ...... + r = n2, for all n>0, where r is an odd integer and n is the number of terms in the
sum. [Note: r = 2n-1].

Q2. For any given number X : X is divisible by 3 if and only if r(X) is divisible by 3.

where r(X) is value of the reverse of X treated as a binary string (with no leading zeroes)

e.g. if X is 10 (decimal) i.e. 1010 (binary) then r(X) is 0101 (binary) i.e. 5 (decimal)

e.g. if X is 19 (decimal) i.e. 10011(binary) then r(X) is 11001 (binary) i.e. 25 (decimal)

Take-Home Exercise:
Using mathematical induction, prove the following:

Q1. 102n - 1 is divisible by 11 for all n > 1.

Q2.

Q3. 1.1! + 2.2! + ...... + n.n! = (n+1)! - 1, for n >= 1.

Q4. 2n < n!, for all n >= 4.

You might also like