Live briefing
Everything about Transposable integer
Number that permute or shift cyclically when multiplied by another number
In mathematics, the transposable integers are integers that permute or shift cyclically when they are multiplied by another integer. Examples are:142857 × 3 = 428571 142857 × 5 = 714285 128205 × 4 = 512820 076923 × 9 = 692307 Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Transposable integerA 5-minute orientation
- Pick up a classic book: Coding the MatrixThe most-reprinted book on the subject
- Read the landmark paper: Generalized Transposable IntegersCited 0 times
- Go sideways: Repeating decimalA closely related topic
- Go sideways: 142857A closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
- General
- Fraction method
- Direct representation
- Cyclic permutation by multiplication
- Proof of formula for cyclical right shift operation
- Proof of formula for cyclical left shift operation
- Shifting an integer cyclically
- Parasitic numbers
- Shifting right cyclically by double positions
- Shifting left cyclically by single position
- Shifting left cyclically by double positions
- Other bases
🏆 Landmark papers (most cited)
đź“š Books worth reading
Coding the MatrixPhilip N. Klein · 2013
Python Basics · 2019
MATLAB for engineering and the life sciencesJoseph Vincent Tranquillo · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Repeating decimal A repeating decimal or recurring decimal is a decimal representation of a number whose digits are eventually periodic (that is, after some place, the same…
- 142857 142,857 is the natural number following 142,856 and preceding 142,858. It is both a Kaprekar number and a cyclic number. 142857 is the best-known cyclic…
- Cyclic number A cyclic number is an integer for which cyclic permutations of the digits are successive integer multiples of the number. The most widely known is the…
- 49 (number) 49 (forty-nine) is the natural number following 48 and preceding 50. 49 is the square of the prime number seven. It appears in the Padovan sequence. Along…
- Euclidean algorithm In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers…
- Extended Euclidean algorithm In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest…
- Modular arithmetic In mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when…
- Greatest common divisor In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the…