You are not logged in.
Pages: 1
You can now check the link again ... Thank you for everything
Please here are the screenshots of the questions, thanks a lot
https://www.dropbox.com/s/ukmeczmf8r889vb/discreteMaths.JPG
https://www.dropbox.com/s/6qjbadr9fo9i8g6/discreteMaths5.JPG
Thanks a lot bob bundy, bobbym I would very much appreciate if I could attach the assignment because the values and symbols get contorted if I paste it, thanks anyway, thanks gAR wow, I need more questions to practice before my exams, thanks u all, you guys are genius.
Can someone please solve the following questions with detailed explanations for me? we are to discuss it before being taught, thank you.
Question 1
Show by mathematical induction that for all n ≥ 1 , 1+2 +3+
..+n = (n(n+1))/2
Question 2
Evaluate the sum 1^2+2^2+3^2+
..+r^2 by using the generating function 1/((1-z)) =1+z+z^2+z^3+z^4+
z^r+
Question 3
Let A= { a,b,c,d,e } and R be a relation on set A such that M_R is given as :
Mr 10010
01000
00011
10000
01001
Find the transitive value of r using Warshall's theory
Question 4
In finite poset S,show that there is always at least one maximal element and one minimal element.
Question 5
Solve the recurrence equation a_n-a_(n-1)-a_(-2) =2n with a_0=0 and a_1=1
Any help is deeply appreciated
Pages: 1