Prime Number in Tcl

Welcome to the Prime Number in Tcl page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

package require Tcl 8.6
package require math::numtheory

proc usage {} {
    puts stderr {Usage: please input a non-negative integer}
    exit 1
}

proc isNonNegativeInteger {s} {
    if {[catch {expr {int($s)}} n]} {
        return 0
    }
    if {$s eq ""} { return 0 }
    if {![string is integer -strict $s]} {
        return 0
    }
    return [expr {$n >= 0}]
}

if {$argc != 1} { usage }

set input [string trim [lindex $argv 0]]
if {![isNonNegativeInteger $input]} { usage }

set n $input
if {$n < 2} {
    puts "composite"
} elseif {[math::numtheory::isprime $n]} {
    puts "prime"
} else {
    puts "composite"
}

Prime Number in Tcl was written by:

• Ștefan-Iulian Alecu

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.