Homework Help Overview
The discussion revolves around counting the total number of functions from set A={1,2,3,...,n} to set B={1,2,3,...,m}, specifically focusing on strictly increasing and non-decreasing functions. The participants are exploring the implications of the function's properties, such as injectivity, in relation to these conditions.
Discussion Character
- Conceptual clarification, Assumption checking, Mathematical reasoning
Approaches and Questions Raised
- Participants are examining the counting methods for strictly increasing functions and questioning whether injectivity is a necessary condition. There is a discussion about the correctness of the original poster's approach and the implications of their formulas.
Discussion Status
There is an ongoing exploration of the counting methods, with some participants suggesting a more conceptual approach. The original poster has revised their calculations based on feedback, indicating a dynamic discussion with attempts to verify the formulas through examples.
Contextual Notes
Participants are encouraged to verify their formulas by testing with small values of n and m, although there is a caution that examples may not always validate the logic used in the reasoning.
