Discrete Mathematics Assignment: Poker Hands and Flower Bouquets

This document provides solutions to a discrete mathematics assignment. The first problem focuses on calculating the number of ways to be dealt a straight, a flush, and either a straight or a flush in a 5-card poker hand, considering different card sequences and suits. The second problem explores combinatorics, calculating the number of distinct flower bouquets that can be assembled with 8 colors and 12 flowers, including scenarios with and without color restrictions. The third problem isn't fully detailed but is about Pancho's Tinder usage. The solutions utilize probability calculations and combinatorial principles to address each part of the problems, including the probability of choosing a specific label from different baskets. References to relevant patents are also provided.