#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 Q. #1 for LECTURE 15 #What is the erdos number? What is the bacon number? What is the erdos-bacon number? What is the erdos-bacon number of dr z #ANSWER to Q. #1: # i) the number of "hops" needed to connect the author of a paper with Paul Erdos, ("collaborative distance") as measured # by authorship of mathematical papers # ii) the number of degrees of separation an actor/actress has from Kevin Bacon # iii) the sum of one's Erdos number plus one's Bacon number # iv) Dr. Z's erdos-bacon number is 5 #ATTENDANCE Q. #2 for LECTURE 15 #What does it mean for a problem in cs to be np-hard? #ANSWER to Q. #2: #(Wikipedia) NP-hardness is "the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP"", where NP is non-deterministic polynomial time, where NP=product(NTime(n^k), k in Natural Nums), and NTime(n^k) is the set of decision problems that can be solved by a non-deterministic Turing machine in O(n^k) time. #ATTENDANCE Q. #3 for LECTURE 15 #Cook up a graph with 6 vertices called 1,2,3,4,5,6 with 12 edges that you know for sure has a hamiltonian cycle #ANSWER to Q. #3: #G:= [{2,3,4,5,6}, {1,3,4}, {1,2,4,5,6}, {1,2,3,6}, {1,3,6}, {1,3,4,5}] # A hamiltonian cycle here could be [1,2,4,3,5,6,1] #ATTENDANCE Q. #4 for LECTURE 15 #Using ComboProject1.txt find the first 10 terms of the following #the number of 3xn King's tours n=1..10 #In other words, use SAW with KiG #ANSWER to Q. #4: #seq(nops(SAW(KiG(3,n)[1])),n=1..9) = 0, 4, 13, 97, 600, 3977, 25762, 168085, 1094186 #for n=10, it was taking a really, really long time for me