for n = min_negative:0.01:max_positive,
for a= min_negative:0.01:max_positive,
for b= min_negative:0.01:max_positive,
for c= min_negative:0.01:max_positive,
if (n>2 & a^n == b^n + c^n),
disp('Theorem falsified');
end
end
end
end
end
Very inefficient and works only for a restricted step size. You can change
it to find n.
Roy
"Rabi Zak" <abuzakour@hotmail.com> wrote in message
news:eed097d.-1@webx.raydaftYaTP...
> hi
>
> fermat's last theorem (proved in 1994) states that
>
> there is no N such that N>2 & a^n= b^n + c^n
>
> how can I write a matlab program that
> searches for n based on iteration
>
> :)
> thanks
|