1238.sagews

def succeed(n):
    N=n.digits()
    print "Step 1:"
    print "n --> ",N
    for i in range(0,len(N)):
        print "n_",i," = ",N[i],",",
    print
    k=len(N)
    print "k = ",k
    Nprime=N
    Nprime.append(0)
    print 
    print "**********************************************"
    print
    print "Step 2:"
    for i in range(0,len(Nprime)):
        L=[]
        for p in range(1000,1000000):
            L.append(p)
        print "n'_",i," = ",Nprime[i],",",
    print 
    print
    print "**********************************************"
    print
    print "Step 3:"
    Nprimeprime = Nprime
    i=0
    while Nprime[i]==9:
        Nprimeprime[i]=0
        i=i+1
    Nprimeprime[i] = Nprime[i]+1
    print Nprimeprime
    for i in range(0,len(Nprimeprime)):
        L=[]
        for p in range(1000,1000000):
            L.append(p)
        print "n'_",i," = ",Nprimeprime[i],",",
    print
    print
    print "Step 4:  Combine"
    print
    print "sum(n''_i * 10^i) = ",sum(Nprimeprime[i]*10^i for i in range(0,len(Nprimeprime)))
    print
    print "**********************************************"
    print
    print "The successor of ",n," is ..... n+ = ",
    return(sum(Nprimeprime[i]*10^i for i in range(0,len(Nprimeprime))))

succeed(34912999)

Step 1: n --> [9, 9, 9, 2, 1, 9, 4, 3] n_ 0 = 9 , n_ 1 = 9 , n_ 2 = 9 , n_ 3 = 2 , n_ 4 = 1 , n_ 5 = 9 , n_ 6 = 4 , n_ 7 = 3 , k = 8 ********************************************** Step 2: n'_ 0 = 9 , n'_ 1 = 9 , n'_ 2 = 9 , n'_ 3 = 2 , n'_ 4 = 1 , n'_ 5 = 9 , n'_ 6 = 4 , n'_ 7 = 3 , n'_ 8 = 0 , ********************************************** Step 3: [0, 0, 0, 3, 1, 9, 4, 3, 0] n'_ 0 = 0 , n'_ 1 = 0 , n'_ 2 = 0 , n'_ 3 = 3 , n'_ 4 = 1 , n'_ 5 = 9 , n'_ 6 = 4 , n'_ 7 = 3 , n'_ 8 = 0 , Step 4: Combine sum(n''_i * 10^i) = 34913000 ********************************************** The successor of 34912999 is ..... n+ = 34913000