MHB Is the Product \(abc(a^3-b^3)(b^3-c^3)(c^3-a^3)\) Divisible by 7?

  • Thread starter Thread starter kaliprasad
  • Start date Start date
  • Tags Tags
    Integer Product
kaliprasad
Gold Member
MHB
Messages
1,333
Reaction score
0
Show that for integer a,b,c the product $abc(a^3-b^3)(b^3-c^3)(c^3-a^3)$ is divisible by 7
 
Mathematics news on Phys.org
kaliprasad said:
Show that for integer a,b,c the product $abc(a^3-b^3)(b^3-c^3)(c^3-a^3)$ is divisible by 7
If $a$, $b$, or $c$ is divisible by $7$, we are done.

Otherwise, each of $a^3$, $b^3$, $c^3$ is congruent to $\pm1\pmod{7}$. Therefore, at least two of these integers are congruent $\pmod7$, and the corresponding factor is divisible by $7$.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top