| Display title | Bijective proof |
| Default sort key | Bijective Proof |
| Page length (in bytes) | 7,557 |
| Namespace ID | 0 |
| Page ID | 35800 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiGary |
| Date of page creation | 04:21, 1 August 2022 |
| Latest editor | imported>WikiGary |
| Date of latest edit | 04:21, 1 August 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In combinatorics, bijective proof is a proof technique for proving that two sets have equally many elements, or that the sets in two combinatorial classes have equal size, by finding a bijective function that maps one set one-to-one onto the other. This technique can be useful as a way of finding a formula... |
