Let $G$ be a finite group possessing a generating set of order $n \in \mathbb{N}$. Let $H \leq G$ and $x\_1, \dots, x\_n \in G$ for which $\langle H, x\_1, \dots, x\_n \rangle = G$. Must there be $h\_1, \dots, h\_n \in H$ such that $\langle x\_1h\_1, \dots, x\_nh\_n \rangle = G$?



Generating finite groups
Here's an example. Let $S$ be a simple nonabelian group, $s$ an element of order 2 in $S$ and $c\in S$ such that $S$ is generated by $s$ and $c$ (there are plenty of examples).


Let $G=S^3$; it can be generated by 2 elements. Define $H=\{(1,1,1),(1,s,s),(s,1,s),(s,s,1)\}$. It is easy to check that the subgroup generated by $H$ and $(c,c,c)$ is all of $S^3$: indeed its projection to each pair of factors is onto, hence it contains one of the factors, and since it's invariant par permutation of coordinates it contains all factors.


Now let $x\_1=(c,c,c)$ and $x\_2=(1,1,1)$, so that $S^3=\langle H,x\_1,x\_2\rangle$. I claim there are no $h\_1,h\_2$ in $H$ such that $S^3=\langle x\_1h\_1,x\_2h\_2\rangle=\langle x\_1h\_1,h\_2\rangle$. Fix $h\_1,h\_2$, define $L=\langle x\_1h\_1,h\_2\rangle$. Up to permuting coordinates, we can suppose that $h\_2$ is either $(1,1,1)$ or $(s,s,1)$. Then the projection of $L$ to the 3rd coordinate is cyclic; hence $L\neq S^3$.


