**(Palindromic prime)** A *palindromic prime* is a prime number and also palindromic. For example, 131 is a prime and also a palindromic prime, as are 313 and 757. Write a program that displays the first 100 palindromic prime numbers. Display 10 numbers per line, separated by exactly one space, as follows: DEVAMINI OKU »

**(Convert milliseconds to hours, minutes, and seconds)** Write a method that converts milliseconds to hours, minutes and seconds using the following header:

public static String convertMillis(long millis)

The method returns a string as ** hours:minutes:seconds**. DEVAMINI OKU »

**(Math: approximate the square root)** There are several techniques for implementing the sqrt method in the Math class. On such technique is known as the Babylonian method. It approximates the square root of a number, **n**, by repeatedly performing a calculation using the following formula:

**nextGues** = (**lastGuess** + **n** / **lastGuess**) / 2 DEVAMINI OKU »

**(Decimal to Binary)** Write a program that prompts the user to enter a decimal integer and displays its corresponding binary value. Don’t use Java’s Integer.toBinaryString(int) in this program. Your program must have the following method.

*public static String toBinary(int n)* DEVAMINI OKU »

**(Celsius to Fahrenheit conversion)** Write a program that displays a table of temperatures from 0C to 20C and their Fahrenheit equivalents. The formula for converting from the Celsius scale to the Fahrenheit scale is

F= (9/5) C + 32

where F is the temperature in Fahrenheit and C is the temperature in Celsius. DEVAMINI OKU »

**(Perfect Numbers)** A positive integer is called a perfect number if it is equal to the sum of all of its positive divisors, excluding itself. For example, 6 is the first perfect number because 6=3+2+1. The next is 28=14+7+4+2+1. There are four perfect numbers less than 10000. Write a program to find all these four numbers. DEVAMINI OKU »

**(Occurrence of max numbers)** Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4. DEVAMINI OKU »

**(Geometry: two rectangles)** Write a program that prompts the user to enter the center x-, y-coordinates, width, and height of two rectangles and determines whether the second rectangle is inside the first or overlaps with the first. (You must use Scanner class to get input from user.) DEVAMINI OKU »

**(Geometry: point in a rectangle?)** Write a program that prompts the user to enter a point (x,y) and checks whether the point is within the rectangle centered at (0,0) with width 10 and height 5. For example (2,2) is inside the rectangle and (6,4) is outside the rectangle. (Hint: A point is in the rectangle if its horizontal distance to (0,0) is less than or equal to 10/2 and its vertical distance is less than or equal to 5.0/2.) DEVAMINI OKU »

**(Compute the area of a triangle) ** Write a program that reads three edges for a triangle and computes the perimeter if the input is valid. Otherwise display that the input is invalid. The input is valid if the sum of every pair of two edges is greater than the remaining edge. (You must use JOptionPane class to get input from user.) DEVAMINI OKU »