#22 Known is a Drop! for loop in java

Definition
A control statement used to repeat a block of code multiple times.
Typically used when number of iterations is known.
syntax:
for (initializer; condition; updater) {
//body
}
Initialization → set starting value
Condition → loop continues while true
Update → executed after each iteration
Allowed variations:

Example 1: Printing natural numbers

Example 2: Printing odd numbers

public class sample {

    public static void main(String[] args) {
        for (int i = 1; i <= 10; i++) {
            if(i%2!=0)
            System.out.print(i + "  ");
        }
    }

}
output:
1  3  5  7  9  

Example 3: Printing multiples of 3

public class sample {

    public static void main(String[] args) {
        for (int i = 1; i <= 15; i++) {
            if(i%3==0)
            System.out.print(i + "  ");
        }
    }
}
Output:
3  6  9  12  15  

Example 4: Multiples of 3 and 5

public class sample {

    public static void main(String[] args) {
        for (int i = 1; i <= 50; i++) {
            if(i%3==0&& i%5==0)
            System.out.print(i + "  ");
        }
    }
}
output:
15  30  45  

Example 5: Multiples of 3 or 5

public class sample {

    public static void main(String[] args) {
        for (int i = 1; i <= 20; i++) {
            if(i%3==0|| i%5==0)
            System.out.print(i + "  ");
        }
    }
}
Output:
3  5  6  9  10  12  15  18  20  

Example 5:Divisors and number of divisors of given number

public class sample {

    public static void main(String[] args) {
        int givenNumber=63;
        int count=0;
        for (int i = 1; i <= givenNumber; i++) {
            if(givenNumber%i==0) {
            System.out.print(i + "  ");
            count++;
            }
        }
        System.out.println();
        System.out.println(" Number of divisors:  "+count);
    }
}
Output:
1  3  7  9  21  63  
 Number of divisors:  6

Example 6: Prime numbers

public class ForLoopPrimeNumber {

    public static void main(String[] args) {
        int input=997;
        if(input<=0)
            System.out.println(input+" is Not a prime number ");
        for(int i=2;i<input;i++) {
            if(input%i==0)
                {
                System.out.println(input+" is Not a prime number ");
            break;
                }
            else
            {
                System.out.println(input+" is  a prime number ");
                break;
            }
                    }
    }

}
output:997 is  a prime number