Answered step by step
Verified Expert Solution
Question
1 Approved Answer
MATH/EECS 1028: Discrete Math for Engineers Winter 2015 Assignment 3 (Released March 29, 2017) Submission deadline: 5:00 pm, April 5, 2017 Notes: 1. The assignment
MATH/EECS 1028: Discrete Math for Engineers Winter 2015 Assignment 3 (Released March 29, 2017) Submission deadline: 5:00 pm, April 5, 2017 Notes: 1. The assignment can be handwritten or typed. It MUST be legible. 2. You must do this assignment individually. 3. Submit this assignment only if you have read and understood the policy on academic honesty on the course web page. If you have questions or concerns, please contact the instructor. 4. Use the dropbox near the EECS main office to submit your assignments, OR submit your assignment in the first TEN minutes of class on the day of the deadline. No late submissions will be accepted. Please do not send files by email. 5. Your answers should be precise and concise. Points may be deducted for long, rambling arguments. 6. Assume R to denote the real numbers, Z to denote the set of integers (. . . , 2, 1, 0, 1, 2, . . .) and N to denote the natural numbers (1, 2, 3, . . .). Question 1 [5 points] Find the coefficient of x4 in the expansion of (1 + 2x + 3x3 )10 ? Question 2 [5 points] In how many ways can we seat 8 men and 3 women on a row of seats so that no two women sit next to each other? Question 3 [5 points] Prove the following statement first by using formulas and second by using a counting argument. (Thus you will write two different proofs for the statements). \u0012 \u0013\u0012 \u0013 \u0012 \u0013\u0012 \u0013 n nk n nj = . k j j k Question 4 [5 points] Prove that among any 54 integers 1 x1 < x2 < x3 < < x54 100, there is a pair with difference 12. 1
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started