My profile image is a constructive proof that all possible dyadic paritionings of a square cannot be enumerated by an algorithm that recursively partitions by halves horizontally or vertically. Any such solution will contain a strut (a line going all the way across), and the image is strutless. In fact, this image illustrates both of the only two strutless solutions when dividing down to 1/4 (ignoring rotations and reflections). I am the sort of person who finds this interesting.
Somewhere mostly harmless
Member for 3 years, 1 month
7 profile views
Last seen May 12 '19 at 13:41
Top network posts
- 71 If someone wanted to pretend to be Satoshi by posting a fake signature to defraud people how could they?
- 70 If someone wanted to pretend to be Satoshi by posting a fake signature to defraud people how could they?
- 21 Why doesn’t Bitcoin use UDP to do Blockpropagation?
- 20 Bitcoin automatically diverted to bech32 address
- 17 Can someone please explain FIBRE like I'm 5 and why is it useful?
- 17 What is the origin of insecure 64-bit nonces in signatures in the Bitcoin chain?
- 16 If bitcoin is indivisible, where does change come from?
- View more network posts →