Ciro Santilli @cirosantilli 37

A theorem that is not very important on its own, often an intermediate step to proving something that the author feels deserves the name "theorem".

math.stackexchange.com/questions/2382011/computational-complexity-of-modular-exponentiation-from-rosens-discrete-mathem mentions:can be calculated in:Remember that $log(m)$ and $log(n)$ are the lengths in bits of $m$ and $n$, so in terms of the length in bits $M$ and $N$ we'd get:

Compared to Waring's problem, this is potentially much harder, as we can go infinitely negative in our attempts, there isn't a bound on how many tries we can have for each number.

In other words, it is unlikely to have a Conjecture reduction to a halting problem.

And when it can't, attempt to classify which subset of the integers can be reached. E.g. Legendre's three-square theorem.

The elliptic curve group of an elliptic curve is a group in which the elements of the group are points on an elliptic curve.

The group operation is called elliptic curve point addition.

Bibliography:

This is the most extreme and final form of peer tutoring, it's natural final consequence given the Internet Age.

Preprint: arxiv.org/abs/2303.10798

Ciro Santilli distinctly remembers being taught that at basic electrical engineering school during Ciro Santilli's undergrad studies at the University of São Paulo.

It really allows you to do alternating current calculations much as you'd do DC calculations with resistors, quite poweful. It must have been all the rage in the 1950s.