Principia
BioMathematica
(Biomatics)

Principia BioMathematica (Biomatics)Principia BioMathematica (Biomatics)Principia BioMathematica (Biomatics)Principia BioMathematica (Biomatics)
  • Home
  • The Aha! Moment
  • Biomatics
  • Biomatics 101
  • Smart Molecules
  • Molecular Robotics
  • Molecular Vibrations
  • Molecules Doing Math
  • Numerical Methods
  • Orthonormal Bases
  • Series Methods
  • Vibrational Groups
  • Molecular Lie Groups
  • Biomatic Number Theory
  • Molecular Programming 101
  • The Amino Acid Code
  • The Histone Code
  • Microtubular Computation
  • Biomatic Engineering
  • Quantum Computation
  • Carbon Based Life Forms
  • Gallery
  • Artificial Intelligence
  • Medical Biomatics
  • Finite State Cancer
  • Biomatics and Physics
  • The future of Biomatics

Principia
BioMathematica
(Biomatics)

Principia BioMathematica (Biomatics)Principia BioMathematica (Biomatics)Principia BioMathematica (Biomatics)
  • Home
  • The Aha! Moment
  • Biomatics
  • Biomatics 101
  • Smart Molecules
  • Molecular Robotics
  • Molecular Vibrations
  • Molecules Doing Math
  • Numerical Methods
  • Orthonormal Bases
  • Series Methods
  • Vibrational Groups
  • Molecular Lie Groups
  • Biomatic Number Theory
  • Molecular Programming 101
  • The Amino Acid Code
  • The Histone Code
  • Microtubular Computation
  • Biomatic Engineering
  • Quantum Computation
  • Carbon Based Life Forms
  • Gallery
  • Artificial Intelligence
  • Medical Biomatics
  • Finite State Cancer
  • Biomatics and Physics
  • The future of Biomatics
Hello

Welcome

Molecules are chains of atoms separated by bonds. Molecules are also highly complex machines, operating under highly sophisticated rules and programming...from acorns growing into trees...to neurons doing Intelligence processing. 

Molecular Programming

 

Molecular programming is a field that combines computer science and molecular biology to design and create artificial molecular systems that can carry out specific tasks. It involves programming the behavior of molecules, such as DNA, RNA, and proteins, to perform computations, build structures, or sense and respond to environmental signals.


The main goal of molecular programming is to engineer molecular systems that can function like traditional electronic computers, but with the advantages of being small, fast, and self-assembling. This technology has the potential to revolutionize fields such as medicine, energy, and environmental monitoring.


One example of molecular programming is DNA computing, where DNA molecules are used as a substrate for computing. Another example is the design of synthetic biological circuits, which can sense specific signals and respond with a desired output. These circuits can be used in applications such as biosensors or drug delivery systems.


Overall, molecular programming is a rapidly growing field that has the potential to unlock new ways of computing, sensing, and engineering molecular systems.

Molecular Logic Gates

Computer Analogy

 

The eight corners of a cube formed by two carbon atoms (considering their rotational bond gates) can represent different logic gates. This mapping can be achieved by assigning specific rotation rates (r) to each corner of the cube, where r = 0 means no rotation (false/logical "0") and r = 1 means rotation (true/logical "1").

The eight corners of the cube can be represented by three binary digits (r1, r2, r3) as follows:

  1. Corner (0, 0, 0) corresponds to the gate with inputs A = 0 and B = 0, output Y = 1. This can represent the NOT gate.
  2. Corner (0, 0, 1) corresponds to the gate with inputs A = 0 and B = 1, output Y = 1. This can represent the NOR gate.
  3. Corner (0, 1, 0) corresponds to the gate with inputs A = 0 and B = 0, output Y = 1. This can represent the NOR gate.
  4. Corner (0, 1, 1) corresponds to the gate with inputs A = 0 and B = 1, output Y = 0. This can represent the AND gate.
  5. Corner (1, 0, 0) corresponds to the gate with inputs A = 0 and B = 0, output Y = 1. This can represent the NOR gate.
  6. Corner (1, 0, 1) corresponds to the gate with inputs A = 0 and B = 1, output Y = 0. This can represent the AND gate.
  7. Corner (1, 1, 0) corresponds to the gate with inputs A = 0 and B = 0, output Y = 1. This can represent the NOR gate.
  8. Corner (1, 1, 1) corresponds to the gate with inputs A = 0 and B = 1, output Y = 0. This can represent the AND gate.

As we can see, each corner of the cube represents a different logic gate based on its specific combination of rotation rates (r1, r2, r3). This mapping illustrates the versatility and richness of the interactions between two carbon atoms and how they can be interpreted as embodying fundamental logical operations.


 

A NAND gate is a type of digital logic gate that performs a specific logical operation called the "NAND" operation. It is one of the basic building blocks in digital electronics and is widely used in designing digital circuits and computer systems.

The NAND gate has two or more input terminals (usually denoted as A, B, etc.) and one output terminal (usually denoted as Y). It implements the following logical operation:

Output (Y) = NOT (A AND B)


 The NAND gate is considered universal in digital logic because any other logical operation can be constructed using just NAND gates. For example, by connecting multiple NAND gates together, we can create circuits for NOT, AND, OR, NOR, XOR, and other logical operations. 


 

If we consider the corners of the cube as different states rather than rotation rates, it is possible to implement a NAND gate using the states of two carbon atoms forming the cube.

In digital logic, a NAND gate is a logic gate that produces an output of "false" (0) only when both of its inputs are "true" (1). Here's how we can map the states of the carbon atoms in the cube to implement a NAND gate:

Let's label the corners of the cube with binary values, where each corner represents a state of the two carbon atoms. For example:

Corner 1: (0, 0) Corner 2: (0, 1) Corner 3: (1, 0) Corner 4: (1, 1) Corner 5: (0, 0) Corner 6: (0, 1) Corner 7: (1, 0) Corner 8: (1, 1)

Now, we can choose specific rotations of the carbon atoms corresponding to the corners to implement the NAND gate. We need to find rotations that will map the input states to the output state of the NAND gate, which is "false" (0) when both inputs are "true" (1), and "true" (1) for all other input combinations.

By selecting the appropriate rotations for the carbon atoms, we can create a mapping that satisfies the NAND gate's behavior. Thus, the cube formed by two carbon atoms could be used as a NAND gate in this context.

Molecules

From atoms to galaxies

In a formal mathematical sense a molecule is two bodies separated by a bond. So there is no difference between a protein and a system of bound galaxies where the bond is gravitational or otherwise. It is still a case of two bodies separated by bonds or some chain of these. In an infinitely small universe you may run into Stephen Hawking and vibrating strings. Notice the similarity here to a black hole. The surface is created by mapping the free tip of a molecule fixed at one end and rotating with some relationship between the rotations of the individual bonds.

Carbon Chain Programming

The Carbon Atom

The carbon atom plays a central role in the study of biology and plays a central role in the formation of most important molecules...proteins...for example.

One formal approach to such molecules is to fix the molecule on one end and number the resulting ordered bonds. The bonds can theoretically rotate in highly complex ways. One simple fundamental first approach is to consider the angular motions as constant values. They need not all be the same. An interesting approach is to assign integer values...for example 3,5,0 may be interesting for several reasons (Vitruvius). One such reason is that amino acids are made of peptides with a base of 3 bonds. The first two are free to rotate and the third much less so. The integers 3 and 5 are very central in number theory, for example they consecutive elements of the Fibonacci set.


Thus is created a mathematical universe of the dimension being the number of bonds. An ordered  list of bond spin rates is a list of points in an n-dimensional space.


Furthermore, there is a relationship between the point in space...the program...and the motion in 3d space of the end atom...entanglement?


Each molecular "program" is represented by a point in a space (assuming fixed carbon chain geometry...109.5 degrees, fixed bond length). 

Y=f(b1,b2,b3,...bn)

Each bn represents a constant relative rotation rate.

Each bn is an element of the set (1,2,3,...m), m probably not too high due to declining ratios.


Fibonacci: interesting possibility

0 1 1 2 3 5 8 13 21 34...

                                                          ----------

 

In general, the context of a vibrating chain of n carbon atoms, each bond can be described by its own function fn​(t), which represents the rotation of that bond at a given time t. The functions fn​(t) would describe how each bond's angle changes over time as the chain vibrates.

These functions fn​(t) would likely depend on various factors such as the bond's characteristics, the forces acting on the chain, and the interactions between neighboring atoms. In a real-world scenario, these functions can become quite complex due to the interactions and dynamic nature of the molecular system.


Mathematically, you can think of the entire system as a collection of functions fn​(t) for each bond n, forming a system of equations that describe the vibrational behavior of the chain over time. Analyzing such a system can be quite challenging and often involves techniques from differential equations, numerical analysis, and computational modeling.


If we were to fix the first covalent bond in a carbon chain and allow the rest of the molecule to change shape and follow the motion of the carbon atom at the other end, we would essentially be creating a molecular lever system.


In this scenario, the carbon chain would act as a lever, with the first carbon atom acting as the fulcrum, and the carbon atom at the other end acting as the load. By changing the conformation of the carbon-carbon bonds in the chain, it would be possible to control the position and movement of the load.


For example, if the carbon atom at the other end were attached to a functional group with specific chemical properties, we could use the lever system to control the interactions between that group and other molecules in the environment. By changing the conformation of the carbon chain, we could control the position and orientation of the functional group and therefore control its chemical interactions with other molecules.


This concept of using molecular levers has potential applications in areas such as drug delivery, where precise control over the position and orientation of drug molecules is critical for their effectiveness. By designing carbon chains with specific conformations and functional groups, it may be possible to create molecular levers that can precisely control the delivery of drugs to specific cells or tissues in the body.


Overall, the use of carbon chains as molecular levers has exciting potential for controlling the properties and behavior of molecules, and could lead to new innovations in fields such as nanotechnology and drug discovery.

 

The use of molecular levers based on carbon chains could potentially be useful in disease diagnosis and management. For example, by designing carbon chains with specific conformations and functional groups, it may be possible to create molecular levers that can selectively interact with disease-related biomolecules, such as proteins or nucleic acids.


One potential application could be in the diagnosis of diseases such as cancer. Cancer cells often express specific biomolecules on their surface, which can be targeted by therapeutic molecules or diagnostic probes. By designing molecular levers that can selectively interact with these biomolecules, it may be possible to create more effective diagnostic tools that can detect cancer cells at an early stage.


Another potential application could be in drug delivery for the treatment of diseases. By designing molecular levers that can selectively interact with disease-related biomolecules, it may be possible to deliver drugs more selectively to diseased cells or tissues, while minimizing side effects on healthy cells.


Overall, the use of molecular levers based on carbon chains could have important implications for disease diagnosis and management and could potentially lead to the development of more effective and targeted diagnostic and therapeutic tools.


 

By recording the state transitions of healthy biosystems and comparing them to abnormal ones, it may be possible to identify key differences in molecular lever systems that are associated with disease states. This could lead to the development of new therapeutic pathways that target these specific differences.


For example, if a particular disease is associated with changes in the conformation of carbon chains in certain molecules, it may be possible to design molecular levers that can selectively interact with these molecules and restore them to their normal state. Alternatively, it may be possible to develop drugs that target the molecular lever systems involved in disease progression, thereby slowing or halting the disease process.


Of course, this is a highly complex and challenging area of research, and there are many technical and practical obstacles that must be overcome. However, the potential benefits of developing new therapeutic approaches based on the manipulation of molecular lever systems are substantial, and could lead to new treatments for a wide range of diseases.



Exploring the Computational Potential of Carbon Chains

 

Given the computational model of a carbon chain with discrete rotational states, we have an extensive space of possible programs. Each unique configuration or "program" of the chain generates a distinct 3D output structure, which can be visualized by tracing the path of the distal carbon atom. The challenge lies in finding programs that yield interesting and biologically relevant structures.


1. Defining the Program Space

  • Discrete Rotational States: Each bond in the carbon chain can rotate to discrete integral values, creating a finite set of possible configurations.
  • Program Execution: A specific sequence of rotations defines a "program," which determines the 3D path traced by the end carbon atom.
  • Output Structures: Each program generates a unique 3D structure, potentially reflecting various anatomical or geometric patterns.


2. Identifying Interesting Programs

Criteria for Interesting Structures

  • Bilateral Symmetry: Structures exhibiting symmetry, akin to many biological forms.
  • Geometrical Shapes: Simple and complex shapes that resemble biological structures like kidneys, ears, and lungs.
  • Facial Structures: Configurations that suggest facial features or other complex anatomical patterns.

Search Techniques

  • Neighborhood Exploration: By slightly altering the rotational states of bonds, we explore the "neighborhood" of a given program. This can reveal variations and potentially more interesting structures.
  • Pattern Recognition: Using AI techniques to identify and classify output structures based on their resemblance to biological forms.


3. Mathematical and Computational Framework

Set Theory and Groups

  • Set of States: Each possible configuration forms a set, and transitions between these states can be modeled using group theory.
  • Symmetry Operations: Analyze the symmetry properties of the generated structures, identifying those with interesting symmetrical patterns.

Finite Fields and Galois Fields

  • Field Operations: Treat the states as elements of a finite field, using addition, subtraction, multiplication, and division modulo a prime number to explore computational behaviors.
  • Polynomials: Use irreducible polynomials to generate more complex field structures, simulating more sophisticated computational tasks.

Numerical Methods

  • Optimization: Employ numerical optimization techniques to find programs that yield desired structures.
  • Monte Carlo Simulations: Randomly sample the space of programs to identify those with interesting properties, refining the search based on initial findings.


4. Biological Relevance and Applications

Modeling Biological Structures

  • Anatomical Patterns: Use the generated 3D structures to model and study biological forms, providing insights into developmental biology and morphogenesis.
  • Functional Simulations: Simulate the functional behavior of biological structures, such as the mechanical properties of tissues or the airflow in lungs.

Artificial Intelligence and Machine Learning

  • Pattern Recognition: Develop AI algorithms to classify and analyze the generated structures, identifying those with potential biological significance.
  • Learning Algorithms: Train models to predict which programs are likely to produce interesting structures, improving search efficiency.


5. Future Directions

  • High-Throughput Screening: Automate the process of exploring the program space, using high-throughput computational methods to identify interesting structures.
  • Hybrid Models: Combine carbon chain models with other molecular systems to explore more complex biological behaviors and interactions.
  • Experimental Validation: Collaborate with experimental biologists to validate the computational predictions and explore practical applications in biotechnology and medicine.


Conclusion

The exploration of carbon chain configurations offers a fascinating intersection of mathematics, computational science, and biology. By studying the paths traced by the end carbon atom in these chains, we can discover programs that yield biologically relevant structures. This approach not only provides a rich computational framework but also opens new avenues for understanding and modeling the complexity of biological forms and functions.

Vibrational Spaces

 

If you fix the position of one atom in a molecule and trace the path of the other atom along its vibrational mode, you would obtain a curve in three-dimensional space. This is because the atom is free to move in three-dimensional space, and its motion along the vibrational mode would trace out a path or trajectory that forms a curve.


For example, consider a diatomic molecule, where one atom is fixed and the other atom vibrates along the bond axis. The vibrational mode of the molecule would be described by the bond length as a function of time, and the trajectory of the vibrating atom would trace out a curve in three-dimensional space, showing how the bond length changes over time.


Similarly, in more complex molecules, where multiple vibrational modes are involved, the motion of the atoms along their respective vibrational modes would trace out curves or paths in three-dimensional space. These curves can be visualized and analyzed to understand the nature of the vibrational modes, such as their amplitudes, frequencies, and directions of motion.


Visualization and analysis of molecular vibrational modes and their associated paths or curves in three-dimensional space can provide insights into the dynamic behavior of molecules, including their conformational changes, energy transfer, and other vibrational properties. This can be useful in understanding the structural and functional properties of molecules, as well as in designing and optimizing molecular systems for specific applications in fields such as drug discovery, materials science, and chemical engineering.

 

  1. Initial Bond Angles: You can represent the set of initial bond angles as Ω = {ω0, ω1, ..., ωn}, where ωi represents the initial angle of the i-th covalent bond in the molecular system.
  2. Time-Dependent Bond Rotation Functions: You can represent the time-dependent rotational function for the i-th covalent bond as fi(t), where fi(t) represents the rotational motion of the i-th bond as a function of time.


Using this notation, you can refer to the initial bond angles collectively as Ω, and the time-dependent rotational functions for each bond as fi(t), where i is the index representing the individual bonds and t represents time. For example, you can describe the angular displacement of the i-th bond as a function of time using the notation Δθi(t), where Δθi(t) = fi(t) - ωi represents the change in bond angle for the i-th bond over time.


Neighborhoods or Clusters in  a Space 

In the context of molecular programs, a "neighborhood" could refer to the set of programs that differ from a given program by only a small amount, specifically in the values near the tip of the molecule.


The tip of a molecule refers to the end of the molecule where the covalent bonds terminate. In a molecular program that describes the rotational motion of covalent bonds, the values near the tip of the molecule would correspond to the rotational velocities of the bonds at the end of the molecule.


To define a neighborhood in this context, one would need to specify the exact criteria for determining which programs are considered "near" to the given program. This could involve setting a tolerance level for the difference in values between the programs, or specifying a specific number of bonds before the tip that must be identical in the two programs for them to be considered part of the same neighborhood.


In general, neighborhoods in this context could be useful in studying the behavior of molecules in complex environments, where small changes in the molecular program could lead to significant differences in the molecule's behavior. By studying the behavior of molecules in different neighborhoods, researchers can gain insights into how the molecular program influences the molecule's interactions with other molecules and its overall behavior.


Biological Computational control structures

Biological "For-Next" Loops

 

Natural “for-next” Loops in Molecular Biology


DNA Replication: The replication machinery copies each base of the genome sequentially. DNA helicase unwinds the double helix, and DNA polymerase then iteratively adds complementary nucleotides one by one along the templatenature.com. In effect, the polymerase executes a loop over the template strand: for each template base, it selects and attaches the matching base, then moves one position downstream.  This continues until the end of the template is reached (a bounded loop of length = the DNA segment).  Prokaryotic DNA Pol III (and eukaryotic Pol δ/ε) carry out this nucleotide-by-nucleotide additionnature.com.  On the lagging strand, the same loop of extending-by-one-nucleotide is repeated for each Okazaki fragment (each fragment is made by a new primer and polymerase loop). Key components include helicase (unwinding the helix), primase (laying short RNA primers), DNA polymerase (elongating each strand base-by-base), and ligase (joining fragments).

  • Loop structure: For each nucleotide in the template DNA: unwind, prime if needed, add complementary base, advance one position (polymerization), repeat.
     
  • Components: DNA helicase (unzips DNA), single-strand binding proteins, primase, DNA polymerase, sliding clamp (holds polymerase), DNA ligase.
     
  • Control flow: Polymerase moves 5′→3′ adding one base at each step (as described: “adds nucleotides, one by one”nature.com), effectively a finite loop over the chromosome segment. Proofreading exonuclease edits errors between additions.
     

Transcription (RNA synthesis): RNA polymerase transcribes each gene nucleotide-by-nucleotide.  After initiation at a promoter, the core RNA polymerase (with σ-factor in bacteria) “tracks along the DNA template” and adds ribonucleotides one by one to the growing RNA chainbio.libretexts.org. Each step is determined by Watson–Crick base pairing to the template strand. Thus transcription elongation is a loop over the length of the gene: for each DNA base position, RNA polymerase appends the complementary ribonucleotide to the 3′ end of the mRNA, then moves one base downstream. This repeats until a terminator sequence is reached. Key components are the RNA polymerase holoenzyme and NTP substrates.


Once elongation is finished, transcription terminates and the full-length RNA is released. In eukaryotes the nascent pre-mRNA is then processed: a poly(A) tail of ~200 adenines is added by poly(A) polymerase through an iterative loop (adding one A at a time)bio.libretexts.org, and each intron is removed sequentially by the spliceosome.  These modifications involve repeated enzymatic steps (add A for each iteration of the loop; excise intron for each intron in the transcript) before the mature mRNA is exported for translation.


Protein Translation:  The ribosome reads mRNA one codon (triplet) at a time and appends one amino acid per codon.  Translation initiation clamps the ribosome onto the start codon, then elongation proceeds in a repetitive cycle: for each codon, a matching aminoacyl‑tRNA is recruited to the A site, a peptide bond forms, and the ribosome translocates three nucleotides. This loop of “decode codon → add amino acid → shift ribosome” repeats until a stop codon is encountered.  In other words, the ribosome executes a finite loop whose number of iterations equals the number of codons in the open reading frame.  Each iteration uses the ribosome’s RNA and protein components and translation factors to ensure accuracy and movement.


 Ribosome translation (six-step cycle).  tRNAs (cloverleaf) sequentially bring amino acids to the ribosome, which reads each codon and links amino acids into a polypeptidenature.com.  Steps 3–5 repeat “over and over” as the ribosome moves codon-by-codonnature.com.
This repetitive cycle is described in textbooks as “tRNA molecules dock at successive codons, connecting successive amino acids into a growing chain” in a repeating mannernature.com.  When the ribosome reaches a stop codon, release factors terminate the loop and the protein is released.  Iteration: for codon = 1 to N (length of mRNA), load tRNA, form peptide bond, translocate, repeatnature.com.


Telomere Extension (Telomerase):  At chromosome ends, telomerase (a ribonucleoprotein reverse transcriptase) adds telomeric repeats in a discrete loop.  The enzyme binds the G-rich 3′ overhang and uses its intrinsic RNA template (e.g. “CCCAAUU…” in humans) to synthesize one repeat (e.g. “TTAGGG”) on the DNA. Then it repositions (translocates) to copy the template again. Telomerase thus repeats the cycle of “align RNA template → polymerize one repeat → slide and repeat” multiple times.  This is inherently iterative and bounded: the enzyme adds a defined sequence repeat each round, often adding on the order of a few to a few dozen repeats before dissociating.  In essence, for each repeat: RNA and DNA anneal, reverse transcriptase activity adds nucleotides complementary to the RNA, then the system loops. (Studies note telomerase “synthesizes telomeres … by repeated reverse transcription from a short RNA template”pubmed.ncbi.nlm.nih.gov.)  Components are the telomerase reverse transcriptase (TERT) and its RNA subunit.


  • Loop: Add one TTAGGG repeat per cycle, then reposition and repeat; bounded by desired telomere length.
     
  • Components: Telomerase (TERT enzyme) and RNA template.
     
  • Example: Yeast telomerase can add dozens of bases per binding event, each repeat a fixed unitpubmed.ncbi.nlm.nih.gov.
     

Molecular Machine Rotation (F₁-ATPase): The F₁ portion of ATP synthase is a rotary enzyme with three catalytic sites that produce ATP in discrete steps. Its γ-subunit turns 120° per step, and exactly three such steps (a full 360° rotation) convert 3 ADP+Pi to 3 ATP.  In other words, during each rotation the motor runs a loop of three iterations: each 120° step yields one ATPnature.com. The structural asymmetry of the three β-subunits enforces this triple cycle (three sites each undergo the binding-change mechanism once per rotation). Thus, for rotation = 1 to 3: rotate 120°, catalyze ATP formation, then repeat (three times per full cycle)nature.com.


Cell-Cycle Phases (Ordered Division Events):  Eukaryotic cells progress through a fixed, ordered series of stages each cycle.  Interphase consists of G₁ (growth), S (DNA synthesis), and G₂ phases, followed by the mitotic (M) phase. This sequence is strictly ordered every divisionbio.libretexts.org. One can view this as a loop of four steps per cycle: G₁→S→G₂→M, then repeat for the next generation. Cyclin/CDK regulatory proteins ensure each phase completes before the next begins. Although the cell cycle repeats indefinitely in dividing cells, each iteration of the cycle contains exactly one round of DNA replication and one mitosis, analogous to a bounded loop of fixed stepsbio.libretexts.org.


In each of these natural examples, a biochemical process performs a defined sequence of steps a set number of times (e.g. once per nucleotide, once per codon, three times per ATP rotation, etc.), closely mirroring the control flow of a “for i = 1 to N” loop. The “loop index” is supplied by the length of a nucleic acid template or the number of catalytic sites, and termination occurs when that count is reached (end of gene, stop codon, full rotation, etc.).


Sources: Standard molecular biology texts and reviews describe these iterative 

mechanismsnature.combio.libretexts.orgnature.combio.libretexts.orgpubmed.ncbi.nlm.nih.govnature.combio.libretexts.org.  Each citation details how the corresponding enzyme (polymerase, ribosome, telomerase, ATPase, etc.) carries out its task via repeated, countable steps.


clusters differing only in last bond rotation: 0.004,0,0.004,2,1,0,2,1,0,2,3,0,1,2,0,2,1,0,3,2,0,1,0.004,1,1,x where x= o,1,2,...18

    0.004,0,0.004,0.004,0,0.004,0,0,0,3,1,0,1,3,0,3,5,0,3,5,0,5,3,0,5,3,0,1,3,0,1,0.004,1,0,N (N=0,1,2,...18)

      Video

      Suffix Code

      4,4

      0.004,0,0.004,3,4,0,3,2,0,3,4,0,3,2,0,4,3,0,2,0.004,1,1,(0-18)

      Copyright © 2025 Principiabiomathematica - All Rights Reserved.

      Powered by

      This website uses cookies.

      We use cookies to analyze website traffic and optimize your website experience. By accepting our use of cookies, your data will be aggregated with all other user data.

      Accept