OpenStudy (anonymous):

how to solve this

4 years ago
OpenStudy (anonymous):

i think you'd definitely need to code this to do it efficiently (have a computer do it). its very interesting though, lol.

4 years ago
OpenStudy (anonymous):

they don't ask for that. they say to convert the number you get after subtracting into 2 numbers of ascending/descending ordered digits

4 years ago
OpenStudy (anonymous):

i think you're misinterpreting the problem. it is pretty simple, it just shouldn't be done by hand. what is wrong with the problem?

4 years ago
OpenStudy (raden):

can we use the repeating number ?

4 years ago
OpenStudy (raden):

or all digits must be different ?

4 years ago
OpenStudy (loser66):

it's really interesting problem. but sorry, I don't know.

4 years ago
OpenStudy (loser66):

my logic is let the last result is a,b,c,d and a.>b>c>d so after rearrange in decreasing and increasing order I have abcd - dcba = 6174

4 years ago
OpenStudy (loser66):

|dw:1369861949998:dw|

4 years ago