# A prime test that's LITERALLY prime

Write a program that will test the primality of a specified number, and give the output as a Boolean value (True is prime). Your prime test can (but doesn't have to) be valid for the number 1.

Here's the catch: your program itself has to sum to a prime number. Convert every character (including spaces) to its Unicode/ASCII value (table). Then, add all those numbers together to get the sum of your program.

For example, take this not-so-great program I wrote in Python 3.3:

q=None
y=int(input())
for x in range(2,int(y**0.5)+1):
if y%x==0:
q=False
if not q:
q=True
print(q)


If you convert all the characters to their corresponding Unicode/ASCII value, you get:

113 61 78 111 110 101 10 121 61 105 110 116 40 105 110 112 117 116 40 41 41 10 102 111 114 32 120 32 105 110 32 114 97 110 103 101 40 50 44 105 110 116 40 121 42 42 48 46 53 41 43 49 41 58 10 32 32 32 32 105 102 32 121 37 120 61 61 48 58 10 32 32 32 32 32 32 32 32 113 61 70 97 108 115 101 10 105 102 32 110 111 116 32 113 58 10 32 32 32 32 113 61 84 114 117 101 10 112 114 105 110 116 40 113 41


You can then find the sum of those numbers manually or with your own program. This specific program sums to 8293, which is a prime number.

Of course, this is Code Golf, so the smaller you can make your program, the better. As pointed out by other users, this program is not very golfy.

A few rules:

Valid inputs include STDIN and prompts (no functions, it's just a way to add free extra code). Spaces are permitted, but only if they are crucial to the functionality of your program. Output must be an output, not just stored in a variable or returned (use print, STDOUT, etc.)

Flags can be used and should be counted literally, not expanded. Comments are not allowed. As for non-ASCII characters, they should be assigned to the value in their respective encoding.

Make sure to list your program's size and the sum of the program. I will test to make sure programs are valid.

Good luck!

Here is a snippet to count the sum of your program and check if it is prime:

function isPrime(number) { var start = 2; while (start <= Math.sqrt(number)) { if (number % start++ < 1) return false; } return number > 1; } var inp = document.getElementById('number'); var text = document.getElementById('input'); var out = document.getElementById('output'); function onInpChange() { var msg; var val = +inp.value; if (isNaN(val)) { msg = inp.value.toSource().slice(12, -2) + ' is not a valid number.'; } else if (isPrime(val)) { msg = val + ' is a prime number!'; } else { msg = val + ' is not a prime number.'; } out.innerText = msg; } function onTextChange() { var val = text.value; var total = new Array(val.length).fill().map(function(_, i) { return val.charCodeAt(i); }).reduce(function(a, b) { return a + b; }, 0); inp.value = '' + total; onInpChange(); } text.onkeydown = text.onkeyup = onTextChange; inp.onkeydown = inp.onkeyup = onInpChange;
body { background: #fffddb; } textarea, input, div { border: 5px solid white; -webkit-box-shadow: inset 0 0 8px  rgba(0,0,0,0.1), 0 0 16px rgba(0,0,0,0.1); -moz-box-shadow:  inset 0 0 8px  rgba(0,0,0,0.1), 0 0 16px rgba(0,0,0,0.1); box-shadow:  inset 0 0 8px  rgba(0,0,0,0.1), 0 0 16px rgba(0,0,0,0.1);  padding: 15px; background: rgba(255,255,255,0.5); margin: 0 0 10px 0; font-family: 'Roboto Mono', monospace; font-size: 0.9em; width: 75%; }</style><meta charset="utf-8"><style>/**/
<link href="https://fonts.googleapis.com/css?family=Roboto+Mono" rel="stylesheet"><textarea id="input" tabindex="0">Insert your (UTF-8 encoded) code here
Or directly input a number below</textarea><br><input id="number" value="6296" tabindex="1"><br><div id="output">6296 is not a prime number.</div>

• In non-golfing languages, it looks like you could just take the shortest prime-deciding code, and tweak variable names until the sum is prime. – xnor Jan 24 '17 at 4:52
• Why the restrictions on I/O? – Jonathan Allan Jan 24 '17 at 4:59
• What's a "Unibyte value" ?!??? – aditsu quit because SE is EVIL Jan 24 '17 at 11:38
• You talk about characters and code pages. A Unicode character has always the same code point, no matter which encoding is used to represent it. As for non-ASCII characters, they should be assigned to the value in their respective encoding. makes me think you actually want the sum of the byte values to be prime – Dennis Jan 25 '17 at 20:28
• Test Your code online – Titus Jan 25 '17 at 21:54

## hello, world!, 13 bytes, 1193

hello, world!

• perfect. I heard of this language before, but to think it also happened to have a perfect byte sum for this challenge :D – Value Ink Jan 26 '17 at 19:55

# Ruby, sum 3373, 37 bytes

require'prime'
g=gets.to_i
p g.prime?


# Microscript II, 2 bytes (sum 137)

N;


# Microscript II, 4 bytes (sum 353)

N;ph


I'm actually quite surprised that both of these wound up having prime byte sums.

# Japt, 2 bytes, 191

Uj


U :85

j : 106

Try it online!

# Pyth, 2 bytes, 127

/P


Try it online

Outputs 1 for primes, 0 for non-primes.

/ has code point 47. P has code point 80.

How it works:

/P
/PQQ    Implicit variables.
Q = input
PQ     Prime factorize Q.
/  Q    Count how many times Q appears. 1 if prime, 0 if not.


main=do
print$product[1..k-1]remk==k-1  Wilson theorem. • Turned it into a full standalone program. – fquarp Apr 1 '18 at 21:00 • The ::IO Int really shouldn't be necessary unless that's the shortest way you can get a prime sum. – Ørjan Johansen Apr 2 '18 at 0:11 • Good call. However, we then get some code that hashes' to an even value. Adding spaces or new-lines does nothing (even values), nor does changing the name of the variable (it appears four times, so replacing its code (say c) amounts to subtracting 4 * c and adding 4 * c', leaving the sum even. However, it can be tweaked by breaking the lines and still be shorter, which I did. – fquarp Apr 2 '18 at 9:23 • 47 bytes with a different primality test: Try it online! (note that there are tabs instead of spaces to get the count right). – Laikoni Apr 2 '18 at 10:39 • Also welcome to PPCG! – Laikoni Apr 2 '18 at 10:40 # Python 2, 50 bytes, 4201 Works for 1. Output is positive if prime, or zero if not. p=input();print all(p%m for m in range(2,p))*~-p;p  Try it online # Python 2, 44 bytes, 3701 Doesn't work for 1. Outputs a Boolean. p=input();print all(p%k for k in range(2,p))  Try it online ## JavaScript (ES6), 47 bytes, 3541 This is heavily based on ETHproductions primality-testing function, which can be found here. alert((F=(n,x=n)=>n%--x?F(n,x):!~-x)(prompt())) # 05AB1E, 2 bytes, 173 p=  Explanation: p # Checks if number is prime - returns 1 if true and 0 if false. Uses implicit input. = # Wouldn't usually be required for this sort of program, but I added it to make the sum prime.  Try it online! • Something something "comments are not allowed" but I guess effective no-ops work fine :D – Value Ink Jan 26 '17 at 19:53 # PHP, 38 bytes, sum 2791 Fun fact: With $h instead of $c, the sum would be 2801 (also a prime), and its binary representation 101011110001 read as decimal is also a prime number. for($b=$c=$argv;$c%--$b;);echo$b<2;  takes command line argument, prints 1 or empty string. Run with -r. Code taken from my own prime function (look at the original post if you can). • @Artyer It´s fixed. – Titus Jan 25 '17 at 20:40 # R, 27 32 bytes, sum 2243 2609 Saved a 5 bytes thanks to @rturnbull cat(gmp::isprime(scan(),r=43)>0)  This makes use of the gmp library's isprime function. > sum(as.integer(charToRaw('cat(!!gmp::isprime(scan()))')))  2243 > cat(!!gmp::isprime(scan())) 1: 2243 2: Read 1 item TRUE >  • cat(!!gmp::isprime(scan())) is 5 bytes shorter, and sums to 2243, also prime. – rturnbull Jan 26 '17 at 9:52 • @rturnbull thanks for that :) – MickyT Jan 26 '17 at 17:52 # Python 2, 44 bytes, byte-sum 3109 This is xnor's 44 byte implementation with the lowest valued variable names that yield a prime byte sum. Prints 1 if prime and 0 if not. C=B=1 exec"B*=C*C;C+=1;"*~-input() print B%C  # Jelly 6 bytes, byte-sum 691 ƓÆḍ,ṠE  prints 1 if prime and 0 if not. TryItOnline! The bytes in hexadecimal are 93 0D D5 2C CD 45 (see the code page), or in decimal are 147 13 213 44 205 69 which sum to 691, which is prime. ### How? ƓÆḍ,ṠE - Main Link: no arguments Ɠ - read and evaluate a line from STDIN (integer expected) Æḍ - proper divisor count , - paired with Ṡ - sign E - all equal? - returns a boolean (1 or 0) - implicit print  The Æḍ functionality is such that primes and their negations return one while other integers do not (composites and their negations return numbers greater than one, one and minus one return zero and zero returns, oddly enough, minus one). The Ṡ functionality is such that negative integers return minus one, zero returns zero and positive integers return one. Thus the two functions only return the same value for the primes. Note that the 3 byte program ƓÆP which directly tests if the input from STDIN is prime is unfortunately not a prime-sum program (240). Testing for equality using =(equals), e(exists in), or ⁼(non-vectorising equals) for 5 bytes also do not yield prime-sum programs. # Alternative (maybe not acceptable) 4 bytes, sum 571 If the I/O restrictions still allow full programs that take an argument. Æḍ⁼Ṡ  ...using the same principle as above, where ⁼ is non-vectorising equality (the non-vectorising aspect has no effect since there is nothing to vectorise over anyway). The hex values are 0D D5 8C CD which are 13 213 140 205 in decimal which sum to 571, a prime. Again note that the 2 byte program ÆP does not have a prime sum (93). • ƓÆPG (311) and ÆPF (163) should be fine, I think? – Lynn Jan 25 '17 at 19:30 • As Unicode, for ƓÆḍ,ṠE, the value is 16183, which is coincidentally prime! – Artyer Jan 25 '17 at 20:38 • @Lynn Yes, it seems the "unnecessary code restriction" (except for the space character) has been lifted, making ƓÆPG OK. I have also asked if a program taking input rather than the use of STDIN is acceptable. – Jonathan Allan Jan 26 '17 at 4:23 • ...If both such things are OK then ÆP¥ is 3 bytes and 97. – Jonathan Allan Jan 26 '17 at 4:30 # CJam, 4 bytes, byte-sum 439 qimp  Uses the built-in primality test. Try it online! ### Alternate solution, 4 bytes, sum 461 r~mp  ## Mathematica, 21 bytes, 1997 Print@*PrimeQ@Input[]  Input[] reads a line of input (from STDIN if no front end is used, through a dialog box if the Mathematica front end is used), Print@*PrimeQ is the composition (@*) of the Print and PrimeQ functions, and @ is prefix function notation. # Perl 6, 24 22 bytes, 1949 say .is-prime for +get  All three whitespace characters are required. (Perl 6 doesn't care what kind of whitespace character they are, though, so I chose a newline instead of the more commonly used space for the second one...) ## Pyth, 4 bytes, 367 }QPQ  Try it here! # Pip, 8 bytes, 511 0Na%,a=1  I wrote a prime checker, and the sum was prime. Convenient. Verify inputs 1-30: Try it online! ### Explanation  a is first command-line argument ,a Numbers from 0 to a-1 a% Take a mod each of those numbers (a%0 gives nil) 0N Count number of times 0 occurs in that list =1 If 0 occurs only 1 time (for a%1), then a is prime  # Pari/GP, 23 bytes, 2111 print(2>=numdiv(input))  Try it online! • This challenge does not seem to allow functions. – Ørjan Johansen Apr 1 '18 at 17:36 # J, 18 Bytes, 1103 echo 1&p:".(1!:1)1  Not far from optimal, the least I could golf a full program primality test to was 17 Bytes: echo(p:[:".1!:1)1, which unfortunately sums to 1133 = 11*103. Unfortunately I can't figure out how to get keyboard input working on TIO, so no link yet. ### Explanation: echo 1&p:".(1!:1)1 | Full program (1!:1)1 | Read a line of input from keyboard ". | Evaluate (converts string to int) 1&p: | 1 for prime, 0 for composite echo | Print result. The space is required, as 'echo1' would be interpreted as a variable  Validating the program:  1 p:+/u:inv'echo 1&p:".(1!:1)1' NB. Convert to ints, sum, and test primality 1  # C (gcc), 62 60 bytes, 4583 Pretty straight-forward. Outputs * if prime, otherwise it outputs a space. Does not work for 1. -2 thanks to l4m2 p;main(i){for(scanf("%d",&p);++i<p;)p=p%i?p:0;puts("*"+!p);}  Try it online! • n;main(i){for(scanf("%d",&n);++i<n;)n=n%i?n:0;puts("*"+!n);} may need to change some variable name for prime sum – l4m2 Apr 2 '18 at 15:15 • @l4m2 Nice one! – gastropner Apr 2 '18 at 15:28 # AWK, 36 bytes, byte-sum 2239 {for(a=1;$0%++a&&a<$0;);$0=(a==\$0)}1


Try it online!

Outputs 0 if not prime and 1 for prime. Definitely not the most efficient code, since it checks every integer greater than 1 to see if it divides the input.

# Excel (57 bytes, code sum 3547)

=XOR(0<PRODUCT(MOD(A1,ROW(OFFSET(D2,0,,SQRT(A1))))),3>A1)


Excel doesn't really have an "input" as such, but this formula expects the number to be tested to be in A1 and outputs to whatever cell you drop it in. It's an array formula, so press Ctrl-Shift-Enter to enter it, rather than Enter.

# Java 8, 114 bytes, Prime 10037

interface M{static void main(String[]a){long n=new Long(a),x=2;for(;x<n;n=n%x++<1?0:n);System.out.print(n>1);}}


Try it online.

Explanation:

interface M{                     // Class
static void main(String[]a){   //  Mandatory main-method
long n=new Long(a),       //   The first argument as number
x=2;for(;x<n;n=n%x++<1?0:n); //   Check if n is a prime
System.out.print(n>1);}}     //   Print whether n was a prime
//    (if n is still the same: it's a prime;
//     if n is now 0 or 1: it's not a prime)


I've used x instead of i to make the unicode sum a prime. Verify the unicode sum here.

# Jelly, 4 bytes, Σ = 239

ÆPa1


Try it online!

Proof: Try it online! (take the 1-based indices of the program's chars of Jelly's code page, decrement to make them 0-based, sum and then check if the result is prime).

# Help, WarDoq!, 2 bytes, ∑ 127

P/


Outputs 1 if it is a prime (positive only) and 0 if it is not a prime.

Try it online! Note: Due to technical limitations, this interpreter takes the first line as the code and the second line as STDIN.

1 is not prime in this.

The code's codepoints are 80 47, which sums to 127.

# SmileBASIC, 42 bytes, 2687

INPUT N:FOR D=2TO N/2P=P+!(N MOD D)NEXT?!P


Outputs 1 (true) if the number is prime, otherwise 0 (false).

The variable names were not just chosen to make the program prime. N is the number to test, D is the divisor, and P keeps track of whether N is prime.

# Wonder, 7 bytes, 537

pr rl e


There probably is a better way...

# Rust, 190 bytes, 15013 score

fn main(){let A=&mut"".into();std::io::stdin().read_line(A);let(B,mut C)=(A.trim().parse::<u64>().unwrap(),true);for H in 2..((B as f64).sqrt()+1.0) as u64{if B%H==0{C=false}}print!("{}",C)}


Ungolfed

fn main() {
let input = &mut "".into();
let (number, mut prime) = (input.trim().parse::<u64>().unwrap(), true);

for x in 2..((number as f64).sqrt() + 1.0) as u64 {
if number % x == 0 {
prime = false;
}
}

print!("{}", prime);
}


Does not work for 1

# Stax, 349

|pq


Run and debug it

• |pQ works for a score of 317. If swapping truthy/falsy is allowed, |p!` works as well for 269. – Khuldraeseth na'Barya Apr 2 '18 at 19:02
• Thank you. I don't think the challenge require that the score be minimized so I didn't tweak that part. – Weijun Zhou Apr 2 '18 at 19:12