Euler problem 9.1

.

There exists exactly one Pythagorean triplet for which *a + b + c = 1000*. Find the product *abc*.

(defune9c()(loop:for a :from 1 :to 1000 :do(loop:for b :from 1 :to a :do(let((c(- 1000(+ a b))))(if(=(+(* a a)(* b b))(* c c))(return-frome9c(lista b c(* a b c))))))))

— colorized by palette fm

— Me@2022-12-05 05:59:49 PM

.

.

2022.12.05 Monday (c) All rights reserved by ACHK

You must be logged in to post a comment.