000 | 02434cam a2200253 a 4500 | ||
---|---|---|---|
001 | 45209126 | ||
003 | OCoLC | ||
005 | 20180531173254.0 | ||
008 | 001017s2001 njua b 001 0 eng | ||
010 | _a00051641 | ||
020 | _a0130309540 (hbk.) | ||
040 |
_aDLC _cDLC _dMUQ _dYBM _dNLGGC _dFIN |
||
050 | 0 | 0 |
_aQA241 _b.S497 2001 |
082 | 0 | 0 |
_a512/.7 _221 |
100 | 1 |
_aSilverman, Joseph H., _d1955- _91134 |
|
245 | 1 | 2 |
_aA friendly introduction to number theory / _cJoseph H. Silverman. |
250 | _a2nd ed. | ||
260 |
_aUpper Saddle River, N.J. : _bPrentice Hall, _cc2001. |
||
300 |
_avii, 386 p. : _bill. ; _c24 cm. |
||
504 | _aIncludes bibliographical references (p. 371) and index. | ||
505 | 0 | 0 |
_tWhat is number theory? -- _tPythagorean triples -- _tPythagorean triples and the unit circle -- _tSums of higher powers and Fermat's Last Theorem -- _tDivisibility and the greatest common divisor -- _tLinear equations and the greatest common divisor -- _tFactorization and the fundamental theorem of arithmetic -- _tCongruences -- _tCongruences, powers, and Fermat's Little Theorem -- _tCongruences, powers, and Euler's Formula -- _tEuler's Phi function -- _tPrime numbers -- _tCounting primes -- _tMersenne primes -- _tMersonne primes and perfect numbers -- _tPowers modulo m and successive squaring -- _tComputing Kth roots modulo m -- _tPowers, roots, and "unbreakable" codes -- _tEuler's phi function and sums of divisors -- _tPowers modulo p and primitive roots -- _tPrimitive roots and indices -- _tSquares modulo p -- Is -1 a square modulo p? Is 2? -- _tQuadratic reciprocity -- _tWhich primes are sums of two squares? -- _tWhich numbers are sums of two squares? -- _tThe equation X⁴ + Y⁴ = Z⁴ -- _tSquare-triangular numbers revisited -- _tPell's equation -- _tDiophantine approximation -- _tDiophantine approximation and Pell's equation -- _tPrimality testing and Carmichael numbers -- _tThe Gaussian integers and unique factorization -- _tIrrational numbers and transcendental numbers -- _tBinomial coefficients and Pascal's triangle -- _tFibanacci's rabbits and linear recurrence sequences -- _tGenerating functions -- _tSums of powers -- _tCubic curves with elliptic curves -- _tElliptic curves with few rational points -- _tPoints on elliptic curves modulo p -- _tTorsion collections modulo p and bad primes -- _tDefect bounds and modularity patterns -- _tElliptic curves and Fermat's last theorem. |
650 | 0 |
_aNumber theory. _91135 |
|
942 |
_2lcc _cBK |
||
999 |
_c1625 _d1625 |