Now, assuming that
,
we can recursively insert
m+n+1 different integer values for any ci on which F depends.
As
for one of these values F does not vanish and
we can repeat the procedure with
F(ci=pi) instead of F. Choosing
at the end arbitrary (for example 0) values for the free ci (Those on
which F does not depend!) we obtain the desired point P.