├── Divisor.java
├── Divisorcount.java
├── Findmultiples.java
├── Findprime.java
└── README.md


/Divisor.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Divisor
 3 | {
 4 | public static void main(String [] args)
 5 | {
 6 | Scanner sc = new Scanner(System.in);
 7 | int val = sc.nextInt();
 8 | Divisor call = new Divisor();
 9 | call.find_divisor(val);
10 | }
11 | void find_divisor(int num){
12 | int count =1;
13 | while(count<=num)
14 | {
15 | if(num % count == 0)
16 | {
17 | System.out.println("Divisible by : " + count);
18 | }
19 | count ++;
20 | }
21 | }
22 | }
23 | 


--------------------------------------------------------------------------------
/Divisorcount.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Divisorcount
 3 | {
 4 | public static void main(String [] args)
 5 | {
 6 | Scanner sc = new Scanner(System.in);
 7 | int val = sc.nextInt();
 8 | Divisorcount call = new Divisorcount();
 9 | call.find_divisor_count(val);
10 | }
11 | void find_divisor_count(int num){
12 | int count =0;
13 | int div =1;
14 | while(div<=num)
15 | {
16 | if(num % div == 0)
17 | {
18 | count ++;
19 | }
20 | div ++;
21 | }
22 | System.out.println("Divisors count :" + count);
23 | }
24 | }
25 | 


--------------------------------------------------------------------------------
/Findmultiples.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Findmultiples{
 3 | public static void main(String [] srgs)
 4 | {
 5 | Scanner sc = new Scanner(System.in);
 6 | System.out.println("Enter the number :");
 7 | int num = sc.nextInt();
 8 | System.out.println("Until which line do you want to print :");
 9 | int val = sc.nextInt();
10 | Findmultiples call = new Findmultiples ();
11 | call.printtables(num,val);
12 | }
13 | void printtables(int num,int val)
14 | {
15 | int count = 1;
16 | while(count<=val)
17 | {
18 | System.out.println(count+" * "+num+" = "+(count * num));
19 | count++;
20 | }
21 | }
22 | }
23 | 


--------------------------------------------------------------------------------
/Findprime.java:
--------------------------------------------------------------------------------
 1 | import java.util.*;
 2 | class Findprime
 3 | {
 4 | public static void main(String [] args)
 5 | {
 6 | Scanner sc = new Scanner(System.in);
 7 | int val = sc.nextInt();
 8 | Findprime call = new Findprime();
 9 | call.check_prime(val);
10 | }
11 | void check_prime(int num){
12 | int count =0;
13 | int div =2;
14 | while(div<(num/2))
15 | {
16 | if(num % div == 0)
17 | {
18 | count ++;
19 | }
20 | div ++;
21 | }
22 | if(count == 0)
23 | {
24 | System.out.println("Given number is Prime");
25 | }else
26 | {
27 | System.out.println("Given number is not a Prime Number");
28 | }
29 | }
30 | }
31 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # BASIC-JAVA-PROGRAMS
 2 | PROGRAM 1 : Find the divisors of given number .
 3 | [solution file name : Divisors.java]
 4 | 
 5 | PROGRAM 2 : Find the count of divisors of a given number.
 6 | [solution filename : Divisorcount.java]
 7 | 
 8 | PROGRAM 3 : Find whether the given number is a prime number or not.
 9 | [solution filename : Findprime.java]
10 | 
11 | PROGRAM 4 : Find the multiples of given number in table format.
12 | [solution filename : Findmultiples.java]
13 | 


--------------------------------------------------------------------------------