Scribd
Upload
7 views10 pages

Java Programs for Basic Mathematical Operations

The document provides Java programs for various mathematical operations, including calculating the sum of natural numbers, power, factorial, product of two integers, checking for prime numbers, summing digits, reversing a number, counting digits, and converting decimal to binary. Each program is accompanied by example outputs demonstrating its functionality. The document serves as a tutorial for implementing recursive functions in Java.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views10 pages

Java Programs for Basic Mathematical Operations

The document provides Java programs for various mathematical operations, including calculating the sum of natural numbers, power, factorial, product of two integers, checking for prime numbers, summing digits, reversing a number, counting digits, and converting decimal to binary. Each program is accompanied by example outputs demonstrating its functionality. The document serves as a tutorial for implementing recursive functions in Java.

Uploaded by

Rehan Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DURGASOFT

C:\prakashclasses>java Test
10
1 2 3 4 5 6 7 8 9 10

02. Implement a program to calculate sum of 'n' natural numbers


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
import [Link].*;
class Demo
{
static int sum(int n){
if(n==1)
return 1;
else
return n+sum(n-1);
}
}
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
int n = [Link]();
[Link]([Link](n));
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
5
15

C:\prakashclasses>java Test
4
10

03. Implement a program to calculate a^b (a to the power b)


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
import [Link].*;
class Demo
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
51  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
{
static int power(int a,int b){
if(b>=1){
return a*power(a,b-1);
}
else
return 1;
}
}
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
int a = [Link]();
int b = [Link]();
[Link]([Link](a,b));
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
2
3
8

C:\prakashclasses>java Test
3
3
27

C:\prakashclasses>java Test
5
3
125

C:\prakashclasses>java Test
5
10
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
52  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
9765625

4. Implement a program to find factorial of the given number?


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
import [Link].*;
class Demo
{
static int fact(int n){
if(n==0)
return 1;
else
return n*fact(n-1);
}
}
class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
int n = [Link]();
[Link]([Link](n));
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
5
120

C:\prakashclasses>java Test
4
24

Ex:
for(i=0;i<=10;i++){} ----> finate ===> 11 times
for(i=0;i>=0;i++){} -----> infinate

05. Implement a program to calculate product of two integer values (a*b)


DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
53  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
~~~
Ex:
import [Link].*;

class Demo
{
static int product(int a,int b){
if(a<b)
return product(b,a);
else if(b!=0)
return a+product(a,b-1);
else
return 0;
}
}

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
[Link]("Enter a value:");
int a = [Link]();
[Link]("Enter b value:");
int b = [Link]();
[Link]([Link](a,b));
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter a value:
2
Enter b value:
3
6

C:\prakashclasses>java Test
Enter a value:
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
54  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
8
Enter b value:
8
64

06. Implement a program to check whether the given number is prime number or
not?
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
~~~~~~~~~~~~
import [Link].*;

class Demo
{
static boolean isprime(int n,int i)
{
if(i==1)
return true;
else if(n%i==0)
return false;
else
return isprime(n,--i);

}
}

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
[Link]("Enter n value:");
int n = [Link]();
[Link]([Link](n,n/2));//true or false
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter n value:
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
55  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
2
true

C:\prakashclasses>java Test
Enter n value:
3
true

C:\prakashclasses>java Test
Enter n value:
4
false

C:\prakashclasses>java Test
Enter n value:
5
true

C:\prakashclasses>java Test
Enter n value:
6
false

07. Implement a program to find sum of digits present in the given number?
--------------------------------------------------------------------------
import [Link].*;

class Demo
{
static int sumofdigits(int n)
{
if(n==0)
return 0;
else
return (n%10)+sumofdigits(n/10);
}
}

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
56  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
[Link]("Enter n value:");
int n = [Link]();
[Link]([Link](n));
}
}

output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
Enter n value:
5
5

C:\prakashclasses>java Test
Enter n value:
123
6

C:\prakashclasses>java Test
Enter n value:
1234
10

C:\prakashclasses>java Test
Enter n value:
12345
15

[Link] a program to calcualte reverse of the given number?


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

LOL- Lots Of Love for math

formula:

((n%10)*pow(10,len-1))+rev(n/10,--len)

n=123,len=3 ----> 3*pow(10,2) + rev(12,2) ---> 3*100=300


n=12,len=2 -----> 2*pow(10,1) + rev(1,1) ----> 2*10=20
n=1,len=1 ------> 1*pow(10,0) + rev(0,0) ----> 1*1=1
n=0 ------------> 0
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
57  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
300+20+1+0 ===> 321

formula:

((n%10)*pow(10,len-1))+rev(n/10,--len)

n=98123, len=5 ----> 3*pow(10,4) + rev(9812,4) ----> 3*10000=30000


n=9812, len=4 -----> 2*pow(10,3) + rev(981,3) -----> 2*1000 = 2000
n=981, len=3 ------> 1*pow(10,2) + rev(98,2) ------> 1*100 = 100
n=98, len=2 -------> 8*pow(10,1) + rev(9,1) -------> 8*10 = 80
n=9, len=1 --------> 9*pow(10,0) + rev(0,0) -------> 9*1 = 9
n=0 ---------------> terminate --------------------> 32189

rev(98123) = 32189

Ex:
import [Link].*;

class Demo
{
static int reverse(int n,int len)
{
if(n==0)
return 0;
else
return ((n%10)*(int)[Link](10,len-1)) + reverse(n/10,--len);

}
}

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
String s = [Link]();

[Link]([Link]([Link](s),[Link]()));//reverse of
'n'
}
}
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
58  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
output:
-------
C:\prakashclasses>javac [Link]

C:\prakashclasses>java Test
781902
209187

C:\prakashclasses>java Test
Ten
Exception in thread "main"
[Link]: For input string: "Ten"
at [Link]/[Link]
([Link])
at [Link]/[Link]([Link])
at [Link]/[Link]([Link])
at [Link]([Link])

09. Implement a program to count number of digits present in the given number
-----------------------------------------------------------------------------
import [Link].*;

class Demo
{
static int c=0;
static int count(int n)
{
if(n!=0)
{
c++;
count(n/10);
}
return (c!=0)?c:1;
}
}

class Test
{
public static void main(String[] args)
{
Scanner obj = new Scanner([Link]);
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
59  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]
DURGASOFT
int n = [Link]();
[Link]([Link](n));
}
}

output:
-------
C:\prakashclasses>java Test
12345
5

C:\prakashclasses>java Test
123
3

C:\prakashclasses>java Test
12
2

C:\prakashclasses>java Test
1
1

C:\prakashclasses>java Test
0
1

Note:
Octal Constants

C ----> prefixed with 0


C++ --> prefixed with 0
Java -> prefixed with 0
Py ---> prefixed with 0o or 0O

10. Implement a program to convert decimal number into binary?


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
import [Link].*;

class Demo
{
static int convert(int n)
{
DURGASOFT, # 202, 2nd Floor, HUDA Maitrivanam, Ameerpet, Hyderabad - 500038,
60  88 85 25 26 27, 72 07 21 24 27/28 | [Link]
Maii: durgasoftonline@[Link]

You might also like