abcde = 5(abcd + abce + abde + acde + bcde)

find all the solutions for (a, b, c, d, e)

if you just want the solutions, should be a simple script. i take it a-e represent digits, aka go from 0-9

This post was edited by carteblanche on Jun 13 2015 09:33pm

does this involve modular arithmetic?

well there's no point in solving it if i dont understand how to solve it



hell if i know, i wasn't able to solve it

i simplified it to 1/5 = 1/a + 1/b + 1/c + 1/d + 1/e but it's still complex

if you google 2004 inmo solutions, it's worked out for you.

/edit it looks like the problem didnt ask to find all solutions. just to prove there's an odd number of solutions?

This post was edited by carteblanche on Jun 13 2015 10:13pm