I'm taking my first discrete math course. One aspect of functions has me stumped. We're asked to list the functions from a two-element set to a three-element set. And then list all the functions from ...

where we reduce a problem of size $n$ into $a$ problems of size $n/b$ and $a$ and $b$ are integers (1,2,3....). We will show how to solve such recurrences when $g$ is ...

ABSTRACT: A friendship graph is a graph consisting of cliques sharing a common vertex. In this paper we investigate the maximum number of elements in an optimal friendship decomposition of graphs of ...