Hensel's lemma the value of "c" mod 27: if "c" ≡ 1 mod 27 then use "a" = 1, if "c" ≡ 10 mod 27 then use "a" = 4 (since 4 is a root of "f"("x") mod 27), and if "c" ≡ 19 mod 27 then use "a" = 7. (It is not true that every "c" ≡ 1 mod 3 is a 3-adic cube, e.g., 4 is not a 3-adic cube since it is not a cube mod 9.) In a similar way, after some preliminary work Hensel's lemma can be used to show that for any "odd" prime number
Cube (algebra) if and only if one can arrange solid unit cubes into a larger, solid cube. For example, 27 small cubes can be arranged into one larger one with the appearance of a Rubik's Cube, since . The difference between the cubes of consecutive integers can be expressed as follows: or There is no minimum perfect cube, since the cube of a negative integer is negative. For example, . Unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25, 75 and 00 can be