bignum IntX package , grouping a number of integer values I(n) where n = 1, 2... n AS A SINGLE large IntX , each I(n) has minimum of 0 and maximum of M(n) ... note all M(n) distinct and can be at most 1000.
Budget: $30 – $250 USD
bignum IntX package , grouping a number of integer values I(n) where n = 1, 2... n , each I(n) has minimum of 0 and maximum of M(n) ... note all M(n) distinct and can be at most 1000.
You provided a most economic representation in IntX as a single number representing all these I(n) integer values . AND CAN DECOMPOSE BACK TO CONSTITUENTS DISTINCT I(n) values
Would be easy for you to write this again on C# DOS Command Prompt in a day or less .$80 on completion
You provided a most economic representation in IntX as a single number representing all these I(n) integer values . AND CAN DECOMPOSE BACK TO CONSTITUENTS DISTINCT I(n) values
Would be easy for you to write this again on C# DOS Command Prompt in a day or less .$80 on completion