Every symmetric polynomial $h(x)$ with center of symmetry $n/2$ can be expressed as a linear combination in the basis $x^i(1+x)^{n-2i}$. The $γ$-polynomial of $h(x)$, which we denote $γ_h(x)$, records the coefficients of this linear combination. Two decades ago, Brändén and Gal independently showed that if $γ_h(x)$ has nonpositive real roots only, then so does $h(x)$. More recently, Brändén, Ferroni, and Jochemko proved using Lorentzian polynomials that if $γ_h(x)$ is ultra log-concave, then so is $h(x)$, and they raised the question of whether a similar statement can be proved for the usual notion of log-concavity. The purpose of this article is to show that the answer to the question of Brändén, Ferroni, and Jochemko is affirmative. One of the crucial ingredients of the proof is an inequality involving binomial numbers that we establish via a path-counting argument.