Project Euler 9 Understanding

Posted by DMan on Stack Overflow See other posts from Stack Overflow or by DMan
Published on 2010-05-05T00:29:21Z Indexed on 2010/05/05 0:38 UTC
Read the original article Hit count: 296

Filed under:

project-euler

This question states:

A Pythagorean triplet is a set of three natural numbers, a b c, for which,

a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52.

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

I'm not sure what's it trying to ask you. Are we trying to find a^2+b^2=c^2 and then plug those numbers into a+b+c=1000?

Related posts about project-euler

Project Euler considered harmful

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I've done some Project Euler problems and I was able to solve them very fast because I already knew all the theory behind them. I learned that "accidentaly" because I also had to learn it for university. I used to also solve olympiad problems, I wasn't very good but I was solving some of the problems… >>> More
Project Euler #15

as seen on Stack Overflow - Search for 'Stack Overflow'
Hey everyone, Last night I was trying to solve challenge #15 from Project Euler: Starting in the top left corner of a 2×2 grid, there are 6 routes (without backtracking) to the bottom right corner. How many routes are there through a 20×20 grid? I figured this shouldn't be… >>> More
Project Euler: Programmatic Optimization for Problem 7?

as seen on Stack Overflow - Search for 'Stack Overflow'
So I would call myself a fairly novice programmer as I focused mostly on hardware in my schooling and not a lot of Computer Science courses. So I solved Problem 7 of Project Euler: By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is… >>> More
Project Euler 7 Scala Problem

as seen on Stack Overflow - Search for 'Stack Overflow'
I was trying to solve Project Euler problem number 7 using scala 2.8 First solution implemented by me takes ~8 seconds def problem_7:Int = { var num = 17; var primes = new ArrayBuffer[Int](); primes += 2 primes += 3 primes += 5 primes += 7 primes += 11 primes += 13 … >>> More
Project Euler 51: Ruby

as seen on Johnny Coder - Search for 'Johnny Coder'
In my attempt to learn Ruby out in the open, here’s my solution for Project Euler Problem 51. I know I started back up with Python this week, but I have three more Ruby solutions in the hopper and I wanted to share. For the record, Project Euler 51 was the second hardest Euler problem for me… >>> More

Developer IT

Project Euler 9 Understanding - Developer IT

Project Euler 9 Understanding

project-euler

Related posts about project-euler

Project Euler considered harmful

Project Euler #15

Project Euler: Programmatic Optimization for Problem 7?

Project Euler 7 Scala Problem

Project Euler 51: Ruby

Categories cloud