Methods of successive approximation, often referred to as iterative methods, are techniques used to solve mathematical problems, particularly equations or systems of equations, where direct solutions may be complex or infeasible. The idea is to make an initial guess of the solution and then refine that guess through a sequence of approximations until a desired level of accuracy is achieved. ### General Approach: 1. **Initial Guess**: Start with an initial approximation of the solution.
The Shortest Common Supersequence (SCS) of two sequences is the smallest sequence that contains both of the original sequences as subsequences. In other words, it's a sequence that can be derived from either of the original sequences by deleting zero or more elements, without rearranging the order of the remaining elements.
WPGMA stands for "Weighted Pair Group Method with Arithmetic Mean." It is a hierarchical clustering method used in bioinformatics, ecology, and other fields to group a set of objects into clusters based on their similarity or distance. The WPGMA algorithm creates a tree-like structure known as a dendrogram that helps visualize the relationships among the objects.
Zeller's congruence is a mathematical algorithm used to calculate the day of the week for any given date. It was developed by Christian Zeller in the 19th century and is particularly useful because it provides a systematic way to determine the day without relying on a calendar. The formula for Zeller's congruence involves the following variables: - \( h \): the day of the week (0 = Saturday, 1 = Sunday, 2 = Monday, ...
A hash function is a mathematical algorithm that transforms an input (or 'message') into a fixed-size string of bytes. The output is typically a 'digest' that uniquely represents the input data, but even a small change in input will produce a significantly different output. Hash functions are widely used in various applications, including data integrity verification, digital signatures, password storage, and more. Here’s a list of well-known hash functions, categorized by their families: ### Cryptographic Hash Functions 1.
The Steinhaus–Johnson–Trotter algorithm is a combinatorial algorithm used to generate all permutations of a finite set in a specific order. This algorithm produces permutations in a way that each permutation differs from the previous one by the interchange of two adjacent elements, following a particular pattern. ### Key Features of the Algorithm: 1. **Directionality**: Each element in the permutation has an associated direction (typically right or left). Initially, all elements can be thought of pointing to the left.
Jury selection is the process by which jurors are chosen to serve on a jury for a specific trial. This process is crucial in the legal system as it aims to ensure that the jury is fair and impartial, reflecting a cross-section of the community while maintaining the rights of both the defendant and the prosecution.
Lipinski's Rule of Five is a set of guidelines designed to predict the oral bioavailability of a compound, particularly in the context of drug development. Formulated by Christopher A. Lipinski in 1997, these rules help assess whether a small molecule is likely to have favorable pharmacokinetics in humans (i.e., absorption, distribution, metabolism, and excretion or ADME properties).
Matched Molecular Pair Analysis (MMPA) is a chemoinformatics technique used primarily in drug discovery and medicinal chemistry to study the effects of small structural changes on the biological activity of compounds. The method involves comparing pairs of molecules (matched pairs) that differ by a specific, small modification—such as the addition, removal, or alteration of a single atom or functional group.
The term "topological index" can refer to various concepts in different fields of mathematics and related disciplines, but it is most commonly associated with graph theory and chemistry. ### In Graph Theory: A topological index is a numeric value that represents some property of a graph, often related to its structure. Topological indices are used to index chemical compounds and predict their chemical properties, biological activities, and other characteristics.
Controllability is a concept primarily used in control theory and systems engineering, referring to the ability to steer a dynamic system's state to a desired condition within a finite time frame using appropriate control inputs. Essentially, a system is considered controllable if it is possible to move it from any initial state to any final state by applying suitable inputs or controls.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact