Lecture Notes on 28 Sep 2009


# This program finds the only non-palindromic number
# whose cube is palindromic

def reverseNum (n):
  revNum = 0
  while (n > 0):
    revNum = revNum * 10 + (n % 10)
    n = n / 10

  return revNum

def main():
  count = 1000
  while (count <= 9999):
    if (count != reverseNum(count)):
      count3 = count * count * count
      if (count3 == reverseNum(count3)):
        print count, "  ", count3
	break
    count = count + 1

main()

# This program finds the lucky house and the last house on the street

def main():
  lastL = 0
  lastR = 0
  sumL = 0
  sumR = 0
  lastHouse = 10000

  while (lastR <= lastHouse):
    lastL = lastL + 1
    sumL = sumL + lastL
    lastR = lastL + 2
    sumR = lastR

    while (sumR < sumL):
      lastR = lastR + 1
      sumR = sumR + lastR

    if (sumL == sumR):
      lucky = lastL + 1
      print lucky, "  ", lastR

main()