Since
1043l−⌊1043l⌋=1043m−⌊1043m⌋=1043n−⌊1043n⌋,
we have
3l≡3m≡3n(mod104)⟺{3l≡3m≡3n(mod24),3l≡3m≡3n(mod54).(1)
As (3,2)=1, we then have from (1) 3l−n≡3m−n≡1(mod24).
Let u be the minimum positive integer satisfying 3u≡1(mod24).
Then for every positive integer v satisfying 3v≡1(mod24), we must have u∣v. Otherwise, if u∤v, then using division with a remainder we could get two non-negative integers a and b satisfying v=au+b with 0<b<u. Then 3b≡3au+b≡3v≡1(mod24), contradicting the definition of u. Therefore u∣v.
Notice that
3≡3(mod24), 32≡9(mod24),
33≡27≡11(mod24), 34≡1(mod24),
then u=4. We may assume that m−n=4k, where k is a positive integer.
In the same way, we get from (2) 3m−n≡1(mod54), that is,
34k≡1(mod54).
Now, we are going to find number k. As 34k−1=(1+5×24)k−1=0(mod54), i.e.
5k×24+2k(k−1)×52×28+6k(k−1)(k−2)×53×212=5k+52k[3+(k−1)×27]+3k(k−1)(k−2)×53×211=0(mod54),
so k=5t. Substituting in the above expression, we get
t+5t[3+(5t−1)×27]≡0(mod52).
Then k=5t=53s, and m−n=500s, where s is a positive integer.
In the same way, we get l−n=500r, where r is a positive integer and r>s since l>m>n.
So the three sides of the required triangle are l=500r+n, m=500s+n and n, respectively, satisfying n>l−n=500(r−s). When s=1, r=2 the perimeter reaches the minimum which equals (1000+501)+(500+501)+501=3003.