I approached the problem by tabulating results and then searching for patterns. I never discovered an algebraic answer, but was able to develop a fractal approach to solving partition problems. That means that my answers are in terms of table coordinates. The partition table is easy to generate due to the fractal nature of the pattern. I've also learned how to answer the question of how many partitions may contain a subgroup of values or how many partitions that contain a given number of parts also contain certain values. I learned that I could partition non-integers, because if P(K) u=1 means the partition of K with one being the smallest value for any part, then P(K) u = P(cK) cu. This means that if u=0.1, I can find the answer by assigning c=10. In the practical world, all results are reported to a number of significant figures and data usually contains only positive values, so the number of ways to obtain a value in the practical world is actually finite, not infinite. If K is a mean value, all possible ways to obtain that mean can be found if we define the number of parts permitted and the number of significant figures. By looking at the frequency of parts with a given value, I can also graph the distribution of values without any restriction on standard deviation.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.