a) i) Give an inductive formula for the sum of the first n odd numbers: 1+3 +5 + .. + 2n -1 Show your induction process. ii) Use the proof by mathematical induction to prove the correctness of your inductive formula in i) above.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Question 1:
a) i) Give an inductive formula for the sum of the first n odd numbers:
1+3 + 5 + .. + 2n -1
Show your induction process.
ii) Use the proof by mathematical induction to prove the correctness of your
inductive formula in i) above.
b) The following C++ program segment computes C = A * B, where A is an "m" by “n"
matrix, B is an “n" by "r" matrix and C is an “m" by “r" matrix.
for (long int i = 0; i< m; i++)
for (long int j = 0; j < r; j++)
long double Sum = 0;
for (long int k = 0; k < n; k++)
Sum = Sum + A[J[K] * B[k][);
CIJN = Sum;
How many times does the code iterate in computing
i) Sum?
ii) The j* column of C, i.e. C[i][j] for a fixed i and j= 1, 2, ,3, .., r?
iii) The complete matrix C?
Transcribed Image Text:Question 1: a) i) Give an inductive formula for the sum of the first n odd numbers: 1+3 + 5 + .. + 2n -1 Show your induction process. ii) Use the proof by mathematical induction to prove the correctness of your inductive formula in i) above. b) The following C++ program segment computes C = A * B, where A is an "m" by “n" matrix, B is an “n" by "r" matrix and C is an “m" by “r" matrix. for (long int i = 0; i< m; i++) for (long int j = 0; j < r; j++) long double Sum = 0; for (long int k = 0; k < n; k++) Sum = Sum + A[J[K] * B[k][); CIJN = Sum; How many times does the code iterate in computing i) Sum? ii) The j* column of C, i.e. C[i][j] for a fixed i and j= 1, 2, ,3, .., r? iii) The complete matrix C?
Expert Solution
Step 1

As per guidelines, Im supposed to answer the first question, so i request you repost the other question as separate question.

 

a) i) Give an inductive formula for the sum of the first n odd numbers: 1 + 3 + 5 + ... + 2n -1, Show your induction process.

ii) Use the proof by mathematical induction to prove the correctness of your inductive formula in i) above.

 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Problems on Dynamic Programming
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education