Computational Recreations in MathematicaAddison-Wesley, 1991 - Počet stran: 286 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. |
Vyhledávání v knize
Výsledky 1-3 z 67
Strana 102
... Implement PowerMod in Lisp . Exercise 5.9 [ P ] [ M ] ( [ 13 ] ) Implement the test 2n − 1 = 1 ( mod n2 ) efficiently ... implementation of the Pollard - p method . This should be able to factor in reasonable time any number with less ...
... Implement PowerMod in Lisp . Exercise 5.9 [ P ] [ M ] ( [ 13 ] ) Implement the test 2n − 1 = 1 ( mod n2 ) efficiently ... implementation of the Pollard - p method . This should be able to factor in reasonable time any number with less ...
Strana 118
... implementing the last squaring step along these lines is extremely difficult to do in Mathematica . One needs very tight control of list processing , so it seems that such an implementation should probably be done in some dialect of ...
... implementing the last squaring step along these lines is extremely difficult to do in Mathematica . One needs very tight control of list processing , so it seems that such an implementation should probably be done in some dialect of ...
Strana 245
... implemented in LeLisp . 5.8 This is just a recursive implementation of PowerMod ( defun PowerMod ( a b c ) ( cond ( ( zerop b ) 1 ) ( ( evenp b ) ( mod ( expt ( PowerMod a ( ash b -1 ) c ) 2 ) c ) ) ( T ( mod ( * ( PowerMod a ( 1- b ) c ) ...
... implemented in LeLisp . 5.8 This is just a recursive implementation of PowerMod ( defun PowerMod ( a b c ) ( cond ( ( zerop b ) 1 ) ( ( evenp b ) ( mod ( expt ( PowerMod a ( ash b -1 ) c ) 2 ) c ) ) ( T ( mod ( * ( PowerMod a ( 1- b ) c ) ...
Obsah
Searching for Numbers | 4 |
Elegant Programs in Mathematica | 6 |
Answer to Question | 12 |
Autorská práva | |
Další části 11 nejsou zobrazeny.
Běžně se vyskytující výrazy a sousloví
algorithm asymptotic base binomial Block calendar CalendarChange Catalan numbers Chapter coefficient Collatz compute Condom Problem condoms conjecture DateToNumber denoted digits DigitsToNumber efficient element Euler-Maclaurin formula evaluate example Exercise expansion Farey sequence Fo(a formula Fy(a gives Gregorian implementation Islamic calendar iterates Julian Julian calendar Khinchin's constant lattice paths Lisp log log log n log log(x log² lower bound M₁ Mathematica Mathematica function Mathematica program mathematical method mixed radix Möbius inversion formula mod p² multiplication MyDigits n_Integer NestList Niven numbers Note number of primes number system numbers less perm polynomial PowerMod powers powers2 prec prime number theorem Prime Range PrimePi PrimeQ problem Quotient recurrence relatively prime Riemann Riemann hypothesis Riemann zeta function rook rowsum RunEncode running Sc(n Section semigroup setf solutions squarefree subsets SuperPowerMod Table[1 TakTime0 term theory toroidal semiqueens TotalStoppingTime tree values W₁ Wieferich primes zero