• oldfart@lemm.ee
      link
      fedilink
      English
      arrow-up
      1
      ·
      2 hours ago

      He looks like he’s been skiing 2 weeks ago, i cant see anything wrong here

  • skhayfa@lemmy.world
    link
    fedilink
    English
    arrow-up
    37
    ·
    11 hours ago

    It could be worse, imagine his personal digital life was sold to a shady consulting firm piloting a conservative populist political campaign

    • heavydust@sh.itjust.works
      link
      fedilink
      English
      arrow-up
      17
      ·
      14 hours ago

      His face still says “please love me, I have money,” but at least he stopped doing that stupid Roman emperor haircut.

  • Maeve@kbin.earth
    link
    fedilink
    arrow-up
    54
    ·
    17 hours ago

    He said “we now have an opportunity to have a productive relationship with the United States government, and we’re going to take that.” He also addressed changes to the company’s diversity, equity, and inclusion policies, but largely mirrored what he has already said publicly on podcasts like Joe Rogan. More of what Zuckerberg said on internal strife at the company was reported by Business Insider, which also obtained a copy of the meeting.

    He told us who he was while he attended university. Do we believe him yet?

  • Cruxifux@feddit.nl
    link
    fedilink
    English
    arrow-up
    24
    ·
    15 hours ago

    The onion is going to go out of business if real life headlines like this one keep coming out.

  • Surly he is smart enough to do some combinatorics to figure out who is leaking the meetings.

    It’s the classic riddle of u have 1000 bottles of wine 1 is poisoned and u have 10 prisoners to test the wine. U must test all the bottles in 4 days, however it takes 3 days for the poison to take effect.

    hint

    With 10 prisoners u can test up to 1024 bottles

    • Lvxferre@mander.xyz
      link
      fedilink
      English
      arrow-up
      2
      ·
      7 hours ago
      solution

      Number all bottles in binary, starting from 0000000000. Then the Nth prisoner drinks all wines where the Nth digit is “1”. have each prisoner drinking the wines where a certain digit is “1”.

      So for example. If you had 8 bottles and 3 prisoners (exact same logic):

      • number your wines 000, 001, 010, 011, 100, 101, 110, 111
      • Prisoner 1 drinks wines 100, 101, 110, 111; if he dies the leftmost digit of the poisoned wine is 1, if he lives the poisoned wine starts with 0
      • Prisoner 2 drinks wines 010, 011, 110, 111; if he dies the mid digit is 1, else it’s 0
      • Prisoner 3 drinks wines 001, 011, 101, 111; if he dies the right digit is 1, else it’s 0

      If nobody dies the poisoned wine is numbered 000. And if all die it’s the 111.

        • Lvxferre@mander.xyz
          link
          fedilink
          English
          arrow-up
          1
          ·
          2 hours ago

          No, I only saw it after I solved the problem.

          my reasoning / thought process

          Initially I simplified the problem to one prisoner. The best way to reduce uncertainty was to split the bottles into two sets with 500 bottles each; the prisoner drinks from one, if he dies the poisonous wine is there, otherwise it’s in one of the leftover 500 bottles.

          Then I added in a second prisoner. The problem doesn’t give me enough time to wait for the first prisoner to die, to know which set had the poisonous wine; so I had to have the second prisoner drinking at the same time as the first, from a partially overlapping set. This means splitting the bottles into four sets instead - “both drink”, “#1 drinks it”, “#2 drinks it”, “neither drinks it”.

          Extending this reasoning further to 10 prisoners, I’d have 2¹⁰=1024 sets. That’s enough to uniquely identify which bottle has poison. Then the binary part is just about keeping track of who drinks what.