programming to find out all possible combination of numbers a,b,c,d in which 0<a<b<c<d<90.
2 ビュー (過去 30 日間)
古いコメントを表示
all possible combination of numbers a,b,c,d in which 0<a<b<c<d<90.
2 件のコメント
Guillaume
2015 年 8 月 26 日
You have to clarify what you mean by numbers. There is of course an infinity of numbers between 0 and 90. Do you mean integers?
採用された回答
Guillaume
2015 年 8 月 26 日
編集済み: Guillaume
2015 年 8 月 26 日
Isn't this simply four for loop?
for a = 1:86
for b = a+1:87
for c = b+1:88
for d = c+1:89
%do whatever you want with a,b,c,d
end
end
end
end
3 件のコメント
Walter Roberson
2015 年 9 月 4 日
Be specific about how you want them output. Do you want them all displayed? If so then is a list of 4 numbers per line acceptable? Do you need every line to include the text 'a=' and ',b=' and so on? Do you want a variable that contains a something-by-4 array where each line is an a, b, c, d selection?
その他の回答 (4 件)
Walter Roberson
2015 年 8 月 26 日
There will be 4636033603912859644 choices for "a" alone, for a total of 19247532396881346240525890574203961674141911582083171582958740223586992125 combinations. That is roughly the cube of the number of fundamental particles in the observable universe, so there is no known means for recording all of those combinations.
8 件のコメント
Walter Roberson
2015 年 8 月 27 日
A = ABCD(:, 1); B = ABCD(:, 2);
etc. The 5th solution would be A(5),B(5),C(5),D(5)
You asked for all of the solutions and this is all of the solutions. Millions of them.
Kelly Kearney
2015 年 8 月 27 日
For just the integers:
tmp = nchoosek(1:89,4);
a = tmp(:,1);
b = tmp(:,2);
c = tmp(:,3);
d = tmp(:,4);
The nchoosek function automatically sorts its results, so you don't have to worry about the inequality check. You could use the same function to test non-integers, too, though as everyone has pointed out the size of your arrays will quickly get out of control as you increase resolution.
1 件のコメント
Roger Stafford
2015 年 9 月 4 日
Kelly's answer using 'nchoosek' is the best one, Ujjwal, and you should accept it. It will give you 89!/4!/85! = 2,441,626 possible combinations.
Note however that he misstates things a bit where he asserts that 'nchoosek' sorts the results. It does not. It actually uses the same order as was present in the received vector argument, which in the case of 1:89 would happen to be sorted.
UJJWAL BARMAN
2015 年 9 月 4 日
1 件のコメント
Guillaume
2015 年 9 月 4 日
Please use comments rather than answering your own question with another question.
To solve your problem, simply move the save after the end of the last loop and save aa, bb, etc. instead of a, b, etc.
参考
カテゴリ
Help Center および File Exchange で Logical についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!