Project Euler – Problem 55

Problem 55:
A Lychrel number is a natural number which cannot form a palindrome through the iterative process of repeatedly reversing its base 10 digits and adding the resulting numbers.

Assume that after 50 steps of running the above iterative process, the number is deemed Lychrel…

How many Lychrel numbers are there below ten-thousand?

package runner;

import java.math.BigInteger;

class runner
	public static boolean isPalindrome(String s){
		for(int j=0;j-1;j--){
		return x.toString();
	public static void main (String[] args) throws java.lang.Exception
		long time = System.currentTimeMillis();
		boolean[] isLychrel = new boolean[10000];
		for(int n=0;n01 (where 01 !->10)
					if(reverseSum.toString().length() == sumString.length())
						removal[k++] = reverseSum.intValue();
				sum = sum.add(reverseSum);
				sumString = sum.toString();
					foundPalin = true;
				for(int i=0;i