Primality by trial division: Difference between revisions
Content added Content deleted
(Emacs Lisp: Use cl-lib) |
|||
| Line 958: | Line 958: | ||
100000000073 |
100000000073 |
||
100000000091</pre> |
100000000091</pre> |
||
=={{header|Brainf***}}== |
|||
<lang bf>>->,[.>,]>-<++++++[-<+[---------<+]->+[->+]-<]>+<-<+[-<+]>>+[-<[->++++++++++<]>> |
|||
+]++++[->++++++++<]>.<+++++++[->++++++++++<]>+++.++++++++++.<+++++++++[->------- |
|||
--<]>--.[-]<<<->[->+>+<<]>>-[+<[[->>+>>+<<<<]>>[-<<+>>]<]>>[->-[>+>>]>[+[-<+>]>> |
|||
>]<<<<<]>[-]>[>+>]<<[-]+[-<+]->>>--]<[->+>+<<]>>>>>>>[-<<<<<->>>>>]<<<<<--[>++++ |
|||
++++++[->+++++++++++<]>.+.+++++.>++++[->++++++++<]>.>]++++++++++[->+++++++++++<] |
|||
>++.++.---------.++++.--------.>++++++++++.</lang> |
|||
Explanation: |
|||
<lang bf>> |
|||
->,[.>,]>-<++++++[-<+[---------<+]->+[->+]-<]>+<-<+[-<+]>>+[-<[->++++++++++<]>>+]< takes input |
|||
>++++[->++++++++<]>.<+++++++[->++++++++++<]>+++.++++++++++.<+++++++++[->---------<]>--.[-]<< " is " |
|||
<-> |
|||
[->+>+<<]>>-[+<[[->>+>>+<<<<]>>[-<<+>>]<]>>[->-[>+>>]>[+[-<+>]>>>]<<<<<]>[-]>[>+>]<<[-]+[-<+]->>>--] finds # of divisors from 1 to n |
|||
<[->+>+<<]>>>>>>>[-<<<<<->>>>>]<<<<<-- |
|||
[>++++++++++[->+++++++++++<]>.+.+++++.>++++[->++++++++<]>.>] "not " |
|||
++++++++++[->+++++++++++<]>++.++.---------.++++.--------.>++++++++++. "prime" new line</lang> |
|||
Will format as "# is/is not prime", naturally limited by cell size. |
|||
=={{header|Burlesque}}== |
=={{header|Burlesque}}== |
||