OpenLLM-France/wikimedia huggingface dataset:
# Structural Biochemistry/Enzyme Regulation/Enzyme Cascades

An enzymatic cascade is a sequence of successive activation reactions involving enzymes, which is characterized by a series of amplifications stemming from an initial stimulus. The product of each preceding reaction catalyzes and is consumed in the next reaction. An example of an enzymatic cascade includes blood clotting, where a timely response is needed. The cascade first activates a clotting factor, followed by the activation of the next clotting factor and so forth until the final cross-linked fibrin clot is formed.
Another example of enzymatic cascade occurs following the binding of allergen to a receptor bound Ig on the mast cell. Spleen tyrosine kinases (Syk) plays an important role in this immunoglobulin E (IgE) signaling pathway. Using knowledge of the cascade and the role Syk plays, Syk inhibitors have been developed to inhibit IgE- driven mast cell degranulation, as well as to inhibit the release of inflammatory cytokines, thereby inhibiting an allergic response.
Enzymatic cascades can also play roles in the immune system. Complement cascade works with the body’s innate immunity by cleaning pathogens from an organism. It proceeds though three major pathways; classical (CP), alternative (AP) and mannose-binding-lectin (MP). The end product results in large scale amplification of cell killing membrane attack complex.

## Blood Clotting

Blood coagulation is an example of this; each enzyme activates the next until a fibrin clot is formed. There are two pathways by which the clotting can proceed: intrinsically or extrinsically. Intrinsic clotting is activated by the exposure of anionic surfaces of blood vessels that is damaged by the trauma, while extrinsic clotting is initiated by the exposure of tissue factors (TF). Tissue factors are integral glycoprotein.
File:Blood clotting.jpg Inactive forms of clotting factors =pink Activated forms = yellow Stimulatory proteins (not enzymes) = blue
The final portion of the pathway is the same for both intrinsic and extrinsic cascades, in which factor X is activated. Once the Prothrombin is activated and catalyzed into thrombin, it catalyzes the conversion of fibrinogen into fibrin. Thrombin cleaves fibrinopeptides at the central globular region, the globular domains at the carboxyl-terminal ends of the beta and delta chains interact with the exposed regions of the chains at the amino terminal. This cross linking reaction forms fibrin clots. It should be noted that thrombin is also involved in the activation of enzymes in previous steps, such as factors VII and VIII, providing a positive feedback loop on the cascade. This fibrin clotting process must be fast acting and precisely regulated, it can only act on damaged tissues. Fibrin can't be flowing in the blood vessels to cause blood clots. This precise regulation is owe to the fact that clotting factors are short-lived and diluted in blood vessels. They are quickly removed by the liver.
File:Blood clot final path.jpg

## Sources

Berg, Jeremy M. John L. Tymoczko. Lubert Stryer. Biochemistry Sixth Edition. W.H. Freeman and Company. New York, 2007.
# Structural Biochemistry/Enzyme Regulation/Isoenzyme analysis

The analysis of patterns of selected enzymes has been used extensively as a technique to identify the species of origin of cell lines with a high degree of certainty. Isoenzymes (or isoenzymes) are structurally different forms or the same enzyme. They catalyse the same reaction but have different protein structures. Each cell line would have its own unique array of isoenzymes.
The technique involves gel electrophoresis of cell homogenates under non-denaturing conditions. Specific activity stains are used to develop a banding pattern of isoenzymes (zymogram), which is characteristic of a particular cell line. Such zymograms are usually photographed to provide a permanent record of each cell line.
Of the various enzymes that can be separated into isoenzymes by this technique, glucose 6-phosphate dehydrogenase, and nucleoside phosphorylase have been particularly well characterised. By using several enzymes the distinguishing features of a cell line are established. These features can often distinguish cell lines even if derived from the same species.
# TiddlyWiki Manual/Saving Methods

This is an incomplete list of methods the community has used to saved TiddlyWiki files in a normal user workflow.

## Saver mechanism

These methods use the saver mechanism, which saves the entire TiddlyWiki as one file.

### TiddlyFox on FireFox up to version 56

* Simple to install and use.
Installation instructions are in the link.
http://tiddlywiki.com/#TiddlyFox

### TiddlyChrome on Google Chrome as long as it supports apps

* Simple to install and use.
Chrome is slated to remove Apps support in early 2018. Until then, this app should work fine. The instructions are in the link.
https://github.com/Arlen22/tiddly-chrome-app

### TiddlyServer

https://github.com/Arlen22/TiddlyServer

### TiddlyDesktop

http://tiddlywiki.com/#TiddlyDesktop

### Electron Wrapper

https://github.com/Arlen22/TiddlyWiki-Electron

### Using the default download saver with a powershell script and a batch file

Put the powershell script in the directory that your browser saves downloads to.
For each TiddlyWiki that you use, create a batch file in the download directory.
Every time you want to open a TiddlyWiki, you click on the corresponding batch file. The script grabs the newest file that starts with the name you specified for stem (in this case "bible"), and copies it into the specified directory as $stem$.html (in this case, "bible.html"). Once you are done editing you click save to download a new copy of the file. Then you can run the batch file again to copy the latest version back into your directory.
* ↑ https://groups.google.com/forum/#!msg/tiddlywiki/lPDUD66GBD8/nyxytP_DEwAJ
# Timeless Theorems of Mathematics/De Morgan's laws

De Morgan's Law is a fundamental principle in Logic and Set Theory. It establishes a useful relationship between the logical operators 'AND' and 'OR' when negations (NOT) are applied. There are two primary forms of De Morgan's Law, known as De Morgan's First Law and De Morgan's Second Law. These laws state that,
* The negation of a disjunction is the conjunction of the negations, $(A\cup B)'=A'\cap B'$
* The negation of a conjunction is the disjunction of the negations, $(A\cap B)'=A'\cup B'$

## Proof

Let $A$ and $B$ are two sets. De Morgan's First Law states that the complement of the union of $A$ and $B$ sets is the same as the intersection of the complements of $A$ and $B$. That means, $(A\cup B)'=A'\cap B'$, or ${\overline {(A\cdot B)}}=({\overline {A}}+{\overline {B}})$. And De Morgan's First Law states that the complement of the intersection of $A$ and $B$ is the same as the union of their complements, $(A\cap B)'=A'\cup B'$, or ${\overline {(A+B)}}=({\overline {A}}\cdot {\overline {B}})$.

### De Morgan's First Law

Assume $x\in (A\cup B)'$. Then $x\not \in A\cup B$.
$\implies x\not \in A$ AND $x\not \in B$
$\implies x\in A'$ AND $x\in B'$
$\implies x\in (A'\cap B')$
$\therefore (A\cup B)'\subseteq (A'\cap B')$
Again, Let, $x\in (A'\cap B')$. Then, $x\in A'$ AND $x\in B'$
$\implies x\not \in A$ AND $x\not \in B$
$\implies x\not \in A\cup B$.
$\implies x\in (A\cup B)'$
$\therefore (A'\cap B')\subseteq (A\cup B)'$
Therefore, $(A\cap B)'=A'\cup B'$ [Proved]

### De Morgan's Second Law

Assume $x\in (A\cap B)'$. Then $x\not \in A\cap B$.
$\implies x\not \in A$ OR $x\not \in B$
$\implies x\in A'$ OR $x\in B'$
$\implies x\in (A'\cup B')$
$\therefore (A\cap B)'\subseteq (A'\cup B')$
Again, Let, $x\in (A'\cup B')$. Then, $x\in A'$ OR $x\in B'$
$\implies x\not \in A$ OR $x\not \in B$
$\implies x\not \in A\cap B$.
$\implies x\in (A\cap B)'$
$\therefore (A'\cup B')\subseteq (A\cap B)'$
Therefore, $(A\cap B)'=A'\cup B'$ [Proved]
# Timeless Theorems of Mathematics/Binomial Theorem

The Binomial Theorem is a fundamental theorem in algebra that provides a formula to expand powers of binomials. It allows us to easily expand expressions, $(a+b)^{n}$, where $a$ and $b$ are real numbers or variables, and $n\geq 0$.

## Proof

Proposition: For any real numbers $a,b$ and $n\geq 0,$ $(a+b)^{n}=\sum _{k=0}^{n}{\binom {n}{k}}a^{n-k}b^{k}$ Where ${\binom {n}{k}}={\frac {n!}{k!(n-k)!}}$
Proof (Mathematical Induction):
For $n=0,(a+b)^{n}=(a+b)^{0}=1$
For $n=1,(a+b)^{n}=(a+b)^{1}=(a+b)$
For $n=2,(a+b)^{n}=(a+b)^{2}$ $=a^{2}+2ab+b^{2}$ $={\binom {2}{0}}a^{2}b^{0}+{\binom {2}{1}}a^{1}b^{1}+{\binom {2}{2}}a^{0}b^{2}$ $=\sum _{k=0}^{2}{\binom {2}{k}}a^{2-k}b^{k}$
For $n=3,(a+b)^{n}=(a+b)^{3}$ $=a^{3}+3a^{2}b+3ab^{2}+b^{3}$ $={\binom {3}{0}}a^{3}b^{0}+{\binom {3}{1}}a^{2}b^{1}+{\binom {3}{2}}a^{1}b^{2}+{\binom {3}{3}}a^{0}b^{3}$ $=\sum _{k=0}^{3}{\binom {3}{k}}a^{3-k}b^{k}$
Let's assume $(a+b)^{n}=\sum _{k=0}^{n}{\binom {n}{k}}a^{n-k}b^{k}$ for some $a\geq 0.$ Now we just have to show that the equation holds true for $n+1.$
$(a+b)^{n}=\sum _{k=0}^{n}{\binom {n}{k}}a^{n-k}b^{k}$
Or, $(a+b)^{n}(a+b)=(\sum _{k=0}^{n}{\binom {n}{k}}a^{n-k}b^{k})(a+b)$
$=({\binom {n}{0}}a^{n}b^{0}+{\binom {n}{1}}a^{n-1}b^{1}+{\binom {n}{2}}a^{n-2}b^{2}+...+{\binom {n}{n}}a^{0}b^{n})(a+b)$
$=a({\binom {n}{0}}a^{n}b^{0}+{\binom {n}{1}}a^{n-1}b^{1}+{\binom {n}{2}}a^{n-2}b^{2}+...+{\binom {n}{n}}a^{0}b^{n})+b({\binom {n}{0}}a^{n}b^{0}+{\binom {n}{1}}a^{n-1}b^{1}+{\binom {n}{2}}a^{n-2}b^{2}+...+{\binom {n}{n}}a^{0}b^{n})$
$=({\binom {n}{0}}a^{n+1}b^{0}+{\binom {n}{1}}a^{n}b^{1}+{\binom {n}{2}}a^{n-1}b^{2}+...+{\binom {n}{n}}ab^{n})+({\binom {n}{0}}a^{n}b^{1}+{\binom {n}{1}}a^{n-1}b^{2}+{\binom {n}{2}}a^{n-2}b^{3}+...+{\binom {n}{n}}a^{0}b^{n+1})$
$={\binom {n}{0}}a^{n+1}b^{0}+a^{n}b^{1}({\binom {n}{1}}+{\binom {n}{0}})+a^{n-1}b^{2}({\binom {n}{2}}+{\binom {n}{1}})+...+ab^{n}({\binom {n}{n}}+{\binom {n}{n-1}})+{\binom {n}{n}}a^{0}b^{n+1})$
$={\binom {n+1}{0}}a^{n+1}b^{0}+{\binom {n+1}{1}}a^{n}b^{1}+{\binom {n+1}{2}}a^{n-1}b^{2}+...+{\binom {n+1}{n}}ab^{n}+{\binom {n+1}{n+1}}a^{0}b^{n+1})$
∴$(a+b)^{n+1}=\sum _{k=0}^{n+1}{\binom {n+1}{k}}a^{n+1-k}b^{k}$
# Timeless Theorems of Mathematics/Differentiability Implies Continuity

Statement: If a function $f(x)$ is differentiable at the point $x_{0},$ then $f$ is continuous at $x_{0}.$
Proof: Assume $f(x)$ is differentiable at $x_{0}$. Then, $D_{x}f(x_{0})$ exists.
The function $f(x)$ is continuous at $x_{0}$ when $\lim _{x\to x_{0}}f(x)=f(x_{0}).$ $\Rightarrow \lim _{x\to x_{0}}f(x)-f(x_{0})=0$ $\Rightarrow \lim _{x\to x_{0}}f(x)-\lim _{x\to x_{0}}f(x_{0})=0$ $\Rightarrow \lim _{x\to x_{0}}[f(x)-f(x_{0})]=0.$ So, to prove the theorem, it is enough to prove that $\lim _{x\to x_{0}}[f(x)-f(x_{0})]=0.$
$\lim _{x\to x_{0}}[f(x)-f(x_{0})]$ $=\lim _{x\to x_{0}}[{\frac {f(x)-f(x_{0})}{x-x_{0}}}(x-x_{0})]$ $=\lim _{x\to x_{0}}[{\frac {f(x)-f(x_{0})}{x-x_{0}}}]\cdot \lim _{x\to x_{0}}(x-x_{0})$ $=D_{x}f(x_{0})\cdot 0=0$
Therefore, When $D_{x}f(x_{0})$ exists, $\lim _{x\to x_{0}}[f(x)-f(x_{0})]=0$ is true.
$\therefore$ If $f(x)$ is differentiable at the point $x_{0},$ then $f$ is continuous at $x_{0}.$ [Proved]
# Timeless Theorems of Mathematics
## Table of Contents
### Algebra

* Polynomial Remainder Theorem
* Polynomial Factor Theorem
* Rational Root Theorem
* Binomial Theorem

### Calculus

* Product, Quotient, Composition Rules
* Intermediate Value Theorem
* Differentiability Implies Continuity
* Mean Value Theorem
* Rolle's Theorem

### Number Theory

* Bézout's Identity
* Euclid's theorem

### Set Theory

* De Morgan's Law

### Geometry

* Mid Point Theorem
* Pythagorean Theorem
* Law of Cosines
* Apolloniu's Theorem
* Brahmagupta Theorem
* Ptolemy's Theorem
* Napoleon's theorem
# Timeless Theorems of Mathematics/Brahmagupta Theorem

The Brahmagupta's theorem states that if a cyclic quadrilateral is orthodiagonal (that is, has perpendicular diagonals), then the perpendicular to a side from the point of intersection of the diagonals always bisects the opposite side.
The theorem is named after the Indian mathematician Brahmagupta (598-668).

## Proof
### Statement

If any cyclic quadrilateral has perpendicular diagonals, then the perpendicular to a side from the point of intersection of the diagonals always bisects the opposite side.

### Proof

Proposition: Let $ABCD$ is a quadrilateral inscribed in a circle with perpendicular diagonals $AC$ and $BD$ intersecting at point $M$. $ME$ is a perpendicular on the side $BC$ from the point $M$ and extended $EM$ intersects the opposite side $AD$ at point $F$. It is to be proved that $AF=DF$.
Proof: $\angle CBD=\angle CAD$ [As both are inscribed angles that intercept the same arc $CD$ of a circle]
Or, $\angle CBM=\angle MAF$
Here, $\angle CMB+\angle CBM+\angle BCM=180$°
Or, $\angle CMB+\angle BCM=180$° $-\angle CBM$
Again, $\angle CME+\angle CEM+\angle ECM=180$°
Or, $\angle CME+\angle CMB+\angle BCM=180$° [As $\angle CMB=\angle CEM=90$° and $\angle BCM=\angle ECM$]
Or, $\angle CME+180$° $-\angle CBM=180$°
Or, $\angle CME=\angle CBM$
Or, $\angle AMF=\angle MAF$ [As, \angle AMF = \angle CME; Vertical Angles]
Therefore, $AF=MF$
In the similar way, $\angle MDF=\angle DMF$ and $MF=DF$
Or, $AF=DF$ [Proved]

## Reference

* ↑ Michael John Bradley (2006). The Birth of Mathematics: Ancient Times to 1300. Publisher Infobase Publishing. ISBN 0816054231. Page 70, 85.
# Writing Adolescent Fiction/Character names/Botanical

Here are some botanical names.
* Acacia
* Achillea
* Althea
* Alyssum
* Amarantha
* Amaryllis
* Anemone
* Angelica
* Anise
* Anthea
* Apple
* Apricot
* Aquacea
* Armeria
* Aspen
* Aster
* Azalea
* Banana
* Basil
* Bay
* Begonia
* Begonya
* Berry (this spelling)
* Betony
* Blanchefleur
* Blossom
* Bluebell
* Bluma
* Briar
* Briar Rose
* Briony
* Bryony
* Cactusflower
* Calla
* Camelia
* Camellia
* Canna
* Cannabis
* Carnation
* Carrot
* Cassia
* Cattleya
* Cayenne
* Cedar
* Celandine
* Cereus
* Cerise (French for cherry)
* Cherimoya
* Cherry
* Chia
* Cilantro
* Cinnamon
* Clematis
* Cliantha
* Clover
* Columbine
* Coralbell
* Crocus
* Cypress
* Daffodil
* Daffodile
* Dahlia
* Daisy
* Dalia
* Daliazucena
* Daphne
* Dasheen
* Dittany
* Dracena
* Ebony
* Elderberry
* Elodea
* Erianthe
* Fern
* Flora
* Freesia
* Frond
* Fuchsia
* Gardenia
* Ginkgo
* Gloriosa
* Guava
* Hazel
* Heather
* Hebe
* Holly
* Honeysuckle
* Hyacinth
* Hyacintha
* Iris
* Ivy
* Jacaranda
* Jacinta
* Jacinth
* Japonica
* Jasmine
* Jessamine
* Jonquil
* Jonquille
* Juniper
* Junipera
* Kale
* Kava
* Kelp
* Kerria
* Kiwi
* Korsbar (Swedish for Cherry)
* Kumquat
* Kunzea
* Lantana
* Larch
* Laurel
* Lavendar
* Lavender
* Lemon
* Lettuce
* Liana
* Lilac
* Lilly/Lily
* Lilyrose
* Linnea
* Lotus
* Lynnaea
* Magnolia
* Mahogany
* Mallow
* Malva
* Mango
* Marguerite
* Marigold
* Mariposa
* Marjoram
* Mignonette
* Mimosa
* Myrtle
* Narcissa
* Nettle
* Oliander [sic]
* Olive
* Orange
* Orchid
* Pansy
* Papaya
* Peach/Peaches
* Pear
* Peony
* Persimmon
* Petunia
* Pink
* Plum
* Poplar
* Poppy
* Posy
* Primrose
* Primula
* Quince/Quincey/Quincy
* Rattan
* Rose
* Rosemary
* Rowan
* Rue (also a Hunger Games name)
* Saffron
* Sage
* Sakura
* Salvia
* Samara
* Sassafras
* Sequoia
* Sesame
* Shamrock
* Smilax
* Snowdrop
* Solandra
* Sorrel
* Spruce
* Sunflower
* Sweetpea
* Syringa
* Tamarind
* Tansy
* Thistle
* Thorn
* Thyme
* Torreya
* Tulip
* Tulipa
* Tupelo
* Valencia
* Vanilla
* Vera
* Verbena
* Viola
* Violet
* Wasabi
* Willow
* Wisteria
* Xilosma
* Ximenia
* Xylitol
* Yarrow
* Yucca
* Yuzu
* Zinnia
* Zoysia
# Writing Adolescent Fiction/Character names/Burmese
## Usage note

Burmese first names are androgynous. Burmese will for a first name use one of the following, or combine two (Khun-Sa, Suu-Kyi). Originally people in Myanmar had no surnames, but now they use one of the possible first names as their surname.
U is an honorific meaning “old”. It is used for senior men, but also for monks.

## First names or surnames

* A
* Aun
* Aunt
* Aung
* Aye
* Ba
* Baby
* Bau
* Bawi
* Bik
* Bo
* Bohmu
* Boy
* Byaw
* Chain
* Chao
* Chaw
* Chi
* Chit
* Cho
* Chun
* Da
* Dan
* Dar
* Daw
* Do
* Gyi
* Ha
* Han
* Har
* Hay
* Hein
* Hla
* Hlaing
* Hmwe
* Hnin
* Hock
* Hpay
* Hsu
* Htaik
* Htain
* Htaung
* Htay
* Htet
* Htike
* Htin
* Htoo
* Htoon
* Htun
* Htut
* Htway
* Htwe
* Hwae
* Ja
* Kaung
* Kay
* Kee
* Kha
* Khain
* Khaing
* Kham
* Khan
* Khant
* Khaung
* Khin
* Khine
* Khing
* Khun
* Kin
* Ko
* Koe
* Koko
* Kwan
* Kwei
* Kya
* Kyaing
* Kyaw
* Kyee
* Kyi
* Kyin
* Kyu
* Kywa
* Kywe
* La
* Lai
* Lar
* Lat
* Latt
* Lay
* Lei
* Li
* Lian
* Lim
* Lin
* Ling
* Linn
* Lon
* Lu
* Lun
* Lwin
* Lynn
* Ma
* Man
* Mang
* Mar
* Maung
* Maw
* May
* Me
* Mee
* Meit
* Mi
* Mima
* Mimma
* Min
* Mina
* Minn
* Mint
* Moe
* Mon
* Moo
* Moun
* Moung
* Mu
* Mung
* Mya
* Myaing
* Myat
* Myi
* Myint
* Mynn
* Myo
* Myaw
* Na
* Naing
* Nan
* Nanda
* Nandar
* Nang
* Naung
* Naw
* Nay
* Ne
* Nee
* Nge
* Ngwe
* Ni
* Noe
* Nu
* Nwe
* Nyee
* Nyein
* Nyi
* Nyinyi
* Nyo
* Nyun
* Nyunt
* Ohn
* On
* One
* Oo
* Ooh
* Oung
* Pa
* Paing
* Pan
* Pann
* Par
* Paw
* Pe
* Pha
* Pho
* Phoo
* Phyo
* Phyoe
* Phyu
* Pi
* Po
* Poe
* Pwint
* Pyae
* Pyant
* Pyin
* Pyone
* Ra
* Sa
* Sai
* Saing
* San
* Sandar
* Sann
* Saw
* Sein
* Seng
* Set
* Shein
* Shin
* Shine
* Shwe
* Si
* Sie
* Sin
* Sint
* Sit
* Sithu
* Smile
* Snow
* So
* Soe
* Sone
* Su
* Suan
* Sung
* Suu
* Swar
* Swe
* Sweet
* Tan
* Tar
* Taw
* Tchin
* Tha
* Thame
* Than
* Thandar
* Thang
* Thant
* Thar
* Thaung
* Thaw
* The
* Theik
* Thein
* Theingi
* Theint
* Thet
* Thi
* Thida
* Thiha
* Thin
* Thinn
* Thiri
* Thit
* Thu
* Thura
* Thuzar
* Thway
* Thwe
* Thwin
* Tin
* Tint
* Toe
* Toke
* Tu
* Tun
* Tut
* Wa
* Wah
* Wai
* Waing
* Wang
* War
* Warwar
* We
* Win
* Winn
* Winna
* Wint
* Wun
* Wynn
* Xing
* Ya
* Yamin
* Yan
* Yang
* Yar
* Ye
* Yee
* Yi
* Yin
* Yint
* Yo
* Yon
* Yona
* Yonna
* Yu
* Yum
* Zan
* Zar
* Zaw
* Zay
* Zeya
* Zin
# Writing Adolescent Fiction/Character names/Belarusian
## Usage note

A Belarusian name consists of a given name, a patronymic middle name, and a surname, similar to Russia. As in Russia, the middle name consists of the father's first name with -ovich or -evich added for sons, and -ovna or -evna added for daughters.

## Girls' names

* Alaksandra
* Alena
* Anastasia
* Awhieñnia
* Barbara (Catholic)
* Brachyslava
* Branislava
* Darafieja
* Eva
* Franciška
* Halina
* Hanna
* Iryna
* Iziaslava
* Jawhieñnia
* Jelizavieta
* Kaciaryna
* Kazimira
* Kista
* Lidyja
* Mahdalena
* Marfa
* Marharyta
* Maryja
* Maryna
* Natallia
* Olga
* Pawlina
* Pradslava
* Radaslava
* Rahnieda
* Safija
* Stanislava
* Stefaniya
* Svetlana
* Taçciana
* Tamara
* Uladzimira
* Usiaslava
* Usiavalada
* Valantsina
* Valantyna
* Varvara (Orthodox)
* Viachaslava
* Volha
* Yulia
* Zora

## Boys' names

* Adam
* Alaksandar
* Alaksiey
* Aleh
* Ales’
* Alhierd
* Aliaksandr
* Andrej
* Anton
* Awhien
* Brachislav
* Branislav
* Chrystafor
* Chviodar
* Dzmitry
* Eduard
* Foma
* Francišak
* Halshan
* Hienadz
* Hieohri
* Ihar
* Ihnat
* Iosif
* Ivan
* Iziasar
* Jakaw
* Jakor
* Jan
* Jarema
* Jawhien
* Jazep
* Jury (Jurka)
* Kastush
* Kazimir
* Lavon
* Lavren
* Łuka
* Majsiej
* Marko
* Michaił
* Michał
* Mikhash
* Mikalaj
* Mikoła
* Nil
* Paval
* Pawluk
* Piatro
* Piotr
* Ryhor
* Siamion
* Siarhiej/Siargej
* Stefan
* Tadevuš
* Uladzimir
* Ulis
* Vaclav
* Valentyn
* Varfalomey
* Vasilya
* Vasyl
* Viachaslav
* Viktar
* Vitawt

## Surnames

* Aliaksiej
* Astapkovich
* Atrashenko
* Azyabina
* Becue
* Boguinskaia
* Chiritso
* Demidchik
* Drozd
* Dubrovchik
* Dukhnov
* Emelyanov
* Filimonov
* Glavatski
* Glovatskiy
* Goukov
* Gureev
* Ivankov
* Ivanov
* Jermalovic
* Kalinivski
* Kaptyukh
* Kardapoltsev
* Kavaliov
* Kazak
* Kazlov
* Kazlovski
* Khodovitch
* Khorkhulyov
* Khorkulev
* Khramov
* Komar
* Kotov
* Koudrevitch
* Kovalchuk
* Kozak
* Kurlovich
* Kurochkin
* Kvachuk
* Kvotchinski
* Ledovski
* Lobachov
* Matskevich
* Mikhnovets
* Moroz
* Novik
* Novikov
* Okeanov
* Pavlovski
* Petrenko
* Petrov
* Piskun
* Polozkov
* Roukhlevitch
* Roukshin
* Rudnitski
* Rukhlevitch
* Safronnikov
* Sawoniuk
* Sazanovich
* Scherbin
* Scherbo
* Schilansky
* Sememiouk
* Shikolenko
* Shimuk
* Sierka
* Skolnick
* Suchovska
* Suldesova
* Taranenko
* Tsybulskaya
* Turovich
* Vinogradov
* Volkov
* Voronokov
* Yatchenko
* Yurkov
* Zhuk
* Zverev
# Traditional Abacus and Bead Arithmetic/Resources for contributors
## Some simple tools

This book makes heavy use of abacus procedure tables like:
Caption text :
| Abacus | Comment |
| ABCDEFGHIJKLM | |
| 4567890123 | Entering radicand starting in CD (first group) |
| 2 | First root digit in B |
| -4 | Subtract square of B from first group |
| 2 567890123 | Null remainder |
| 4 567890123 | Doubling B. Appending next group to remainder |
| 41 567890123 | 5/4≈1, try 1 as next root digit |
| -4 | Continue division by 41, subtract 1✕41 from EF |
| -1 | |
| 41 157890123 | 15 as remainder |
| 42 157890123 | Double second root digit |
| 42 157890123 | Append next group |
| 423157890123 | 157/42≈3, try 3 as next root digit |
| -12 | Continue division by 423, subtract 3✕423 from E-H |
| -06 | |
| -09 | |
| 423 30990123 | 309 as remainder |
| 426 30990123 | Double third root digit |
| 426 30990123 | Append next group |
| etc. | |
and could also be enhanced by using some abacus diagrams here and there like this one:
Write caption here! :
| A | B | C | D | E | F | G | H | I | K | J | L | M |
| 9 | 18 | 9 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 9 | 9 | 9 |
If you plan to contribute to this book, you may find some simple tools located at User:Jccsvq/Abacus diagrams and procedure tables that may make some of these tasks easier for you. (Jccsvq (discuss • contribs) 05:46, 22 August 2021 (UTC))
# Traditional Abacus and Bead Arithmetic/Roots
## Introduction

Obtaining square and cubic roots are the most complex operations studied within Elemental Arithmetic. The eastern abacus is very well adapted to obtaining square roots by a direct and efficient procedure, but unfortunately the same cannot be said with reference to cube roots which, although possible, require a tortuous path full of comings and goings that it is prone to errors.
Cargill Gilston Knott (1856 - 1922), one of the fathers of modern seismology, was a Scottish physicist and mathematician who served nine years as a professor of mathematics, acoustics and electromagnetism at the Imperial University of Tokyo; after which he was awarded the Order of the Rising Sun by Emperor Meiji in 1891. During his stay in Japan he came into contact with the Japanese abacus which he studied in depth and without a doubt he used professionally in his own work as a teacher and researcher. The result of this study was a famous 55 pages article written in 1885 about it, which for a long time has been the best informed account in English, and obligatory reference, on the history and foundations of soroban. The next two chapters in this book develop and expand on Knott's vision of the traditional methods of obtaining square and cube roots, the vision of a western scientist and mathematician, offering both a theoretical and practical approach illustrated with several examples.

## Chapters

This part of the book consists of the following chapters:
* Square root
* Cube root

## Checking your exercises

Obtaining square and cubic roots with the abacus can be a somewhat long process and during the learning phase it is interesting to have a tool that allows us to control whether we are doing it correctly.

### Square root

For square roots you can try the excellent Murakami's Square root tutor with Kijoho, a JavaScript application that you can run directly in your browser or download to your computer from its GitHub repository. You just have to enter the root in the small input box on the left and repeatedly press the "next" button on the screen to see the development of the process step by step.

### Cube root
#### File knott.bc

And mainly for cube roots, the following BC code may help, copy and paste it to a text file and call it knott.bc:

#### File: sr200703.bc

Output:

#### File cr488931400152.bc

Output

## References

* ↑ Knott, Cargill G. (1886), "The Abacus, in its Historic and Scientific Aspects", Transactions of the Asiatic Society of Japan, 14: 18–73