Arjun's matrix multiplication runs faster than Strassens matrix multiplication.
Strassens matrix multiplication is=$n^{\log_{2}^{7}}$.
Arjuns matrix multiplication time complexity=
T(n)=p*T(n/4)+$\theta (n^{2})$
Apply master's theorem TC=$n^{\log_{4}^{p}}$.
In the problem Arjuns TC is less than Strassens multiplication.
$n^{\log_{2}^{7}} >n^{\log_{4}^{p}}$
$n^{\log_{2}^{7}} >n^{\log_{2}^{p^{1/2}}}$
7 >$p^{1/2}$
49>p.
so P value is less than 49 it is equall to 48.