Invariable generation of permutation and linear groups

A subset {x ₁,x ₂,…,x _d} of a group G invariably generates G if {x ₁ ^{g ₁} ,x ₂ ^{g ₂} ,…,x _d ^{g _d} } generates G for every d-tuple (g ₁,g ₂…,g _d)∈G ^d. We prove that a finite completely reducible linear group of dimension n can be invariably generated by ⌊[Formula presented]⌋ elements. We also prove tighter bounds when the field in question has order 2 or 3. Finally, we prove that a transitive [respectively primitive] permutation group of degree n≥2 [resp. n≥3] can be invariably generated by O([Formula presented]) [resp. O([Formula presented])] elements.