Scribd
Upload
50 views

Discrete Math

This document contains the solutions to 7 questions on discrete mathematics concepts. Question 1 finds the terms f(1), f(2), f(3) of a recursively defined function. Question 2 finds the terms of a sequence defined recursively as n^2. Question 3 provides two different recursive definitions and solves for the terms. The remaining questions provide recursive definitions for various sequences and solve for specific terms.

Uploaded by

Tiny G
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
50 views

Discrete Math

This document contains the solutions to 7 questions on discrete mathematics concepts. Question 1 finds the terms f(1), f(2), f(3) of a recursively defined function. Question 2 finds the terms of a sequence defined recursively as n^2. Question 3 provides two different recursive definitions and solves for the terms. The remaining questions provide recursive definitions for various sequences and solve for specific terms.

Uploaded by

Tiny G
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/ 4

SEATWORK #2 Discrete Structure II

GROUP #1

Question 1.

𝑓(0) = 2, 𝑛 = 0, 1, 2, …
𝑓(𝑛 + 1) = 𝑓(𝑛) + 𝑓(𝑛) + 2
𝐹𝑖𝑛𝑑 𝑓(1), 𝑓(2), 𝑓(3).

Answer

𝑓(0 + 1) = 𝑓(0) + 𝑓(0) + 2 = 𝒇(𝟏) = 2 + 2 + 𝟐 = 6


𝑓(1 + 1) = 𝑓(1) + 𝑓(1) + 2 = 𝒇(𝟐) = 6 + 6 + 𝟐 = 14
𝑓(2 + 1) = 𝑓(2) + 𝑓(2) + 2 = 𝒇(𝟑) = 14 + 14+ 𝟐 = 30

Question 2.

𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒:


an= n2 for n = 1, 2, 3, …
𝑟𝑒𝑐𝑢𝑟𝑠𝑖𝑣𝑒𝑙𝑦. 𝑎1 = 1
Answer
𝒂𝟏 = (1)2 = 𝟏
𝒂𝟏 = (2)2 = 4
𝒂𝟏 = (3)2 = 9
𝒂𝟏 = (4)2 = 16
𝒂𝟏 = (5)2 = 25

Question 3.
Give a recursive algorithm for finding the sum of the n odd positive integers
I. Find 𝑓(2), 𝑓(3), 𝑓(4), 𝑎𝑛𝑑 𝑓(5) if 𝑓 is defined recursively by 𝑓(0) = -1, 𝑓(1) = 2, and 𝑓𝑜𝑟 𝑛 = 1, 2, …
f(0) = -1, f(1) = 2, n=1, 2, …
f(n−1)
1. 𝑓(𝑛 + 1) =
f(n)

Answer
f(0−1) −2
𝑓(0 + 1) = = f(1)= −1 = f(1)= 2
f(0)
f(1−1) −1 1
𝑓(1 + 1) = = f(2)= = f(2)= −
f(1) 2 2
f(2−1) 2
𝑓(2 + 1) = = f(3)= 1 = f(3)= - 4
f(2) −
2
1
f(3−1) − 1
𝑓(3 + 1) = = f(4)= −42 = f(4)=
f(3) 8
f(4−1) −4
𝑓(4 + 1) = = f(5)= 1 = f(5)= -32
f(4)
8

2. 𝑓(𝑛 + 1) = 3𝑓(𝑛)2 - 4𝑓(𝑛 - 1)2

Answer

𝑓(1 + 1) = 3𝑓(1)2 - 4𝑓(1 - 1)2 = 𝒇(2) = (𝟑)(4) - (𝟒)(1) = 12 - 4 = 8


𝑓(2 + 1) = 3𝑓(2)2 - 4𝑓(2 - 1)2 = 𝒇(3) = (𝟑)(64) - (𝟒)(4) = 192 - 16 = 176
𝑓(3 + 1) = 3𝑓(3)2 - 4𝑓(3 - 1)2 = 𝒇(4) = (𝟑)(30,976) - (𝟒)(64) = 92,928 - 256 = 92,672
𝑓(4 + 1) = 3𝑓(4)2 - 4𝑓(4 - 1)2 = 𝒇(5) = (𝟑)( 8,588,099,584) - (𝟒)( 30,976) =
25,764,298,752 - 123,904 = 25,764,174,848

II. Give a recursive definition of the sequence {𝑎𝑛}, 𝑛 = 1, 2, 3, … 𝑖𝑓

3. an = 2n + 1
Answer
an = 2n + 1
a1 = 2(1) + 1 = 3
a2 = 2(2) + 1 = 5
a3 = 2(3) + 1 = 7
a4 = 2(4) + 1 = 9
a4 = 2(5) + 1 = 11
4. an = 5n
Answer
an = 5n
a1 = 5(1) = 5
a2 = 5(2) = 10
a3 = 5(3) = 15
a4 = 5(4) = 20
a4 = 5(5) = 25

5. an = n2
Answer
an = n2
a1 = (1)2 = 1
a2 = (2)2 = 4
a3 = (3)2 = 9
a4 = (4)2 = 16
a4 = (5)2 = 25

6. Find the 𝟔𝒕𝒉 term in this arithmetic sequence {13, 26, 39, …}
Answer
an = a1 + (n - 1)d
𝑎6 = 13 + (6 - 1)(13)
𝒂𝟔 = 𝟕𝟖

7. Find the 𝟓𝒕𝒉 term in this geometric sequence {10, 100, 1000, …}
Answer

an = a1 rn-1
𝑎5 = (10)(10)5-1
𝒂𝟓 = 𝟏𝟎𝟎, 𝟎𝟎𝟎

You might also like