Palindromic primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,217: / Line 1,217: @@
 rem - return true if n is palindromic, otherwise false
-function ispalindrome(n = integer) = integer
+function ispalindromic(n = integer) = integer
-   var i, j, result = integer
+   var i, j = integer
    var s = string
    s = str$(n)
@@ Line 1,228: / Line 1,228: @@
          j = j - 1
       end
-   if (mid(s,i,1)) = (mid(s,j,1)) then
+end = (mid(s,i,1)) = (mid(s,j,1))
-      result = TRUE
-   else
-      result = FALSE
-end = result
 rem - return n mod m
@@ Line 1,262: / Line 1,258: @@
 for i = 2 to 1000
   if isprime(i) then
-     if ispalindrome(i) then
+     if ispalindromic(i) then
         begin
            print using "##### ";i;