**A** combinatoric Le Monde mathematical puzzle that resembles many earlier ones:

Given a pool of 30 interns allocated to three person night-shifts, is it possible to see 31 consecutive nights such that (a) all the shifts differ and (b) there are no pair of shifts with a single common intern?

**I**n fact, the constraint there is very strong: two pairs of shift can only share zero or two interns. For one given shift, there are 26 other shifts with which it can share two interns, but then any two of those 26 others must share zero or two, which makes the two common to all and exclude any additional shift. But this is not the only approach to allocate the interns over the shifts since, as pointed out by Jean-Louis and checking with the following R code, ~~28 and not 27 is the maximum possible number of shifts under those conditions.~~

poss=combn(30,3) shft=matrix(NA,31,3) shft[1,]=sample(1:30,3) poss=poss[,sample(4060)] prop=poss[,1];k=2 acpt=intersect(prop,shft[1,]) while (((length(acpt)==1)+(length(acpt==3)))>0){ prop=poss[,k];k=k+1 acpt=intersect(prop,shft[1,])} shft[2,]=prop for(i in 3:31){ poss=poss[,sample(4060)] prop=poss[,1];k=2 acpt=(length(intersect(prop,shft[1,]))==1)+(length(intersect(prop,shft[1,]))==3) for (j in 2:(i-1)) acpt=acpt+(length(intersect(prop,shft[j,]))==1)+(length(intersect(prop,shft[j,]))==3) while ((acpt>0)&(k<4061)){ prop=poss[,k];k=k+1 acpt=(length(intersect(prop,shft[1,]))==1)+(length(intersect(prop,shft[1,]))==3) for (j in 2:(i-1)) acpt=acpt+(length(intersect(prop,shft[j,]))==1)+(length(intersect(prop,shft[j,]))==3)} if (k==4061) break() shft[i,]=prop}