#Please do not post homework
#Ravali Bommanaboina, 12/13/20, Assignment 25

#Question 1
# * * * * * * * * *
# * * * * * *
# * * * * *
# * * *
# *
# *
# *

#Question 2
#36T67348502
#Question 3
#[[6, 4, 2, 2, 2, 2, 2], 0]
#Question 4
#36167251325636293988820471890953695495016030339315650422081868605887952568754066420592310556052906916435144
#We are able to get this answer quickly because we use Euler's recurrence.
#Question 5
pnFastMod:=proc(n,m) :
RETURN(pnFast(n) mod m):
end:
#Question 6
#Question 7