Trachtenberg system

Last updated

The Trachtenberg system is a system of rapid mental calculation. The system consists of a number of readily memorized operations that allow one to perform arithmetic computations very quickly. It was developed by the Ukrainian engineer Jakow Trachtenberg in order to keep his mind occupied while being in a Nazi concentration camp.

Contents

The rest of this article presents some methods devised by Trachtenberg. Some of the algorithms Trachtenberg developed are ones for general multiplication, division and addition. Also, the Trachtenberg system includes some specialised methods for multiplying small numbers between 5 and 13.

The section on addition demonstrates an effective method of checking calculations that can also be applied to multiplication.

General multiplication

The method for general multiplication is a method to achieve multiplications with low space complexity, i.e. as few temporary results as possible to be kept in memory. This is achieved by noting that the final digit is completely determined by multiplying the last digit of the multiplicands. This is held as a temporary result. To find the next to last digit, we need everything that influences this digit: The temporary result, the last digit of times the next-to-last digit of , as well as the next-to-last digit of times the last digit of . This calculation is performed, and we have a temporary result that is correct in the final two digits.

In general, for each position in the final result, we sum for all :

People can learn this algorithm and thus multiply four-digit numbers in their head – writing down only the final result. They would write it out starting with the rightmost digit and finishing with the leftmost.

Trachtenberg defined this algorithm with a kind of pairwise multiplication where two digits are multiplied by one digit, essentially only keeping the middle digit of the result. By performing the above algorithm with this pairwise multiplication, even fewer temporary results need to be held.

Example:

To find the first (rightmost) digit of the answer, start at the first digit of the multiplicand

The units digit of is
The first digit of the answer is . The tens digit is ignored.
Pointers for the first digit 2FingerMethod-first digit.png
Pointers for the first digit

To find the second digit of the answer, start at the second digit of the multiplicand:

The units digit of plus the tens digit of plus
The units digit of .
.
The second digit of the answer is and carry to the third digit.
Pointers for the second digit 2FingerMethod-second digit.png
Pointers for the second digit

To find the third digit of the answer, start at the third digit of the multiplicand:

The units digit of plus the tens digit of plus
The units digit of plus the tens digit of plus
The units digit of
The third digit of the answer is and carry to the next digit.
Pointers for the third digit 2FingerMethod-third digit.png
Pointers for the third digit

To find the fourth digit of the answer, start at the fourth digit of the multiplicand:

The units digit of plus the tens digit of plus
The units digit of plus the tens digit of plus
The units digit of plus the tens digit of .
carried from the third digit.
The fourth digit of the answer is and carry to the next digit.

Continue with the same method to obtain the remaining digits.

2 Finger method 2FingerMethod.png
2 Finger method

Trachtenberg called this the 2 Finger Method. The calculations for finding the fourth digit from the example above are illustrated at right. The arrow from the nine will always point to the digit of the multiplicand directly above the digit of the answer you wish to find, with the other arrows each pointing one digit to the right. Each arrow head points to a UT Pair, or Product Pair. The vertical arrow points to the product where we will get the Units digit, and the sloping arrow points to the product where we will get the Tens digits of the Product Pair. If an arrow points to a space with no digit there is no calculation for that arrow. As you solve for each digit you will move each of the arrows over the multiplicand one digit to the left until all of the arrows point to prefixed zeros.

Setting up for Division Trachtenberg Division.png
Setting up for Division

Division in the Trachtenberg System is done much the same as in multiplication but with subtraction instead of addition. Splitting the dividend into smaller Partial Dividends, then dividing this Partial Dividend by only the left-most digit of the divisor will provide the answer one digit at a time. As you solve each digit of the answer you then subtract Product Pairs (UT pairs) and also NT pairs (Number-Tens) from the Partial Dividend to find the next Partial Dividend. The Product Pairs are found between the digits of the answer so far and the divisor. If a subtraction results in a negative number you have to back up one digit and reduce that digit of the answer by one. With enough practice this method can be done in your head.


General addition

A method of adding columns of numbers and accurately checking the result without repeating the first operation. An intermediate sum, in the form of two rows of digits, is produced. The answer is obtained by taking the sum of the intermediate results with an L-shaped algorithm. As a final step, the checking method that is advocated both removes the risk of repeating any original errors and identifies the precise column in which an error occurs all at once. It is based on check (or digit) sums, such as the nines-remainder method.

For the procedure to be effective, the different operations used in each stage must be kept distinct, otherwise there is a risk of interference.

Other multiplication algorithms

When performing any of these multiplication algorithms the following "steps" should be applied.

The answer must be found one digit at a time starting at the least significant digit and moving left. The last calculation is on the leading zero of the multiplicand.

Each digit has a neighbor, i.e., the digit on its right. The rightmost digit's neighbor is the trailing zero.

The 'halve' operation has a particular meaning to the Trachtenberg system. It is intended to mean "half the digit, rounded down" but for speed reasons people following the Trachtenberg system are encouraged to make this halving process instantaneous. So instead of thinking "half of seven is three and a half, so three" it's suggested that one thinks "seven, three". This speeds up calculation considerably. In this same way the tables for subtracting digits from 10 or 9 are to be memorized.

And whenever the rule calls for adding half of the neighbor, always add 5 if the current digit is odd. This makes up for dropping 0.5 in the next digit's calculation.

Numbers and digits (base 10)

Digits and numbers are two different notions. The number T consists of n digits cn ... c1.

Multiplying by 2

Proof

Rule:

  1. Multiply each digit by 2 (with carrying).

Example: 8624 × 2

Working from left to right:

8+8=16,
6+6=12 (carry the 1),
2+2=4
4+4=8;
8624 × 2 = 17248

Example: 76892 × 2

Working from left to right:

7+7=14
6+6=12
8+8=16
9+9=18
2+2=4;
76892 × 2 =153784

Multiplying by 3

Proof

Rule:

  1. Subtract the rightmost digit from 10.
  2. Subtract the remaining digits from 9.
  3. Double the result.
  4. Add half of the neighbor to the right, plus 5 if the digit is odd.
  5. For the leading zero, subtract 2 from half of the neighbor.

Example: 492 × 3 = 1476

Working from right to left:

(10 − 2) × 2 + Half of 0 (0) = 16. Write 6, carry 1.
(9 − 9) × 2 + Half of 2 (1) + 5 (since 9 is odd) + 1 (carried) = 7. Write 7.
(9 − 4) × 2 + Half of 9 (4) = 14. Write 4, carry 1.
Half of 4 (2) − 2 + 1 (carried) = 1. Write 1.

Multiplying by 4

Proof

Rule:

  1. Subtract the right-most digit from 10.
  2. Subtract the remaining digits from 9.
  3. Add half of the neighbor, plus 5 if the digit is odd.
  4. For the leading 0, subtract 1 from half of the neighbor.

Example: 346 × 4 = 1384

Working from right to left:

(10 − 6) + Half of 0 (0) = 4. Write 4.
(9 − 4) + Half of 6 (3) = 8. Write 8.
(9 − 3) + Half of 4 (2) + 5 (since 3 is odd) = 13. Write 3, carry 1.
Half of 3 (1) − 1 + 1 (carried) = 1. Write 1.

Multiplying by 5

Proof

Rule:

  1. Take half of the neighbor, then, if the current digit is odd, add 5.

Example: 42×5=210

Half of 2's neighbor, the trailing zero, is 0.
Half of 4's neighbor is 1.
Half of the leading zero's neighbor is 2.
43×5 = 215
Half of 3's neighbor is 0, plus 5 because 3 is odd, is 5.
Half of 4's neighbor is 1.
Half of the leading zero's neighbor is 2.
93×5=465
Half of 3's neighbor is 0, plus 5 because 3 is odd, is 5.
Half of 9's neighbor is 1, plus 5 because 9 is odd, is 6.
Half of the leading zero's neighbor is 4.

Multiplying by 6

Proof

Rule:

  1. Add half of the neighbor to each digit. If the current digit is odd, add 5.

Example: 357 × 6 = 2142

Working right to left:

7 has no neighbor, add 5 (since 7 is odd) = 12. Write 2, carry the 1.
5 + half of 7 (3) + 5 (since the starting digit 5 is odd) + 1 (carried) = 14. Write 4, carry the 1.
3 + half of 5 (2) + 5 (since 3 is odd) + 1 (carried) = 11. Write 1, carry 1.
0 + half of 3 (1) + 1 (carried) = 2. Write 2.

Multiplying by 7

Proof

Rule:

  1. Double each digit.
  2. Add half of its neighbor to the right (dropping decimals, if any). The neighbor of the units position is 0.
  3. If the base-digit is even add 0 otherwise add 5.
  4. Add in any carryover from the previous step.

Example: 693 × 7 = 4,851

Working from right to left:

(3×2) + 0 + 5 + 0 = 11 = carryover 1, result 1.
(9×2) + 1 + 5 + 1 = 25 = carryover 2, result 5.
(6×2) + 4 + 0 + 2 = 18 = carryover 1, result 8.
(0×2) + 3 + 0 + 1 = 4 = result 4.

Multiplying by 8

Proof

Rule:

  1. Subtract right-most digit from 10.
    1. Subtract the remaining digits from 9.
  2. Double the result.
  3. Add the neighbor.
  4. For the leading zero, subtract 2 from the neighbor.

Example: 456 × 8 = 3648

Working from right to left:

(10 − 6) × 2 + 0 = 8. Write 8.
(9 − 5) × 2 + 6 = 14, Write 4, carry 1.
(9 − 4) × 2 + 5 + 1 (carried) = 16. Write 6, carry 1.
4 − 2 + 1 (carried) = 3. Write 3.

Multiplying by 9

Proof

Rule:

  1. Subtract the right-most digit from 10.
    1. Subtract the remaining digits from 9.
  2. Add the neighbor to the sum
  3. For the leading zero, subtract 1 from the neighbor.

For rules 9, 8, 4, and 3 only the first digit is subtracted from 10. After that each digit is subtracted from nine instead.

Example: 2,130 × 9 = 19,170

Working from right to left:

(10 − 0) + 0 = 10. Write 0, carry 1.
(9 − 3) + 0 + 1 (carried) = 7. Write 7.
(9 − 1) + 3 = 11. Write 1, carry 1.
(9 − 2) + 1 + 1 (carried) = 9. Write 9.
2 − 1 = 1. Write 1.

Multiplying by 10

Add 0 (zero) as the rightmost digit.

Proof

Multiplying by 11

Proof

Rule:

  1. Add the digit to its neighbor. (By "neighbor" we mean the digit on the right.)

Example:

(0 + 3) (3 + 4) (4 + 2) (2 + 5) (5 + 0)
3 7 6 7 5

To illustrate:

11=10+1

Thus,

Multiplying by 12

Proof

Rule: to multiply by 12:
Starting from the rightmost digit, double each digit and add the neighbor. (The "neighbor" is the digit on the right.)

If the answer is greater than a single digit, simply carry over the extra digit (which will be a 1 or 2) to the next operation. The remaining digit is one digit of the final result.

Example:

Determine neighbors in the multiplicand 0316:

Multiplying by 13

Proof

Publications

The book contains specific algebraic explanations for each of the above operations.

Most of the information in this article is from the original book.

The algorithms/operations for multiplication, etc., can be expressed in other more compact ways that the book does not specify, despite the chapter on algebraic description. [lower-alpha 1]

Other systems

There are many other methods of calculation in mental mathematics. The list below shows a few other methods of calculating, though they may not be entirely mental.

Notes

  1. ↑ All of this information is from an original book published and printed in 1960. The original book has seven full Chapters and is 270 pages long. The chapter titles are as follows. The numerous sub-categories in each chapter are not listed. The Trachtenberg speed system of basic mathematics
    • Chapter 1 Tables or no tables
    • Chapter 2 Rapid multiplication by the direct method
    • Chapter 3 Speed multiplication-"two-finger" method
    • Chapter 4 Addition and the right answer
    • Chapter 5 Division – Speed and accuracy
    • Chapter 6 Squares and square roots
    • Chapter 7 Algebraic description of the method
    Quotes:
    • "A revolutionary new method for high-speed multiplication, division, addition, subtraction and square root." (1960)
    • "The best selling method for high-speed multiplication, division, addition, subtraction and square root – without a calculator." (Reprinted 2009)
    • Multiplication is done without multiplication tables
    • "Can you multiply 5132437201 times 4522736502785 in seventy seconds?" "One young boy (grammar school-no calculator) did--successfully--by using The Trachtenberg Speed System of Basic Mathematics"
    • Jakow Trachtenberg (its founder) escaped from Hitler's Germany from an active institution toward the close of WWII. Professor Trachtenberg fled to Germany when the czarist regime was overthrown in his homeland, Russia, and lived there peacefully until his mid-thirties when his anti-Hitler attitudes forced him to flee again. He was a fugitive and when captured spent a total of seven years in various concentration camps. It was during these years that Professor Trachtenberg devised the system of speed mathematics. Most of his work was done without pen or paper. Therefore most of the techniques can be performed mentally.

Related Research Articles

<span class="mw-page-title-main">Chinese remainder theorem</span> Theorem for solving simultaneous congruences

In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer n by several integers, then one can determine uniquely the remainder of the division of n by the product of these integers, under the condition that the divisors are pairwise coprime.

<span class="mw-page-title-main">Quadratic reciprocity</span> Gives conditions for the solvability of quadratic equations modulo prime numbers

In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard statement is:

A multiplication algorithm is an algorithm to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Numerous algorithms are known and there has been much research into the topic.

In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality is always true in elementary algebra. For example, in elementary arithmetic, one has Therefore, one would say that multiplication distributes over addition.

The quater-imaginary numeral system is a numeral system, first proposed by Donald Knuth in 1960. Unlike standard numeral systems, which use an integer as their bases, it uses the imaginary number as its base. It is able to uniquely represent every complex number using only the digits 0, 1, 2, and 3. Numbers less than zero, which are ordinarily represented with a minus sign, are representable as digit strings in quater-imaginary; for example, the number −1 is represented as "103" in quater-imaginary notation.

<span class="mw-page-title-main">Mental calculation</span> Arithmetical calculations using only the human brain

Mental calculation consists of arithmetical calculations using only the human brain, with no help from any supplies or devices such as a calculator. People may use mental calculation when computing tools are not available, when it is faster than other means of calculation, or even in a competitive context. Mental calculation often involves the use of specific techniques devised for specific types of problems. People with unusually high ability to perform mental calculations are called mental calculators or lightning calculators.

Casting out nines is any of three arithmetical procedures:

In modular arithmetic computation, Montgomery modular multiplication, more commonly referred to as Montgomery multiplication, is a method for performing fast modular multiplication. It was introduced in 1985 by the American mathematician Peter L. Montgomery.

A divisibility rule is a shorthand and useful way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix, or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers. Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in Scientific American.

In mathematical notation for numbers, a signed-digit representation is a positional numeral system with a set of signed digits used to encode the integers.

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, called the modulus of the operation.

In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number p, then this root can be lifted to a unique root modulo any higher power of p. More generally, if a polynomial factors modulo p into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of p.

The Blum–Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is a probabilistic, semantically secure cryptosystem with a constant-size ciphertext expansion. The encryption algorithm implements an XOR-based stream cipher using the Blum-Blum-Shub (BBS) pseudo-random number generator to generate the keystream. Decryption is accomplished by manipulating the final state of the BBS generator using the private key, in order to find the initial seed and reconstruct the keystream.

Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. The resulting computations are left in an encrypted form which, when decrypted, result in an output that is identical to that produced had the operations been performed on the unencrypted data. Homomorphic encryption can be used for privacy-preserving outsourced storage and computation. This allows data to be encrypted and outsourced to commercial cloud environments for processing, all while encrypted.

In mathematics, a Witt vector is an infinite sequence of elements of a commutative ring. Ernst Witt showed how to put a ring structure on the set of Witt vectors, in such a way that the ring of Witt vectors over the finite field of prime order p is isomorphic to , the ring of p-adic integers. They have a highly non-intuitive structure upon first glance because their additive and multiplicative structure depends on an infinite set of recursive formulas which do not behave like addition and multiplication formulas for standard p-adic integers.

Cubic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x3 ≡ p (mod q) is solvable; the word "reciprocity" comes from the form of the main theorem, which states that if p and q are primary numbers in the ring of Eisenstein integers, both coprime to 3, the congruence x3 ≡ p is solvable if and only if x3 ≡ q is solvable.

The digital root of a natural number in a given radix is the value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached. For example, in base 10, the digital root of the number 12345 is 6 because the sum of the digits in the number is 1 + 2 + 3 + 4 + 5 = 15, then the addition process is repeated again for the resulting number 15, so that the sum of 1 + 5 equals 6, which is the digital root of that number. In base 10, this is equivalent to taking the remainder upon division by 9, which allows it to be used as a divisibility rule.

A repeating decimal or recurring decimal is a decimal representation of a number whose digits are eventually periodic ; if this sequence consists only of zeros, the decimal is said to be terminating, and is not considered as repeating.

In modular arithmetic, Barrett reduction is a reduction algorithm introduced in 1986 by P.D. Barrett.

In mathematics, a profinite integer is an element of the ring

References

  1. ↑ Trachtenberg, Jakow (1960). Cutler, Ann (ed.). The Trachtenberg Speed System of Basic Mathematics. Translated by A. Cutler, R. McShane. Doubleday and Company, Inc. p. 270. 1962 edition: ISBN   9780285629165.
  2. ↑ @GiftedtheMovie (9 March 2017). "Hobbies include playing with legos and learning the Trachtenberg system 👷‍♀️📚✏️ @McKennaGraceful is Mary // #GiftedMovie" (Tweet) – via Twitter.

Further reading

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.