The discussion revolves around a combinatorial problem involving the selection of students from a class. The original poster seeks to express the number of times a student is selected, denoted as 'a', in terms of the total number of students 'n' and the size of the selection 'm'.
The discussion is ongoing, with participants exploring different methods to understand the problem. Some guidance has been offered regarding starting with small examples, but there is a clear request for a more abstract treatment using variables.
Participants note the forum's requirement to show work, indicating that some may not have provided sufficient detail in their attempts.
vkash said:there are n students in a class. They are selected in sets of m. A student says he is selected a times. find value of a in terms of m and n.
Total number of selections made are nCm.
After that nothing is striking in my mind.can you please help.
getting trend how it is happening and understanding how is it happening is different thing & i want to know second one not first one so it will helpful for me if you did it with variables.Ray Vickson said:Start by looking at small example, such as n = 4 and m = 2, 3 or 4. Select an element such as '1', and look at all the subsets that contain that element. Once you see the pattern, it should be easier to look at the general n, m problem.
RGV
vkash said:getting trend how it is happening and understanding how is it happening is different thing & i want to know second one not first one so it will helpful for me if you did it with variables.
so can anybody please do it with variables.