Step 1 :This problem is about combinations. We are asked to find the number of ways to choose 6 students from a class of 35 to represent the class on the student council. The order in which we choose the students does not matter.
Step 2 :The formula for combinations is \(C(n, k) = \frac{n!}{k!(n-k)!}\), where n is the total number of items, k is the number of items to choose, and '!' denotes factorial.
Step 3 :In this case, n = 35 and k = 6.
Step 4 :Substituting these values into the formula, we get \(C(35, 6) = \frac{35!}{6!(35-6)!}\).
Step 5 :Calculating this gives us a total of 1623160 ways.
Step 6 :So, the final answer is \(\boxed{1623160}\). There are 1623160 ways to choose 6 students from a 35-member class to represent the class on the student council.