{"version":"1.0","type":"link","title":"Bijective proof - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}