2012-12-13, 18:31 | #1 |
Apr 2012
2×47 Posts |
compendium of formulas related with primes ?
Hello
I'm looking for a book with a compendium of formulas related with modular arithmetics, Wilson's theorem, Fermat theorems, diophantine equations, number field sieve, and other not so well-known, and maybe elliptic curves and algorithms such as Miller-Rabin.... I've seen that some typical Formulae books contain very little about this subject. (Zwillinger, Bronhsteid, Weisstein, Polyanin, Abramowitz...) And all "number theory" books I found are too theoretical, plenty of demostration but not a summary of relations. Another option would be some computer/cryptography texts but they don't include many formulas either, and they spend most of its pages with computer related things and long explanations. Could you suggest me any book or link, please? I mean, I would like to have in a book or pdf a summary of all known relations containing prime numbers and modular calculus. regards Last fiddled with by skan on 2012-12-13 at 18:33 |
2012-12-14, 01:14 | #2 |
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts |
if you mean like statements containing maybe too many exist to fit in a reasonable sized file, Fermats little theorem,Wilson's theorem, Euler-Jacobi pseudoprimes, and facts like the primes can only reside in modular classes that are coprime with the modulus. and there's a lot more like these at last check.
Last fiddled with by science_man_88 on 2012-12-14 at 01:15 |
2012-12-14, 01:51 | #3 |
Tribal Bullet
Oct 2004
3·1,181 Posts |
That's actually an interesting question; you need a desk reference if you just want to use results in (say) applied mathematics without understanding where they came from, but in what field can you claim to need that with number theory? You can list algorithms for (say) modular exponentiation, and there are many of them, some very complicated, but a list isn't very useful if you just want to read the list and not do anything with them. Even in that case you can look up the relevant chapter in the Handbook of Applied Cryptography.
On the other hand, how do you summarize a subject that is as old as mathematics itself? |
2012-12-14, 02:00 | #4 |
Apr 2012
2×47 Posts |
The books I listed above contain more than 30000 formulas.
Then I think it's possible. The problem is that the formulas I'm asking for could be considered too specific or complicated or not interesting for most people. I know that many of them area contained in some cryptography books, but they spend 99% of the space with long explanations, comments and non related subjects. Last fiddled with by skan on 2012-12-14 at 02:03 |
2012-12-14, 03:11 | #5 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
9,787 Posts |
Ha ha ha... indeed?!? To get the best ratio between what the reader expects when he start reading a book and the real content of the book, we should only read sandra brown's books.... (edit: and listen only to justin bieber's songs).
Last fiddled with by LaurV on 2012-12-14 at 03:13 |
2012-12-14, 12:37 | #6 |
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
1011100100000_{2} Posts |
One book that might be worth looking at is Crandall and Pomerance's 'Prime Numbers: a computational perspective'
This might be over the top mathsy for you. Last fiddled with by fivemack on 2012-12-14 at 19:16 |
2012-12-14, 12:56 | #7 |
Apr 2012
2·47 Posts |
Thank you henryzz
Last fiddled with by fivemack on 2012-12-14 at 19:17 |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Problems for displaying math formulas | alpertron | Forum Feedback | 4 | 2011-05-26 20:37 |
Assorted formulas for exponents of Mersenne primes | Lee Yiyuan | Miscellaneous Math | 60 | 2011-03-01 12:22 |
recurrent formulas to obtain primes | Unregistered | Information & Answers | 2 | 2011-01-14 17:19 |
Prime-Related History: Leibniz' "Universal Language Based on Primes" | ewmayer | Math | 10 | 2007-03-02 12:47 |
Smooth polynomial formulas to produce all primes | Cyclamen Persicum | Math | 10 | 2003-03-29 07:08 |