There are two graphs ${2}^p$ and q! and we need to determine if they are close enough at some point. Mathematically, it was something like this
1< ${2}^p$ /q! <1.1
So in other terms, is it possible to check if there are any integral values of p(p>7, p $\in$ ${I}^+$) and q(q>5, q $\in$ ${I}^+$) due to which the division gives a value between 1 and 1.1
I have tried figuring it out using the graphical approach and I think there doesn't exists any p or q such that p>7 and q>5, but I think there exists a concrete mathematical approach to figure it out.
Stirling's approximation is enough to generate solutions.
$$2^x \approx y! \approx \sqrt{2\pi y}\left(\frac ye \right)^y \implies x \approx \frac12 \log_2 (2\pi y) + y \log_2 \left(\frac ye \right)$$
These are all pairs $(x,y)$ which satisfy your inequality with $y \le 100$:
{{7, 5}, {70, 22}, {98, 28}, {133, 35}, {170, 42}, {203, 48}, {220, 51}, {290, 63}, {296, 64}, {351, 73}, {376, 77}, {414, 83}, {459, 90}, {505, 97}}For each of these pairs,
$$ \left\lfloor \frac12 \log_2 (2\pi y) + y \log_2 \left(\frac ye \right) \right\rfloor \le x \le \left\lceil \frac12 \log_2 (2\pi y) + y \log_2 \left(\frac ye \right) \right\rceil. $$
Using this bound you can generate pairs as large as you want through some trial/error. For instance, here are some pairs around $y = 10^6$:
{18489124, 1000012}, {18489144, 1000013}Edit: In hindsight, a built-in
loggammafunction might be faster than Stirling's.