Kaprekar's Constant Java Coding Challenge | Edabit | How'd You Code That?
Kaprekar’s Constant
Named after Dattatreya Ramchandra Kaprekar, the Kaprekar Constant shows that the number 6-1-7-4, is reached as one repeatedly subtracts the highest and lowest numbers that can be constructed from a set of four digits that are not all identical.
For example, take the number 3,524. Arrange the digits in descending order. You get 5-4-3-2. Next, arrange the digits in ascending order. You get 2-3-4-5. Now, subtract the two numbers, and you get 3-0-8-7. Now, taking the number 3-0-8-7, and arranging the numbers in descending order, you get 8-7-3-0. Arranging the numbers in ascending order results in 0-3-7-8. Subtracting the two numbers produces 8-3-5-2. Take 8-3-5-2 and arrange the digits in descending order. You get 8-5-3-2. Arranging the number in ascending order results in 2-3-5-8. Subtracting the two numbers produces 6-1-7-4. And there you have it, Kaprekar’s Constant.
Closed Captions/Subtitles - [email protected]
Video Editing - [email protected]
Song: Stardust - Ikson (Vlog No Copyright Music)
Music promoted by Vlog No Copyright Music.
/ ikson
Watch video Kaprekar's Constant Java Coding Challenge | Edabit | How'd You Code That? online without registration, duration hours minute second in high quality. This video was added by user Ed Clark 04 April 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 451 once and liked it 18 people.