කාටද පුලුවන්(Who will be the man) ?

[Elcid]

3353533^3 = 342071^3 + 1555639^3 + 3236743^3
7141417^3 = 2368979^3 + 5524903^3 + 5669863^3
7941497^3 = 414487^3 + 5418779^3 + 6990911^3
7985897^3 = 1612439^3 + 3497891^3 + 7732327^3
9332339^3 = 2413097^3 + 5254687^3 + 8678507^3
9700079^3 = 5007017^3 + 5246053^3 + 8630249^3


28477^3 = 10781^3 + 11071^3 + 27361^3
28477^3 = 3739^3 + 17203^3 + 26183^3

33199^3 = 15187^3 + 24197^3 + 26647^3
33199^3 = 2833^3 + 19081^3 + 30941^3
33199^3 = -12227^3 + 26641^3 + 26921^3

Machn Bahu padha 2i ekathu karanna thiyenne....me answer eke 3k ekathu karalane,,,,,,
Any way thanks...

 

[Elcid]

Machn Numbers tika a,b,c <100 nedda kiyala kiyanna puluwanda

0 ta wadi onama number ekak macho.....I think there is something more than...

 

[Elcid]

ade ehema kiyanna epai ban.thanx.mawa mokakda una nikila kiyana wachane dakka gaman.aurudu 5kata withara kalin OL karaddi ahuwa wage mathakai ehema ekak.
eth uththarenam danna machan

aaaa danna ban......

Ok Bro...Thanks 4 the try....

 

[EΜΙFΞXΛ]

machan meka wisadanna ba meka theory ekak widiyata pennanna puluwan
a^n + b^n = c^n

if n > 2

dfrnce eka godak wadi...eh hinda a^3+b^3=c^3 kiyana ekata udaharanayak nam netha

 

[EΜΙFΞXΛ]

so meka hoynna kochchara mahansi unath wedak na..u can try until u die for sure

 

[suranga84]

machan meka wisadanna ba meka theory ekak widiyata pennanna puluwan
a^n + b^n = c^n

if n > 2

dfrnce eka godak wadi...eh hinda a^3+b^3=c^3 kiyana ekata udaharanayak nam netha

In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c can satisfy the equation a^n + b^n = c^n for any integer value of n greater than two,

eth nikan mata matakayak tiyenawa wage ban puluwan kiyala..hebei sure ne okkoma +ve kiyala

 

[koondeGoda]

I wrote a java programe for solve this for positive integers..nothing hardcore just 3 forloops and a separate method to check those against the equation ! but it takes awfully long time to calcualte !! there are no results below 200 for a.b.c(upto which i tried) .. i need a super computer to go beyond..

 

[MegaZonTa]

I wrote a java programe for solve this for positive integers..nothing hardcore just 3 forloops and a separate method to check those against the equation ! but it takes awfully long time to calcualte !! there are no results below 200 for a.b.c(upto which i tried) .. i need a super computer to go beyond..

I wrote a C code .. no answer untill 20000

#include <stdio.h>
#include <conio.h>
void main()
{
	clrscr();
	int a=1,b=1,c=1,q=20000;
	while(a<=q)
	{
		while(b<=q)
		{
			while(c<=q)
			{
			if (c*c*c==a*a*a + b*b*b)
			
			printf("%d %d %d \n",a,b,c);
			
			c++;
			}
		b++;
		}
	a++;

	}
	printf("Search Completed !");
getch();
}

 

[koondeGoda]

I wrote a C code .. no answer untill 20000

#include <stdio.h>
#include <conio.h>
void main()
{
	clrscr();
	int a=1,b=1,c=1,q=20000;
	while(a<=q)
	{
		while(b<=q)
		{
			while(c<=q)
			{
			if (c*c*c==a*a*a + b*b*b)
			
			printf("%d %d %d \n",a,b,c);
			
			c++;
			}
		b++;
		}
	a++;

	}
	printf("Search Completed !");
getch();
}

yup i used the very same algo , used another method for debugin pupropses ..

public class Test {

     public static void main(String[] args) {

         final int limit=500;// upper limit of the values 

          System.out.println("Possible positive values\n");

         for(int a=1 ; a<limit ; a++){

             for(int b=1; b<limit ; b++){

                 for(int c=2 ; c<limit ; c++){
                     if(Test.isValid(a, b, c))
                        System.out.printf(" %d , %d , %d \n" , a,b,c);
                 }
             }
         }
    }
     public static boolean isValid(int a, int b, int c){
        
         if( Math.pow(a, 3) + Math.pow(b, 3) == Math.pow(c, 3))
              return true;
         else
              return false;

     }

}

 

[Chathurangaabey]

okata uththara naa bun....

 

[Elcid]

machan meka wisadanna ba meka theory ekak widiyata pennanna puluwan
a^n + b^n = c^n

if n > 2

dfrnce eka godak wadi...eh hinda a^3+b^3=c^3 kiyana ekata udaharanayak nam netha

In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c can satisfy the equation a^n + b^n = c^n for any integer value of n greater than two,

eth nikan mata matakayak tiyenawa wage ban puluwan kiyala..hebei sure ne okkoma +ve kiyala

I wrote a java programe for solve this for positive integers..nothing hardcore just 3 forloops and a separate method to check those against the equation ! but it takes awfully long time to calcualte !! there are no results below 200 for a.b.c(upto which i tried) .. i need a super computer to go beyond..

I wrote a C code .. no answer untill 20000

#include <stdio.h>
#include <conio.h>
void main()
{
    clrscr();
    int a=1,b=1,c=1,q=20000;
    while(a<=q)
    {
        while(b<=q)
        {
            while(c<=q)
            {
            if (c*c*c==a*a*a + b*b*b)
            
            printf("%d %d %d \n",a,b,c);
            
            c++;
            }
        b++;
        }
    a++;

    }
    printf("Search Completed !");
getch();
}

Good Work Bro...U all are Excellent..
There is no answer for this question..This is a simple part of fermat theory.
Fermat me theory eka 17 wani siyawasedi idiripath kale..Eka 19 wani siyawasa awasan wenakam katawath prove karanna bari una..Meke Provement eka more than 100 Pages....
a^n + b^n =c^n
n>2 wana wita kisima sankyawak thruptha nokarai..

This is the one who gave the Idea...

Fermat!!!!!!!!!!!!!!!!!!!!!!!!!!
He is the best one ever in mathematics...

 

[Elcid]

okata uththara naa bun....

U got that Idea too Bro..

 

[Elcid]

I wrote a C code .. no answer untill 20000

#include <stdio.h>
#include <conio.h>
void main()
{
    clrscr();
    int a=1,b=1,c=1,q=20000;
    while(a<=q)
    {
        while(b<=q)
        {
            while(c<=q)
            {
            if (c*c*c==a*a*a + b*b*b)
            
            printf("%d %d %d \n",a,b,c);
            
            c++;
            }
        b++;
        }
    a++;

    }
    printf("Search Completed !");
getch();
}

yup i used the very same algo , used another method for debugin pupropses ..

public class Test {

     public static void main(String[] args) {

         final int limit=500;// upper limit of the values 

          System.out.println("Possible positive values\n");

         for(int a=1 ; a<limit ; a++){

             for(int b=1; b<limit ; b++){

                 for(int c=2 ; c<limit ; c++){
                     if(Test.isValid(a, b, c))
                        System.out.printf(" %d , %d , %d \n" , a,b,c);
                 }
             }
         }
    }
     public static boolean isValid(int a, int b, int c){
        
         if( Math.pow(a, 3) + Math.pow(b, 3) == Math.pow(c, 3))
              return true;
         else
              return false;

     }

}

Nice

 

[dhanascc]

machan moda joke denna epa..................
mekata solution na...........
eka maths wala theory 1k...............

 

[Elcid]

machan moda joke denna epa..................
mekata solution na...........
eka maths wala theory 1k...............

Good Morning Bro........

 

[Core]

thanks for your awesome question

Written by Myself in Visual C# 2008
I don't know there are correct values all I can say is, it takes lot of times
and I got a Dual Core Machine(2.6Ghz) so I don't think so I can get the answers.if you have a Core i7 with 4.0Ghz Overclocked Machine then try this

the basic procedure goes like that
(values reach upto 100,000)
(a = b=c= 100,000)

Codes to Copy Paste
(before copy and paste first construct a listbox
named lsitbox1)

Tutorial .How to make a library file

http://www.elakiri.com/forum/showthread.php?t=462079

Note: if you want to make a library file(.dll) then tell
me I can do that for languages that works on CLR (Microsoft .NET frame work 1.0<)


private void button1_Click(object sender, EventArgs e)
{
//c^3 = a^3 + b^3
//a,b,c >0
MessageBox.Show("The Max Value that you can reach " + double.MaxValue.ToString());
double a, b, c, _answer_a_b;
a = 0;
b = 0;
c = 0;
double _answer_a = 0;
double _answer_b = 0;
double _answer_c = 0;

for (c = 1; c <= 100000; c++)
{
for (a = 1; a <= 100000; a++)
{
for (b = 1; b <= 100000; b++)
{
//return the values for three variables
_answer_a = (double.Parse(Math.Pow(a, 3).ToString()));
_answer_b = (double.Parse(Math.Pow(b, 3).ToString())); ;
_answer_c = (double.Parse(Math.Pow(c, 3).ToString()));
_answer_a_b = _answer_a + _answer_b;

//Console.WriteLine(_answer_c + " = " + _answer_a + "+" + _answer_b);
Console.WriteLine(_answer_c + " = " + _answer_a_b);


if (_answer_c == _answer_a_b)
{
//the correct values will be added to the listbox
//but you must make a listbox
listBox1.Items.Add(c+"^3" + " = " + a + "^3 + " + b + "^3");
//Console.WriteLine(_answer_c + "=" + a + "^3 + " + b + "^3");

}
}
}
}

}


Ok thanks .!

 

[akalanka_yapa]

ammo den nam maths mathaka nehe

 

[Core]

http://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem

 

[Core]

 

[Elcid]

http://en.wikipedia.org/wiki/Fermat's_Last_Theorem

It looks U have done so many Hard Work Bro...Thanks 4 sharing them..
It will be make a huge difference in mathematics if someone find the numbers...
As I know this theorem is the one of the longest provements in mathematics and there are so many doubts in that...
Thanks Bro...