Question:** A youth mentorship program has 10 students and 6 mentors. In how many ways can each student be assigned to exactly one mentor, if each mentor must be assigned at least one student?

["Youth Mentorship Program: How Many Ways Can 10 Students Be Assigned to 6 Mentors with Each Mentor Getting At Least One Student?", "When a youth mentorship program brings together 10 motivated students and 6 knowledgeable mentors, a natural and impactful challenge arises: How many meaningful ways can each student be assigned to exactly one mentor—while ensuring every mentor receives at least one student? This question isn’t just about counting assignments—it’s about fostering structured learning, strong relationships, and equitable participation across a growing program.", "This article explores the combinatorial mathematics behind assigning 10 distinct students to 6 distinct mentors, with the constraint that no mentor is left without a student.", "---", "### Understanding the Problem", "Each of the 10 students chooses exactly one mentor, forming a mapping from students to mentors. Normally, if there were no restrictions, each student would have 6 choices, leading to (6^{10}) total unrestricted assignments. However, the requirement that each mentor must receive at least one student introduces a vital constraint—this rules out many simple power assignments.", "To satisfy the condition that all 6 mentors get at least one student, the assignment number must reflect surjective (onto) functions: every mentor receives at least one student.", "But here’s the catch—we are assigning distinct students to distinct mentors, meaning both students and mentors are distinguishable. So we’re not just counting binary functions; we’re counting valid onto mappings of a 10-element set to a 6-element set.", "---", "### The Mathematical Framework", "This problem fits the classic combinatorics pattern of counting onto functions from a set of size (n = 10) (students) to a set of size (k = 6) (mentors), with the requirement that no element in the codomain (mentors) is excluded.", "The number of such onto functions is given by:", "[\n\ ext{number of assignments} = k! \cdot S(n, k)\n]", "Where:\n- (k = 6) — number of mentors\n- (n = 10) — number of students\n- (S(n, k)) is the Stirling number of the second kind, representing the number of ways to partition (n) distinct objects into (k) non-empty, unlabeled subsets.\n- Multiplying by (k!) assigns labels (i.e., identities) to these subsets, making the mentors distinguishable.", "Thus, the total number of valid assignments is:", "[\n6! \ imes S(10, 6)\n]", "---", "### Calculating the Stirling Number (S(10, 6))", "Stirling numbers can be computed recursively or via inclusion-exclusion. For small values, they are well-documented. From combinatorial tables or using recurrence:", "[\nS(10, 6) = 22827\n]", "This value represents the number of ways to partition 10 distinct students into 6 non-empty, unlabeled groups—each group assigned to one unique mentor.", "---", "### Final Calculation", "Now compute:", "[\n6! = 720\n]\n[\n720 \ imes 22827 = 16,400,040\n]", "So, there are 16,400,040 distinct ways to assign 10 students to 6 mentors such that every mentor receives at least one student, and each student is assigned to exactly one mentor.", "---", "### Why This Matters in Real-World Mentorship Programs", "Beyond pure math, this combinatorial model reflects a crucial truth: equal opportunity for impact. Ensuring each mentor has at least one student fosters balance in support, prevents tokenism, and maximizes the mentorship program’s reach. By counting only valid onto mappings, program coordinators can plan resources, sessions, and evaluations with confidence—knowing every mentor is actively contributing.", "Moreover, this number guides scalability discussions: as more students join, the growth in valid mentorship configurations grows rapidly, indicating strong flexibility while preserving structure.", "---", "### Conclusion", "The youth mentorship program described offers 16,400,040 meaningful, equitable ways to assign 10 students to 6 mentors—ensuring every mentor receives our brightest young minds. This elegant application of combinatorics not only solves a practical assignment problem but also embodies the program’s mission: every student deserves a supportive guide, and every mentor deserves the chance to lead.", "Keywords: youth mentorship program, assign students to mentors, onto functions, Stirling numbers, combinatorics, mentorship pairing, surjective functions, combinatorial counting, 10 students 6 mentors, distributed mentorship.", "---", "For more insights on optimizing mentorship models using combinatorial design, explore advanced resource allocation strategies and dynamic matching algorithms tailored for youth development initiatives."]