Global Information Lookup Global Information

Trachtenberg system information


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 Russian engineer Jakow Trachtenberg in order to keep his mind occupied while being in a Nazi concentration camp.

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 (but shown here is 2–12).

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

and 22 Related for: Trachtenberg system information

Request time (Page generated in 0.8028 seconds.)

Trachtenberg system

Last Update:

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...

Word Count : 6481

Trachtenberg

Last Update:

Look up trachtenberg in Wiktionary, the free dictionary. Trachtenberg (Russian/Ukrainian: Трахтенберг, Yiddish: טראַכֿטנבערג; Hebrew: טרכטנברג, is a surname...

Word Count : 369

Jakow Trachtenberg

Last Update:

Jakow Trachtenberg (17 June 1888 – 26 October 1951) was a mathematician who developed the mental calculation techniques called the Trachtenberg system. He...

Word Count : 228

Sieve of Eratosthenes

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 3035

Karatsuba algorithm

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 2044

Vedic Mathematics

Last Update:

recorded habit of experimentation with numbers. Similar systems include the Trachtenberg system or the techniques mentioned in Lester Meyers's 1947 book...

Word Count : 2651

Discrete logarithm

Last Update:

difficulty of both problems has been used to construct various cryptographic systems. There exist groups for which computing discrete logarithms is apparently...

Word Count : 2042

Greatest common divisor

Last Update:

ideal as {a, b}. This convention is followed by many computer algebra systems. Nonetheless, some authors leave gcd(0, 0) undefined. The GCD of a and...

Word Count : 4674

Multiplication algorithm

Last Update:

Number-theoretic transform Prosthaphaeresis Slide rule Trachtenberg system Residue number system § Multiplication for another fast multiplication algorithm...

Word Count : 6422

AKS primality test

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 2448

General number field sieve

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 1786

Fermat primality test

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 1134

Generation of primes

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 1154

Trial division

Last Update:

publicly known method in a useful time period on any available computer system or computer cluster such as supercomputers and computer grids. The largest...

Word Count : 1345

Integer factorization

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 2924

Ancient Egyptian multiplication

Last Update:

fraction Egyptian mathematics Multiplication algorithms Binary numeral system Neugebauer, Otto (1969) [1957]. The Exact Sciences in Antiquity (2 ed.)...

Word Count : 1425

Integer square root

Last Update:

step unnecessary. See Methods of computing square roots § Binary numeral system (base 2) for an example. Some programming languages dedicate an explicit...

Word Count : 2410

Extended Euclidean algorithm

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 4452

Primality test

Last Update:

"Riemann's Hypothesis and Tests for Primality". Journal of Computer and System Sciences. 13 (3): 300–317. doi:10.1016/S0022-0000(76)80043-8. Agrawal, Manindra;...

Word Count : 3792

Modular exponentiation

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 2802

Sieve of Atkin

Last Update:

relation (LLL; KZ) Modular exponentiation Montgomery reduction Schoof Trachtenberg system Italics indicate that algorithm is for numbers of special forms...

Word Count : 1995

Computational number theory

Last Update:

and explicit aspects of the Langlands program. Magma computer algebra system SageMath Number Theory Library PARI/GP Fast Library for Number Theory Eric...

Word Count : 479

PDF Search Engine © AllGlobal.net