#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:

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

Question 1
How many connected graphs are there with 30 vertices and 50 edges

Answer 1
616531513027177775473601317524937092680978914590598004251998471840
We use the WtEdConGclever(30, a)

Question 2
Find NuKcomp to find the number of labeled connected graph with 50 vertices with 5 components

Answer 2
NuKcomp(50, 5)[50]
8478898769087132221372075981319343772340049898599778271771883957\

  75305784916394110747990275055299781322568818279009002885758853\

  48212857384767830040557053247256490676318714477784265805319979\

  12754588338757770602066132091766888900020551743577913219185207\

  70044264772718553756381630036749487602537274670704109302833374\

  82240

Big number

Question 3
How many labelled connected graphs are there with 30 vertices and 50 edges?

Answer 3
616531513027177775473601317524937092680978914590598004251998471840
We use the WtEdConGclever(30, a)

Question 4
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 4
i = 2 A323875
i = 3 A323876
i = 4 A323877
i = 5 dneW