Yes it is for all unique combinations - so ABC is included - otherwise the number of combinations wouldn’t be so large.
It is the outline shape I am really interested in. Any thoughts how to get that without having to plot the points at all? At the moment I am thinking of plotting the points...
Yes all number of unique combinations (order does not matter) are possible. Duplicates are not included. To generate the set I've just used binary numbers. The problem is that at 50 options the number of possible combinatins is huge. I have not had chance to try it yet but I think that it does...
any thoughts on how to reduce the number of points? What I am really aiming for is to be able to determine what the outline shape of the distribution would be just from looking at the initial data. Do you think it would be useful to run the program and save the results for 0 options all the way...
Appologies. 2^50 is the total number of possible combinations for when I have 50 options. Some examples for the simplified case above being e.g. AB, BC, ABC, CD, ADC ... In the case above there would be 2^4 possible combinations of A,B,C, &D
To illustrate my problem say I have the following table:
Option, x , y
A , 25 , 30
B , 5 , 12
C , 3 , 9
D, 12, 13
I want to create a graph of every possible combination in the set where the x values are added and the y values are added. For example say it was...
Not too sure which forum this would be best suited to. Say I have lots of polynomials that have been obtained through conducting experiments, with the different coefficients in the polynomial representing different physical properties that have been changed in each case. How could I use this...
Thanks again. For your G(x) using the hex numbers did you just multiply out the brackets? Copy and pasting into wolfram alpha gives a much longer expression with different coefficients.
I have an application that will output numbers comprised of the digits 0-9 (numbers like 47565, 34489, 92838 – this will be the value outputted from an ADC on a microcontroller). I want to provide some FEC via Reed Solomon encoding. I am going with GF(24) and will just not use the values above...
What would you use for the irreducible prime polynomial for GF(11)?
For the multiplication table what I did was just create a table (from 0 - 10) where if the product is less than 11 you just use the product value but if it is greater than 11 use the modulus remainder. Do you mean that you...