> for k from 1 to 10 do > 2*k; > end do; 2 4 6 8 10 12 14 16 18 20 > for k from 1 to 10 do > 11-k; > end do; 10 9 8 7 6 5 4 3 2 1 > S:={1,3,6,2,23,8,4,65,11,43,67,19,54}; S := {1, 2, 3, 4, 6, 8, 11, 19, 23, 43, 54, 65, 67} > L:=[]; L := [] > for n in S do > if n>15 then print(n); L:=[op(L),n]: end if: > end do: 19 23 43 54 65 67 > L; [19, 23, 43, 54, 65, 67] > P:=[]; P := [] > for n from 2 to 1000 do > if isprime(n) then P:=[op(P),n]: > end if: > end do: > n_primes:=nops(P); n_primes := 168 > A:=[]; A := [] > for n from 1 to n_primes do > if P[n] mod 4 = 1 then A:=[op(A),P[n]]: > end if: > end do: > A; [5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, 137, 149, 157, 173, 181, 193, 197, 229, 233, 241, 257, 269, 277, 281, 293, 313, 317, 337, 349, 353, 373, 389, 397, 401, 409, 421, 433, 449, 457, 461, 509, 521, 541, 557, 569, 577, 593, 601, 613, 617, 641, 653, 661, 673, 677, 701, 709, 733, 757, 761, 769, 773, 797, 809, 821, 829, 853, 857, 877, 881, 929, 937, 941, 953, 977, 997] > nops(A); 80 >