#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


1. What is the erdos number? - the number of steps needed to connect the author of a paper with the mathematician Paul Erdos


What is the bacon number? -  the number of steps or degrees of separation an actor has from Bacon


What is the erdos-bacon number? - the sum of an individual’s Erdos number and Bacon number 


What is the erdos-bacon number of Dr. Z? - 5 


2. What does it mean for a problem in CS to be np-hard? 
An NP-hard problem is at least as hard as every problem in NP, and it might be much harder


3. Cook up a graph with 6 vertices called 1, 2, 3, 4, 5, 6 with 12 edges you know for sure has a Hamiltonian Cycle. 


with(networks): 
G:= octahedron():


4. Using ComboProject1.txt find the first 7 terms of the number of 3xn King’s TOURS n=1..10. In other words use SAW with KiG. 


{[[1, 1], [1, 2], [2, 1], [3, 1], [3, 2], [2, 2], [1, 1]], [[1, 1], [1, 2], [2, 1], [3, 2], [3, 1], [2, 2], [1, 1]], [[1, 1], [1, 2], [2, 2], [3, 1], [3, 2], [2, 1], [1, 1]], [[1, 1], [1, 2], [2, 2], [3, 2], [3, 1], [2, 1], [1, 1]], [[1, 1], [2, 1], [3, 1], [3, 2], [2, 2], [1, 2], [1, 1]], [[1, 1], [2, 1], [3, 2], [3, 1], [2, 2], [1, 2], [1, 1]], [[1, 1], [2, 2], [3, 1], [3, 2], [2, 1], [1, 2], [1, 1]], [[1, 1], [2, 2], [3, 2], [3, 1], [2, 1], [1, 2], [1, 1]]}