You are here:
Most questions on number theory, divisibility, primes, Euclidean algorithm, Fermat`s theorem, Wilson`s theorem, factorisation, euclidean algorithm, diophantine equations, Chinese remainder theorem, group theory, congruences, continued fractions.
Teacher of math for 50 years
ATL
Journal of mathematics and its applications
BSc Hons Liverpool
State Scholarship 1955
I taught John Birt, former Director of the BBC in 1961. His homework book was the most perfect I have ever marked. And also the most neat. I could tell he was destined for great things. One of my classmates was the poet Roger McGough, and I have a mention in his autobiography.
The variety, and the fact that everyone can participate. Anyone could discover a new largest prime number by joining the Mersenne prime project, using their computer off-line in the background to do masses of calculations.
I would love to have enough knowledge to completely understand Andrew Wiles's proof of Fermat's last theorem.
Secure encrypted messaging can be dependent on the difficulty of factorising the product of two large prime numbers.
Does the beauty I find in number theory demand a divine creator for the Universe?
| User | Date | K | C | P | Comments |
|---|---|---|---|---|---|
| Kenneth | 01/16/12 | 10 | 10 | 10 | Thanks for the reply and explanation! |
| Samir | 01/11/12 | 5 | 7 | 10 | |
| Prashant S Akerkar | 11/26/11 | 10 | 10 | 10 | Dear Prof Vijilant Thank you. Thanks & ..... |
| Michael | 11/11/11 | 10 | 10 | 10 | Very helpful expert, speedy answers and precise ..... |
| Prashant S Akerkar | 11/09/11 | 10 | 10 | 10 | Dear Prof Vijilant Thank you. Thanks ..... |
Hello Kenneth The amount of work that is done is the number of cook-hours. 4*6 cook hours are needed for 8 pies, so each pie needs 4*6/8 cook-hours. When 2*4 cook-hours are available, the number of
Hello Samir Once again, it will depend on the values of C and r. And also there will be multiple solutions if we allow A or B or n and m to be 1. You should know that if n = m = r = p where p>2, there
Hello Samir Clearly this depends on the value of C. For example, if C = 2, we must have A = B = 1, but n and m may have any values whatsoever. Indeed for any value of C, if we take A = 1, B = C -
Hello Prashant Once again it isn't a number theory question, but these are all permutations of male and female. Not combinations since for example male, female is not the same as female, male. If
Hello Heni Of course. It is very easy. Assuming you are thinking about positive integers, round up log(n)/log(2) to the next integer. For example n = 12. log(12)/log(2) = 3.58... Round up to 4.

©2012 About.com, a part of The New York Times Company. All rights reserved.