#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 my RUID 
#Let b:=SECOND DIGIT of my RUID 
#Let c:=FIFTH DIGIT of my RUID 
#Let d:=SIXTH DIGIT of my RUID 

#How many walks in Manhattan are there (not using Broadway)
#From corner of min(a,b) St and min(c,d) Ave
#to corner of max(a,b) St. and max(c,d) Ave
#Walking in the positive direction?

#A1. MY ANSWER TO THE FIRST ATTENDANCE QUESTION IS:
#My RUID is 186000449
#a = 1, b = 8, c = 0, d = 0.
#min(a,b) = 1, min(c,d) = 0
#max(a,b) = 8, max(c,d) = 0
#The number of walks in the positive direction from (1,0) to (8,0) is 1. 



#Q2. THE  SECOND ATTENDANCE QUESTION WAS:

#Consider my RUID as a word of length 9 in the 10-letter "alphabet" {0,1,2,...,9}
#How many ways to rearrange my RUID?


#A2. MY ANSWER TO THE  SECOND ATTENDANCE QUESTION IS:
#My RUID is 186000449
#There are 3 0s, 2 4s, 1 1, 1 6, 1 8, 1 9.
#Using the explicit formula 9! / (3! * 2! * 1! * 1! * 1! * 1!) we get that there are 30240 ways to rearrange my RUID.