#ATTENDANCE QUIZ FOR LECTURE 21 of Dr. Z.'s Math454(02) Rutgers University

# Please Edit this .txt page with Answers

#Email  ShaloshBEkhad@gmail.com 
#Subject: p21
#with an attachment called
#p21FirstLast.txt
#(e.g. p21DoronZeilberger.txt)

#Right after finishing watching the lecture but no later than Nov. 20, 2020, 8:00pm


THE NUMBER OF ATTENDANCE QUESTIONS WERE: 4

PLEASE LIST ALL THE QUESTIONS FOLLOWED, AFTER EACH, BY THE ANSWER




#ATTENDANCE Q. #1 for LECTURE 20
#How many connected graphs are there with 30 vertices and 50 edges? (labeled ?)

#ANSWER to Q. #1:	

# coeff(WtEdConGclever(30,a)[30],a,50) = 616531513027177775473601317524937092680978914590598004251998471840 graphs




#ATTENDANCE Q. #2 for LECTURE 20
#Find the number of labeled graphs with 50 vertices and 5 components

#ANSWER to Q. #2:

# NuKComp(50,5)[50] = 8478898769087132221372075981319343772340049898599778271771883957753057849163941107479902750552997813225688182790090028857588534..
..82128573847678300405570532472564906763187144777842658053199791275458833875777060206613209176688890002055174357791321918520770044264772718553756381630..
..03674948760253727467070410930283337482240





#ATTENDANCE Q. #3 for LECTURE 20
#How many labeled connected graphs are there with 30 vertices and 50 edges?

#ANSWER to Q. #3:

#Same as Q#1? coeff(WtEdConGclever(30,a)[30],a,50) = 616531513027177775473601317524937092680978914590598004251998471840 graphs





#ATTENDANCE Q. #4 for LECTURE 20
#For i=2,3,4,5... find the OEIS A number if it exists of NuKcomp(20,i), what is the smallest i for which it is not in the OEIS?

#ANSWER to Q. #4:

#i = 2 --> A323875
#i = 3 --> A323876
#i = 4 --> A434877
#The smallest i for which it is not in the OEIS appears to be i=5