robtodd5816 robtodd5816 29-02-2024 Mathematics contestada give a combinatorial proof (no computations are needed) to establish this identity. hint: consider the set of numbers 1 through n. how many subsets of size k have i as their highest numbered member?
