For a long time, it was thought this might be the optimal shape, but it was never proven. And it couldn't have been because it turns out that you can do better: the Gerver sofa (1992) is a more complicated shape, composed of 18 curve segments and has A=2.2195.
Nobody knew whether there might be an even better shape until now (assuming the proof holds up).
https://en.wikipedia.org/wiki/File:Gerver%E2%80%99s_and_Hamm...
Here's a silly one: since 1, 3, 5 and 7 are primes, it almost seems obvious that all odd numbers are prime. Naturally, they are not, and there are countless proofs about various prime number generators to show that they can generate prime numbers, which are really prime.
[1] https://mathenchant.wordpress.com/2025/04/21/is-1-prime-and-...
The "intuitive" argument that 1 is prime is that, as with prime numbers, you can't produce it by multiplying some other numbers. That's true!
But where the primes are numbers that are the product of just one factor, 1 is the product of zero factors, a very different status. The argument over whether 1 should be called a "prime number" is almost exactly analogous to the argument over whether 0 should be called a positive integer.†
It's more broadly analogous to the argument over whether 0 should be called a "number", but that argument was resolved differently. "Number" was redefined to include negatives, making 0 a more natural inclusion. If you similarly redefine "prime number" to include non-integral fractions (how?), it might make more sense to consider 1 to be one.
† Note that there is no Fundamental Theorem of Addition stating that the division of a sum into addends is unique. It isn't, but 0 is the empty sum anyway.
What do you mean?
The factors of 3 are 3 and 1. The factors of 1 are 1?
3 is the product of the members of {3}.
1 is the product of the members of the empty set.
We’re excluding the unit when defining these factor sets (ie, multiplicative identity) because it removes unique factorization.
That 1 is the unit is also why it’s the value for the product of the empty set because we want the product of a union of sets to match the product of a product of sets. But we don’t exclude it from the primes for that reason.
Oh! So it’s like Python’s `reduce(multiply,s,initial=1)`, such that s={} still gets you 1. Alright, that makes sense.
This seems to be circular since it assumes that 1 is not prime