Oh, I misread and didn't see the part where the two vacant seats had to be next to eachother.
How about 60060? It's divisible by every number from 1 to 15 except 8 and 9 so the two students would be next to eachother.
It seems like the easiest way to prove that the number in question is 60060 would be to say that since the two numbers are consecutive, both n and n+1 must divide 60060, meaning in turn that n(n+1)|60060 (where n is an integer and 0<n<16). Then you could skip the non-obvious factors (1 through 6) and start with n=7, which would tell you that 8 does not divide 60060. If you skip 8 and go to n=9, you'll find that 9 also does not divide 60060.
But the hard part of the problem, which is what I'm guessing you're having trouble with, is how to get to 60060 in the first place. The key here in finding a number (we'll call it x) is that there are two consecutive integers that are not factors of x. My guess is that one way (probably not the ideal way) to show this is to just list the multiples of each number less than 15 in the set {1, 2,..., 15} and try to find where a subset of it that has more than one element and then claim that it must be a factor. Then you can cross off numbers that have one element that are still factors of x and nonconsecutive numbers. You should be left with x=60060 and 8 and 9 as your missing elements.
[collapse="Sample Proof"]Let A={1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
Let B_n be a subset of A that contains all elements in A divisible by n.
If |B_n|>1, n|x
n=1
B_1=A
|B_1|=15
Therefore 1|x (no ****)
n=2
B_2={2, 4, 6, 8, 10, 12, 14}
|B_2|=7
So 2|x
n=3
B_3={3, 6, 9, 12, 15}
|B_3|=5
So 3|x
n=4
B_4={4, 8, 12}
|B_4|=3
So 4|x
n=5
B_5={5, 10, 15}
|B_5|=3
So 5|x
n=6
Since 2|x and 3|x and gcd(2,3)=1, 2*3|x (i.e. 6|x)
n=7
B_7={7, 14}
|B_7|=2
So 7|x
n=8
B_8={8}
|B_8|=1
So 8 is not necessarily a factor.
n=9
B_9={9}
|B_9|=1
So 9 is not necessarily a factor.
n=10
Since 2|x and 5|x and gcd(2,5)=1, 2*5|x (i.e. 10|x)
n=11
B_11={11}
|B_11|=1
So 11 is not necessarily a factor.
n=12
Since 3|x and 4|x and gcd(3,4)=1, 3*4|x (i.e. 12|x)
n=13
B_13={13}
|B_13|=1
So 13 is not necessarily a factor.
n=14
Since 2|x and 7|x and gcd(2,7)=1, 2*7|x (i.e. 14|x)
n=15
Since 3|x and 5|x and gcd(3,5)=1, 3*5|x (i.e. 15|x)
The remaining numbers that may or may not be factors are 8, 9, 11, and 13. Of these, only 8 and 9 are consecutive, meaning that 11 and 13 are both factors (11|x and 13|x).
Therefore, the smallest value of x=7!*11*13/2=60060
The number that the teacher thought of is 60060 and the two students who did not receive the prize are sitting in chairs number 8 and 9.
QED[/collapse]This is the most elegant way I can think of to prove this. This problem is kind of beastly and nothing but variations on the brute force method come to mind.
(Also, if you knew the number in the first place but just didn't know how to get there, why not just tell us the number? It would have saved me a lot of frivolous calculations...)