write a program to print the highest palindrome value that is the multiplication of two numbers lies between 100 to 1000.

Featured Replies

- 1
Part1: see bguild's answer. Part2: If you start by finding palindromes then you are left with the problem of finding out if each palindrome is the product of of two numbers 100-999 (not so easy). If you start by multiplying every possible combination of two numbers 100-999. that's only 500,000 … Read More

- 1
System.nanoTime() returns the time in nanoSeconds. Take its value before you start and after you finish and subtract the two. Read More

- 2
Below is my result (forgot to add). Not very fast though :P >Mininum:100 | Maximum:1000 Found at 993 x 913 = 906609 Total time: 16 millisecond(s) Mininum:100 | Maximum:10000 Found at 9999 x 9901 = 99000099 Total time: 6 millisecond(s) Mininum:100 | Maximum:100000 Found at 99979 x 99681 = 9966006699 … Read More

This topic has been dead for over six months. Start a new discussion instead.

Recommended Topics