tedge %2087pdf 5. Let B- (0, 1) The following is a recursive definition for B of
ID: 3731514 • Letter: T
Question
tedge %2087pdf 5. Let B- (0, 1) The following is a recursive definition for B of the set of all binary strings of length 0 or larger. Recall that A is the symbol for the empty string that has no characters a is in B" ii If x C Bthen x0 and x1 are also in B Give a recursive definition for the set S, which consists of all binary strings for which all the 0's come before all the 1's. Eg, 001111 is a member of S, but 0010111 is not in S 6. Suppose someone takes out a home improvement loan for $30,000. The annual interest on the loan is 6% compounded monthly The monthly payment is S600 Let at denote the amount owed at the end of the nth month. The payments start the first month and are due the last day of every month a. Give a recurrence relation for a. Don't forget the basis (also called the intial conditions) b Suppose the borrower would like a lower monthly payment. How large does the monthly payment need to be to ensure that the amount owed decreases every month?Explanation / Answer
5) Lambda is the element of S
0 is the element of S
1 is the element of S
if x is an element of S then 0x and x1 are also element of S.
6) a0 = 30000
an = an-1 + (106/100)*an-1 - 600
Note : I donot have strong hold on compound interest and so the relation above may not be completely correct. However it would be on similar lines.
b) Amount owned would decrease every month if an < an-1. You can solve the inequality to get the answer
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.