Originally Posted by

**Tinkerz** Dear all,

I am not a math professional but would like some help if possible.

I am working with two sets of numbers that I would like to transform, I will be declaring them in an array.

The sets of numbers will be 1 to 5

The both sets set will decrease from 5 to 1

Both numbers in each set are equi-distant form each other

The pattern will look like Laplace distribution.

set1 array set 2 array

5,4,3,2,1 1,2,3,4,5

10,8,6,4,2 3,5,7,9,11

I would like to transform the numbers in the array, then find a strength between the transformed distribution and the laplace distribution on the original numbers

Second

Work with 2 sets of transformed numbers.

one being the master the other the slave, the pattern would look like

master 100,101,99,101,99,101,99

slave 1, 1, 2, 3, 3, 3,

so the master changes indepentely of the slave, but the slave cannot change with out the master doing so

So I would like to find the strength of the slave, when it gets stronger to the master.

Please can you help me.

2) I am looking to write this in C#, so any free .net package that I can call will be the easiest way for me.

3) I don't know which inputs to take out of FFT and into Laplace so I would like instructions on that too, please feel free to ask questions.

Many thanks

Tinkerz