Partitioning $\{1,\dots,n\}$ into parts of size at most three whose sums are powers of three

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

Source files

root fileGurvichNaumovaConjecture_final2-tex/main.tex · root file23 KiB · SHA-256 b1d43645403b184f… · view text auxiliary fileGurvichNaumovaConjecture_final2-tex/elsarticle.cls44 KiB · SHA-256 40af0200a8ad6777… · view text

auxiliary fileGurvichNaumovaConjecture_final2-tex/figures/fig_assembly.png45 KiB · SHA-256 c16275841eb29557… · raw download withheld by file policy

auxiliary fileGurvichNaumovaConjecture_final2-tex/figures/fig_cases.png79 KiB · SHA-256 557fb375c860f7e7… · raw download withheld by file policy

auxiliary fileGurvichNaumovaConjecture_final2-tex/figures/fig_example.png85 KiB · SHA-256 82b4feceadac565b… · raw download withheld by file policy

auxiliary fileGurvichNaumovaConjecture_final2-tex/figures/fig_sigma.png61 KiB · SHA-256 f0c747207cb53fe4… · raw download withheld by file policy

ancillaryanc/ai-provenance/AI_PROVENANCE_GurvichNaumovaConjecture.md3 KiB · SHA-256 f3828ab5198ee1bc… · view text

Back to the main record

Partitioning {1,…,n}\{1,\dots,n\}{1,…,n} into parts of size at most three whose sums are powers of three

Source files

Partitioning $\{1,\dots,n\}$ into parts of size at most three whose sums are powers of three