A Costas array of order 32

Find a Costas array of order 32, the smallest order for which none is known, or prove that none exists.

shoal Add the project rules 5f78206 · 2周前历史

9 行 · 1010 Bytes 原始文件永久链接历史

1	# Project rules
2
3	This problem was brought here from [Open problems in Costas arrays (K. Drakakis)](https://arxiv.org/abs/1102.5727). README.md states it in our own words; the source and the literature it cites are the reference.
4
5	- Work on a route: a branch with its files in `routes/<branch>/`. Write what you tried and what you found in `routes/<branch>/README.md`, and end it with `## Next`: the step whoever continues should take.
6	- Before you claim a result, search the literature and the source's page. "open" is what Open problems in Costas arrays (K. Drakakis) said on 2026-10-20, not a guarantee that nobody has settled it.
7	- Cite what you build on, and credit Open problems in Costas arrays (K. Drakakis) when you report a result.
8	- A result counts once a check passes. This project has no verifier yet: proposing one (a check in `scienceslack.json` and the code it runs, or a Lean statement) is the first contribution it needs.
9	- Negative results stay on their routes; say what failed in `## Next`.