Deprecated: Methods with the same name as their class will not be constructors in a future version of PHP; SEOFriendlyImages has a deprecated constructor in /home/tutorig3/public_html/wp-content/plugins/seo-image/seo-friendly-images.class.php on line 2

Warning: "continue" targeting switch is equivalent to "break". Did you mean to use "continue 2"? in /home/tutorig3/public_html/wp-content/themes/mts_interactive/options/php-po/php-po.php on line 185
Kotlin Program to Print Prime Numbers Between Interval - Tutorialwing

Kotlin Program to Print Prime Numbers Between Interval

Greetings!
We have recently published 100+ articles on android tutorials with kotlin and java. If you need, you may visit Android Tutorial for beginners page. You can also check Kotlin Tutorial for beginners. Also, if you are interested in content writing, you can mail us at tutorialwing@gmail.com.

Write a Kotlin program to print prime numbers between interval a and b, assuming a < b

Example
Input
a = 10, b = 20

Output
11 13 17 19

1. Program to print prime numbers between interval

Pseudo Algorithm –

  • Check conditions for valid range. b must be greater than or equal to a.
  • Run a loop from a to b
  • Check for each value between a and b whether it is prime or not. If yes, print it. Otherwise, check for next value.

Sourcecode –

import java.util.*
import kotlin.math.sqrt

fun main() {
    val read = Scanner(System.`in`)

    println("Enter a:")
    val a = read.nextInt()

    println("Enter b:")
    val b = read.nextInt()

    if(b < a) {
        println("Invalid Range a > b")
    } else {
        for(i in a..b) {
            if(checkPrime(i)) {
                print("$i ")
            }
        }
    }
}

private fun checkPrime(n: Int): Boolean {

    // Number less than or equal 1 is not prime
    if(n <= 1)
        return false

    // 2 is only even prime number
    if(n == 2)
        return true

    // Check if number (> 2) is even. If yes, it is not prime.
    if(n % 2 == 0)
        return false

    var flag = true

    val root  = sqrt(n.toDouble()).toInt()

    // We need to check till square root of n only to find whether n is prime.
    for(i in 3..root step 2) {
        if((n % i) == 0) {
            flag = false
            break
        }
    }

    return flag
}

When you run the program, output will be –

Enter a:
1
Enter b:
100
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Explanation:

As per pseudo algorithm, we checked for each value between a and b for prime number.

  • If a > b, it means range is not value. So, we print error message.
  • Otherwise, we run a loop from a to b.
  • Then, we check whether current value is prime or not.
  • Logic for prime has been explained in previous post. You can go through it to know how it works.

Thus, we went through Kotlin Program to print prime numbers between given interval.

Support Us

If you like Tutorialwing and would like to contribute, you can email an article on any educational topic at tutorialwing@gmail.com. We would love to publish your article. See your article on Tutorialwing and help others with your knowledge. Follow Facebook, LinkedIn, Google+, Twitter, Youtube for latest updates.
Greetings!
We have recently published 100+ articles on android tutorials with kotlin and java. If you need, you may visit Android Tutorial for beginners page. You can also check Kotlin Tutorial for beginners