I need a regex to not only find a number in the format 'nnn nnn nnn' but to also perform an algorithm on the digits. The algorithm can be done by find and replace and tally marks and not math functions. For instance first number 5 multiplied by check digit 2 would be 10 tally marks. this is done on all 9 numbers. Then we divide by replacing a number tally marks with a different mark. So 10 tally marks where we replace 4 with the alternative mark would leave 2 original tally marks. If there are any of the of the original tally marks left then the number is not an integer and not a match.
I am hopeful this is possible due to the conversation here:-
[login to view URL]
Some folks have managed to get a regular expression to match prime numbers:-
[login to view URL]
We can only use standard regex (no script, perl etc.), our implementation is basically these:-
[login to view URL]
[login to view URL]
[login to view URL]
There is a really good chance this is not possible. Feel free to call me crazy. However we are using software that does not support anything but regex at the crucial step.