Question 1046143
{{{1/99="0.010101..."}}} , {{{2/99="0.020202..."}}} ,
and for any {{{p}}} integer that is not a multiple of 11, or 99,
the decimal part of {{{p/99}}} will be a 2-digit repeating sequence.

So, we can represent all {{{10^4/m}}} numbers whose decimal expansion is a 2-digit repeating sequence as
{{{p/99}}} , where {{{p}}}= an integer that is not a multiple of 11.
Then, {{{10^4/m=p/99}}} , and {{{1/m=(1/10^4)(p/99)}}}
has pairs of repeating digits after the 4th decimal place.
{{{1/m=(1/10^4)(p/99)}}}--->{{{m=99*10^4/p}}}-->{{{m=3^2*11*2^4*5^4/p}}} .
For that {{{m}}} to be an integer,
{{{p}}} cannot have any factors not present in {{{3^2*11*2^4*5^4}}} ,
and for {{{m}}} to be an odd integer,
{{{p}}} must have {{{2^4}}} as a factor.
Choosing {{{p=3^2*2^4*5^4}}} , we get {{{m=3^2*11*2^4*5^4/(3^2*2^4*5^4)=11}}} with {{{1/m="0.09090909..."}}} .
That is the smallest odd positive integer {{{(m)}}} so that the decimal expansion of {{{1/m}}} has pairs of repeating digits after the 4th decimal place.
However, {{{m=11}}} may not be considered the right answer,
because the phrase "just 4 non recurring digits" probably means that the third decimal places must be different from the 5th one,
and the and fourth one must be different from the sixth one.
So, we need to put less factors into {{{p}}} ,
leaving {{{m}}} with more of the factors in {{{3^2*11*5^4}}} to get
{{{m=3*11=33}}} with {{{1/m=1/33="0.03030303..."}}} (not right either),
{{{m=5*11=55}}} with {{{1/m=1/33="0.02020202m=..."}}} (not right either),
{{{m=3^2*11=99}}} with {{{1/m=1/99="0.01010101..."}}} , and so on.
We could keep trying to drop factors from {{{p}}} ,
until we get to {{{m=11*5^6=6875}}},
when {{{1/m=1/6875="0.0001454545..."}}}
has a 4th decimal digit {{{(1)}}} that is different from the sixth one {{{(5)}}} .
So, {{{highlight(m=6875)}}} is my answer.
 
NOTE: there is an option that does not require trying so many factor combinations to get to {{{m}}} ,
but it does require more algebra, so it may not get to the answer faster.