Drifting distances on the integer line: a probabilistic take on classical inequaliti
#1
(This post was last modified: 12-17-2025, 02:44 AM by IvyN.)
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.
Reply


[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Forum Jump: