problem 4 2 8

Описание к видео problem 4 2 8

This is part of the series of videos, where you can see a mathematician struggle with the problems of Neal Koblitz: Elliptic Curves and Modular Forms.

In my formula for number of ways to write n as a sum of 5 integers, then coefficient must be 20, and one should only sum over those n-j^2 that are odd. Off course, the formula only holds for n equivalent to 2 or 3 modulo 4. But I consider it a wonderful result. I dare you to prove it using only classical methods.

Комментарии

Информация по комментариям в разработке