OpenLLM-France/wikimedia huggingface dataset:
# Structuring Data

In order for data, or information, to prove useful, we need to organize it into a coherent structure. There are several historical developments where we have attempted to organize and standardize information structures and best practices. We need to develop standards, and organizational structures, in order to facilitate data re-use and interchange.

## Relational Databases

Relational databases have been developed over the course of decades. There are several relational database engines, notably the PostgreSQL and MySQL engines. A query language, called Structured Query Language, has been developed to facilitate the discovery, manipulation, and re-organization of relational data.

### Impedence Mismatch

Relational databases have an "Impedence Mismatch" between programming languages and data structures in the database. This means that extra programming methods must be used to map, or utilize, relational data in various projects, e.g. Object Oriented programs.

## JSON

JSON stands for JavaScript Object Notation. JSON is semi-structured and designed to be human readable.
In JSON, there are two types of values:
* objects {"property": "value"}
* arrays ["lists","of","values"]
Structure: nested sets (objects, arrays)

### JSON Schema

Specify structure, check for conformance. A schema is not reqiured in advance, and JSON is known as a "self describing" markup.
* A JSON Schema can used by JSON Editors even for rendering a graphical user interface GUI (see JSON Editor for placing Icon on a Open Layers Map)

### Queries

There are several competing standards for JSON querying:
* JSON Path,
* JAQL,
* JSONiq

### Ordering

JSON Arrays are numerically indexed and so can be considered ordered data structures.

### Implementation

JSON has been implemented in many NoSQL systems (as an input/output method). Additionally, some document management systems and programming languages (JavaScript, Python, etc.) support JSON.

### Programming interface

JSON maps more or less directly to many programming languages' data structures.

### Learning Task

* Create a JSON Schema from a JSON object of your choice with JSON2Schema Generator.
* Learn to convert XML records into JSON by checking a web-based GitHub example http://dfsq.github.io/xml2json/#/xml/paste
* Explore a GitHub Book about JSON Schema that defines the structure of a JSON file and facilitates the validation of a given JSON file against the JSON Schema.

## XML

XML is structuring data like JSON. Furthermore XML provides also the concept of a Schema to check if a given XML document is valid (see Tutorial W3C Schools https://www.w3schools.com/xml/schema_intro.asp as introduction to XML Schema).
# Ada/Overview
### Introduction

Ada was developed under a US Department of Defense contract from 1977 to 1983. Its main goal was to develop a language to replace, in sorts, the various hundreds of languages then used by the Department of Defense. What resulted is strong-typed and modular programming language that is used widely in mission critical systems. It was originally targeted at embedded and real-time systems, but as seen a wide range of applications, especially in the defense community.

### Prerequisites

* A basic knowledge of programming. Familiarity with an Algol-based language, such as C, C++, or Pascal, will be useful.
* A Linux operating system, preferably Ubuntu. This can be run as a virtual machine with software like Oracle's VM VirtualBox.
* Strong desire to learn.
* Patience and time to learn. No language is learned overnight and one certainly cannot expect to develop full-blown applications after only 2 weeks of learning any language.

### Course description

This course is designed to introduce the student to the basics of the Ada programming language, enough to understand what is going on and how to further proceed with learning more about its applications. This course is not designed, as of yet, to introduce the student to the full power of Ada. Most program examples are text-based console applications developed on the Linux operating system.

### Links

* Wikipedia: Ada (programming language)
* Wikibooks:Ada programming tutorial
# Cryptography/Data Encryption Standard

Data Encryption Standard (DES) is a Symmetric Encryption algorithm developed by IBM in the late 1970’s that utilizes a preshared cryptographic key to encrypt/decrypt a given data chunk of 64 bits. It works by first diving the given data into a 64-bit block and using the given key to encrypt each individual block. These data blocks can only be decrypted by another host if they know the preset key by simply repeating the system against itself using the key.
DES has now been formally replaced with Advance Encryption Standard (AES), as the new Standard by the National Security Agency (NSA).
DES is a type of encryption algorithm known as a block cipher, meaning that data is encrypted using blocks of data instead of bit by bit from a stream.

## External Links

Federal Information Processing Standards (FIPS) Publication 46-3
# Mapudungun language

Welcome to the class of Mapudungun for English speakers. You'll learn an advanced level of the language, with some lessons with dialogues, grammatical explanations, vocabularies and sound files whenever it's possible. If you have any doubts, ask on the talk page. If you wanna help with the course, you're more than welcome! If this course is useful for you, tell other people so that they can also learn Mapudungun, the Mapuche language.

### Index

* Introduction
* History
* Pronunciation and writing
   * Alfabeto Unificado
   * Alfabeto de Erize
   * Grafemario Raguileo
   * Grafemario Azümchefe
* Accentuation

### Lessons

* Lesson 1: Mari mari
* Lesson 2: Chumül akuymi?
* Lesson 3: Ta Tüfey
* Lesson 4: Chew müley...?
* Lesson 5: Deu Ileymi?
* Usual phrases

### Grammar

* Noun
* Pronoun
* Verb
** Modes and tenses
** Negation
** Agent and patient
** Mapudungun/Verb/Suffixes order
** Userful verbs
* Creation of sentences

### Wordbook / Vocabulary

* Society
* Colours
* Numbers
* Family
* Body parts
* Home
# The necessities in Numerical Methods
## Calculus
### Numerical Differentiation

* Background on Differentiation (pdf)
* Continuous Function Differentiation (pdf)
* Discrete Function Differentiation (pdf)
* Forward, Backward, Central Divided Difference
* High Accuracy Differentiation
* Richardson Extrapolation
* Unequal Spaced Data Differentiation
* Numerical Differentiation with Octave

### Non-linear Equations

* Bisection Method (pdf)
* Newton-Raphson Method (pdf)
* Secant Method
* False-Position Method

### Numerical Integration

* Trapezoidal Rule
* Simpson's 1/3 Rule
* Romberg Rule
* Gauss-Quadrature Rule
* Adaptive Quadrature

### Optimization
## Matrix Algebra
### Simultaneous Linear Equations

* A system of linear equations (pdf)

### Iterative methods
## Regression
### Linear Least Squares
## Interpolation
### Piecewise Interpolation
## Ordinary Differential Equation
## Using Symbolic Package in Octave

* Visit http://octave.sourceforge.net/index.html
* Download symbolic-1.0.9.tar.gz
* In Ubuntu, using the Ubuntu Software Center, I installed GiNac and CLN related software and symbolic package for Octave. But it did not properly installed.
* After extracting files from symbolic-1.0.9.tar.gz, I followed the following steps.
* While doing this, I got an error message related to mkoctfile. So, I used the following command: sudo apt-get install ocatve3.2-headers. Then I was able to install the symbolic packages in the Ubuntu.

## Read some tutorials about symbolic computation

* Symbolic Mathematics in Matlab/GNU Octave (http://faraday.elec.uow.edu.au/subjects/annual/ECTE313/Symbolic_Maths.pdf)
* Symbolic Computations (http://www.math.ohiou.edu/courses/math344/lecture7.pdf)

## Using SymPy ( a Python library for symbolic mathematics)

go to [ Electrical_&_Computer_Engineering_Studies ]
# Finite-dimensional vector space/Linear subspace/Kernel/Solution space/Fact/Proof/Exercise

Let $V$ be a finite-dimensional $K$-vector space and $U\subseteq V$ a linear subspace.
a) Show that there exist linear forms $L_{1},\ldots ,L_{r}$ on $V$ such that
    $U=\bigcap _{i=1}^{r}\operatorname {kern} L_{i}\,.$
b) Show that $U\subseteq V$ is the kernel of a linear mapping on $V$ (into some $K^{r}$).
c) Show that every linear subspace $U\subseteq K^{n}$ is the solution space of a system of linear equations.
# Finite-dimensional vector space/Linear subspace/Kernel/Solution space/Fact

Let $V$ be a finite-dimensional $K$-vector space and $U\subseteq V$ a linear subspace. Then the following hold.
a) There exist linear forms $L_{1},\ldots ,L_{r}$ on $V$ such that
    $U=\bigcap _{i=1}^{r}\operatorname {kern} L_{i}\,.$
b) $U\subseteq V$ is the kernel of a linear mapping on $V$ to some $K^{r}$.
c) Every linear subspace $U\subseteq K^{n}$ is the solution space of a
# Linear subspace/Dual space/Orthogonal space/Correspondence/Fact/Proof

(1) and (2) are clear. (3). The inclusion
    $U\subseteq {\left(U^{\perp }\right)}^{\perp }\,$
is also clear. Let $v\in V$, $v\notin U$. Then we can choose a basis $u_{1},\ldots ,u_{r}$ of $U$ and extend it to a basis $u_{1},\ldots ,u_{r},v,v_{1},\ldots ,v_{\ell }$ of $V$. The linear form $v^{*}$ vanishes on $U$, therefore, it belongs to $U^{\perp }$. Because of
    $v^{*}(v)=1\neq 0\,,$
we have $v\notin {\left(U^{\perp }\right)}^{\perp }$.
The inclusion
    $F\subseteq {\left(F^{\perp }\right)}^{\perp }\,$
holds immediately. Let $f\in {\left(F^{\perp }\right)}^{\perp }$, that is,
    $F^{\perp }\subseteq \operatorname {kern} f\,.$
Let $f_{1},\ldots ,f_{m}$ be a generating system of $F$. Due to exercise we have that $f$ is a linear combination of the $f_{i}$; therefore, $f\in F$.
(4). We first prove the second part. Let $f_{1},\ldots ,f_{r}$ be a basis of $F$, and let
    $\varphi \colon V\longrightarrow K^{r}$
denote the mapping where these linear forms are the components. Here, we have
    $F^{\perp }=\operatorname {kern} \varphi \,.$
Assume that the mapping $\varphi$ is not surjective. Then $\operatorname {Im} \varphi$ is a strict linear subspace of $K^{r}$ and its dimension is at most $r-1$. Let $W$ be a $(r-1)$-dimensional linear subspace with
    $\operatorname {Im} \varphi \subseteq W\subseteq K^{r}\,.$
Due to fact, there is a linear form
    $g\colon K^{r}\longrightarrow K,$
whose kernel is exactly $W$. Write $g=\sum _{i=1}^{r}a_{i}p_{i}$, where $p_{i}$ is the $i$th projection. Then
    $\sum _{i=1}^{r}a_{i}f_{i}=g\circ \varphi =0\,,$
contradicting the linear independence of the $f_{i}$. Moreover, $\varphi$ is surjective and the statement follows from fact.
The first part follows by using $U={\left(U^{\perp }\right)}^{\perp }$ and applying the second part to $F=U^{\perp }$.
# Clear Thinking/Curriculum
## Clear Thinking

This clear thinking curriculum is being developed as part of the Applied Wisdom curriculum to help people become more accurate and consistent in their thinking.
An alternative curriculum, provided by Rebel Wisdom, is also available.
Reading this essay on the Height of the Eiffel Tower can provide a good starting point for these studies.
These courses are available now and establish the core of the curriculum:
* Facing Facts — Embracing Reality
* Evaluating Evidence — Seeking Reality
* Seeking True Beliefs — Excellence in the Quest for Knowledge
* Exploring Worldviews — Challenging our deeply embedded assumptions
* Deductive Logic — Evaluating Consistency
* Recognizing Fallacies — Describing inconsistencies
* Knowing How You Know — Developing and applying your own Theory of Knowledge.
* Thinking Scientifically — Reliable ways of knowing
** What There Is — Know what is real
* Intellectual Honesty — Seeking Real Good Together
* Socratic Methods — Seeking real good by questioning beliefs
* Exploring Social Constructs — Constructing Reality
* Finding Common Ground — Aligning concepts with reality
* Evaluating Journalism Standards — Seeking reliable information sources
* Resolving Cognitive Dissonance—Understanding, Identifying, and Addressing Inner Conflict
* Real Good Religion—Rebooting spiritual practice
* Understanding Emergence—Exploring the possible
* Natural Inclusion — Experiencing the world from nature.
Courses in this curriculum address common core standards requirements for: Standards for Mathematical Practice » Construct viable arguments and critique the reasoning of others.
The following courses are proposed but yet to be developed:
* Forecasting with Bayes’ Theorem — Integrating Evidence
* Clarifying Probabilities — Using Natural Frequencies
* Understanding Risk — Exposure to loss
* Inductive Reasoning — Evaluating expectations
** The problem of induction
* Cognitive Errors and Distortions — Circumventing Occlusions
* Rhetoric — Appraising the allure
* Analyzing Real Arguments — Evaluating rhetoric
Until the courses in this curriculum are complete, students may benefit from the courses now available in the Khan Academy Critical Thinking curriculum.
# Possibilities/Curriculum

This possibilities curriculum is being developed as part of the Applied Wisdom curriculum to help people think more creatively, generate alternatives for solving problems, and choose wisely from an abundant set of alternative solutions and actions.
These courses are available now and establish the core of the curriculum:
* Creating Possibilities—Navigating problem space
* Unleashing Creativity—Welcoming new and useful ideas
* Thinking Tools—Boosting Imagination
* Problem Finding—Discovering the Real Problem
* Solving Problems—Creating solutions
* Embracing Ambiguity—Keep thinking
* Transcending Conflict—Resolving contradictory goals
* Flourishing—Realizing human potential
* Playing — Enjoyable Activity
* Envisioning Our Future — Describing your vision of our future
* Intentional Evolution — Choosing our future
* Evolving Governments — Unleashing collaboration
* Evolving Money—Exchanging goods and services
* Creativity - Unleashing creativity
The following courses are proposed but not yet developed:
* Reframing the Problem—Telling a different story
* Beauty—Savor beauty.
* Aspirations—Unleash real hope
# Boolf prop/3-ary/great prefect

Number of blocks: 4 Integer partition: 4⋅64
| # | great prefect | block |
| 64 | 0 | [0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 64, 65, 66, 67, 68, 69, 70, 71, 80, 81, 82, 83, 84, 85, 86, 87, 168, 169, 170, 171, 172, 173, 174, 175, 184, 185, 186, 187, 188, 189, 190, 191, 232, 233, 234, 235, 236, 237, 238, 239, 248, 249, 250, 251, 252, 253, 254, 255] |
| 64 | 4 | [8, 9, 10, 11, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31, 72, 73, 74, 75, 76, 77, 78, 79, 88, 89, 90, 91, 92, 93, 94, 95, 160, 161, 162, 163, 164, 165, 166, 167, 176, 177, 178, 179, 180, 181, 182, 183, 224, 225, 226, 227, 228, 229, 230, 231, 240, 241, 242, 243, 244, 245, 246, 247] |
| 64 | 2 | [32, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, 51, 52, 53, 54, 55, 96, 97, 98, 99, 100, 101, 102, 103, 112, 113, 114, 115, 116, 117, 118, 119, 136, 137, 138, 139, 140, 141, 142, 143, 152, 153, 154, 155, 156, 157, 158, 159, 200, 201, 202, 203, 204, 205, 206, 207, 216, 217, 218, 219, 220, 221, 222, 223] |
| 64 | 6 | [40, 41, 42, 43, 44, 45, 46, 47, 56, 57, 58, 59, 60, 61, 62, 63, 104, 105, 106, 107, 108, 109, 110, 111, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 144, 145, 146, 147, 148, 149, 150, 151, 192, 193, 194, 195, 196, 197, 198, 199, 208, 209, 210, 211, 212, 213, 214, 215] |
# Boolf prop/3-ary/praetor

Number of blocks: 16 Integer partition: 16⋅16
| # | praetor | block |
| 16 | 0 | [0, 17, 34, 51, 68, 85, 102, 119, 136, 153, 170, 187, 204, 221, 238, 255]File:Set of 3-ary Boolean functions 57896486333794311352466587372716853682903935386526539088661048023915243372545.svg |
| 16 | 1 | [1, 16, 35, 50, 69, 84, 103, 118, 137, 152, 171, 186, 205, 220, 239, 254]File:Set of 3-ary Boolean functions 28948905734546486136869951883554333513920930453733235058270336113397551136770.svg |
| 16 | 2 | [2, 19, 32, 49, 70, 87, 100, 117, 138, 155, 168, 185, 206, 223, 236, 253]File:Set of 3-ary Boolean functions 14474121596086149254626164786388727017944227235188016128539048712578749956100.svg |
| 16 | 3 | [3, 18, 33, 48, 71, 86, 101, 116, 139, 154, 169, 184, 207, 222, 237, 252]File:Set of 3-ary Boolean functions 7237226439955551866896230251618139443684273378497113829943559501384618606600.svg |
| 16 | 4 | [4, 21, 38, 55, 64, 81, 98, 115, 140, 157, 174, 191, 200, 217, 234, 251] |
| 16 | 5 | [5, 20, 39, 54, 65, 80, 99, 114, 141, 156, 175, 190, 201, 216, 235, 250]File:Set of 3-ary Boolean functions 1809306608409155385117565147909784777930941306599910009599991384103204159520.svg |
| 16 | 6 | [6, 23, 36, 53, 66, 83, 96, 113, 142, 159, 172, 189, 202, 219, 232, 249]File:Set of 3-ary Boolean functions 904632599755384329195713988645480943156445146135475740806812471150338113600.svg |
| 16 | 7 | [7, 22, 37, 52, 67, 82, 97, 112, 143, 158, 173, 188, 203, 218, 233, 248]File:Set of 3-ary Boolean functions 452326652497221992071812679864255262735934189248943787820503656239277801600.svg |
| 16 | 8 | [8, 25, 42, 59, 76, 93, 110, 127, 128, 145, 162, 179, 196, 213, 230, 247] |
| 16 | 9 | [9, 24, 43, 58, 77, 92, 111, 126, 129, 144, 163, 178, 197, 212, 231, 246]File:Set of 3-ary Boolean functions 113081663025572211472148249545134115373825524354682453474974754906998571520.svg |
| 16 | 10 | [10, 27, 40, 57, 78, 95, 108, 125, 130, 147, 160, 177, 198, 215, 228, 245]File:Set of 3-ary Boolean functions 56539537484711520525883456196830964956379609018678856372368873916597273600.svg |
| 16 | 11 | [11, 26, 41, 56, 79, 94, 109, 124, 131, 146, 161, 176, 199, 214, 229, 244]File:Set of 3-ary Boolean functions 28270415781076374480063399420383357223159665345770485827991357936004761600.svg |
| 16 | 12 | [12, 29, 46, 63, 72, 89, 106, 123, 132, 149, 166, 183, 192, 209, 226, 243]File:Set of 3-ary Boolean functions 14134884358836501807247954945507473978368961208853467913361413538603601920.svg |
| 16 | 13 | [13, 28, 47, 62, 73, 88, 107, 122, 133, 148, 167, 182, 193, 208, 227, 242] |
| 16 | 14 | [14, 31, 44, 61, 74, 91, 104, 121, 134, 151, 164, 181, 194, 211, 224, 241]File:Set of 3-ary Boolean functions 3533721092794470035920757768146409936863299563418306387964880433987993600.svg |
| 16 | 15 | [15, 30, 45, 60, 75, 90, 105, 120, 135, 150, 165, 180, 195, 210, 225, 240]File:Set of 3-ary Boolean functions 1766900986317273406530518280719747121391491205567195105433173375773081600.svg |
# Boolf prop/3-ary/great praetor

Number of blocks: 4 Integer partition: 4⋅64
| # | great praetor | block |
| 64 | 0 | [0, 1, 8, 9, 16, 17, 24, 25, 34, 35, 42, 43, 50, 51, 58, 59, 68, 69, 76, 77, 84, 85, 92, 93, 102, 103, 110, 111, 118, 119, 126, 127, 128, 129, 136, 137, 144, 145, 152, 153, 162, 163, 170, 171, 178, 179, 186, 187, 196, 197, 204, 205, 212, 213, 220, 221, 230, 231, 238, 239, 246, 247, 254, 255]File:Set of 3-ary Boolean functions 87184631881107753729529260112740996522067674747594426895873498048891113898755.svg |
| 64 | 2 | [2, 3, 10, 11, 18, 19, 26, 27, 32, 33, 40, 41, 48, 49, 56, 57, 70, 71, 78, 79, 86, 87, 94, 95, 100, 101, 108, 109, 116, 117, 124, 125, 130, 131, 138, 139, 146, 147, 154, 155, 160, 161, 168, 169, 176, 177, 184, 185, 198, 199, 206, 207, 214, 215, 222, 223, 228, 229, 236, 237, 244, 245, 252, 253] |
| 64 | 4 | [4, 5, 12, 13, 20, 21, 28, 29, 38, 39, 46, 47, 54, 55, 62, 63, 64, 65, 72, 73, 80, 81, 88, 89, 98, 99, 106, 107, 114, 115, 122, 123, 132, 133, 140, 141, 148, 149, 156, 157, 166, 167, 174, 175, 182, 183, 190, 191, 192, 193, 200, 201, 208, 209, 216, 217, 226, 227, 234, 235, 242, 243, 250, 251] |
| 64 | 6 | [6, 7, 14, 15, 22, 23, 30, 31, 36, 37, 44, 45, 52, 53, 60, 61, 66, 67, 74, 75, 82, 83, 90, 91, 96, 97, 104, 105, 112, 113, 120, 121, 134, 135, 142, 143, 150, 151, 158, 159, 164, 165, 172, 173, 180, 181, 188, 189, 194, 195, 202, 203, 210, 211, 218, 219, 224, 225, 232, 233, 240, 241, 248, 249] |
# Boolf prop/3-ary/quaestor

Number of blocks: 16 Integer partition: 16⋅16
| # | quaestor | block |
| 16 | 0 | [0, 24, 36, 60, 66, 90, 102, 126, 129, 153, 165, 189, 195, 219, 231, 255]File:Set of 3-ary Boolean functions 57896048070373769491417295362101480869679047472698551317454488802455720034305.svg |
| 16 | 1 | [1, 25, 37, 61, 67, 91, 103, 127, 128, 152, 164, 188, 194, 218, 230, 254]File:Set of 3-ary Boolean functions 28948024035186884745708647681050740434967129631552388094066724205209612976130.svg |
| 16 | 2 | [2, 26, 38, 62, 64, 88, 100, 124, 131, 155, 167, 191, 193, 217, 229, 253]File:Set of 3-ary Boolean functions 14474012017593442375796715454410890738509434893084198442928681539648131956740.svg |
| 16 | 3 | [3, 27, 39, 63, 65, 89, 101, 125, 130, 154, 166, 190, 192, 216, 228, 252]File:Set of 3-ary Boolean functions 7237006008796721187898357727205445369286618920342877330305695904669559160840.svg |
| 16 | 4 | [4, 28, 32, 56, 70, 94, 98, 122, 133, 157, 161, 185, 199, 223, 227, 251]File:Set of 3-ary Boolean functions 3618503017825678581285093526099662564752582377139826828513203328849400561680.svg |
| 16 | 5 | [5, 29, 33, 57, 71, 95, 99, 123, 132, 156, 160, 184, 198, 222, 226, 250]File:Set of 3-ary Boolean functions 1809251508912839290642546763049831282384266557049702447293455176419243982880.svg |
| 16 | 6 | [6, 30, 34, 58, 68, 92, 96, 120, 135, 159, 163, 187, 197, 221, 225, 249]File:Set of 3-ary Boolean functions 904625754456419645505172858075163517505663897491222935475652947564535218240.svg |
| 16 | 7 | [7, 31, 35, 59, 69, 93, 97, 121, 134, 158, 162, 186, 196, 220, 224, 248]File:Set of 3-ary Boolean functions 452312877228209822752586429037581758754825790865558725997445175773036019840.svg |
| 16 | 8 | [8, 16, 44, 52, 74, 82, 110, 118, 137, 145, 173, 181, 203, 211, 239, 247]File:Set of 3-ary Boolean functions 227039847827326250973527176555168871534410259539694997583804615943822311680.svg |
| 16 | 9 | [9, 17, 45, 53, 75, 83, 111, 119, 136, 144, 172, 180, 202, 210, 238, 246]File:Set of 3-ary Boolean functions 113519923913663125486763588277584435767705537379596074693725301336279482880.svg |
| 16 | 10 | [10, 18, 46, 54, 72, 80, 108, 116, 139, 147, 175, 183, 201, 209, 237, 245]File:Set of 3-ary Boolean functions 56759961956831562754920408025753098590070852662023480053763613825614218240.svg |
| 16 | 11 | [11, 19, 47, 55, 73, 81, 109, 117, 138, 146, 174, 182, 200, 208, 236, 244]File:Set of 3-ary Boolean functions 28379980978415781377460204012876549295160528233448884002362986957850019840.svg |
| 16 | 12 | [12, 20, 40, 48, 78, 86, 106, 114, 141, 149, 169, 177, 207, 215, 235, 243]File:Set of 3-ary Boolean functions 14189990541863233051101912389232910289006925269952906176366478028606279680.svg |
| 16 | 13 | [13, 21, 41, 49, 79, 87, 107, 115, 140, 148, 168, 176, 206, 214, 234, 242]File:Set of 3-ary Boolean functions 7094995270931616525550956194616455144534738110701794189842749424232570880.svg |
| 16 | 14 | [14, 22, 42, 50, 76, 84, 104, 112, 143, 151, 171, 179, 205, 213, 233, 241] |
| 16 | 15 | [15, 23, 43, 51, 77, 85, 105, 113, 142, 150, 170, 178, 204, 212, 232, 240] |