Programming for Mathematics

Course timings from 18th August: 11:30-12:30; Mondays, Wednesdays and Fridays (media room, IMSc)

Jump to:

1. Introduction to Sage (4 Aug)
2. Introductory Programming Tutorial (6 Aug)
3. Advanced Prgramming Tutorial (8 Aug)
4. Sharing and Interacting in Sage (11 Aug)
   
5. Toward the Code (13 Aug)
   
6. Classes in python-1 (18 Aug)
   
7. Classes in python-2 (20 Aug)
   
8. Classes in python-3 (22 Aug)
   
9. Inheritance (24 Aug)
   
10. Inheritance 2 (26 Aug)
    
11. Exceptions and Iterators (1 Sept)
    
12. List Methods and Functions (3 Sept)
    
13. Iterators for Partitions and Lattice Paths (5 Sept)
    

Homework

1. Find three topics in the combinatorics directory you didn't know about, but should. Be ready to show someone else how to compute it.
2. Find a tutorial in the Sage documentation written by Anne Schilling, one of the presenters at Sage Days 60.
3. What was your favorite function in calculus? Can you calculate its integral?
4. Solve one of the harder Sudoku puzzles linked http://dingo.sbs.arizona.edu/~sandiway/sudoku/examples.html, using Sage.
5. How many graphs are there of order five? (Up to isomorphism.)
6. How many graphs are there of order five and size six?
7. Do Project Euler's problem seven.
8. Compute the sum of the primes below n, where n=30,100,1000, and two million. For the last few, you may want to learn about a "list" from a good Python tutorial, such as this one, this one, or another one from this list.
9. Use Sage to calculate the determinant of the diagonal matrix of ranks one through ten with all ones on the diagonal. (You know the answer, but get Sage to do it for you!)
10. Look up the list of programs which Sage uses internally or has interfaces to. Have you used any of them?

Video Recording