MultiHub Forum

Full Version: Drifting distances on the integer line: a probabilistic take on classical inequaliti
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
what if the distance between integers on a number line could drift slightly in a random way but eventually settle to a fixed limit; what would a probabilistic geometry of the integers look like, and could this idea yield new proofs of classical inequalities?

That could work.

That sounds neat, but I doubt randomness in distances will give clean proofs of classical inequalities.