Hi,

I try to develop a custom function in order to distribute a number based on a sequence, with separators. An example

- the number is 17

- the sequence is 5

- the separator is "X"

--> the distribution should be

5 X 5 X 5 X 2

The total of the numbers is 17 and each sequence is separated by "X". The distribution ends by the Mod(number ; sequence)

This is the recursive function I developed, without success : Distribution(numbr; rythm)

Let([

M = numbr ;

R = rythm ;

RI = Mod(M ; R) ] ;

Case(

RI = M ; RI ;

R & " X " & Distribution((M - R) ; R))

)

Doesn't work... Find attached my test file : you will see that the results are far from being expected...

Any suggestion will be greatly appreciated !

Christian

test_sequence.zip

I can't find my way through your calc. I think you want something like:

Distribute ( number ; divisor )

Case (

number > divisor ; divisor & " + " & Distribute ( number - divisor ; divisor ) ;

number

)

Edited June 19, 200619 yr by Guest
even simpler

Thanks for your answer.

Unfortunately, it doesn't work beter than mine...

Christian

"doesn't work beter" is not a good description.

Please state your input, your expected result, and the actual result returned.

Sorry, I just re-tried, and the conclusion is that I'm stupid your solution work fine ! I inverted the two data in the formula...

Many thanks for your help !

Christian