Ciro Santilli @cirosantilli 37

4 squares are sufficient by Lagrange's four-square theorem.

3 is not enough by Legendre's three-square theorem.

The subsets reachable with 2 and 3 squares are fully characterized by Legendre's three-square theorem.

Determines if an executable is a position independent executable (PIE).

Seems to be informational only, since not used by Linux kernel 5.0 or glibc 2.29.

file 5.36 however does use it to display file type as explained at: stackoverflow.com/questions/34519521/why-does-gcc-create-a-shared-object-instead-of-an-executable-binary-according-to/55704865#55704865

The default feathers-chat app runs on NeDB (local filesystem JSON database).

Ciro Santilli managed to port it to Sequelize for PostgreSQL as shown at: github.com/cirosantilli/feathers-chat/tree/sequelize-pg

Complexity: NP-intermediate as of 2020:

The basis of RSA: RSA. But not proved NP-complete, which leads to:

I think these are the ones where $\Delta H\times \Delta S>0$, i.e. enthalpy and entropy push the reaction in different directions. And so we can use temperature to move the Chemical equilibrium back and forward.

The problem with a single-level paging scheme is that it would take up too much RAM: 4G / 4K = 1M entries per process.

If each entry is 4 bytes long, that would make 4M per process, which is too much even for a desktop computer: ps -A | wc -l says that I am running 244 processes right now, so that would take around 1GB of my RAM!

For this reason, x86 developers decided to use a multi-level scheme that reduces RAM usage.

The downside of this system is that is has a slightly higher access time, as we need to access RAM more times for each translation.

This construction takes as input:and it produces an elliptic curve over a finite field of order $p$ as output.

The constructions is used in the Birch and Swinnerton-Dyer conjecture.

To do it, we just convert the coefficients $a$ and $b$ from the Equation "Definition of the elliptic curves" from rational numbers to elements of the finite field.

For example, suppose we have $a=3/4$ and we are using $p=11$.

For the denominator $4$, we just use the multiplicative inverse, e.g. supposing we havewhere $4^{-1}=3\mathrm{mod}11$ because $4\times 3=1\mathrm{mod}11$, related: math.stackexchange.com/questions/1204034/elliptic-curve-reduction-modulo-p

archive.org/details/quantumstoryhist0000bagg on the Internet Archive Open Library.