Skip to main content

The RATS Sequence


In Mathematics, one of the amazing concepts is the Reverse-Add-Then-Sort (RATS) Sequence.

The RATS Sequence is a sequence that is formed by reversing, adding, then sorting the digits.

Let's understand this concept in detail:

Form the RATS Sequence

Step 1: Consider any number (must be greater than 0).

Step 2: Reverse the number.

Step 3: Add the original number (considered in Step 1) with the number formed by reversing the number (in Step 2).

Step 4: Sort the number obtained in Step 3 in ascending order. The resultant obtained after sorting the number forms the next sequence after n iteration.

Examples

First Iteration

Step 1: Number 1.

Step 2: Reversing the number gives the resultant 1.

Step 3: Adding the original number 1 (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 1 gives the resultant 2.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 2. Here number 2 forms the next sequence after the first iteration as shown below:

The sequence is: 1, 2, .....

Second Iteration

Step 1: Number 2.

Step 2: Reversing the number gives the resultant 2.

Step 3: Adding the original number (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 2 gives the resultant 4.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 4. Here number 4 forms the next sequence after the second iteration as shown below:

The sequence is: 1, 2, 4, .....

Third Iteration

Step 1: Number 4.

Step 2: Reversing the number gives the resultant 4.

Step 3: Adding the original number (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 4 gives the resultant 8.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 8. Here number 8 forms the next sequence after the third iteration as shown below:

The sequence is: 1, 2, 4, 8, .....

Fourth Iteration

Step 1: Number 8.

Step 2: Reversing the number gives the resultant 8.

Step 3: Adding the original number (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 8 gives the resultant 16.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 16. Here number 16 forms the next sequence after the fourth iteration as shown below:

The sequence is: 1, 2, 4, 8, 16, .....

Fifth Iteration

Step 1: Number 16.

Step 2: Reversing the number 16 gives the resultant 61.

Step 3: Adding the original number 16 (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 61 gives the resultant 77.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 77. Here number 77 forms the next sequence after the fifth iteration as shown below:

The sequence is: 1, 2, 4, 8, 16, 77, .....

Sixth Iteration

Step 1: Number 77.

Step 2: Reversing the number 77 gives the resultant 77.

Step 3: Adding the original number 77 (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 77 gives the resultant 154.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 145. Here number 145 forms the next sequence after the sixth iteration as shown below:

The sequence is: 1, 2, 4, 8, 16, 77, 145, .....

Seventh Iteration

Step 1: Number 145.

Step 2: Reversing the number 145 gives the resultant 541.

Step 3: Adding the original number 145 (considered in Step 1) with the number formed by reversing (in Step 2)  i.e. 541 gives the resultant 686.

Step 4: Sorting the number obtained in Step 3 in ascending order gives the resultant 668. Here number 668 forms the next sequence after the seventh iteration as shown below:

The sequence is: 1, 2, 4, 8, 16, 77, 145, 668, .....

Hope you have understood this amazing concept of the RATS Sequence. You may try yourself using the number 668 from the above sequence and form the next sequence. In case of any query, please feel free to provide your valuable comments.

Comments

Popular posts from this blog

The Number 1.6: Base of Fibonacci Sequence and the Golden Ratio

This post is about the number 1.6 that forms the base of the mathematical concepts Fibonacci sequence and the Golden ratio. For better understanding of this amazing number 1.6, it is important to know about Fibonacci sequence and the Golden ratio. Golden Ratio The  Golden ratio is the ratio of a line segment cut into two pieces of distinct lengths such that the ratio of the longer segment to the shorter segment is equal to the whole segment to that of the longer segment. It is denoted by the symbol Phi [ø]. Suppose there is a line segment AB, and C is any point that divides the line segment AB into two pieces of distinct lengths such that AC is greater than CB. Then, as per the definition, [ø] = AC/CB = AB/AC. The value of the Golden ratio [ø] is 1.6 1803398875 . As you can see, the value of the Golden ratio starts with the number 1.6. For more information on the Golden ratio, see https://theamazingconcepts.blogspot.com/2021/07/the-golden-ratio-key-to-amazing-design....

Universe Secret Code 369 Theory

When it comes to the origin of the universe secret code 369 theory, one name associated with this amazing concept is ‘Nikola Tesla’. Nikola Tesla [10 July 1856 – 07 January 1943] was not only a great inventor / scientist, but also the greatest mind of all the time. He has done a plenty of research throughout his life, and highly recognized for his contributions towards the following : High Voltage, High Frequency Power Experiments Alternating Current (AC) Electricity Supply System Apart from the above-mentioned contributions, he has given ‘Universe Secret Code 369 Theory’ and has called the number 369 – the key to the universe. Now the question that will come to the curious minds is that why Nikola Tesla has called this number the key to the universe. The answer to this question is described in this post. Let start with a specific pattern as shown below: 1 1 + 1 => 2 2 + 2 => 4 4 + 4 => 8 8 + 8 => 16; 1 + 6 => 7 16 + 16 => 32; 3 + 2 => 5 >>>>>>...

Nivenmorphic Number or Harshadmorphic Number

A Nivenmorphic number or Harshadmorphic number is a positive integer whose sum of digits is the last digits of the number i.e. the sum of the digits terminates the number. The Concept Step 1:  Take any positive integer. Step 2:  Calculate the sum of the digits of the number. Step 3:  If the sum of the digits is the last digits of the number i.e. the sum of the digits terminates the number, then the number is a Nivenmorphic number or Harshadmorphic number, else not. For Example Number: 16218 Sum of the digits of the number: [1 + 6 + 2 + 1 + 8] => 18 Here, the sum of the digits 18 is the last digits of the number i.e.  the sum of the digits terminates the number.  Hence, the number 16218 is a Nivenmorphic number or Harshadmorphic number. Hope you have understood this amazing concept of Nivenmorphic number or Harshadmorphic number. You can try yourself using any other positive integer. In case of any issue, kindly pro...