Download data/lean/OAI/Computability/BinPacking/Trees/CompetingTrees.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 370 Bytes
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/BinPacking/Trees/CompetingTrees.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/BinPacking/Trees/CompetingTrees.lean
-
curl -L -o CompetingTrees.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/BinPacking/Trees/CompetingTrees.lean
370 Bytes
| import OAI.Computability.BinPacking.Packing.PhaseIteration | |
| namespace OAI | |
| namespace BinPackingGap | |
| def competingTrees (d : ℕ) (hd : 0 < d) : CompetingTrees d := | |
| CompetingTrees.ofAuxiliary d hd (buildAuxiliary (2 * d - 1)) | |
| theorem exists_competingTrees (d : ℕ) (hd : 0 < d) : Nonempty (CompetingTrees d) := | |
| ⟨competingTrees d hd⟩ | |
| end BinPackingGap | |
| end OAI | |