Let $G$ be a finite group. It is easy to prove that the elements of $G$ with odd order are in odd number. Indeed, if, for every divisor $d$ of the order of $G$, $r_{d}$ denotes the number of elements of $G$ with order $d$, then the number of elements of $G$ with odd order is $1 + \sum_{d} r_{d}$, where $d$ ranges over the odd divisors of $\vert G \vert$ such that $d \geq 3$; but $r_{d}$ is divisible by $\varphi (d)$ (Euler function) and, for a naturel number $n \geq 3$, $\varphi (n)$ is even, thus it is well true that the elements of $G$ with odd order are in odd number.
So, my question is : let $G$ be a finite group and $p$ a prime number; is it known if it is necessarily true that the elements of $G$ with order coprime to $p$ are in number coprime to $p$ ?
I found some lemmas and, if I am not wrong, these lemmas make it possible to prove that the answer is "yes" for every group of order $\leq 431$. Since my proof of this meager result is very long, I will only sketch it if I don't get a better answer.
Edit (August 8, 2021). I discover that this question is Exercise 28 b) in Bourbaki, Algèbre, ch. I (Paris, 1970), § 6, p. I.139.