Given an example of a tree of order 6 containing four vertices of degree 1 and two vertices of degree 3.
Show that every cyclic graph of order ‘n’ is isomorphic to the group < Zn , + n > .
#Mathematics
if a function g(x) satisfies the functional equation g(x+y)=g(x)+g(y), x,y>0 and is bounded in the interval 0 to 1 prove by reductio ad absurdum that g(x)=g(1)•x
13.Solve the recurrence relation using generating function , an-9an-1+20an-2=0 for n greater than or equals to 2 with initial values a0=-3, a1=-10.
12. Solve the recurrence relation an=an-1+n2,where a0=7 by substitution
11. For arbitrary constants c1,c2, And c3 show that an=c12n+c25n+c3n5n satisfies the recurrence relations an-12an-1+45an-2-50an-3=0
8. Find a generating function for the sequence (a0, a1,....ar.....), where ar=the number of non negative integral solutions to e1+e2 +....en=r where 0 less than or equal to e1 less than or equal to 1 for each i=1,2,3,.....n
What is the truth value of Ex P(×),where P(×) is the statement "x² >12" and the universe of discourse consists of the negative integers not exceeding 4?
What is the domain of the function is this proposition?