Rosetta Code

Primality by trial division: Difference between revisions

Page Discussion

Primality by trial division (view source)

Revision as of 10:23, 8 September 2023

51 bytes removed ,  9 months ago
m
→‎{{header|EasyLang}}
(add task to arm assembly raspberry pi)
Line 2,360:
=={{header|EasyLang}}==
<syntaxhighlight lang="easylang">
func isprim n .
proc isPrime num . result .
if numn < 2
result =return 0
break 1▼
.
if numn mod 2 = 0 and numn > 2
result =return 0
break 1
.
for i = 3 step 2 to sqrt num
sq = sqrt if num mod i = 0n
while i result <= 0sq
if n mod breaki 2= 0
return 0
.
▲ breaki 1+= 2
.
result =return 1
.
</syntaxhighlight>
Chkas
2,083

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/348652"