MAD 2104 Midterm: MAD 2104 FIU Exam 412k

16 views2 pages
15 Feb 2019
School
Course
Professor

Document Summary

The set of all nite bit strings is countable. If s t the domain of f , then f (s t ) = f (s) f (t ). For all sets, a l b = (a \ b) (b \ a). Then prove your conjecture by induction: prove that 12 + 32 + . + (2n + 1)2 = (n + 1)(2n + 1)(2n + 3)/3 for every nonnegative integer n. Remarks and answers: the average was about the same as for quizzes 2 and 3. The two highest grades were 103 and 105 ! I have estimated your semester grade, based on your best 3 out of 4 quiz scores, and noted it on the upper right corner of your quiz. This method assumes you have already had your lowest grade, which may not be correct. Also, i have not yet included your hw grades.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers

Related Documents

Related Questions