# Java

Not what you're looking for?

I need a Java program source code to process a 3-digit palindromic number. A

palindromic number is any number which has the same value when

read from either direction. The way to solve the problem (by hand)

is as follows:

· Write down any 3-digit number.

· Reverse the digits in the original number and write them under

the original number.

· Add the two numbers.

· If the number is a palindrome, stop.

· If the number is not a palindrome, reverse the digits of the sum

and write them under the sum.

· Add these two numbers.

· Repeat this process until you get a palindrome.

· The number of times that you had to add in order to reach the

palindrome is the palindrome order of your original number.

##### Purchase this Solution

##### Solution Summary

Java is emphasized.

##### Solution Preview

The code is in the attached file. I assume the following:

<br><br>1. Only integers will be input

<br><br>2. The program runs from within Java, not from the command line

<br><br>

<br><br>The code includes one class called Palindrome with three methods:

<br><br>Method one checks if an integer is a ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### C++ Operators

This quiz tests a student's knowledge about C++ operators.

##### Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

##### Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

##### C# variables and classes

This quiz contains questions about C# classes and variables.

##### Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.