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

# Please Edit this .txt page with Answers

#Email  ShaloshBEkhad@gmail.com 
#Subject: p15
#with an attachment called
#p15FirstLast.txt
#(e.g. p15DoronZeilberger.txt)

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


THE NUMBER OF ATTENDANCE QUESTIONS WERE: 4

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

-----------------------------------
Attendance Question 1:
i) What is Erdos Number?
ii) What is the Bacon Number?
iii) What is the Erdos-Bacon Number?
iv) What is the Erdos-Bacon Number of Dr. Z?

i) A person's Erdos number describes the collaborative distance between Erdos and that person i.e it counts the number of collaborators on mathematical publications that the person has to go through to reach Erdos.

ii) The Bacon number counts the number of acquaintance links/degrees of spearation from a person to the actor Kevin Bacon. These links are usually required to be two actors appearing on a film together.

iii) The Erdos-Bacon number is simply the sum of a person's Erdos number and a person's Bacon number.

iv) The Erdos-Bacon Number of Dr. Z is 5.


-----------------------------------
Attendance Question 2:
What does it mean for a problem in CS to be NP-Hard?

A problem in CS is considered to be NP-Hard when an algorithm for solving the problem can be translated into one for solving any NP (nondeterministic polynomial time) problem.

-----------------------------------
Attendance Question 3:
Cook-up a graph with 6 vertices called 1,2,3,4,5,6 with 12 undirected edges that you know for sure has a Hamiltonian cycle?

G := [{2,3,5,6}, {1,3,4,6}, {1,2,4,5}, {2,3,5,6}, {1,3,4,6}, {1,2,4,5}]
There is definitely a Hamiltonian cycle in this graph since [1,2,3,4,5,6,1] is a Hamiltonian cycle.


-----------------------------------
Attendance Question 4:
Using ComboProject1.txt, find the first 10 terms of the following sequence:
The number of 3xn King's Tours n = 1..10
In other words, use SAW with KiG.

I used SAWnu(KiG(3,n)[1]) for n = 1..10
n = 9 took very long to compute and n = 10 was taking more than an hour so I did not find the corresponding term.
[0,4,13,97,600,3977,25762,168085,1094186,????]