Skip to main content

Kaprekar Constant 495 for Three-digit Number

Dattatreya Ramchandra Kaprekar (D. R. Kaprekar; 1905 – 1986) was an Indian mathematician who discovered several classes of natural numbers including Kaprekar Constant.

The number 495 is called Kaprekar Constant for three-digit number.

Why is the number 495 called Kaprekar Constant?

In 1949, D. R. Kaprekar discovered an interesting property of the number 495 through the mathematical calculations.

D. R. Kaprekar observed that when any three-digit number of non-identical digits (not all digits are same) is arranged in two parts – highest number and lowest number, and difference is calculated using subtraction method, then the end-result will be always 495.

If the process is continued even after getting the end-result 495, then the end-result will be always 495 at each Iteration, therefore the number 495 is known as Kaprekar Constant.

Steps to Follow

  1. Take any three-digit number with different digits.
  2. Form the highest number and lowest number from this three-digit number.
  3. Find the difference using subtraction method, and the end-result will be 495 [First Iteration].
  4. If the end-result is other than 495 in Step 3, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 3.
  5. Form the highest number and lowest number from this three-digit number.
  6. Find the difference using subtraction method, and the end-result will be 495 [Second Iteration].
  7. If the end-result is other than 495 in Step 6, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 6.
  8. Form the highest number and lowest number from this three-digit number.
  9. Find the difference using subtraction method, and the end-result will be 495 [Third Iteration].
  10. If the end-result is other than 495 in Step 9, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 9.
  11. Form the highest number and lowest number from this three-digit number.
  12. Find the difference using subtraction method, and the end-result will be 495 [Fourth Iteration].
  13. If the end-result is other than 495 in Step 12, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 12.
  14. Form the highest number and lowest number from this three-digit number.
  15. Find the difference using subtraction method, and the end-result will be 495 [Fifth Iteration].
  16. If the end-result is other than 495 in Step 15, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 15.
  17. Form the highest number and lowest number from this three-digit number.
  18. Find the difference using subtraction method, and the end-result will be 495 [Sixth Iteration].
  19. If the end-result is other than 495 in Step 18, then again follow the process from Steps 1 – 3. But in this case, three-digit number to consider will be the result obtained in Step 18.
  20. Form the highest number and lowest number from this three-digit number.
  21. Find the difference using subtraction method, and the end-result will be 495 [Seventh Iteration]. Repeat this process if the end-result is other than the number 495.

Note

Kaprekar Constant fits for any three-digit number excluding 111, 222, 333, 444, 555, 666, 777, 888, 999.

Example

  1. Take three-digit number 123.
  2. Highest and lowest numbers formed from this three-digit number are 321 and 123, respectively.
  3. Difference after subtraction method (321 – 123) is 198 [First Iteration].
  4. The end-result in Step 3 is other than 495, so follow the process from Steps 1 – 3. In this case, three-digit number to consider is 198.
  5. Highest and lowest numbers formed from this three-digit number are 891 and 189, respectively.
  6. Difference after subtraction method (891 – 189) is 702 [Second Iteration].
  7. The end-result in Step 6 is other than 495, so follow the process from Steps 1 – 3. In this case, three-digit number to consider is 702.
  8. Highest and lowest numbers formed from this three-digit number are 720 and 027, respectively.
  9. Difference after subtraction method (720 – 027) is 693 [Third Iteration].
  10. The end-result in Step 9 is other than 495, so follow the process from Steps 1 – 3. In this case, three-digit number to consider is 693.
  11. Highest and lowest numbers formed from this three-digit number are 963 and 369, respectively.
  12. Difference after subtraction method (963 – 369) is 594 [Fourth Iteration].
  13. The end-result in Step 12 is other than 495, so follow the process from Steps 1 – 3. In this case, three-digit number to consider is 594.
  14. Highest and lowest numbers formed from this three-digit number are 954 and 459, respectively.
  15. Difference after subtraction method (954 – 459) is 495 [Fifth Iteration].

In this example, the end-result 495 has been obtained in Fifth Iteration.

Hope you have understood the above-mentioned steps along with this example. You can try yourself using any other three-digit number. In case of any issue, kindly provide your valuable comments.

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

The 3n + 1 Problem or Collatz Problem

The 3n + 1 Problem, also known as the 3n + 1 Conjecture or Collatz Problem or Collatz Conjecture, is that if any positive integer  n  is iteratively operated using two simple rules:  Addition  and  Division , then the end-result always leads to the number 1. The Rules Rule 1 [Addition]:  If the number n is odd, then triple it and add 1. Rule 2 [Division]:  If the number n is even, then divide it by 2. Steps to Follow Step 1:  Take any positive integer n. Step 2:  Check whether the integer is odd or even. Step 3:  If the integer is odd, then triple it and add 1. Step 4:  If the integer is even, then divide it by 2. Step 5:  Repeat this procedure. Step 6:  The end-result always leads to the number 1. For Example Integer n = 5 5 is an odd number, so triple it and add 1. The value of n = 16. 16 is an even number, so divide it by 2. The value of n = 8. 8 is an even number, so divide it by 2. The va...
2 comments
Read more

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 >>>>>>...
Post a Comment
Read more

The Black Hole Number 123

You might have heard the term black hole . A black hole is a region of spacetime where gravity is so strong that even light or electromagnetic waves cannot escape it. In Mathematics, the number 123 is called the black hole number. Let’s understand this amazing concept in detail. The Procedure Step 1 : Consider any number . Step 2 : Count the number of even digits. Step 3 : Count the number of odd digits. Step 4 : Count the number of total digits. Step 5 : Consider the number (" even " " odd " " total ") obtained in the n   iteration. Step 6 : Repeat the steps ( Step 1 to Step 5 ) after every iteration until you get the number (" even " " odd " " total ") as  123 . Note : If you repeat the steps ( Step 1 to Step 5 ) even after getting the number 123, you will obtain the same number i.e. 123 after every iteration. Example First Iteration Step 1 : Number 1234567890 . Step 2 : Number of  even  digits = 5 . Step 3 : Number of...
1 comment
Read more