# Tagged Questions

For questions about the study of finite or countable discrete structures, specifically how to count or enumerate elements in a set (perhaps of all possibilities) or any subset. It includes questions on permutations, combinations, bijective proofs, and generating functions.

85 views

### Drawing previously undrawn cards from a deck

Suppose you have a deck of $y$ cards. First, randomly select $y-x$ distinct cards and sign the face of each, then shuffle all the cards back in to the deck. Proceed as follows: Draw a card. If it is ...
62 views

89 views

### Is there a nice characterization of these classes of functions on a set of $n$ elements?

I am looking at the set of all functions from $[n] \to [n]$, where $[n] = \{1,2,\dots,n\}$. Now, I consider two functions equivalent, if they are conjugates by some permutation, that is, they are the ...
2k views

### Edge coloring of the cube

We have a cube and we are coloring its edges. There are three colors available. We say that the two colorings are the same if one can obtain a second by turning cube and permuting colors. Find the ...
354 views

### Primitive binary necklaces

The problem/solution of counting the number of (primitive) necklaces is very well known. But what about results giving sufficient conditions for a given necklace be primitive? For example, in the ...