a repository of mathematical know-how

Elementary number theory front page

Quick description

This page contains links to articles that may be useful for dealing with problems in elementary number theory.

Note iconIncomplete This article is incomplete. This page needs to be written properly; so far it is only really a placeholder.

Techniques in elementary number theory

Modular arithmetic Quick description ( Modular arithmetic is the part of number theory that studies the integers up to multiples of some fixed number. Dealing with integers in this way is typically very useful if one is looking at a question that involves the notion of divisibility. )


I believe Fermat's 'descente

I believe Fermat's 'descente infinie' deserves a mention here. What's your opinion?

Definitely agreed. A nice

Definitely agreed. A nice example would be the infinite-descent proof that every positive integer is a sum of four squares.

That's a nice one. Another

That's a nice one. Another example might be a proof of the irrationality of \sqrt{2} or maybe a proof that the diophantine equation x^{4}+y^{4}=z^{2} has no positive integral solutions.

Post new comment

(Note: commenting is not possible on this snapshot.)

Before posting from this form, please consider whether it would be more appropriate to make an inline comment using the Turn commenting on link near the bottom of the window. (Simply click the link, move the cursor over the article, and click on the piece of text on which you want to comment.)