revised
Finding Chord Segments with Integer Length
deleted 14 characters in body
Loading…
revised
Finding Chord Segments with Integer Length
added a link
Loading…
comment
Finding Chord Segments with Integer Length
Yes, I think so!
revised
Finding Chord Segments with Integer Length
added a note
Loading…
comment
Finding Chord Segments with Integer Length
According to your last edit, we should only exclude chords that are diameters. But something like
(m,n,r)=(1,7,5) (with CS=BS) now looks valid. For X=100, I believe this would lead to 74 solutions instead of 37.
revised
Finding Chord Segments with Integer Length
saved 7 bytes
Loading…
revised
Finding Chord Segments with Integer Length
saved 5 bytes
Loading…
revised
Finding Chord Segments with Integer Length
saved 3 bytes
Loading…
revised
Finding Chord Segments with Integer Length
saved 1 byte
Loading…
Loading…
revised
Find the outcome of a Cortex Prime dice roll
minor update
Loading…
revised
Find the outcome of a Cortex Prime dice roll
saved 2 bytes
Loading…
revised
Find the outcome of a Cortex Prime dice roll
saved 1 byte
Loading…
revised
Find the outcome of a Cortex Prime dice roll
clarification
Loading…
revised
Find the outcome of a Cortex Prime dice roll
added a commented version
Loading…
Loading…
revised
Bingo square equivalents
minor clarification
Loading…
revised
Bingo square equivalents
added a link to the code used to find the magic number
Loading…
revised
Bingo square equivalents
saved 1 byte
Loading…
comment
Bingo square equivalents
@Tbw This is a variation of something I came up with earlier to get all reflections and rotations of a square matrix:
[...15**6+""].map(d=>m=m.map((r,y)=>r.map((_,x)=>m[x][y]).sort(_=>-d))). There are actually a few other options.

