I stumbled on this nice little puzzle the other day. I'll link to the source tomorrow when sharing the answer. Until then, have fun :)
Find all the possible ways, if any exist, to fill in the three blanks to make all three statements true.
Previous iteration: #726159 (partial proof for special case in #728029)
335 sats \ 1 reply \ @Scroogey 17 Oct
If you allow words instead of numbers as solutions: odd, irrational, and odd.
reply
Even better than what Randall Munroe had in mind (#731084).
reply
Do the 1, 2, and 3 that label each panel count?
reply
I hadn't thought of that. That way the solution could be something else. Let's give it a try!
▣ 1 = a ▣ 2 = b ▣ 3 = c
a = b + c + 5 b = √(ab3) c = min(a, b , 1)
reply
That's up to you to decide 😜
reply
  1. 0
  2. 0
  3. 0
:)
reply
Trivial solutions are solutions too ;)
reply
There is a unique positive integer solution, assuming we include the panel identification numbers.
Solving it gives:
reply
58 sats \ 0 replies \ @nym 17 Oct
Panel 1: 1.618 Panel 2: 1.272 Panel 3: 1
reply
Here a link to a link to the answers: #731084
reply
deleted by author
reply