i guess this is an easy one , but since i'm not a mathematician ....
Let a[i..j] and b[p..q] be two substring and let |a[i..j]| and |b[p..q]| be their lengths
How would i formally define : a pair (a[i..j],b[p..q]) is the minimal pair of substrings between all (a,b) substring pairs from 1 to 100 such that |b[p..q]|-|a[i..j]|=5.
my attempt :
does it say the same thing as in the sentence?
ok so the question is not if i can do it or not bur how would i write it down. But to answer your questions:
let say i have a string S = abababba
and i chpo it down to substrings (all possible)
s1 = aba
s2 = abab
s3 = abba
s4 = babab
now every substring has a length so a pair of substrings (s1,s3) = (3,4). therefore for every possible pair i will get a pair of their lengths. now i am looking for a pair of substrings with lengths when subtracted give a certain (absolute) value, let say 1. then what i have is a set of pairs (s2,s1),(s3,s1),(s4,s3),(s4,s2) and the minimum substring pair that satisfies my condition is (s2,s1),(s3,s1) (ok i have 2 minimum values but in a real case scenario this cannot ever happen since i have another condition that prevents it)
sorry if i was vague but when i talk to people that do this i usually end-up like an idiot for not knowing this so i did not want to look like one again (big fail again )