/usr/share/axiom-20140801/input/fns.input is in axiom-test 20140801-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 | )set break resume
)spool fns.output
)set message test on
)set message auto off
)clear all
--S 1 of 20
odd(i) == 2*i - 1
--R
--R Type: Void
--E 1
--S 2 of 20
[odd(i) for i in 1..10]
--R
--R Compiling function odd with type PositiveInteger -> Integer
--R
--R (2) [1,3,5,7,9,11,13,15,17,19]
--R Type: List(Integer)
--E 2
--S 3 of 20
odd == i +-> 2*i - 1
--R
--R Compiled code for odd has been cleared.
--R 1 old definition(s) deleted for function or rule odd
--R Type: Void
--E 3
--S 4 of 20
odd(1111)
--R
--R Compiling function odd with type PositiveInteger -> Integer
--R
--R (4) 2221
--R Type: PositiveInteger
--E 4
--S 5 of 20
[i for i in 2.. | prime? i]
--R
--R
--R (5) [2,3,5,7,11,13,17,19,23,29,...]
--R Type: Stream(PositiveInteger)
--E 5
--S 6 of 20
primes := /
--R
--R
--R (6) /
--R Type: Variable(/)
--E 6
--S 7 of 20
primes == [p := nextPrime(i = 0 => 2; p) for i in 1..]
--R
--R Type: Void
--E 7
--S 8 of 20
primes
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 8
--S 9 of 20
primes(20)
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 9
--S 10 of 20
firstPrimes(n) == [primes(i) for i in 1..n]
--R
--R Type: Void
--E 10
--S 11 of 20
firstPrimes(25)
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R Cannot compile map: primes
--R We will attempt to interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 11
--S 12 of 20
primesLessThan(n) == [p for p in primes while p < n]
--R
--R Type: Void
--E 12
--S 13 of 20
primesLessThan 1000
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R Cannot compile map: primes
--R We will attempt to interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 13
--S 14 of 20
isPrime? n == reduce(_or,[n = p for p in primes while n <= p])
--R
--R Type: Void
--E 14
--S 15 of 20
isPrime?(1111)
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R Cannot compile map: primes
--R We will attempt to interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 15
--S 16 of 20
twins := [p,p+2 for p in primes | prime?(p+2)]
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R
--RDaly Bug
--R AXIOM can only iterate over lists now and you supplied an object of
--R type UniversalSegment(PositiveInteger) .
--E 16
--S 17 of 20
twins := [p, p+2 for i in 1.. | (p := primes(i)) + 2 = primes(i+1)]
--R
--R There are 1 exposed and 0 unexposed library operations named
--R nextPrime having 1 argument(s) but none was determined to be
--R applicable. Use HyperDoc Browse, or issue
--R )display op nextPrime
--R to learn more about the available operations. Perhaps
--R package-calling the operation or using coercions on the arguments
--R will allow you to apply the operation.
--R Cannot find a definition or applicable library operation named
--R nextPrime with argument type(s)
--R Polynomial(Integer)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--R AXIOM will attempt to step through and interpret the code.
--R Cannot compile map: primes
--R We will attempt to interpret the code.
--R
--RDaly Bug
--R Interpret-Code mode is not supported for stream bodies.
--E 17
--S 18 of 20
firsts := [p for i in 1.. | (p := primes(i)) + 2 = primes(i+1)]
--R
--R Cannot compile map: primes
--R We will attempt to interpret the code.
--R
--RDaly Bug
--R Interpret-Code mode is not supported for stream bodies.
--E 18
--S 19 of 20
twins := [p, p + 2 for p in firsts]
--R
--R
--RDaly Bug
--R AXIOM cannot iterate with p over your form now. Perhaps you should
--R try using a conversion to make sure your form is a list or
--R stream, for example.
--E 19
--S 20 of 20
twins(i) ==firsts(i),2 + firsts(i)
--R
--R There are no library operations named firsts
--R Use HyperDoc Browse or issue
--R )what op firsts
--R to learn if there is any operation containing " firsts " in its
--R name.
--R
--RDaly Bug
--R Cannot find a definition or applicable library operation named
--R firsts with argument type(s)
--R Variable(i)
--R
--R Perhaps you should use "@" to indicate the required return type,
--R or "$" to specify which version of the function you need.
--E 20
)spool
)lisp (bye)
|