16 deleted 9 characters in body
source | link

Write a full program that, given a strictly positive integer n as input, determines whether n is prime and print or returnprints a truthy or falsy value accordingly.

Write a full program that, given a strictly positive integer n as input, determines whether n is prime and print or return a truthy or falsy value accordingly.

Write a full program that, given a strictly positive integer n as input, determines whether n is prime and prints a truthy or falsy value accordingly.

    Notice removed Reward existing answer by Mr. Xcoder
    Bounty Ended with H.PWiz's answer chosen by Mr. Xcoder
    Notice added Reward existing answer by Mr. Xcoder
    Bounty Started worth 500 reputation by Mr. Xcoder
    Notice removed Reward existing answer by Martin Ender
    Bounty Ended with H.PWiz's answer chosen by Martin Ender
    Notice added Reward existing answer by Martin Ender
    Bounty Started worth 500 reputation by Martin Ender
15 replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
source | link

Rosetta code features lists by language of idiomatic approaches to primality testing, one using the Miller-Rabin test specifically and another using trial division. However, "most idiomatic" often does not coincide with "shortest." In an effort to make Programming Puzzles and Code Golf the go-to site for code golf, this challenge seeks to compile a catalog of the shortest approach in every language, similar to http://codegolf.stackexchange.com/q/55422/20469"Hello, World!" and http://codegolf.stackexchange.com/q/69/20469Golf you a quine for great good!.

Rosetta code features lists by language of idiomatic approaches to primality testing, one using the Miller-Rabin test specifically and another using trial division. However, "most idiomatic" often does not coincide with "shortest." In an effort to make Programming Puzzles and Code Golf the go-to site for code golf, this challenge seeks to compile a catalog of the shortest approach in every language, similar to http://codegolf.stackexchange.com/q/55422/20469 and http://codegolf.stackexchange.com/q/69/20469.

Rosetta code features lists by language of idiomatic approaches to primality testing, one using the Miller-Rabin test specifically and another using trial division. However, "most idiomatic" often does not coincide with "shortest." In an effort to make Programming Puzzles and Code Golf the go-to site for code golf, this challenge seeks to compile a catalog of the shortest approach in every language, similar to "Hello, World!" and Golf you a quine for great good!.

14 remove reference to non-existant footnote
source | link

Write a full program that, given a strictly positive integer n as input, determines whether n is prime1 and print or return a truthy or falsy value accordingly.

Write a full program that, given a strictly positive integer n as input, determines whether n is prime1 and print or return a truthy or falsy value accordingly.

Write a full program that, given a strictly positive integer n as input, determines whether n is prime and print or return a truthy or falsy value accordingly.

13 edited tags
| link
    Notice removed Draw attention by Dennis
    Bounty Ended with Martin Ender's answer chosen by Dennis
    Notice added Draw attention by Dennis
    Bounty Started worth 200 reputation by Dennis
    Question Unprotected by Dennis
12 while I'm at it...
source | link
11 Don't encourage bad practice
source | link
    Question Protected by Community
    Notice removed Reward existing answer by Martin Ender
    Bounty Ended with Etoplay's answer chosen by Martin Ender
    Question Unprotected by Dennis
    Question Protected by Community
    Question Unprotected by Dennis