Eshaan Gandhi

Number of attendance problems -

Attendance problem 1 - 
(i) What is teh 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

Answer:
i)describes the "collaborative distance" between mathematician Paul Erdős and another person

ii)describles the degrees of serperation between actor kevin bacon and another person

iii) Erdős–Bacon number is the sum of one's Erdős number—which measures the "collaborative distance" in authoring academic papers between that person and Hungarian mathematician Paul Erdős—and one's Bacon number

iv) 5
Attendance problem 2:
Answer:

What does it mean for a problem in CS to be NP hard
In computational complexity theory, NP-hardness (non-deterministic polynomial-time hardness) is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". A simple example of an NP-hard problem is the subset sum problem.

Attendance problem 3:
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

[{2, 3}, {3, 4}, {5, 6}, {6, 1}, {1, 2}]


Attendance problem 4
Using ComboProject1.txt Find the first 7 terms of the follwoing sequences the number of 3xn kinds tours n =1..10

In other words use SAW with KiG

seq(SAWnu(KiG(3, n)), n=1..8)
            0, 8, 32, 240, 1488, 9844, 63808, 416236
My computer started crying at n = 9