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

# Please Edit this .txt page with Answers

#Email  ShaloshBEkhad@gmail.com 
#Subject: p2
#with an attachment called
#p2FirstLast.txt
#(e.g. p2DoronZeilberger.txt)

#Right after finishing watching the Second lecture but no later than Friday, Sept. 11, 2020, 8:00pm




Q1. THE FIRST ATTENDANCE QUESTION WAS: 
	#Let a:= FIRST DIGIT of your RUID 
	#Let b:= SECOND DIGIT of your RUID
	#Let c:= FIFTH DIGIT of your RUID
	#Let d:= SIX DIGIT of your RUID
	# How many walks in Manhattan are there (not using bdway) from the corner of min(a,b) St and min(c,d) Ave 
										  to max(a,b) St and max(c,d) Ave walking in the positive direction. 

A1. MY ANSWER TO THE FIRST ATTENDANCE QUESTION IS:
	#RUID: 193002246
	#a:=1
	#b:=9
	#c:=0
	#d:=2
	#Corner of 1st St and 0 Ave to 9th St and 2nd Ave
	
	#This question turns into the number of walks going from [1,0] to [9,2]. This becomes (9-1 + 2-0) Choose (9-1) = 10 Choose 8 = 45 ways. 


Q2. THE  SECOND ATTENDANCE QUESTION WAS:
	#Consider your RUID as a word of LENGTH 9 in the 10-letter "alphabet" {0,1,2,3,4,5,6,7,8,9}. How many ways to rearrange your RUID?  

A2. MY ANSWER TO THE  SECOND ATTENDANCE QUESTION IS:
	#RUID: 193002246
	#There are 2 pairs of repeats (2 0's and 2 2's), so the answer is 9!/(2! * 2!) = 90,720 ways to rearrange.