Skip to main content

About us


About Us

Simple java programs with explanation, tutorials, tips and tricks

If you have any query regrading Site, Advertisement and any other issue, please feel free to contact at shobhitdubey9902@gmail.com

Comments

Post a Comment

Popular posts from this blog

Java program for prime numbers

A prime number is the number which is is  divisible by itself and not by other numbers. A program to check prime number can be made by using for and while loop combination . This article contains java program for finding prime number ,write a java program for prime number between 1- 100 ,simple program to find prime factorial of a number in java. EXAMPLE 1 - program to check whether a number is prime number  or not. import java.util.*; public class pr { public static void main() { Scanner sc=new Scanner(System.in); System.out.println("enter number"); int num=sc.nextInt(); int d=0; for(int i=2;i<=num;i++) { if(num%i==0) d++; } if(d==0) System.out.println("it is a prime number"); else System.out.println("it is not a prime number"); } } Output enter number 23 it is a p...
Post a Comment
Read more

Niven number in java

A number is said to be niven or harshad if the number is divisible by the sum of its digits. EXAMPLE-135 The sum of digits are: 1 + 3 + 5                                                                  135/9=15 A simple java program to check whether a number is harshad / niven or not can be made with the help of while loop. For this, firstly we extract the digits of the number and then we sum up all the digits.After all the digits are summed then we check whether rhe number when divided by the sum of its digits leaves any remainder or not. If the remainder is zero then number is niven / harshad number else not. ALGORITHM - STEP 1: Start STEP 2 : print "enter a number" STEP 3 : taking input of integer in n STEP 4 : int s = 0 STEP 5 : int no = n STEP 6 : repeat STEP 7 to STEP 9 until no!=0 STEP 7 : int d=no%10 STEP 8 : s=s+d...
Post a Comment
Read more

Emirp number in java, program to check emirp number

Emirp is simply the reverse prononciation of word "prime". An emirp number is the number which is prime and whose reverse is also a prime number. EXAMPLE-1 17  Reverse of the number = 71 Both the numbers are prime so 17 is an emirp number. EXAMPLE-2 37 Reverse of the number = 73 Both the numbers are prime so 37 is an emirp number. EXAMPLE-3 13 Reverse of the number = 31 Both the numbers are prime so 13 is an emirp number. Emrip number can be easily made in java with the help of methods/functions. Firstly, take an input of number, then check it is prime or not, then reverse the number and again check it is prime or not, if both are true, print the suitable output. ALGORITHM- STEP 1 : start STEP 2 : print "enter a number" STEP 3 : take input of number in e STEP 4 : int n=num, int rev =0 STEP 5 : repeat STEP to STEP until n>0 STEP 6 : int d=n%10 STEP 7 : rev=(rev*10)+d STEP 8 : n=n/10 STEP 9 :  int p= input value from STEP 13 STEP 10 : int d=0, x=num STEP 11 : int i...
Post a Comment
Read more