> #Project Choice Form for  Dr. Z.'s Math454(02) Rutgers University
> # Please Edit this .txt page with Answers
> 
> #Email  ShaloshBEkhad@gmail.com 
> #Subject: Project Choice
> #with an attachment called
> #ProjectChoiceFirstLast.txt
> #(e.g. ProjectChoiceDoronZeilberger.txt)
> #No later than Nov. 1, 2020, 8:00pm
> 
> #NOTE: FIRST COME, FIRST SERVED. LIMIT OF FOUR PER PROJECT (INCLUDING THE LEADER)
> 
> #NAME:
> 
> #My Choice of Projects  are as follows
> 
> #First Choice:                  I am willing to be Project Leader: Yes/No
> 
> #Second Choice:                 I am willing to be Project Leader: Yes/No
> 
> #Third Choice:                  I am willing to be Project Leader: Yes/No
;
> 
;
> 
;
> 
;
> #NAME: Weiji Zheng
;
> ##My Choice of Projects  are as follows
;
> #FIRST CHOICE: ComboProject1.txt          I am willing to be Project Leader: No
;
> #Its purpose is to generate and investigate integer sequences counting the number of HAMILTONIAN CYCLES for interesting graphs that come from Chess. Generalizing and Extending Euler's Knight's tour
;
> 
;
> #SECOND CHOICE: ComboProject5.txt          I am willing to be Project Leader: No
;
> #Its purpose is the generate and study sequences enumerating Final tie positions in a k by n generalized TicTacToe in a k by n board, for fixed k. The classical case is k=3 and n=3
;
> 
;
> #THIRD CHOICE: ComboProject6.txt          I am willing to be Project Leader: No
;
> #Its purpose is to generate and investigate minimal degrees and average degrees of vertices in induced subgraphs of famous families of graphs inspired by Hao Huang's amazing proof of the Sensitivity Conjecture
;
> 
;