Hello Guys ,
Once again I am back with a new interesting article in Java Programming. Check number divisibility using vedic maths in terms of Java Program. If you like it please share and comment on it.
Program to find divisibility using vedic maths
public class Controller {
public static boolean case2(int number,int divisible){
boolean flag= false;
if(number%10 == 0 || number%10 == 2 ||number%10 == 4 ||number%10 == 6 ||number%10 == 8){
System.out.println("Yes "+number+" is divisible by "+divisible);
flag = true;
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
return flag;
}
public static boolean case3(int number,int divisible){
boolean flag= false;
int sum = 0;
int remander = 0;
int temp = number;
while(temp!=0){
remander = temp%10;
temp = temp/10;
sum+=remander;
}
if(sum%3==0){
System.out.println("Yes "+number+" is divisible by "+divisible);
flag = true;
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
return flag;
}
public static void case4(int number,int divisible){
double sum2 = (double)number/100;
String floatToString = Double.toString(sum2);
int lastValue = Integer.parseInt(floatToString.substring(floatToString.indexOf(".")+1));
if(lastValue%4==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case5(int number,int divisible){
if(number%10 == 0 || number%10 == 5)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case6(int number,int divisible){
boolean status = case2(number,2);
if(status){
boolean status2 = case3(number,3);
if(status2)
System.out.println("Yes so "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
}
public static void case7(int number,int divisible){
int remander = 0;
int tempNum = number;
if((tempNum+"").length()>2){
while(tempNum!=0){
remander = tempNum%10;
int sum = remander*2;
tempNum = tempNum/10;
tempNum = tempNum-sum;
if((tempNum+"").length() == 2)
break;
}
}
if(tempNum%7 ==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case8(int number,int divisible){
double sum2 = (double)number/1000;
String floatToString = Double.toString(sum2);
int lastValue = Integer.parseInt(floatToString.substring(floatToString.indexOf(".")+1));
if(lastValue%8==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case9(int number,int divisible){
int sum = 0;
int remander = 0;
int temp = number;
while(temp!=0){
remander = temp%10;
temp = temp/10;
sum+=remander;
}
if(sum%9==0){
System.out.println("Yes "+number+" is divisible by "+divisible);
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
}
public static void case11(int number,int divisible){
String conversion = String.valueOf(number);
int length = (number+"").length();
int conversionArr[] = new int[length];
int count = 0;
while(count<length){
conversionArr[count] = Character.getNumericValue(conversion.charAt(count));
count++;
}
int odd = 0,even = 0;
for(int i=0;i<conversionArr.length;i++){
if(i%2==0){
even+= conversionArr[i];
}else{
odd+= conversionArr[i];
}
}
int sub = even - odd;
if(sub==0 || sub%11==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void main(String[] args) {
System.out.println("Enter the number:- ");
Scanner sc = new Scanner(System.in);
int number = sc.nextInt();
System.out.println("Enter divisible by number( only 2 to 9 and 11 are allow):-");
int divisible = sc.nextInt();
switch(divisible){
case 2: case2(number,divisible);
break;
case 3: case3(number,divisible);
break;
case 4: case4(number,divisible);
break;
case 5: case5(number,divisible);
break;
case 6: case6(number,divisible);
break;
case 7: case7(number,divisible);
break;
case 8: case8(number,divisible);
break;
case 9: case9(number,divisible);
break;
case 11: case11(number,divisible);
break;
default: System.out.println("you have entered wrong choice");
}
}
}
Once again I am back with a new interesting article in Java Programming. Check number divisibility using vedic maths in terms of Java Program. If you like it please share and comment on it.
Program to find divisibility using vedic maths
public class Controller {
public static boolean case2(int number,int divisible){
boolean flag= false;
if(number%10 == 0 || number%10 == 2 ||number%10 == 4 ||number%10 == 6 ||number%10 == 8){
System.out.println("Yes "+number+" is divisible by "+divisible);
flag = true;
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
return flag;
}
public static boolean case3(int number,int divisible){
boolean flag= false;
int sum = 0;
int remander = 0;
int temp = number;
while(temp!=0){
remander = temp%10;
temp = temp/10;
sum+=remander;
}
if(sum%3==0){
System.out.println("Yes "+number+" is divisible by "+divisible);
flag = true;
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
return flag;
}
public static void case4(int number,int divisible){
double sum2 = (double)number/100;
String floatToString = Double.toString(sum2);
int lastValue = Integer.parseInt(floatToString.substring(floatToString.indexOf(".")+1));
if(lastValue%4==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case5(int number,int divisible){
if(number%10 == 0 || number%10 == 5)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case6(int number,int divisible){
boolean status = case2(number,2);
if(status){
boolean status2 = case3(number,3);
if(status2)
System.out.println("Yes so "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
}
public static void case7(int number,int divisible){
int remander = 0;
int tempNum = number;
if((tempNum+"").length()>2){
while(tempNum!=0){
remander = tempNum%10;
int sum = remander*2;
tempNum = tempNum/10;
tempNum = tempNum-sum;
if((tempNum+"").length() == 2)
break;
}
}
if(tempNum%7 ==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case8(int number,int divisible){
double sum2 = (double)number/1000;
String floatToString = Double.toString(sum2);
int lastValue = Integer.parseInt(floatToString.substring(floatToString.indexOf(".")+1));
if(lastValue%8==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void case9(int number,int divisible){
int sum = 0;
int remander = 0;
int temp = number;
while(temp!=0){
remander = temp%10;
temp = temp/10;
sum+=remander;
}
if(sum%9==0){
System.out.println("Yes "+number+" is divisible by "+divisible);
}
else{
System.out.println("no "+number+" is not divisible by "+divisible);
}
}
public static void case11(int number,int divisible){
String conversion = String.valueOf(number);
int length = (number+"").length();
int conversionArr[] = new int[length];
int count = 0;
while(count<length){
conversionArr[count] = Character.getNumericValue(conversion.charAt(count));
count++;
}
int odd = 0,even = 0;
for(int i=0;i<conversionArr.length;i++){
if(i%2==0){
even+= conversionArr[i];
}else{
odd+= conversionArr[i];
}
}
int sub = even - odd;
if(sub==0 || sub%11==0)
System.out.println("Yes "+number+" is divisible by "+divisible);
else
System.out.println("no "+number+" is not divisible by "+divisible);
}
public static void main(String[] args) {
System.out.println("Enter the number:- ");
Scanner sc = new Scanner(System.in);
int number = sc.nextInt();
System.out.println("Enter divisible by number( only 2 to 9 and 11 are allow):-");
int divisible = sc.nextInt();
switch(divisible){
case 2: case2(number,divisible);
break;
case 3: case3(number,divisible);
break;
case 4: case4(number,divisible);
break;
case 5: case5(number,divisible);
break;
case 6: case6(number,divisible);
break;
case 7: case7(number,divisible);
break;
case 8: case8(number,divisible);
break;
case 9: case9(number,divisible);
break;
case 11: case11(number,divisible);
break;
default: System.out.println("you have entered wrong choice");
}
}
}
Comments
Post a Comment