The document contains 10 questions covering topics in discrete mathematics including:
1) Stating counting principles like the product rule and sum rule
2) Proving that the sum of the first n natural numbers is n(n+1)/2 using mathematical induction
3) Proving that the square root of 5 is irrational
4) Finding the dual of a Boolean expression
5) Identifying the three types of quantifiers
6) Calculating the total number of possible projects a student can choose from across multiple lists
The document contains 10 questions covering topics in discrete mathematics including:
1) Stating counting principles like the product rule and sum rule
2) Proving that the sum of the first n natural numbers is n(n+1)/2 using mathematical induction
3) Proving that the square root of 5 is irrational
4) Finding the dual of a Boolean expression
5) Identifying the three types of quantifiers
6) Calculating the total number of possible projects a student can choose from across multiple lists
The document contains 10 questions covering topics in discrete mathematics including:
1) Stating counting principles like the product rule and sum rule
2) Proving that the sum of the first n natural numbers is n(n+1)/2 using mathematical induction
3) Proving that the square root of 5 is irrational
4) Finding the dual of a Boolean expression
5) Identifying the three types of quantifiers
6) Calculating the total number of possible projects a student can choose from across multiple lists
a) State the product rule and sum rule of counting principles n(n + 1) b) Show that the sum of the first n natural number is by mathematical induction 2 c) Prove that 5 is irrational d) Find the dual of the Boolean expression 𝑥𝑧̅ + 𝑥. 0 + 𝑥̅ . 1 e) What are the 3 types of quantifiers? f) A student can choose a computer project from one of three lists. The three lists contain 23 , 15 and 19 possible projects respectively. How many possible projects are there to choose from? g) Find the formula for sum of the first n − even positive integers h) Find the bitwise OR, bitwise AND and bitwise XOR of the bit strings 0110110110 and 1100011101 i) Use a table to express the values of the Boolean function 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦̅ + (𝑥𝑦𝑧 ̅̅̅̅̅) j) Differentiate between recurrence and recursion.
Nonlinear Functional Analysis and Applications: Proceedings of an Advanced Seminar Conducted by the Mathematics Research Center, the University of Wisconsin, Madison, October 12-14, 1970