Hi Community , I came across these problems and had absolutely no clue on how to approach these at all. Any guidance or Help would be appreciated .
Problems are attached in image form
P1 : Bruce Banner is interested in number of arrays , A , A , ... A[n](1 <= A[i] <= M , A[i] — integer ) such that LCM of all its elements is divisible by number D. Please find sum of answer to the problems with D = L , D = L+1 .... D = R .
please output it modulo 10^9 + 7 ;
Constraints : n < 5*10^6 1 <= L <= R <= M <= 10000