fork download
copy 
  1. import kotlin.math.sqrt
  2.  
  3.  
  4. fun isPrime(n: Int): Boolean {
  5.   if (n < 2) {
  6.     return false
  7.   }
  8.  
  9.   for (i in 2 until sqrt(n.toDouble()).toInt() + 1) {
  10.     if (n % i == 0) {
  11.       return false
  12.     }
  13.   }
  14.  
  15.   return true
  16. }
  17.  
  18. fun main() {
  19.   val n = 7
  20.  
  21.   val result = isPrime(n)
  22.  
  23.   if (result) {
  24.     println("$n jest liczba pierwsza")
  25.   } else {
  26.     println("$n nie jest liczba pierwsza")
  27.   }
  28. }
Success #stdin #stdout 0.07s 36568KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
7 jest liczba pierwsza
https://ideone.com/eVaqy4
Prime number test
language:
Kotlin (kotlin 1.3.21)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!