Post #2735412
2026-05-10 23:06 UTC
@byorgey@mathstodon.xyz Another approach is to use binary search on each integer from 1 to maximum p to find between which two indices of p it would go. Depending on whether binary search favors the lower or upper value, that can directly give you the conjugate and is O(maximum p * log length p). In J that would be I.i.@{.
@das_g@chaos.social
Replies (0)
No replies.