Figuring Out N[sub]x: A Guide

[Cbray]

Tell me how to figure this out:
Let N₀ denote a three digit number with not all digits identical. Arrange the digits in descending order and subtract from this number the number that is obtained by arranging the digits in ascending order. Let N₁ denote the result, written as a three digit number (e.g., 42 is written as 042). Now perform the same operation on N₁ that you performed on N₀ and let N₂ denote the result. Repeat to construct the sequence N₃, N₄,...

(a) Show that there exists a number N_x such that if N₀=N_x then N₁=N_x

(b) Show that N_{6=Nx for any initial number N0}

 

[cepheid]

Tell me how to figure this out: Let (..) = subscript
Let N(0) denote a three digit number with not all digits identical. Arrange the digits in descending order and subtract from this number the number that is obtained by arranging the digits in ascending order. Let N(1) denote the result, written as a three digit number (e.g., 42 is written as 042). Now perform the same operation on N(1) that you performed on N(0) and let N(2) denote the result. Repeat to construct the sequence N(3), N(4),...

(a) Show that there exists a number N(x) such that if N(0)=N(x) then N(1)=N(x)

(b) Show that N(6)=N(x) for any initial number N(0)

Try using the buttons above the reply box that are marked X² and X₂ to get superscripts and subscripts respectively, or equivalently, you do it manually by surrounding text you want subscripted or superscripted in [noparse] [/noparse] tags and [noparse] [/noparse] tags respectively.

You will find it very useful that, by definition, any three-digit decimal number is constructed as:

a₂10² + a₁10¹ + a₀10⁰

where the coefficients a₂, a₁, and a₀ are the first, second, and third digits respectively. You'll have to decide on an arbitrary ordering for the coefficients (i.e. which one is the largest, middle, and smallest).

 

[Cbray]

Let z be the greatest digit, and let x be the smallest.
Therefore, x<y<z
Then if we subtract the largest number formed from the smallest number formed, we have
zyx
xyz-
=ABC

Since x<z
C=10+x-z

And,
B=10+y-1-y

Also,
A=z-1-x

z=9,y=5,x=4

z(100)+y(10)+x-(x(100)-y(10)-z)=(z-x)(99)
=495

Hence we only need to check 9 possible numbers: 99,198,297,296,495,594,693,792 and 891 (10(99)=990 which is the same as 99)

 

[NascentOxygen]

Tell me how to figure this out: Let (..) = subscript
Let N(0) denote a three digit number with not all digits identical. Arrange the digits in descending order and subtract from this number the number that is obtained by arranging the digits in ascending order. Let N(1) denote the result, written as a three digit number (e.g., 42 is written as 042).

Ndescend = 100*a + 10*b + c
Nascend = 100*c + 10*b + a

Nd - Na = 99*a - 99*c = 99 * (a - c) ... this is your N(1)

There, that's a start. :shy:

Chucking in various values for a and c, remembering that a>c,
we generate numbers such as 396, 495, 198, 099, 594, etc.

These look like following a pattern, when rearranged in descending order:
1st digit, call it a: always 9
2nd digit, call it b: 5 or 6 or 7 or 8 or 9
3rd digit, call it c: equal to (9-b)

So the number with digits in descending order is: 100*9 + 10 * b + (9-b)
which happens to simplify to: 900 + 9 b + 9 = 909 + 9 * b

If b is 5, it comes to 954
if b is 6, 963
if b is 7, 972
if b is 8, 981
if b is 9, 990

and if arranged in ascending order, these would each become: 459, 369, etc.

Now, subtract the ascending form from the descending form,
954 - 459 = 495
963 - 369 = 594
972 - 279 = 693
981 - 189 = 792
990 - 099 = 891

When these numbers are arranged in descending order, we have 954, 954, 963, 972, 981
and in descending order, 459, 459, 369, 279, 189. ... these are your N(2)



Subtracting the ascending form from the descending form, ...

I'm not sure that I can see where this is heading, I'm just playing with numbers so I'll end here.