2

So I need help calculating Pythagorean Triples, basically I want the output to look like this:

3 4 5
5 12 13
6 8 10
7 24 25

ETC.

I need help with the calculation portion and to ensure that I do not have duplicates (i.e. 5 12 13 and 12 5 13).

Thoughts? Can someone lead me in the right direction?

Here is my code that I have so far:

package cs520.hw1;

public class Triples {

        public static void main(String[] args) 
        {
            int x1, x2, x3; 

            for(x1 = 1; x1 < 100; x1++)
            {
                for(x2 = 1; x2 < 100; x2++)
                {
                    for(x3 = 1; x3 < 100; x3++)
                    {
                        int a= x1, b=x2, c=x3;

                        if((Math.sqrt(a) + Math.sqrt(b)) == Math.sqrt(c))
                        {
                            if(a < b)
                            {
                                System.out.println(x1 +"  "+ x2 +"   "+ x3);
                            }
                        }
                    }
                }
            }       
        }
    }
Madhawa Priyashantha
  • 9,633
  • 7
  • 33
  • 60
user3859018
  • 379
  • 1
  • 5
  • 14
  • What's the problem with your code? Are you getting any kind of error? Is it not returning the expected result? What's your question? – Micho Jul 10 '15 at 01:40
  • This is unrelated to your issue, but there's a function `Math.hypot(a,b)` which calculates `sqrt(a*a+b*b)`. It probably doesn't matter in your sample code, mind you; however, if you had very large numbers, it could make a difference. – celticminstrel Jul 10 '15 at 01:45

3 Answers3

1

Example code:

public class QuickTester {

    // Change MAX to whatever value required
    private static final int MAX = 25;

    public static void main(String[] args) {

        int a, b, c;

        for(a = 1; a < MAX; a++)
        {
            for(b = a; b < MAX; b++)
            {
                for(c = b; c < MAX; c++)
                {
                    if((Math.pow(a, 2) + Math.pow(b, 2))
                            == Math.pow(c, 2))
                    {
                        System.out.printf("%d %d %d\n",
                                a, b, c);
                    }
                }
            }
        }
    }
}

Output (for MAX being 25 instead of 100):

3 4 5
5 12 13
6 8 10
8 15 17
9 12 15
12 16 20

Note:

  • To ensure that you don't get (5 12 13 and 12 5 13), simply make sure that a < b < c.
  • Use (Math.pow(a, 2) + Math.pow(b, 2)) == Math.pow(c, 2) to find the triplets
almightyGOSU
  • 3,731
  • 6
  • 31
  • 41
0

You need to change the calls to Math.sqrt(n) to Math.pow(n, 2), where n = a, b, c.

So, the code becomes

 package cs520.hw1;

 public class Triples {

 public static void main(String[] args) 
 {
        int x1, x2, x3; 

        for(x1 = 1; x1 < 100; x1++)
        {
            for(x2 = 1; x2 < 100; x2++)
            {
                for(x3 = 1; x3 < 100; x3++)
                {
                    int a= x1, b=x2, c=x3;

                    if((Math.pow(a, 2) + Math.pow(b, 2)) == Math.pow(c, 2))
                    {
                        if(a < b)
                        {
                            System.out.println(x1 +"  "+ x2 +"   "+ x3);
                        }
                    }
                }
            }
        }       
    }
}
PNS
  • 19,295
  • 32
  • 96
  • 143
0
public class Triplets {
public static void main(String args[]) {
    Scanner in = new Scanner(System.in);
    int a, b, c;
    System.out.println("Enter the value of n: ");
    int n = in.nextInt();
    System.out.println("Pythagorean Triplets upto " + n + " are:\n");
    for (a = 1; a <= n; a++) {
        for (b = a; b <= n; b++) {
            for (c = 1; c <= n; c++) {
                if (a * a + b * b == c * c) {
                    System.out.print(a + ", " + b + ", " + c);
                    System.out.println();
                }
                else
                    continue;                  
            }
        }
    }
}}
iamgoddey
  • 37
  • 1
  • 11