Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Im an undergraduate in the mathematics field ..So i wanna be alittle more productive and wanted to do an essay or project mostly on number theory or Algebra(Rings or Groups) and i want to ask if you have to suggest some good topics for undergraduate level..and give me some tips on how to start.(and references)

share|cite|improve this question

closed as off-topic by Meta, USER91500, probablyme, Claude Leibovici, Chris Godsil Jan 29 at 12:37

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "Seeking personal advice. Questions about choosing a course, academic program, career path, etc. are off-topic. Such questions should be directed to those employed by the institution in question, or other qualified individuals who know your specific circumstances." – USER91500, probablyme, Claude Leibovici
If this question can be reworded to fit the rules in the help center, please edit the question.

    
@Apurv Why remove the relevant tags? – user1729 Feb 27 '14 at 12:05
    
@user1729, the question is not on number theory, it is related to personal opinion and career development. So I removed the irrelevant tags. – Apurv Feb 28 '14 at 4:14
up vote 7 down vote accepted

One possibility is to study the so called "Euclidean proofs" for Dirichlet's theorem on arithmetic progressions, which are sometimes possible and are much easier than Dirichlet's methods form analytic number theory. However, it is an interesting question to say what an "Euclidean proof" should be, and for which arithmetic progressions $an+b$ it works. For references, see for example Ram Murty, M.; Thain, N.: Prime Numbers in certain Arithmetic Progressions.

share|cite|improve this answer
    
Oh! Thank you! It is interesting! – Manolis Lyviakis Feb 27 '14 at 10:59

It's a bit of a challenge but perhaps you could summarize the activity following Yitang Zhang's recent paper on the gaps between primes. A friend of mine is doing so as his Master's dissertation; it's doable and it'd get you up-to-date. You'd have to black-box a few results as an undergraduate though.

share|cite|improve this answer
1  
Ohh yes it was an awsome result! – Manolis Lyviakis Feb 27 '14 at 11:02

You may try to understand the key points in the AKS primality test.

The book Primality Testing in Polynomial Time by Dietzfelbinger is very nice.

There is also the more recent, and probably simpler, Primality Testing for Beginners by Rempe-Gillen and Waldecker.

See also the survey It is easy to determine whether a given integer is prime by Granville.

A related book is The Joy of Factoring by Wagstaff.

share|cite|improve this answer

A wonderful book is Proofs from THE BOOK by Ziegler and Aigner (the capitals are in the title - I am not actually shouting). This book contains lots of wonderfully elegant proofs from number theory, geometry, analysis and so on. The proofs are almost always at a low-enough level for a good undergraduate student to understand (the idea is that they are simple and elegant, and therefore are understandable!). Clicking on the following link will download a table of contents for the 4th edition: link.

The name Proofs from THE BOOK is in honour of Paul Erdős. From wikipedia: "(The book is) a book in which God had written down the best and most elegant proofs for mathematical theorems. Lecturing in 1985 he said, You don't have to believe in God, but you should believe in The Book...He accused (God) of hiding his socks and Hungarian passports, and of keeping the most elegant mathematical proofs to himself. When he saw a particularly beautiful mathematical proof he would exclaim, This one's from The Book!."

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.