Example of Induction (Advanced): Balanced Strings 
Example of Induction (Advanced): Balanced Strings
by Robert Donley
Video Lecture 6 of 17
Not yet rated
Views: 745
Date Added: March 9, 2015

Lecture Description

Math Major Basics: Using complete induction, we show that, for balanced strings, the number of left parentheses equals the number of right parentheses. A balanced string is a finite sequence of (s and )s constructed recursively.

Course Index

Course Description

Math Doctor Bob provides a brief course on logic, proofs, sets, and the integers. Intended as a prerequisite playlist for Abstract Algebra and Real Analysis courses.


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)