Back to the 2022 paper
Similar questions
Formal Language & Automata TheoryThe logic of pumping lemma is a good example of (i) pigeon-hole principle (ii) divide-and-conquer technique (iii) recursion (iv) iteration20222mDiscrete MathematicsIf m is the number of objects (pigeons) and n is the number of boxes (pigeonholes), then the function is both one-to-one and onto if (i) m<n (ii) m=n (iii) m>n (iv) none of these20232mDiscrete MathematicsAn odd number of people stand in a yard at mutually distinct distances. At the same time each person throws a pie at their nearest neighbour, hitting this person. Use mathematical induction to show that there is at least one survivor, that is, at least one person who is not hit by a pie.20227mFormal Language & Automata TheoryProve using pumping lemma for regular languages that the language \{ 0^n / n \text{ is a perfect square} \} is not regular.20227m
PreviousProve Bernoulli's inequality that if h > -1, then 1+nh \le (1+h)^n for all non-negative integers n.NextThe sequence 8, 11, 9, 1, 4, 6, 12, 10, 5, 7 contains 10 terms. Note that 10 = 3^2 + 1. There are four strictly increasing subsequences of length four, namely, 1, 4, 6, 12; 1, 4, 6, 7; 1, 4, 6, 10; and 1, 4, 5, 7. There is also a strictly decreasing subsequence of length four, namely, 11, 9, 6, 5.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.