Recursion Void
Recursion Void
company;
import java.util.*;
import java.lang.*;
if (i<=n/2)
{
if(n%i==0)
System.out.println("Not prime");
else
meth(n,i+1);
}
else
System.out.println("prime Number");
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
meth(n,2);
}
}
Output:
Enter
7
prime Number
8.Code:
package com.company;
import java.util.*;
import java.lang.*;
System.out.println("Enter");
int n = sc.nextInt();
meth(n,s);
}
}
Output:
Enter
153
sum is 9
9.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
meth(n,s);
}
}
Output:
Enter
212
product is 4
10.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
meth(n,s);
}
}
Output:Enter
5
Factorial is 120
11.Code:
package com.company;
import java.util.*;
import java.lang.*;
System.out.println("Enter");
int n = sc.nextInt();
meth(n,s);
}
}
Output:
Enter
245
reverse is 542
12.Code:
package com.company;
import java.util.*;
import java.lang.*;
System.out.println("Enter");
int n = sc.nextInt();
int n1=n;
meth(n,s,count(n),n1);
}
}
Output:
Enter
153
Armstrong
14.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
int n1=n;
meth(n,s,n1);
}
}
Output:Enter
121
Palindrome
import java.util.*;
import java.lang.*;
}else {
System.out.println("sum of even digits "+s);
}
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
int n1=n;
meth(n,s);
}
}
Output:
Enter
121
sum of even digits 2
16.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
int n1=n;
meth(n,s);
}
}
Output:
Enter
56412
Count 5
17.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
int n1=n;
System.out.println("Factors are");
meth(n,s);
}
}
Output:
Enter
6
Factors are
1 2 3 6
18.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
else
System.out.println("HCF "+a);
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
/*System.out.println("Enter");
int n = sc.nextInt();
int n1=n;*/
meth(60,36);
}
}
Output:
HCF 12
19.Code:
package com.company;
import java.util.*;
import java.lang.*;
}
public static void main(String[] args) {
// write your code here
// Characters pattern
Scanner sc = new Scanner(System.in);
System.out.println("Enter");
int n = sc.nextInt();
int n1=sc.nextInt();
meth(n,n1,s);
}
}
Output:
Enter
5 3
power is 125