This introduction to computational number theory is centered on a number of problems that live at the interface of analytic, computational and Diophantine number theory, and provides a diverse collection of techniques for solving number- theoretic problems. There are many exercises and open research problems included.

* Preface * Introduction * LLL and PSLQ * Pisot and Salem Numbers * Rudin-Shapiro Polynomials * Fekete Polynomials * Products of Cyclotomic Polynomials * Location of Zeros * Maximal Vanishing * Diophantine Approximation of Zeros * The Integer-Chebyshev Problem * The Prouhet-Tarry-Escott Problem * The Easier Waring Problem * The Erds-Szekeres Problem * Barker Polynomials and Golay Pairs * The Littlewood Problem * Spectra * Appendix A: A Compendium of Inequalities * B: Lattice Basis Reduction and Integer Relations * C: Explicit Merit Factor Formulae * D: Research Problems * References * Index

등록된 사용후기

사용후기 쓰기 새 창 더보기

사용후기가 없습니다.

등록된 상품문의

상품문의 쓰기새 창 더보기

상품문의가 없습니다.

배송정보

교환/반품 정보