Since {x}<1 holds for any x, we have {a1}+{a2}+⋯+{a100}<100; also, by the relation between roots and coefficients, −∑i=1100ai is the coefficient of the x99 term of f(x), and hence must be an integer, so
{a1}+{a2}+⋯+{a100}≤99.
We now show that there exists an f(x) such that {a1}+{a2}+⋯+{a100}=99. Consider the function
f(x)=x(x−2)(x−4)(x−6)⋯(x−198)+(x−1)(x−3)⋯(x−197)
Substituting values for checking, it is easy to see that f(−1)f(0),f(1)f(2),⋯,f(197)f(198) are all less than 0, so by Newton's method for locating roots, f(x) has a root in each of the 100 intervals (−1,0),(1,2),(3,4),⋯,(197,198). Therefore f(x) has 100 real roots, satisfying the conditions required by the problem, and
[a1]+[a2]+⋯+[a100]=−1+1+3+⋯+197
But the coefficient of the x99 term of f(x) is −(2+4+6+⋯+198)+1, so by the relation between roots and coefficients, we have
a1+a2+⋯+a100=2+4+6+⋯+198−1
Therefore
{a1}+{a2}+⋯+{a100}=(a1+a2+⋯+a100)−([a1]+[a2]+⋯+[a100])=(2+4+6+⋯+198−1)−(1+3+5+⋯+197−1)=99