Let a,b,c denote the numbers of questions chosen from Sections A, B and C respectively.
Total questions to be attempted: a+b+c=15.
Minimum requirement: a≥4,b≥4,c≥4.
Upper limits (because of the number of questions present): a≤8,b≤6,c≤6.
Introduce new variables to handle the “at least 4” condition:
a=a′+4,b=b′+4,c=c′+4,a′,b′,c′≥0.
Substituting in a+b+c=15 gives
a′+b′+c′=15−12=3−(1)
Equation (1) demands non-negative integer solutions of sum 3. These are:
• (3,0,0) and its permutations • (2,1,0) and its permutations • (1,1,1).
Now apply the upper bounds.
Case 1: (a′,b′,c′)=(3,0,0)
Then (a,b,c)=(7,4,4) which satisfies a≤8,b≤6,c≤6.
The other two permutations give (a,b,c)=(4,7,4) or (4,4,7), both violating b≤6 or c≤6.
Hence only one admissible triple: (7,4,4).
Case 2: (a′,b′,c′)=(2,1,0)
All six permutations obey the limits, giving
(6,5,4),(6,4,5),(5,6,4),(4,6,5),(5,4,6),(4,5,6).
Case 3: (a′,b′,c′)=(1,1,1)
This single solution yields (5,5,5), within the limits.
Thus the admissible (a,b,c) triples are
(7,4,4),(6,5,4),(6,4,5),(5,6,4),(4,6,5),(5,4,6),(4,5,6),(5,5,5).
For each triple, multiply the individual combinations:
Section A: choose a out of 8((a8))
Section B: choose b out of 6((b6))
Section C: choose c out of 6((c6)).
Compute every case:
(7,4,4):(6,5,4):(6,4,5):(5,6,4):(4,6,5):(5,4,6):(4,5,6):(5,5,5):(78)(46)(46)=8⋅15⋅15=1800(68)(56)(46)=28⋅6⋅15=252028⋅15⋅6=2520(58)(66)(46)=56⋅1⋅15=840(48)⋅1⋅6=70⋅6=42056⋅15⋅1=84070⋅6⋅1=42056⋅6⋅6=2016
Add the eight results:
1800+2520+2520+840+420+840+420+2016=11376.
Hence, a student can select the required 15 questions in 11376 different ways.