Negative quotients and their remainders

modular-arithmetic

There are various conventions for how to define the quotient and remainder for the division algorithm when extended from naturals to integers. The remainder is uniquely determined once one defines the quotient, and usually conventions say which to round the quotient, e.g. towards $\,0\,$ or, towards the nearest integer, or towards $\,\pm\infty.$ Some programming languages provide all of the possibilities, e.g. see the floor, ceiling, round, truncate functions in Common Lisp.

A web search will turn up further discussion in many places, e.g. on Wikipedia and D. Leijen, Division and Modulus for Computer Scientists.

proof of functional completeness of logical operators

How to derive $\sum_{n=0}^\infty 1 = -\frac{1}{2}$ without zeta regularization

$f$ is the complexification of a map if $f$ commutes with almost complex structure and standard conjugation. What if we had anti-commutation instead?

Isomorphism $f$ preserves the order of an element?

Taylor's polynomial uniqueness proof - why are these limits inferable?

Prove existence of a real root.

Finding the closed form of a recursive sequence

A number when successively divided by $9$, $11$ and $13$ leaves remainders $8$, $9$ and $8$ respectively

Flag manifold to Complex Projective line

Show that for any prime $ p $, there are integers $ x $ and $ y $ such that $ p|(x^{2} + y^{2} + 1) $.

Is $[0,1] \cap \Bbb Q$ a compact subset of $\Bbb Q$?