For a fixed unit vector $${a = (a_1, a_2,..., a_n) \in S^{n-1}}$$ , that is, $${\sum^n_{i=1} a^2_1 = 1}$$ , we consider the 2 signed vectors $${\varepsilon = (\varepsilon_1, \varepsilon_2,..., \varepsilon_n) \in \{-1, 1\}^n}$$ and the corresponding scalar products $${a \cdot \varepsilon = \sum^n_{i=1} a_i \varepsilon_i}$$ . In [3] the following old conjecture has been reformulated. It states that among the 2 sums of the form $${\sum \pm a_i}$$ there are not more with $${|\sum^n_{i=1} \pm a_i| > 1}$$ than there are with $${|\sum^n_{i=1} \pm a_i| \leq 1}$$ . The result is of interest in itself, but has also an appealing reformulation in probability theory and in geometry. In this paper we will solve an extension of this problem in the uniform case where $${a_1 = a_2 = \cdot\cdot\cdot = a_n = n^{-1/2}}$$ . More precisely, for S being a sum of n independent Rademacher random variables, we will give, for several values of $${\xi}$$ , precise lower bounds for the probabilities or equivalently for where $${T_n}$$ is a standardized binomial random variable with parameters n and $${p = 1/2}$$ . These lower bounds are sharp and much better than for instance the bound that can be obtained from application of the Chebyshev inequality. In case $${\xi = 1}$$ Van Zuijlen solved this problem in [5]. We remark that our bound will have nice applications in probability theory and especially in random walk theory (cf. [1, 2]). [ABSTRACT FROM AUTHOR]