81. Integer Arithmetic Instructions In Assembly Language For most processors, integer arithmetic is faster than floating point 16, or 32 bit integer or 32 or 64 bit floating point) in general purpose registers http://www.osdata.com/topic/language/asm/intarith.htm

sponsored by OSdata.com Assembly Language binary integer arithmetic This web page examines integer arithmetic instructions in assembly language. Specific examples of instructions from various processors are used to illustrate the general nature of assembly language. ad free version of this exact same web page available here For those with high speed connections, the very large single file summary is still on line. table of contents for assembly language section integer arithmetic further reading: books on assembly language related software further reading: websites integer arithmetic See also binary integer data representations For most processors, integer arithmetic is faster than floating point arithmetic. This can be reversed in special cases such digital signal processors. The basic four integer arithmetic operations are addition subtraction multiplication , and division . Arithmetic operations can be signed or unsigned A specialized, but common, form of addition is an increment A specialized, but common, form of subtraction is an decrement Compare instructions are used to examine one or more integers non-destructively. These are usually implemented by performing a subtraction in some shadow register or accumulator and then setting flags accordingly. Compare instructions can compare two integers, or can compare a single integer to zero. Triadic compare instructions compare a test value to an upper and lower limit, which can be useful for bounds and range checking.

82. SWI-Prolog 5.5.7 Reference Manual: Section 4.26 The general arithmetic predicates are optionally compiled now (see set_prolog_flag/2 and the O command line option). Compiled arithmetic reduces global http://gollem.science.uva.nl/SWI-Prolog/Manual/arith.html

4.26 Arithmetic Arithmetic can be divided into some special purpose integer predicates and a series of general predicates for floating point and integer arithmetic as appropriate. The integer predicates are as ``logical'' as possible. Their usage is recommended whenever applicable, resulting in faster and more ``logical'' programs. The general arithmetic predicates are optionally compiled now (see and the -O command line option). Compiled arithmetic reduces global stack requirements and improves performance. Unfortunately compiled arithmetic cannot be traced, which is why it is optional. The general arithmetic predicates all handle expressions . An expression is either a simple number or a function . The arguments of a function are expressions. The functions are described in section 4.27 between +Low, +High, ?Value Low and High are integers, High Low . If Value is an integer, Low Value High . When Value is a variable it is successively bound to all integers between Low and High . If High is inf or infinite between/3 is true iff Value Low , a feature that is particularly interesting for generating integers from a certain value.

83. Journal Of The ACM -- 1974 The parallel evaluation of general arithmetic expressions. Journal of the ACM , 21(2)201206, April 1974. References, Citations, etc. BibTeX entry http://theory.lcs.mit.edu/~jacm/jacm74.html

Journal of the ACM 1974 Volume 21, Number 1, January 1974 David G. Herr . On a statistical model of Strand and Westwater for the numerical solution of a Fredholm integral equation of the first kind. Journal of the ACM , 21(1):1-5, January 1974. References, etc. BibTeX entry Nai-kuan Tsao . Some a posteriori error bounds in floating-point computations. Journal of the ACM , 21(1):6-17, January 1974. References, etc. BibTeX entry L. W. Cotten and A. M. Abd-Alla . Processing times for segmented jobs with I/O compute overlap. Journal of the ACM , 21(1):18-30, January 1974. Additional information. BibTeX entry P. A. Franaszek and T. J. Wagner . Some distribution-free aspects of paging algorithm performance. Journal of the ACM , 21(1):31-39, January 1974. References, Citations, etc. BibTeX entry Giorgio Ingargiola and James F. Korsh . Finding optimal demand paging algorithms. Journal of the ACM , 21(1):40-53, January 1974. References, etc. BibTeX entry Debasis Mitra . Some aspects of hierarchical memory systems. Journal of the ACM , 21(1):54-65, January 1974.

84. BBC Education - AS Guru - Maths - Pure - Sequences And Series - Arithmetic Seque general arithmetic Series Triangle Numbers The Sum of an arithmetic Series This time the diagram illustrates the general arithmetic series with first http://www.bbc.co.uk/education/asguru/maths/13pure/03sequences/17arthimetic/prin

Home TV Radio Talk ... A-Z Index SUNDAY 18th September 2005 Text Only General Arithmetic Series Triangle Numbers The Sum of an Arithmetic Series General Arithmetic Series The rods represent the Natural or counting numbers with which we are all familiar. This is one of the simplest arithmetic series. The starting number (which we refer to as the first term ) is 1, and each term is one more than the previous term. The amount the values increase by is known as the common difference . It is usual to use a lower case ' a ' to represent the first term and a lower case ' d ' for the common difference. u The starting number, a , is 1 u u u u u n u n The common difference, d , is 1 Top This time the diagram illustrates the general arithmetic series with first term a and common difference d . The second term is a d , the third is a d , the fourth of a d . The n th term will be a + (one less than n d u a u a + d u a + 2d u a + (n-1)d Top Triangle Numbers The numbers 1, 3, 6, 10, Â are shown in the diagram. This number sequence generates the triangle numbers. The n th triangle number is the sum of the Natural numbers from 1 to n This is the same as finding the sum of the first n terms of the arithmetic series with first term 1 and common difference 1.

85. The Mercury Project: [m-dev.] Trivial Diff: Update Tests/general/arithmetic.* RCS file /home/mercury1/repository/tests/general/arithmetic.exp,v diff u -r1.1 arithmetic.exp - general/arithmetic.exp 1996/11/04 070756 1.1 http://www.cs.mu.oz.au/research/mercury/mailing-lists/mercury-developers/mercury

The Mercury Project [m-dev.] trivial diff: update tests/general/arithmetic.* Home News Information Overview ... Search Subject: [m-dev.] trivial diff: update tests/general/arithmetic.* From: Mark Anthony BROWN ( dougl@cs.mu.OZ.AU Date: Mon Jan 17 2000 - 16:18:25 EST sorted by: [ date ] [ thread ] [ subject ] [ author ] Next message: Michael Day: "Re: [m-dev.] string streams and formatting" Previous message: Fergus Henderson: "Re: [m-dev.] string streams and formatting" Estimated hours taken: 0.1 tests/general/arithmetic.m: tests/general/arithmetic.exp: Use `xor` instead of '^' operator. Index: general/arithmetic.exp RCS file: /home/mercury1/repository/tests/general/arithmetic.exp,v retrieving revision 1.1 diff -u -r1.1 arithmetic.exp - general/arithmetic.exp 1996/11/04 07:07:56 1.1 +++ general/arithmetic.exp 2000/01/17 05:10:50 -X ^ Y: 7 +X `xor` Y: 7 Index: general/arithmetic.m RCS file: /home/mercury1/repository/tests/general/arithmetic.m,v retrieving revision 1.2 diff -u -r1.2 arithmetic.m - general/arithmetic.m 1995/08/17 05:32:24 1.2 +++ general/arithmetic.m 2000/01/17 05:09:02

86. What Is Arithmetic? Algebraic, ie general, facts, however expressed, are a great arithmetic tool. This is nowhere more apparent than in explaining and devising rapid math http://www.cut-the-knot.org/WhatIs/WhatIsArithmetic.shtml

Username: Password: Sites for teachers Sites for parents Awards Interactive Activities ... Sites for parents What Is Arithmetic? Arithmetic is a branch of mathematics that deals with properties of the counting (and also whole) numbers and fractions and the basic operations applied to these numbers. As a matter of fact, as a noun in the above sense, the word is used quite seldom. In the early grades, when numbers are the main object of study, the subject is often designated as mathematics . The mathematics appellation sticks around until much later when it paradoxically becomes Algebra I. The latter is usually associated with the use of letters as place holders for generic or unknown numbers. One explanation for the common avoidance of the word arithmetic stems from the fact that, besides learning numbers and how to deal with them, students are often taught about shapes and the skill of measurements, which takes the subject somewhat beyond the purview of arithmetic. However, the common meaning of "Mental Math" as the skill of carrying out basic calculations in one's head without recourse to paper, pencil, or other ancillary devices. The misnaming of the subject is entrenched in mathematics education literature. The titles

87. Textbook On Computer Arithmetic Some of these books that cover computer arithmetic in general (as opposed to special Computer arithmetic (G.1.0), general (B.2.0 Â ), Algorithms, Design http://www.ece.ucsb.edu/Faculty/Parhami/text_comp_arit.htm

Textbook on Computer Arithmetic Behrooz Parhami: 200 parhami@ece.ucsb.edu webadmin@ece.ucsb.edu Other contact info at Bottom of this page B. Parhami's teaching and textbooks or his home page Parhami, Behrooz, Computer Arithmetic: Algorithms and Hardware Designs , Oxford University Press, New York, 2000 (ISBN 0-19-512583-5, 490 + xx pp.). Instructor’s manual prepared in two volumes. Available for purchase from Oxford University Press and various college or on-line bookstores. Preface Contents at a Glance Book Reviews Complete Table of Contents ... Errors and Additions Return to: Top of this page Preface The context of computer arithmetic Advances in computer architecture over the past two decades have allowed the performance of digital computer hardware to continue its exponential growth, despite increasing technological difficulty in speed improvement at the circuit level. This phenomenal rate of growth, which is expected to continue in the near future, would not have been possible without theoretical insights, experimental research, and tool-building efforts that have helped transform computer architecture from an art into one of the most quantitative branches of computer science and engineering. Better understanding of the various forms of concurrency and the development of a reasonably efficient and user-friendly programming model have been key enablers of this success story. The down side of exponentially rising processor performance is an unprecedented increase in hardware and software complexity. The trend toward greater complexity is not only at odds with testability and certifiability but also hampers adaptability, performance tuning, and evaluation of the various tradeoffs, all of which contribute to soaring development costs. A key challenge facing current and future computer designers is to reverse this trend by removing layer after layer of complexity, opting instead for clean, robust, and easily certifiable designs; to devise novel methods for gaining performance and ease-of-use benefits from simpler circuits that can be readily adapted to application requirements.

88. Charles Bloom : News & E-mail : MACM-96 Arithmetic Coder MACM96 Multi-precision arithmetic Coder Module. A Virtual Queue Based general arithmetic Encoder. MACM-96 is by Mahesh Naik , published here 6-14-96 http://www.cbloom.com/news/macm.html

MACM-96 : Multi-precision Arithmetic Coder Module A Virtual Queue Based General Arithmetic Encoder MACM-96 is by Mahesh Naik , published here 6-14-96 contact at: kiran@giasbm01.vsnl.net.in or BOMAAB04@giasbm01.vsnl.net.in MACM related resources on this page: MACM-96 source code Mr. Naik's original source code the original Virtual Queue Skew Coder : VQSC source code VQSC postscript paper Summary of the MACM method ( with VQSC as background ) by Charles Bloom: Notes sent to me by the auther (Mahesh Naik) in email : < both a and b. The second method is very easy to use in assembly language implementations ass most current logic units report it anyway. Range Normalisation: ==================== the CodeRange can be always doubled by appending a 1 bit to High and bit to Low This process can be carried out as long as CodeRange <= (2^P) as bits shifted into the Q region from the W region must have the special pattern illustrated above. It is not necessary to always normalise. In fact the IBM literature does normalisation only if CodeRange < ( 2^P) CWR (CACM!) does normalisation only if after normalisastion the most significant bit of HIGHW is of LOWW is 1 . ( They used some tricky identities to do arithmetic, by complementing the leading bit ( in both HIGHW and LOWW) before further arithmetic ... ..more of it in another article .... !) Their bits_to_follow is our QueueLength Because they don't always normalise their interval is (1/4,1] after normalisation There normalisation interval is (1/4,1]

89. Science Jokes:1. MATHEMATICS Riemann developed an arithmetic in which 2 + 2 = 5, paralleling the Euclidean 2 + By names of course I do not mean technical designations in general, http://www.xs4all.nl/~jcdverha/scijokes/1.html

1. MATHEMATICS Subsections 1. mathematics - general 1.1 proofs 1.2 statistics and statisticians 1.3 mathematicians ... 1.15 functions general Index Comments and Contributions previous:Contents mathematics Top of page Bottom of page Index Send comment From Susan Stepney (stepneys#NoSpam.logica.com) I always love the "Doc Smith" approach to mathematics, where Our Hero glances at an equation (sorry, "formula"), and instantly says "of course...!" My experience is usually more like "I don't know what on earth that means" ... scribble, scribble, scribble ... "Oh, yes, but what a weird way of writing it" ... scribble, scribble, scribble ... "now *this* should be a much clearer way" ... scribble, scribble, scribble ... "oh, it's identical to what I started with. But *now* I understand it." I can't *read* maths, I can only write it :-) A colleague of mine put it better: "mathematics is not a spectator sport". mathematics Top of page Bottom of page Index Send comment From the "Cow" collection at (Found in Michael Cook's (mlcook#NoSpam.afdsb.cca.rockwell.com) Canonical List of Math Jokes) mathematics Top of page Bottom of page Index Send comment From: jkelber#NoSpam.gladstone.uoregon.edu (Judah Kelber)

90. Citebase - G Add-On, Digital, Sieve, General Periodical, And Non-Arithmetic Sequ G AddOn, Digital, Sieve, general Periodical, and Non-arithmetic Sequences. Authors Smarandache, Florentin. In this paper a small survey is presented on http://citebase.eprints.org/cgi-bin/citations?id=oai:arXiv.org:math/0010151

91. Randomness In Arithmetic Randomness in arithmetic. Scientific American 259, No. 1 (July 1988), pp. For a generalpurpose computer neither of these extremes is actually possible. http://www.cs.auckland.ac.nz/CDMTCS/chaitin/sciamer2.html

Randomness in Arithmetic Scientific American 259, No. 1 (July 1988), pp. 80-85 by Gregory J. Chaitin It is impossible to prove whether each member of a family of algebraic equations has a finite or an infinite number of solutions: the answers vary randomly and therefore elude mathematical reasoning. What could be more certain than the fact that 2 plus 2 equals 4? Since the time of the ancient Greeks mathematicians have believed there is little-if anything-as unequivocal as a proved theorem. In fact, mathematical statements that can be proved true have often been regarded as a more solid foundation for a system of thought than any maxim about morals or even physical objects. The 17th-century German mathematician and philosopher Gottfried Wilhelm Leibniz even envisioned a ``calculus'' of reasoning such that all disputes could one day be settled with the words ``Gentlemen, let us compute!'' By the beginning of this century symbolic logic had progressed to such an extent that the German mathematician David Hilbert declared that all mathematical questions are in principle decidable, and he confidently set out to codify once and for all the methods of mathematical reasoning. This result, which is part of a body of work called algorithmic information theory, is not a cause for pessimism; it does not portend anarchy or lawlessness in mathematics. (Indeed, most mathematicians continue working on problems as before.) What it means is that mathematical laws of a different kind might have to apply in certain situations: statistical laws. In the same way that it is impossible to predict the exact moment at which an individual atom undergoes radioactive decay, mathematics is sometimes powerless to answer particular questions. Nevertheless, physicists can still make reliable predictions about averages over large ensembles of atoms. Mathematicians may in some cases be limited to a similar approach.

92. The C Book — Variables And Arithmetic Variables and arithmetic. 2.1. Some fundamentals 2.2. The alphabet of C 2.3. The Textual Structure of Programs 2.4. Keywords and identifiers 2.5. http://www.phy.duke.edu/~rgb/General/c_book/c_book/chapter2/

About GBdirect Consultancy Training Development ... Want a prettier version? Section navigation The C Book Preface Introduction Fundamentals ... Answers Leeds Office (National HQ) GBdirect Ltd Leeds Innovation Centre 103 Clarendon Road LEEDS West Yorkshire United Kingdom consulting@gbdirect.co.uk tel: Sales: South East Regional Office GBdirect Ltd 18 Lynn Rd ELY Cambridgeshire United Kingdom consulting@gbdirect.co.uk tel: Sales: Please note: Initial enquiries should always be directed to our UK national office in Leeds (West Yorkshire), even if the enquiry concerns services delivered in London or South/East England. Clients in London and the South East will typically be handled by staff working in the London or Cambridge areas. Variables and Arithmetic 2.1. Some fundamentals 2.3. The Textual Structure of Programs 2.4. Keywords and identifiers 2.5. Declaration of variables ... Next chapter Search Printer-friendly version The C Book This book is published as a matter of historical interest. Please read the

93. Algebraic Geometry And Number Theory With Magma arithmetic fields; general algebraic geometry ie schemes; Elliptic curves; Curves of genus greater than 1; Modular forms and modular abelian varieties http://magma.maths.usyd.edu.au/ihp/

General Schedule Participants Accomodation ... Registration Algebraic Geometry and Number Theory with Magma Paris October 4 - 8, 2004 Pictures Click here for pictures of the conference (taken by William Stein and Allan Steel). Introduction A week-long conference on the Computer Algebra system Magma trimester on "Explicit Methods in Number Theory" , organised by Belabas, Cohen, Cremona, Mestre, Roblot, Zagier. For further information, mail John Cannon The meeting was built around the following types of activities: Lectures describing recent developments in algorithms for algebraic geometry and arithmetic fields. Talks describing significant applications of Magma to algebraic geometry or number theory. Talks discussing potential algorithms or ideas for future directions in computational methods for algebraic geometry and arithmetic fields. Short courses on the use of Magma in following areas: Arithmetic fields General algebraic geometry ie schemes Elliptic curves Curves of genus greater than 1 Modular forms and modular abelian varieties Lectures Manjul Bhargava (IAS Princeton): A conjecture of Conway and Schneeberger on quadratic forms Gavin Brown (Warwick): Graded rings over K3 surfaces John Cannon (Sydney): An overview of algebraic geometry in Magma John Cremona (Nottingham): Finding all elliptic curves with good reduction outside a given set of primes Miles Reid (Warwick): Unprojection and Gorenstein rings in small codimensions Josef Schicho (Linz): Deciding rational rationality of algebraic surfaces

94. Wiley-VCH - Books | Computer Science | General & Introductory | Arithmetic And L Books Computer Science general Introductory arithmetic and Logic in Computer Systems arithmetic and Logic in Computer Systems ISBN 0471-46945-9 http://www.wiley-vch.de/publish/en/books/bySubjectCS00/bySubSubjectCS00/0-471-46

95. The Effect Of Arithmetic Skills On Success In General Physics NP01.82 The effect of arithmetic skills on success in general physics. Mariarosa Allodi (Utica College). Freshman students at our college must take a http://flux.aps.org/meetings/YR99/CENT99/abs/S5087082.html

Previous abstract Graphical version Next abstract Session NP01 - Poster Session IV. POSTER session, Tuesday evening, March 23 Exhibit Hall, GWCC The effect of arithmetic skills on success in general physics Mariarosa Allodi (Utica College) Freshman students at our college must take a mathematics placement examination which also serves as a diagnostic tool. A comparison of performance on the arithmetic section of the test, with grades in our non-calculus, general physics classes, demonstrates the correlation between an understanding of arithmetic operations, and, success with physics, regardless of the number and the level of the high school courses that have been successfully completed Part N of program listing

96. Seattle Pacific University Mathematics General Education Requirements arithmetic Review courses are offered through the Math Lab. This general education requirement can be met by choosing one of the following http://www.spu.edu/depts/math/general.htm

Mathematics Faculty Courses General Requirements Math Lab Links Calculus Information To fulfill the University's graduation requirements, all students are required to complete a basic math skills competency requirement and a general education mathematics requirement as a part of the exploratory curriculum. Math Skills Competency Requirement Competency in basic mathematics is essential in our technologically oriented society. All undergraduates are required to demonstrate competency in basic mathematics in one of the following ways: Score 500 or more on the quantitative SAT-I exam if taken prior to April 1995. Score 580 or more on the quantitative SAT-I exam if taken April 1995 or later. Score 25 or more on the ACT math test. Transfer in with a C (2.0) or better in MAT 1225, Calculus, or its college level equivalent. (MAT 1221, Survey of Calculus, does not meet this requirement.) Pass SPU's Mathematics Proficiency Examination. Complete the required work in Arithmetic Review (MAT 0121-MAT 0125) as revealed by the proficiency test results. Successfully complete all 5 credits in Arithmetic Review.

97. Napoleonic Arithmetic (Essay) Also when applying Napoleonic arithmetic it is extremely important to infuse those Looking back on history the arm chair general has the ability to http://www.civilwarhome.com/napolmath.htm

Napoleonic Arithmetic by Professor Ernest Butner (Irish) When discussing battles it is important to analyze maneuver and action based on many elements. I will try to explain these elements as proposed by Frederick, Napoleon, Jomini, Clausewitz, and Foch. Also when applying Napoleonic Arithmetic it is extremely important to infuse those elements that were known at the time of the action. Looking back on history the arm chair general has the ability to scrutinize with 20/20 visionsomething the commanders of the past did not have at their disposal. In many cases poor maps were used with little knowledge of roads or topography. This may seem like an excursion into the field of mathematics, but actually it is a maneuver into the art of war. Basically the elements that I will be working with may have been developed in the time of Ghengis Khan, Alexander, or Caesar. They are principles that were important through out time and have been important throughout the 19th and 20th century in regard to the successful prosecution of war. I will use Gettysburg as an example in this equation. First place yourself in a position of the Army of Northern Virginia General staff. I know there was no such entity, but for this exercise it works better if you can envision being in the war room with Generals Lee, Longstreet, Stuart, Hill, and Ewell.

98. MUMPS Solver Fortran 90 package for solving linear systems of equations of the form A*x = b, where the matrix A is sparse and can be either unsymmetric, symmetric positive definite, or general symmetric. Available in various arithmetics (real or complex, single or double), and with or without MPI. http://www.enseeiht.fr/lima/apo/MUMPS/

MUMPS: a MU ltifrontal M assively P arallel sparse direct S olver MUMPS Documentation Availability Credits ... Links September 2005: MUMPS 4.5.3 is available MUMPS MAIN FEATURES Solution of linear systems with symmetric positive definite matrices; general symmetric matrices; general unsymmetric matrices; complex or real arithmetic matrices; Parallel factorization and solve phases uniprocessor MPI/Scalapack free version also available); Iterative refinement and backward error analysis Input matrix in assembled format distributed assembled format elemental format Partial factorization and Schur complement matrix IMPLEMENTATION Distributed Multifrontal Solver; F90, MPI based (C user interface available); Stability based on partial pivoting; Dynamic Distributed Scheduling to accomodate both numerical fill-in and multi-user environment; Use of BLAS, LAPACK, ScaLAPACK. A fully asynchronous distributed solver (VAMPIR trace) Partially funded by CEC ESPRIT IV long term research project No. 20160 (PARASOL) Parasol test problems.

99. Arithmetic Of Algebraic Curves (Stepanov)-Springer Mathematics (general) Book Author SA Stepanov thoroughly investigates the current state of the theory of Diophantine equations and its related methods. Discussions focus on arithmetic http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-40109-22-33292450-0,00

Please enable Javascript in your browser to browse this website. Select your subdiscipline Algebra Analysis Applications Mathematical Biology Mathematical Physics Probability Theory Quantitative Finance Home Mathematics Select a discipline Biomedical Sciences Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Philosophy Popular Science Psychology Public Health Social Sciences Statistics preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900180-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900170-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900190-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900200-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900369-0,00.gif'); preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900344-0,00.gif'); Please select Africa Asia Australia / Oceania Europe Germany North America South America Switzerland United Kingdom All Author/Editor Title ISBN/ISSN Series preloadImage('/sgw/cda/pageitems/designobject/cda_displaydesignobject/0,11978,5-0-17-900050-0,00.gif');

100. KRYPTO -- A Card Game The KRYPTO arithmetic Card Game. From a deck of numbered cards, select 5 (the hand ) and a 6th (the objective ). The task is to find a way to combine http://www.math.niu.edu/~rusin/uses-math/games/krypto/

The KRYPTO "Arithmetic" Card Game From a deck of numbered cards, select 5 (the "hand") and a 6th (the "objective"). The task is to find a way to combine the five (each card used once and only once) using the four basic arithmetic operations to yield the objective value. As of September 2004 the game is available from The Making People Happy Company . (The game was long available from Dale Seymour Publications, who were then bought by Pearson Learning, who carried the product until mid-2004 I think, but then let it go "out of print". Copies continue to appear on Ebay for about five bucks.) It is possible to play Krypto online through the company's website, http://mphgames.com/ A computer simulation is available (it's pretty simple-minded); this is source code for the UBASIC language, an excellent variation of BASIC. A printout of the precisely 500 formulas which can arise when combining five numbers using arithmetic operations. (Sample "formulas" are "x1+x2+x3+x4+x5" and "(x5-x4)-(x2/(x3-x1))"; given five card values x1 through x5, the first formula gives one way to combine them; the second gives as many as 120 ways to combine them, depending on which card is called "x1", or "x2", or...) Also available: working notes and odds and ends from the Maple computations.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 5     81-100 of 102    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20