This Monday I have a couple of links lined up, both math related and non-math related.

First up is a Wikibook titled High School Mathematics Extensions. It contains over 140 pages covering topics like Primes, Modular Arithmetic, Logic, Discrete Probability, Mathematical Programming, and more. It also has exercises and projects for each topic. It’s directed towards 14 to 18 year olds who are interested in mathematics, but this is a good and solid introduction for anyone interested in the aforementioned topics, and can also be a good refresher for more advanced students. The Wikibook is still under construction, so if you have anything to add to it, I encourage you to do so!

The next one I want to share is Programming Praxis. It’s a great website with a regularly updated collection of programming exercises and projects. The best thing about the exercises is that they cover so many different science/technology/mathematics/computer science topics. It’s almost certain that you will learn something new. I could name a few examples, but there are just so many topics… I suggest you take a look at the list of exercises. I myself do a couple of exercises from that list every once in a while, and have currently finished the first thirty (and already learned a lot).

Next up is a video lecture titled Introduction to Git with Scott Chacon of GitHub. It is, like the title suggests, an introduction to Git. Git is a version control and source code management system, which allows you to do amazing things with your source files. In short, it allows you to go back in time and view an older version of your project, try out a new feature in your code and go back if you don’t like it, back up the project to a remote location, and easily collaborate with others on the project. I’m not going to explain it further, just watch the video already! I myself have used Git almost on a daily basis for a couple of years, and in every programming project that involves more than a single code file with a couple of lines.

I don’t want to overwhelm you with too many links, so here is the last one today. An Introduction to Primality Testing is a great little article written by Google employee Fred Akalin. If you want to learn about primality testing, you’ve got to check this one out. Well written and beautifully set up with interactive code examples.

So that’s it for today. The blog image is by …-Wink-…, who shared it under the creative commons license. Do you have any links you would like to share? Then please leave a comment, because we would love to hear about them!

### Posted by Bjarki Ágúst

Eman

Hello good links I am really looking forward to them, mostly to the first one. And I found this:

http://online-judge.uva.es/p/Art_of_Programming_Contest_SE_for_uva.pdf

It’s about programming, some tips for C ando so on It’s very good for Uva problems. Where I originally found it.

Bjarki Ágúst

And yes, that book is excellent. I’ve actually read 2/3 of the book myself. The only thing I didn’t like about the book was that it seems to have copied a lot of content from the USACO Training Program Gateway (which seems to be currently down for whatever reason).

Eman

And do you now something from Graph algorithms, because I am completely beginner in graphs and I want to improve.

Bjarki Ágúst

There are many good resources online, as well as many good books covering the subject. For example: Introduction to graphs and their data structures, Competitive Programming 2 (great coverage of graph algorithms) and Introduction to Algorithms (more in-depth than the last book).

I would also recommend doing the following:
– Go to your UVa account on uHunt, or alternatively go to my account if you don’t have one.
– Under “Competitive Programming Exercises”, open “ALL Graph” problems.
– Now you have a list of problems categorized into specific graph algorithms.
– Now you can Google a topic, like Flood Fill, and then try solving problems categorized under Flood Fill.

Eman

Thanks.