The following is a valid algorithm to test for divisibility by 11. STEP 1 Sum the digits in the odd potions counting from the left (first, third,..., etc.). STEP 2 Then sum the remaining digits. STEP 3 If the difference between the two sums is divisible by 11, then so is the original number. Otherwise it is not. (Ceilings and Floors ) In the Java programming language, the following Math class methods are defined. For example, Math.max (3.95, 10.3) returns (equals) 10.3 since it is the larger of the two given numbers. Solution True.