It kind of feels - in my mathematical nativity - that there must be a general way to reduce all higher n down to the proof given for n=4 rather like Euler solve

It kind of feels - in my mathematical nativity - that there must be a general way to reduce all higher n down to the proof given for n=4 rather like Euler solved the Königsberg problem.