TestSet

Author: PeterLuschny

.gitignore

@@ -1,7 +1,8 @@
 Manifest.toml
 local/*
 docs/build/*
-.vscode/*
-integersequences.code-workspace
+.vsc/*
 data/A123456.json
 data/b000290.txt
+demos/.ipynb_checkpoints
+

Project.toml

@@ -4,7 +4,6 @@ version = "0.3.0-dev"
 
 [deps]
 Atom = "c52e3926-4ff0-5f6e-af25-54175e0327b1"
-BenchmarkTools = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
 Dates = "ade2ca70-3891-5945-98fb-dc099432e06a"
 DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"
@@ -17,5 +16,5 @@ Nemo = "2edaba10-b0f1-5616-af89-8c11ac63239a"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
 
 [compat]
-Nemo = ">= 0.15.1"
-julia = ">= 1.2.0"
+Nemo = ">= 0.16.2"
+julia = ">= 1.3.1"

README.md

@@ -22,7 +22,7 @@ I  | Iteration (over n terms)
 L  | List (array based)
 M  | Matrix (2-dim square)
 R  | Real function (Float64)
-P  | Polynomial (univariate over ZZ)
+P  | Polynomial (univariate over ℤ)
 S  | Staircase (list iteration)
 T  | Triangle (list iteration)
 V  | Value (single term)
@@ -62,7 +62,7 @@ L000045(n) = coefficients(G000045, n)
 * Return the ``n``-th Fibonacci number.
 ```
 function V000045(n)
-   F = ZZ[1 1; 1 0]
+   F = ℤ[1 1; 1 0]
    Fn = F^n
    Fn[2, 1]
 end

data/stripped

@@ -73,7 +73,7 @@ Turán graph T(2n, n) for n = 20.")
 g = V033815(20)
 println(g)
 
-println("\nThe binomial function defined for all ZZ.
+println("\nThe binomial function defined for all fmpz.
 The same way as Maple and Mathematica compute the binomial.
 First the familiar Pascal case:")
 for n in 0:8