On each homework assignment, please write (i) your name, (ii) name of course, and (iii) homework number. You are allowed and encouraged to work together on homework. Yet, each student is expected to turn in his or her own work. In general, late homework will not be accepted. However, you are allowed to turn in up to three late homework assignments with no questions asked. Unless you have made arrangements in advance with me, homework turned in after class will be considered late. When doing your homework, I encourage you to consult the Elements of Style for Proofs.

Daily Homework

The following assignments are due at the beginning of the indicated class meeting. However, most assignments will be collected at the end of the class meeting. I reserve the right to modify the assignment if the need arises. These exercises will form the basis of the student-led presentations. Daily assignments will be graded on a $\checkmark$-system. During class, you are only allowed and encouraged to annotate your homework using the colored marker pens that I provide.

  • Daily Homework 1: Read the syllabus and write down 5 important items. Note: All of the exam dates only count as a single item. Turn in on your own paper at the beginning of class. (Due Wednesday, January 16)
  • Daily Homework 2: If you haven’t already, read the Preface (3 pages) and Chapter 0: Introduction to this book (14 pages) in Inquiry Based Enumerative Combinatorics. Jot down some notes and be prepared to explain/justify (1) the recurrence relation, (2) the closed form, and (3) the structural recurrence diagram for the $n$-disk version of the Towers of Hanoi. (Due Wednesday, January 16)
  • Daily Homework 3: Complete Problems 1-7 in Chapter 1 and digest the surrounding text along the way. (Due Friday, January 18)
  • Daily Homework 4: Complete Problems 8-13 in Chapter 1 and digest the surrounding text along the way. (Due Wednesday, January 23)
  • Daily Homework 5: (Tentative) Complete Problems 14-18 in Chapter 1 and digest the surrounding text along the way. (Due Friday, January 25)
  • Daily Homework 6: (Tentative) Complete Problems 19-24 in Chapter 1 and digest the surrounding text along the way. Be sure to read the exposition at the end of Chapter 1. (Due Monday, January 28)

Weekly Homework

For most of the assignments below, you will be required to submit 2-3 formally written proofs. You are required to type your submission using LaTeX (see below). You can either submit a hardcopy of your assignment or email me the PDF of your completed work. If you email me the PDF, please name your file as WeeklyX-LastName.pdf, where X is the number of the assignment and Lastname is your last name. Notice there are no spaces in the filename.

  • Weekly Homework 1: Read The Secret to Raising Smart Kids by Carol Dweck and write a one-page summary/reflection about the article. For this assignment, I suggest you use the template on Overleaf found here instead of using the “Start your homework in Overleaf” link below. (Due Tuesday, January 22 by 8PM)

Using LaTeX for Weekly Homework

You are required to use LaTeX to type up your Weekly Homework assignments. The easiest way to get started with LaTeX is to use an online editor. I recommend using Overleaf, but there are other options. The good folks over at Overleaf have preloaded my homework template, so to get started, all you need to do is click the link below and then click on “Open as Template”. Be sure to update your name and the course title.

Start your homework in Overleaf

Dana C. Ernst

Mathematics & Teaching

  Northern Arizona University
  Flagstaff, AZ
  Google Scholar
  Impact Story

Current Courses

  MAT 441: Topology
  MAT 526: Combinatorics

About This Site

  This website was created using GitHub Pages and Jekyll together with Twitter Bootstrap.

  Unless stated otherwise, content on this site is licensed under a Creative Commons Attribution-Share Alike 4.0 International License.

  The views expressed on this site are my own and are not necessarily shared by my employer Northern Arizona University.

  The source code is on GitHub.