Page's Algorithm
Jump to navigation
Jump to search
This article needs to be linked to other articles.
In particular: Category, among other things.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.
This theorem requires a proof..
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
In particular: Category, among other things.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.
To discuss this in more detail, feel free to use the talk page.
Once you have done so, you can remove this instance of {{MissingLinks}} from the code.
Algorithm
Page's Algorithm is for generating combinatorial objects called Second-Order Restricted Weak Integer Compositions.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Source of Name
This entry was named for Daniel Robert Page.
