# Taxicab Numbers

Here given code implementation process.

/*
Java program for
Taxicab Numbers
*/
public class TaxicabNumber
{
public void findNTaxicabNo(int n)
{
// Auxiliary variables
int result = 0;
int num = 1;
int count = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
for (int a = 1;
a <= Math.pow(num, 0.3333333333); ++a)
{
for (int b = a + 1;
b <= Math.pow(num, 0.3333333333); ++b)
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count++;
}
}
}
if (count == 2)
{
// Display Taxicab number
System.out.println(num);
// Increase result count
result++;
}
// Increase number count
num++;
// Reset count
count = 0;
}
}
public static void main(String[] args)
{
// Test
}
}

#### Output

1729
4104
13832
20683
32832
39312
#include <iostream>
#include <math.h>

using namespace std;
/*
C++ program for
Taxicab Numbers
*/
class TaxicabNumber
{
public: void findNTaxicabNo(int n)
{
// Auxiliary variables
int result = 0;
int num = 1;
int count = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
for (int a = 1; a <= pow(num, 0.3333333333); ++a)
{
for (int b = a + 1; b <= pow(num, 0.3333333333); ++b)
{
if ((a *a *a) + (b *b *b) == num)
{
// When a³ + b³ = num
count++;
}
}
}
if (count == 2)
{
// Display Taxicab number
cout << num << endl;
// Increase result count
result++;
}
// Increase number count
num++;
// Reset count
count = 0;
}
}
};
int main()
{
// Test
return 0;
}

#### Output

1729
4104
13832
20683
32832
39312
// Include namespace system
using System;
/*
Csharp program for
Taxicab Numbers
*/
public class TaxicabNumber
{
public void findNTaxicabNo(int n)
{
// Auxiliary variables
int result = 0;
int num = 1;
int count = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
for (int a = 1; a <=
Math.Pow(num, 0.3333333333); ++a)
{
for (int b = a + 1; b <=
Math.Pow(num, 0.3333333333); ++b)
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count++;
}
}
}
if (count == 2)
{
// Display Taxicab number
Console.WriteLine(num);
// Increase result count
result++;
}
// Increase number count
num++;
// Reset count
count = 0;
}
}
public static void Main(String[] args)
{
// Test
}
}

#### Output

1729
4104
13832
20683
32832
39312
package main
import "math"
import "fmt"
/*
Go program for
Taxicab Numbers
*/

func findNTaxicabNo(n int) {
// Auxiliary variables
var result int = 0
var num int = 1
var count int = 0
// This loop are executed until result count are not have to n.
for (result < n) {
for a := 1 ; float64(a) <= math.Pow(float64(num), 0.3333333333) ; a++ {
for b := a + 1 ; float64(b) <= math.Pow(float64(num), 0.3333333333) ; b++ {
if (a * a * a) + (b * b * b) == num {
// When a³ + b³ = num
count++
}
}
}
if count == 2 {
// Display Taxicab number
fmt.Println(num)
// Increase result count
result++
}
// Increase number count
num++
// Reset count
count = 0
}
}
func main() {

// Test
findNTaxicabNo(6)
}

#### Output

1729
4104
13832
20683
32832
39312
<?php
/*
Php program for
Taxicab Numbers
*/
class TaxicabNumber
{
public	function findNTaxicabNo(\$n)
{
// Auxiliary variables
\$result = 0;
\$num = 1;
\$count = 0;
// This loop are executed until result count are not have to n.
while (\$result < \$n)
{
for (\$a = 1;
\$a <= pow(\$num, 0.3333333333); ++\$a)
{
for (\$b = \$a + 1;
\$b <= pow(\$num, 0.3333333333); ++\$b)
{
if ((\$a * \$a * \$a) + (\$b * \$b * \$b) == \$num)
{
// When a³ + b³ = num
\$count++;
}
}
}
if (\$count == 2)
{
// Display Taxicab number
echo(\$num.
"\n");
// Increase result count
\$result++;
}
// Increase number count
\$num++;
// Reset count
\$count = 0;
}
}
}

function main()
{
// Test
}
main();

#### Output

1729
4104
13832
20683
32832
39312
/*
Node JS program for
Taxicab Numbers
*/
class TaxicabNumber
{
findNTaxicabNo(n)
{
// Auxiliary variables
var result = 0;
var num = 1;
var count = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
for (var a = 1;
a <= Math.pow(num, 0.3333333333); ++a)
{
for (var b = a + 1;
b <= Math.pow(num, 0.3333333333); ++b)
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count++;
}
}
}
if (count == 2)
{
// Display Taxicab number
console.log(num);
// Increase result count
result++;
}
// Increase number count
num++;
// Reset count
count = 0;
}
}
}

function main()
{
// Test
}
main();

#### Output

1729
4104
13832
20683
32832
39312
import math
#    Python 3 program for
#    Taxicab Numbers
class TaxicabNumber :
def findNTaxicabNo(self, n) :
#  Auxiliary variables
result = 0
num = 1
count = 0
#  This loop are executed until result count are not have to n.
while (result < n) :
a = 1
while (a <= (num ** (1/3))) :
b = a + 1
while (b <= (num ** (1/3))) :
if ((a * a * a) + (b * b * b) == num) :
#  When a³ + b³ = num
count += 1

b += 1

a += 1

if (count == 2) :
#  Display Taxicab number
print(num)
#  Increase result count
result += 1

#  Increase number count
num += 1
#  Reset count
count = 0

def main() :
#  Test

if __name__ == "__main__": main()

#### Output

1729
4104
13832
20683
32832
39312
#    Ruby program for
#    Taxicab Numbers
class TaxicabNumber
def findNTaxicabNo(n)
#  Auxiliary variables
result = 0
num = 1
count = 0
#  This loop are executed until result count are not have to n.
while (result < n)
a = 1
while (a <= num ** (1/3.0))
b = a + 1
while (b <= num ** (1/3.0))
if ((a * a * a) + (b * b * b) == num)
#  When a³ + b³ = num
count += 1
end

b += 1
end

a += 1
end

if (count == 2)
#  Display Taxicab number
print(num, "\n")
#  Increase result count
result += 1
end

#  Increase number count
num += 1
#  Reset count
count = 0
end

end

end

def main()
#  Test
end

main()

#### Output

1729
4104
13832
20683
32832
39312
/*
Scala program for
Taxicab Numbers
*/
class TaxicabNumber()
{
def findNTaxicabNo(n: Int): Unit = {
// Auxiliary variables
var result: Int = 0;
var num: Int = 1;
var count: Int = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
var a: Int = 1;
while (a <= Math.pow(num, 0.3333333333))
{
var b: Int = a + 1;
while (b <= Math.pow(num, 0.3333333333))
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count += 1;
}
b += 1;
}
a += 1;
}
if (count == 2)
{
// Display Taxicab number
println(num);
// Increase result count
result += 1;
}
// Increase number count
num += 1;
// Reset count
count = 0;
}
}
}
object Main
{
def main(args: Array[String]): Unit = {
var task: TaxicabNumber = new TaxicabNumber();
// Test
}
}

#### Output

1729
4104
13832
20683
32832
39312
import Foundation;
/*
Swift 4 program for
Taxicab Numbers
*/
class TaxicabNumber
{
func findNTaxicabNo(_ n: Int)
{
// Auxiliary variables
var result: Int = 0;
var num: Int = 1;
var count: Int = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
var a: Int = 1;
while (Double(a) <= pow(Double(num), 0.3333333333))
{
var b: Int = a + 1;
while (Double(b) <= pow(Double(num), 0.3333333333))
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count += 1;
}
b += 1;
}
a += 1;
}
if (count == 2)
{
// Display Taxicab number
print(num);
// Increase result count
result += 1;
}
// Increase number count
num += 1;
// Reset count
count = 0;
}
}
}
func main()
{
// Test
}
main();

#### Output

1729
4104
13832
20683
32832
39312
/*
Kotlin program for
Taxicab Numbers
*/
class TaxicabNumber
{
fun findNTaxicabNo(n: Int): Unit
{
// Auxiliary variables
var result: Int = 0;
var num: Int = 1;
var count: Int = 0;
// This loop are executed until result count are not have to n.
while (result < n)
{
var a: Int = 1;
while (a <= Math.pow(num.toDouble(), 0.3333333333))
{
var b: Int = a + 1;
while (b <= Math.pow(num.toDouble(), 0.3333333333))
{
if ((a * a * a) + (b * b * b) == num)
{
// When a³ + b³ = num
count += 1;
}
b += 1;
}
a += 1;
}
if (count == 2)
{
// Display Taxicab number
println(num);
// Increase result count
result += 1;
}
// Increase number count
num += 1;
// Reset count
count = 0;
}
}
}
fun main(args: Array < String > ): Unit
{
// Test
}

1729
4104
13832
20683
32832
39312

## Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.