There are 45 different ways in which two of them can be selected as the best students in the class.
A combination in mathematics is a choice made from a group of separate elements where the order of the selection is irrelevant (unlike permutations).
A k-combination of a set S is officially defined as a subset of S's k unique elements.
Total number of students = 10
Number of students to be selected = 2
No. of ways = 10C2
= (10*9)/2
= 5*9
= 45
Hence, there are 45 different ways in which two of them can be selected as the best students in the class.
To learn more about students here:
https://brainly.com/question/16209277
#SPJ4