ans = 
Before starting in your project, you should visit
The course is free of costs and helps you to learn the basics of the new software.
Variable might be set by a nonscalar (three variables in pythagorean triplet)
4 次查看（过去 30 天）
显示 更早的评论
Hi everyone,
Im working for project euler and I try to do #9 (Special Pythagorean Triplet). I have encountered couples of errors, one of which is something that occurs from my trying to make 3 arrays probably, some of them are named Variable might be set by a nonscalar and other errors which I don't understand.
function y = pythtrip(a,b,c)
%UNTITLED Summary of this function goes here
% Detailed explanation goes here
y = a*b*c;
a = 0:750;
b = 0:750;
c = 0:750;
while (a>b) && b>c && (a^2)+(b^2)==(c^2) && a+b+c == 1000;
pythtrip(a,b,c)
y;
end
9 个评论
John D'Errico
2025-7-23
But you are making EXACTLY my point. If you are solving PE problems, then a triply looped solution will stop being viable very quickly. Even an O(S) solution, as you showed, is useless if S becomes just a little larger, say 1e20. And PE problems are notorious for exactly that, at least once you get past the first dozen or so. Then you need to be looking for better solutions, not brute force. And even a linear solution can be poor at some level.
Torsten
2025-7-23
编辑：Torsten
2025-7-23
Yes, I agree: your solution is better than mine (or since it's not mine: the one that I found as classified "optimal" because of complexity O(S)). Maybe it's more difficult to put your method into formal MATLAB code where you only have to specify the value of the sum and all the triples are automatically generated. But in principle it's more efficient.
Maybe your method is hard to find since the complexity of factoring is not known to be polynomial in the input size.
回答（1 个）
John D'Errico
2025-7-19
编辑：John D'Errico
2025-7-19
Let me suggest that brute force is NEVER the good way to solve a project Euler problem. NEVER. When brute force is applied, most of brute froce codes you would write would still be running long after both you and your computer are piles of dust. (Ok, I'll admit that the Sudoku PE problem was doable by me merely solving each sudoku puzzle by hand, then computing a result. That was ok, since I like doing sudoku puzzles. But that was one of the very, very few PE problems I solved on paper, and I recall having solved around 300 of them almost entirely in MATLAB.) I will comcede that this problem is probably doable via brute force, as a pretty low numbered problem. But that still makes it a poor choice of method.
Instead, start with the Euclidean formula for Pythagorean triples. ALWAYS do some reading and thinking BEFORE you try to write code for a PE problem.
In there, you will learn how to represent all Pythagorean triples as the triple:
{a,b,c} = {k*(m^2-n^2), 2*k*m*n, k*(m^2+n*2)}
In that formula, we know that m>n is necessary. What do you know about the desired triples? Their sum must be 1000, What can you get from that formula?
a+b+c == 2*k*m*2 + 2*k*m*n == 2*k*m*(m+n) == 1000
Now look for all such values of k,m,n, where m>n, such that the produt holds. It looks like solution for a sum as small as 1000 can be done using pencil and paper. And since they tell you that only one solution exists, you can do it via some pretty fast trial and error, just by looking at the factor pairs of a number.
factor(1000)
We know that one of those factors of 2 is already taken.
factorpairs = @(N) [divisors(N)',N./divisors(N)'];
First, suppose k is 1, then we can find M and N
fp = factorpairs(500)
Each such pair of factors would imply a value for m and n. Remembering that m>n is a requirement for the Euclid formula to work, we might do this:
mnsolve = @(fp) [fp(:,1), fp(:,2) - fp(:,1)];
mnsolve(fp)
And when k==1, only one such pair seems to yield a viable pythagorean triple.from that set. (Remember the rules about m and n. They must be both positive, and must have m>n.) You might decide to test it to see if that pair indeed satisfies your needs.
triplefun = @(k,m,n) k.*[m.^2-n.^2, 2*m.*n, m.^2+n.^2)];
Now you could try it again for k=2, which would require the factor pairs of 250.
Honestly, I don't recall my solution method for this problem, but I would guess I did something fairly simple like this. I could look it up, since I think I saved the MATLAB codes for all of those PE problems.
1 个评论
John D'Errico
2025-7-20
编辑：John D'Errico
2025-7-21
Just for kicks, using the ideas in my answer, how would I find a pythagorean triple with a designated sum a+b+c=123456?
S = 123456;
factor(S)
factorpairs = @(N) [divisors(N)',N./divisors(N)'];
mnsolve = @(fp) [fp(:,1), fp(:,2) - fp(:,1)];
% with k == 1:
k = 1;
fp = factorpairs(S/2/k)
mnsolve(fp)
There are clearly no valid solutions when k==1. But, when k==643 (there may be other solutions, I did not look further through all of the divisors of S to learn if there may be others. I'd not be amazed if there were.)
k = 643;
fp = factorpairs(S/2/k)
mnsolve(fp)
We do see there parameters m and n that will generate a triple. m>n is the requirement, and both must be positive. I could have automated this fairly easily, but the explanations are I think more useful.
triplefun = @(k,m,n) k.*[m.^2-n.^2, 2*m.*n, m.^2+n.^2];
T = triplefun(643,8,4)
sum(T)
Is this a pythagorean triple?
dot(T.^2,[1 1 -1])
As expected, indeed it is. Note that the triple I did find is a pretty large one. And brute force loops would have taken a fair amount of time to produce a result. As well, you should see the above computation took essentially no CPU time to find. What if the sum had been given as something on the order of 1e12 instead? What if it had been as large as 1e100? That would be a problem more worthy of Project Euler. As long as I used syms in the computations there to avoid double precision issues, it would still have taken virtually no effort to solve. Again, this is what you need to take away from Project Euler, to look more deeply into a problem than just brute force. While brute force can work for small problems, it often becomes intractable, and that can happen very quickly.
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
您也可以从以下列表中选择网站：
美洲
- América Latina (Español)
- Canada (English)
- United States (English)
欧洲
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom(English)
亚太
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)