Computational Recreations in MathematicaAddison-Wesley, 1991 - 286 páginas Presents some common problems in mathematics and how they can be investigated using the Mathematica computer system. Problems and exercises include the calendar, sequences, the n-Queens problems, digital computing, blackjack and computing pi. This book is for those that would like to see how Mathematica is applied to real-world mathematics. |
Contenido
Elegant Programs in Mathematica 344 | 3 |
Digital Computing | 19 |
The Calendar | 35 |
Derechos de autor | |
Otras 12 secciones no mostradas
Términos y frases comunes
algorithm asymptotic bignum Block boundary conditions C₁ calendar CalendarChange Chapter coefficient Collatz completed all encounters compute Condom Problem conjecture count the number D.E. Knuth DateToNumber denoted digits DigitsToNumber efficient equidistribution Evaluates example Exercise F₁(a F₂ Factor Integer Farey sequence FareyList Fo(a Fo(b Fy(a gives graph Gregorian Gregorian calendar implementation implies Islamic calendar iterate Khinchin's constant lattice paths Lisp log log log(x log² lower bound LowerDigits M₁ M₂ master condom Mathematica Mathematica function Mathematica program mathematical MemberQ method mixed radix Möbius inversion formula mod p² Moebius multiplication MyDigits n_Integer Note number of primes number system number theory perm polynomial PowerMod prime number theorem PrimeQ problem Quotient relatively prime Riemann hypothesis Riemann zeta function running Sc(n Section solutions squarefree Stirling's formula subsets SuperPowerMod SuperSuperPowerMod TAK₂ TakTime TakTime0 a_ term toroidal semiqueens TotalStoppingTime values W₁ Wieferich primes women zero