that this is not at all efficient in R. So,
>> (1*13.4689
>> + 1*12.85212+ 1*17.05071) / 1+1+1), (1*13.4689 + 2*12.85212+ 1*17.05071)
>> / 1+2+1)...
>>
>> Is there a better way? If I solve for z is it then easier with an upper
>> limit? So, z = x*0.753288 + y*1.0552
>
As Burt and Jeff stated that there is an infinite set of solutions. If you
are interested in a particular solution, such as getting 15.0078, you can
easily achieve that by trial and error; that is fix 1 or 2 variables and
change the the rest till you get the desired solution.
I tried that and came
I solve for z is it then easier with an upper
> limit? So, z = x*0.753288 + y*1.0552
> and then loop it?
>
> --
> *From:* Bert Gunter
> *Sent:* Friday, December 8, 2017 3:16 PM
> *To:* Jeff Newmiller
> *Cc:* R-help; Benjamin Sabatini
> *Subject:* Re: [R] trying to find the mu
Are x,y, and z supposed to be positive whole numbers? If so, there may be
no solutions. If there is a solution set, of course any multiple of the set
is a solution set, so presumably you want a minimal set in some sense. This
strikes me as a hard problem mathematically, but maybe there is some
obvi
Solve for one of your variables and it will be given in terms of the other two.
That is, there is a whole infinite plane of solutions. No, aggregate will not
be sufficient to enumerate the solution set..
--
Sent from my phone. Please excuse my brevity.
On December 7, 2017 10:37:37 PM PST, Benj
Hi,
I'm trying to find a way to determine what multiples of the combination of
three or more numbers equals a forth number.
So, if I had a number set like:
c(13.4689, 12.85212, 17.05071)
What combination and multiples of these numbers would average to 15.0078? (so,
something that would tell m
6 matches
Mail list logo
