kyrla

aka Asmo

FIND ME AFTER THE BOMBS DROP:
twitter@Asmodean_ | kyrla.bsky.social
tumblr@kyrlarchive | discord@kyrla_
youtube@kyrla | kyrla.bandcamp.com
reddit/u/kyrla_ | website league
chemist, socialist, anti-fascist --- @ me about f1 drama --- pfp by portaltohades.bsky.social


DecayWTF
@DecayWTF

A new one to go along with "oops I just tried to solve the halting problem by mistake": Oops we just tried to solve the Erdős distinct-sums problem by mistake.


DecayWTF
@DecayWTF

This calls for an old fashioned


DecayWTF
@DecayWTF

2 oz good brandy
1/2 oz Demerara syrup
4 dashes cardamom bitters

Shake with ice. It's pretty good although I should have gone a little lighter on the simple


You must log in to comment.

in reply to @DecayWTF's post:

It's a combinatorial problem. Paul Erdos conjectured that if you have a set of distinct numbers, A1 through An such that the sums of the subsets are distinct (ie if you pick some subset of those numbers and add up the sums, no other subset of the same length will have the same sum), the minimum value of An (the largest number of the set) is greater than 2^n times some constant factor. It's an open area of research in combinatorics and the current best known lower bounds for An are some very large numbers.

in reply to @DecayWTF's post: