<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=112.207.1.119</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=112.207.1.119"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/112.207.1.119"/>
	<updated>2026-05-02T21:47:58Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Kite_(geometry)&amp;diff=2095</id>
		<title>Kite (geometry)</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Kite_(geometry)&amp;diff=2095"/>
		<updated>2014-02-02T10:28:09Z</updated>

		<summary type="html">&lt;p&gt;112.207.1.119: /* Area */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[physics]], the &#039;&#039;&#039;reduced mass&#039;&#039;&#039; is the &amp;quot;effective&amp;quot; [[inertial mass]] appearing in the [[two-body problem]] of [[Newtonian mechanics]].  It is a quantity which allows the two-body problem to be solved as if it were a [[one-body problem]]. Note, however, that the mass determining the [[gravitational force]] is &#039;&#039;not&#039;&#039; reduced. In the computation one mass &#039;&#039;can&#039;&#039; be replaced by the reduced mass, if this is compensated by replacing the other mass by the sum of both masses. The reduced mass is frequently denoted by &amp;lt;math&amp;gt;\scriptstyle \mu &amp;lt;/math&amp;gt; ([[Greek alphabet|Greek]] lower case [[Mu (letter)|mu]]), although the [[standard gravitational parameter]] is also denoted by &amp;lt;math&amp;gt;\scriptstyle \mu &amp;lt;/math&amp;gt; (and so are [[Mu (letter)#Physics and engineering|a number of other physical quantities]] as well). It has the [[dimensional analysis|dimensions]] of mass, and [[SI unit]] kg.&lt;br /&gt;
&lt;br /&gt;
==Equation==&lt;br /&gt;
&lt;br /&gt;
Given two bodies, one with mass &#039;&#039;m&#039;&#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt; and the other with mass &#039;&#039;m&#039;&#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;, the equivalent one-body problem, with the position of one body with respect to the other as the unknown, is that of a single body of mass &amp;lt;ref&amp;gt;Encyclopaedia of Physics (2nd Edition), R.G. Lerner, G.L. Trigg, VHC publishers, 1991, (Verlagsgesellschaft) 3-527-26954-1, (VHC Inc.) 0-89573-752-3&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Dynamics and Relativity, J.R. Forshaw, A.G. Smith, Wiley, 2009, ISBN 978-0-470-01460-8&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_\text{red} = \mu = \cfrac{1}{\cfrac{1}{m_1}+\cfrac{1}{m_2}} = \cfrac{m_1 m_2}{m_1 + m_2},\!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where the force on this mass is given by the force between the two bodies.&lt;br /&gt;
&lt;br /&gt;
===Properties===&lt;br /&gt;
&lt;br /&gt;
The reduced mass is always less than or equal to the mass of each body:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_\text{red} \leq m_1, \quad m_\text{red} \leq m_2 \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and has the reciprocal additive property:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{1}{m_\text{red}} = \frac{1}{m_1} + \frac{1}{m_2} \,\!&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
which by re-arrangement is equivalent to half of the [[harmonic mean]].&lt;br /&gt;
&lt;br /&gt;
==Derivation==&lt;br /&gt;
&lt;br /&gt;
The equation can be derived as follows.&lt;br /&gt;
&lt;br /&gt;
===Newtonian mechanics===&lt;br /&gt;
&lt;br /&gt;
{{main|Newtonian mechanics}}&lt;br /&gt;
&lt;br /&gt;
Using [[Newton&#039;s second law]], the force exerted by body 2 on body 1 is&lt;br /&gt;
:&amp;lt;math&amp;gt;\bold{F}_{12} = m_1 \bold{a}_1. \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The force exerted by body 1 on body 2 is&lt;br /&gt;
:&amp;lt;math&amp;gt;\bold{F}_{21} = m_2 \bold{a}_2. \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
According to [[Newton&#039;s third law]], the force that body 2 exerts on body 1 is equal and opposite to the force that body 1 exerts on body 2:&lt;br /&gt;
:&amp;lt;math&amp;gt;\bold{F}_{12} = - \bold{F}_{21}.\!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Therefore,&lt;br /&gt;
:&amp;lt;math&amp;gt;m_1 \bold{a}_1 = - m_2 \bold{a}_2. \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\bold{a}_2=-{m_1 \over m_2} \bold{a}_1. \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The relative acceleration &#039;&#039;&#039;a&#039;&#039;&#039;&amp;lt;sub&amp;gt;rel&amp;lt;/sub&amp;gt; between the two bodies is given by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\bold{a}_{\rm rel}= \bold{a}_1-\bold{a}_2 = \left(1+\frac{m_1}{m_2}\right) \bold{a}_1 = \frac{m_2+m_1}{m_1 m_2} m_1 \bold{a}_1 = \frac{\bold{F}_{12}}{m_{\rm red}}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
So we conclude that body 1 moves with respect to the position of body 2 as a body of mass equal to the reduced mass.&lt;br /&gt;
&lt;br /&gt;
===Lagrangian mechanics===&lt;br /&gt;
&lt;br /&gt;
{{main|Lagrangian mechanics}}&lt;br /&gt;
&lt;br /&gt;
Alternatively, a Lagrangian description of the two-body problem gives a [[Lagrangian]] of&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;L = {1 \over 2} m_1 \mathbf{\dot{r}}_1^2 + {1 \over 2} m_2 \mathbf{\dot{r}}_2^2 - V(| \mathbf{r}_1 - \mathbf{r}_2 | ) \!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &#039;&#039;&#039;r&#039;&#039;&#039; is the position vector of mass &#039;&#039;m&amp;lt;sub&amp;gt;i&amp;lt;/sub&amp;gt;&#039;&#039; (of particle &#039;&#039;&amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt;&#039;&#039;). The potential energy &#039;&#039;V&#039;&#039; is a function as it is only dependent on the absolute distance between the particles. If we define &lt;br /&gt;
:&amp;lt;math&amp;gt;\mathbf{r} = \mathbf{r}_1 - \mathbf{r}_2 &amp;lt;/math&amp;gt;&lt;br /&gt;
and let the centre of mass coincide with our origin in this reference frame, i.e. &lt;br /&gt;
:&amp;lt;math&amp;gt; m_1 \mathbf{r}_1 + m_2 \mathbf{r}_2 = 0 &amp;lt;/math&amp;gt;,&lt;br /&gt;
then&lt;br /&gt;
:&amp;lt;math&amp;gt; \mathbf{r}_1 = \frac{m_2 \mathbf{r}}{m_1 + m_2} , \mathbf{r}_2 = \frac{-m_1 \mathbf{r}}{m_1 + m_2}.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Then substituting above gives a new Lagrangian&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; L = {1 \over 2}m_\text{red} \mathbf{\dot{r}}^2 - V(r), &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_\text{red} = \frac{m_1 m_2}{m_1 + m_2} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is the reduced mass. Thus we have reduced the two-body problem to that of one body.&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
&lt;br /&gt;
Reduced mass occurs in a multitude of two-body problems, where classical mechanics is applicable.&lt;br /&gt;
&lt;br /&gt;
===Collisions of particles===&lt;br /&gt;
&lt;br /&gt;
In a collision with a [[coefficient of restitution]] &#039;&#039;e&#039;&#039;, the change in kinetic energy can be written as &lt;br /&gt;
:&amp;lt;math&amp;gt;\Delta K = \frac{1}{2}\mu v^2_{\rm rel}(e^2-1)&amp;lt;/math&amp;gt;,&lt;br /&gt;
where v&amp;lt;sub&amp;gt;rel&amp;lt;/sub&amp;gt; is the relative velocity of the bodies before [[collision]].&lt;br /&gt;
&lt;br /&gt;
For typical applications in nuclear physics, where one particle&#039;s mass is much larger than the other the reduced mass can be approximated as the smaller mass of the system. The limit of the reduced mass formula as one mass goes to infinity is the smaller mass, thus this approximation is used to ease calculations, especially when the larger particles exact mass is not known.&lt;br /&gt;
&lt;br /&gt;
===Motions of masses in gravitational fields===&lt;br /&gt;
&lt;br /&gt;
In the case of the gravitational potential energy &lt;br /&gt;
:&amp;lt;math&amp;gt;V(| \mathbf{r}_1 - \mathbf{r}_2 | ) = - \frac{G m_1 m_2}{| \mathbf{r}_1 - \mathbf{r}_2 |} \, ,&amp;lt;/math&amp;gt;&lt;br /&gt;
we find that the position of the first body with respect to the second is governed by the same differential equation as the position of a body with the reduced mass orbiting a body with a mass equal to the sum of the two masses, because &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_1 m_2 = (m_1+m_2) m_\text{red}\!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Non-relativistic quantum mechanics===&lt;br /&gt;
&lt;br /&gt;
Consider the [[electron]] (mass &#039;&#039;m&amp;lt;sub&amp;gt;e&amp;lt;/sub&amp;gt;&#039;&#039;) and [[proton]] (mass &#039;&#039;m&amp;lt;sub&amp;gt;p&amp;lt;/sub&amp;gt;&#039;&#039;) in the [[hydrogen atom]].&amp;lt;ref&amp;gt;Molecular Quantum Mechanics Parts I and II: An Introduction to QUANTUM CHEMISRTY (Volume 1), P.W. Atkins, Oxford University Press, 1977, ISBN 0-19-855129-0&amp;lt;/ref&amp;gt; They orbit each other about a common centre of mass, a two body problem. To analyze the motion of the electron, a one-body problem, the reduced mass replaces the electron mass&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_e \rightarrow \frac{m_em_p}{m_e+m_p} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and the proton mass becomes the sum of the two masses&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;m_p \rightarrow m_e + m_p &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This idea is used to set up the [[Schrödinger equation]] for the hydrogen atom.&lt;br /&gt;
&lt;br /&gt;
===Other uses===&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Reduced mass&amp;quot; may also refer more generally to an [[algebra]]ic term of the form {{Citation needed|date=December 2011}}&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;x_\text{red} =  {1 \over {1 \over x_1} + {1 \over x_2}} = {x_1 x_2 \over x_1 + x_2}\!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
that simplifies an equation of the form&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\ {1\over x_\text{eq}} = \sum_{i=1}^n {1\over x_i} = {1\over x_1} + {1\over x_2} + \cdots+ {1\over x_n}.\!\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The reduced mass is typically used as a relationship between two system elements in parallel, such as [[resistors]]; whether these be in the electrical, thermal, hydraulic, or mechanical domains.  This relationship is determined by the physical properties of the elements as well as the [[continuity equation]] linking them.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
*[[Center-of-momentum frame]]&lt;br /&gt;
*[[Momentum conservation]]&lt;br /&gt;
*[[Defining equation (physics)]]&lt;br /&gt;
*[[Harmonic oscillator]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*[http://hyperphysics.phy-astr.gsu.edu/hbase/orbv.html#rm &#039;&#039;Reduced Mass&#039;&#039; on HyperPhysics]&lt;br /&gt;
&lt;br /&gt;
[[Category:Mechanics]]&lt;br /&gt;
[[Category:Mass]]&lt;/div&gt;</summary>
		<author><name>112.207.1.119</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Equilateral_triangle&amp;diff=2629</id>
		<title>Equilateral triangle</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Equilateral_triangle&amp;diff=2629"/>
		<updated>2014-02-02T09:35:58Z</updated>

		<summary type="html">&lt;p&gt;112.207.1.119: /* Using trigonometry */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{About|the number||9 (disambiguation)}}&lt;br /&gt;
{{Infobox number&lt;br /&gt;
| number = 9&lt;br /&gt;
| numeral = [[nonary]]&lt;br /&gt;
| divisors = 1, 3, 9&lt;br /&gt;
| unicode = Ⅸ, ⅸ&lt;br /&gt;
| greek prefix  = [[Wiktionary:ennea-|ennea-]]&lt;br /&gt;
| latin prefix  = [[Wiktionary:nona-|nona-]]&lt;br /&gt;
&lt;br /&gt;
| lang1 = [[Amharic language|Amharic]] &lt;br /&gt;
| lang1 symbol = &amp;lt;span style=&amp;quot;font-size:100%;&amp;quot;&amp;gt;፱&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang2 = [[Arabic language|Arabicl]]&lt;br /&gt;
| lang2 symbol = &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;٩&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang3 = [[Urdu]]&lt;br /&gt;
| lang3 symbol = {{Urdu numeral|9|20}}&lt;br /&gt;
| lang4 = [[Armenian numerals|Armenian numeral]]&lt;br /&gt;
| lang4 symbol =  &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;Թ&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang5 = [[Bengali language|Bengali]]&lt;br /&gt;
| lang5 symbol =  &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;৯&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang6 = [[Chinese numerals|Chinese/Japanese&amp;lt;br /&amp;gt;/Korean numeral]]&lt;br /&gt;
| lang6 symbol = 九 (jiu) &amp;lt;br /&amp;gt; 玖 (formal writing)&lt;br /&gt;
| lang7 = [[Devanāgarī]]&lt;br /&gt;
| lang7 symbol =  &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;९&amp;lt;/span&amp;gt; (nau)&lt;br /&gt;
| lang8 = [[Greek numerals|Greek numeral]]&lt;br /&gt;
| lang8 symbol = θ´&lt;br /&gt;
| lang9 = [[Hebrew numerals|Hebrew numeral]]&lt;br /&gt;
| lang9 symbol = &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;ט&amp;lt;/span&amp;gt; (Tet)&lt;br /&gt;
| lang10 = [[Tamil numerals]]&lt;br /&gt;
| lang10 symbol =  &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;௯&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang11 = [[Khmer numerals|Khmer]]&lt;br /&gt;
| lang11 symbol =  ៩&lt;br /&gt;
| lang12 = [[Telugu language|Telugu numeral]]&lt;br /&gt;
| lang12 symbol =  &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;౯&amp;lt;/span&amp;gt;&lt;br /&gt;
| lang13 = [[Thai numerals|Thai numeral]]&lt;br /&gt;
| lang13 symbol = &amp;lt;span style=&amp;quot;font-size:150%;&amp;quot;&amp;gt;๙&amp;lt;/span&amp;gt;&lt;br /&gt;
}}&lt;br /&gt;
{{Wiktionary|nine}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;9&#039;&#039;&#039; (&#039;&#039;&#039;nine&#039;&#039;&#039; {{IPAc-en|&#039;|n|ai|n}}) is the [[natural number]] following [[8 (number)|8]] and preceding [[10 (number)|10]].&lt;br /&gt;
&lt;br /&gt;
==Alphabets and codes==&lt;br /&gt;
*In the [[NATO phonetic alphabet]], the digit 9 is called &amp;quot;Niner&amp;quot;.&lt;br /&gt;
*Five-digit [[produce]] [[Price Look-Up code|PLU codes]] that begin with 9 are [[Organic food|organic]].&lt;br /&gt;
&lt;br /&gt;
==Commerce==&lt;br /&gt;
*Common terminal digit in [[psychological pricing]]&lt;br /&gt;
===Companies===&lt;br /&gt;
*[[9Lives|Nine Lives]] cat food; its name is derived from the legend that a cat has nine lives&lt;br /&gt;
*[[Nine Network]] a.k.a. Channel 9, an Australian free-to-air television station&lt;br /&gt;
*[[Nine West]], a clothing brand &amp;lt;ref&amp;gt;&#039;&#039;Nine West&#039;&#039; http://www.ninewest.com/&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Culture and mythology==&lt;br /&gt;
===Chinese culture===&lt;br /&gt;
*Nine (九 [[pinyin]] jiǔ) is considered a good [[Numbers in Chinese culture|number in Chinese culture]] because it sounds the same as the word &amp;quot;longlasting&amp;quot; ([[久]] [[pinyin]] jiǔ){{Citation needed|date=April 2008}}.&lt;br /&gt;
&lt;br /&gt;
*Nine is strongly associated with the [[Chinese dragon]], a symbol of magic and power. There are nine forms of the dragon, it is described in terms of nine attributes, and it has nine children.  It has 117 scales - 81 [[yin and yang|yang]] (masculine, heavenly) and 36  [[yin and yang|yin]] (feminine, earthly). All three numbers are multiples of 9 (9×13=117, 9×9=81, 9×4=36)&amp;lt;ref&amp;gt;{{cite book|title=Myths of China And Japan|author=Donald Alexander Mackenzie|url=http://books.google.com/books?id=vzbeLy4TBa4C&amp;amp;pg=PA46&amp;amp;dq=chinese+dragon+scales+yin+36|publisher=Kessinger|year=2005|isbn=1-4179-6429-4}}&amp;lt;/ref&amp;gt; as well as having the same [[digital root]] of 9.&lt;br /&gt;
&lt;br /&gt;
*The dragon often symbolizes the [[Emperor of China|Emperor]], and the number nine can be found in many ornaments in the [[Forbidden City]].&lt;br /&gt;
&lt;br /&gt;
*The circular altar platform (&#039;&#039;Earthly Mount&#039;&#039;) of the [[Temple of Heaven]] has one circular marble plate in the center, surrounded by a ring of nine plates, then by a ring of 18 plates, and so on, for a total of nine rings, with the outermost having 81=9&amp;amp;times;9 plates.&lt;br /&gt;
&lt;br /&gt;
*The name of the area called &#039;&#039;[[Kowloon]]&#039;&#039; in [[Hong Kong]] literally means: &#039;&#039;nine [[Chinese dragon|dragons]]&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
*The [[nine-rank system]] was a civil service nomination system used during certain Chinese dynasties.&lt;br /&gt;
&lt;br /&gt;
===Ancient Egypt===&lt;br /&gt;
*The [[nine bows]] is a term used in Ancient Egypt to represent the traditional enemies of Egypt&lt;br /&gt;
&lt;br /&gt;
===European culture===&lt;br /&gt;
*The [[Nine Worthies]] are nine historical, or semi-legendary figures who, in the Middle Ages, were believed to personify the ideals of chivalry&lt;br /&gt;
&lt;br /&gt;
===Greek Mythology===&lt;br /&gt;
* The nine [[muses]] in Greek mythology are [[Calliope]] (epic poetry), [[Clio]] (history), [[Erato]] (erotic poetry), [[Euterpe]] (lyric poetry), [[Melpomene]] (tragedy), [[Polyhymnia]] (song), [[Terpsichore]] (dance), [[Thalia (muse)|Thalia]] (comedy), and [[Urania]] (astronomy).&lt;br /&gt;
* It takes nine days (for an anvil) to fall from heaven to earth, and nine more to fall from earth to [[Tartarus]]--a place of torment in the [[Greek_underworld|underworld]].&lt;br /&gt;
&lt;br /&gt;
===Japanese culture===&lt;br /&gt;
*The Japanese consider nine to be unlucky because in Japanese the word for nine sounds similar to the word for &amp;quot;pain&amp;quot; or &amp;quot;distress&amp;quot; ({{linktext|苦}}, &#039;&#039;kyū&#039;&#039;){{Citation needed|date=April 2008}}.&lt;br /&gt;
&lt;br /&gt;
== Evolution of the glyph ==&lt;br /&gt;
{{See also|Hindu-Arabic numeral system}}&lt;br /&gt;
According to Georges Ifrah, the origin of the 9 integers can be attributed to the ancient Indian civilization, and was adopted by subsequent civilizations in conjunction with the [[0 (number)|0]].&amp;lt;ref&amp;gt;{{cite book|title=From One to Zero: A Universal History of Numbers|year=1985|author=Georges Ifrah|publisher=Viking|isbn=0-670-37395-8}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[File:Evo9glyph.svg|x50px|right]]&lt;br /&gt;
In the beginning, various Indians wrote 9 similar to the modern closing question mark without the bottom dot. The Kshatrapa, Andhra and Gupta started curving the bottom vertical line coming up with a [[3 (number)|3]]-look-alike. The Nagari continued the bottom stroke to make a circle and enclose the 3-look-alike, in much the same way that the &#039;&#039;@&#039;&#039; character encircles a lowercase &#039;&#039;a&#039;&#039;. As time went on, the enclosing circle became bigger and its line continued beyond the circle downwards, as the 3-look-alike became smaller. Soon, all that was left of the 3-look-alike was a squiggle. The Arabs simply connected that squiggle to the downward stroke at the middle and subsequent European change was purely cosmetic.&lt;br /&gt;
&lt;br /&gt;
While the shape of the 9 character has an [[Ascender (typography)|ascender]] in most modern [[typeface]]s, in typefaces with [[text figures]] the character usually has a [[descender]], as, for example, in [[File:TextFigs196.png]].&lt;br /&gt;
&lt;br /&gt;
This numeral resembles an inverted &#039;&#039;6&#039;&#039;. To disambiguate the two on objects and documents that can be inverted, the 9 is often underlined, as is done for the 6. Another distinction from the 6 is that it is often handwritten with a straight stem.&lt;br /&gt;
&lt;br /&gt;
==Idioms and popular phrases==&lt;br /&gt;
*&amp;quot;A [[cat-o&#039;-nine-tails]] suggests perfect punishment and atonement.&amp;quot; --[[Robert Ripley]].&lt;br /&gt;
&amp;quot;A stitch in time saves Nine&amp;quot;&lt;br /&gt;
*The word &amp;quot;K-9&amp;quot; pronounces the same as &#039;&#039;canine&#039;&#039; and is used in many [[United States|U.S.]] police departments to denote the [[police dog]] unit. Despite not sounding like the translation of the word &#039;&#039;canine&#039;&#039; in other languages, many police and military units around the world use the same designation.&lt;br /&gt;
*Someone dressed &amp;quot;to the nines&amp;quot; is dressed up as much as they can be.&lt;br /&gt;
*In [[urban culture]], &amp;quot;nine&amp;quot; is a [[slang]] word for a [[9mm]] [[pistol]] or [[homicide]], the latter from the Illinois Criminal Code for homicide.&lt;br /&gt;
&lt;br /&gt;
==Internet==&lt;br /&gt;
*&#039;&#039;[[The 9 on Yahoo!]]&#039;&#039;, hosted by [[Maria Sansone]], was a daily video compilation show, or vlog, on Yahoo! featuring the nine top &amp;quot;web finds&amp;quot; of the day.&lt;br /&gt;
*[[Cirno]] from Touhou Project is represented by ⑨&lt;br /&gt;
&lt;br /&gt;
==Literature==&lt;br /&gt;
*There are [[Divine Comedy#The Circles of Hell|nine circles of Hell]] in Dante&#039;s &#039;&#039;[[Divine Comedy]]&#039;&#039;.&lt;br /&gt;
*The [[Nine Bright Shiners]], characters in Garth Nix&#039;s [[Old Kingdom trilogy]]. &#039;&#039;The Nine Bright Shiners&#039;&#039; was a 1930s book of poems by Anne Ridler&amp;lt;ref&amp;gt;{{cite book|title=Women&#039;s Poetry of the 1930s: A Critical Anthology|author=Jane Dowson|year=1996|publisher=Routledge|isbn=0-415-13095-6|url=http://books.google.com/books?id=fVTQPI3ZIHcC&amp;amp;pg=RA1-PA103&amp;amp;dq=nine-bright-shiners+ridler&amp;amp;ie=ISO-8859-1#PRA1-PA103,M1}}&amp;lt;/ref&amp;gt; and a 1988 fiction book by Anthea Fraser;&amp;lt;ref&amp;gt;{{cite book|title=The Nine Bright Shiners|author=Anthea Fraser|publisher=Doubleday|year=1988|isbn=0-385-24323-5|url=}}&amp;lt;/ref&amp;gt; the name derives from &amp;quot;a very curious old semi-pagan, semi-Christian&amp;quot; song.&amp;lt;ref&amp;gt;{{cite book|title=Recollections of an Eton Colleger, 1898-1902|author=Charles Herbert Malden|publisher=Spottiswoode|year=1905|url=http://books.google.com/books?id=EKB9T4pPcfkC&amp;amp;pg=PA182&amp;amp;dq=nine-bright-shiners#PPA180,M1}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
*&#039;&#039;[[The Nine Tailors]]&#039;&#039; is a 1934 [[mystery novel]] by [[United Kingdom|British]] writer [[Dorothy L. Sayers]], her ninth featuring sleuth [[Lord Peter Wimsey]]&lt;br /&gt;
*[[Nine Unknown Men]] are, in occult legend, the custodians of the sciences of the world since ancient times&lt;br /&gt;
*In [[J.R.R. Tolkien&#039;s]] [[Middle-earth]], there are nine rings of power given to men, and consequently, nine [[Nazgul|ringwraiths]]&lt;br /&gt;
**Additionally, &#039;&#039;[[The Fellowship of the Ring]]&#039;&#039; consists of nine companions, representing the free races and also as a positive mirror of the nine ringwraiths&lt;br /&gt;
&lt;br /&gt;
==Mathematics==&lt;br /&gt;
Nine is a [[composite number]], its proper [[divisor]]s being [[1 (number)|1]] and  [[3 (number)|3]]. It is 3 times 3 and hence the third [[square number]]. Nine is a [[Motzkin number]]. It is the first composite [[lucky number]], along with the first composite odd number.&lt;br /&gt;
&lt;br /&gt;
Nine is the highest single-digit number in the [[decimal|decimal system]].  It is the second non-unitary square [[prime number|prime]] of the form (p&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;) and the first that is odd. All subsequent squares of this form are odd. It has a unique [[aliquot sum]] [[4 (number)|4]] which is itself a square prime. Nine is; and can be, the only square prime with an aliquot sum of the same form. The [[aliquot sequence]] of nine has 5 members (9,4,3,1,0) this number being the second composite member of the 3-aliquot tree. It is the aliquot sum of only one number the discrete semiprime [[15]].&lt;br /&gt;
&lt;br /&gt;
There are nine [[Heegner number]]s.&amp;lt;ref&amp;gt;Bryan Bunch, &#039;&#039;The Kingdom of Infinite Number&#039;&#039;. New York: W. H. Freeman &amp;amp; Company (2000): 93&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Since 9&amp;amp;nbsp;=&amp;amp;nbsp;3&amp;lt;sup&amp;gt;2&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;&amp;lt;/sup&amp;gt;, 9 is an [[exponential factorial]].&lt;br /&gt;
&lt;br /&gt;
8 and 9 form a [[Ruth-Aaron pair]] under the second definition that counts repeated prime factors as often as they occur.&lt;br /&gt;
&lt;br /&gt;
In bases 12, 18 and 24, nine is a 1-[[automorphic number]] and in base 6 a 2-automorphic number (displayed as &#039;13&#039;).&lt;br /&gt;
&lt;br /&gt;
A [[polygon]] with nine sides is called a [[nonagon]] or enneagon.&amp;lt;ref&amp;gt;Robert Dixon, &#039;&#039;Mathographics&#039;&#039;. New York: Courier Dover Publications: 24&amp;lt;/ref&amp;gt; A group of nine of anything is called an ennead.&lt;br /&gt;
&lt;br /&gt;
In [[decimal|base 10]] a positive number is divisible by nine [[if and only if]] its [[digital root]] is 9.&amp;lt;ref&amp;gt;[[Martin Gardner]], &#039;&#039;A Gardner&#039;s Workout: Training the Mind and Entertaining the Spirit&#039;&#039;. New York: A. K. Peters (2001): 155&amp;lt;/ref&amp;gt; That is, if you multiply nine by any [[natural number]], and repeatedly add the digits of the answer until it is just one digit, you will end up with nine:&lt;br /&gt;
&lt;br /&gt;
* 2 × 9 = 18 (1 + 8 = 9)&lt;br /&gt;
* 3 × 9 = 27 (2 + 7 = 9)&lt;br /&gt;
* 9 × 9 = 81 (8 + 1 = 9)&lt;br /&gt;
* 121 × 9 = 1089 (1 + 0 + 8 + 9 = 18; 1 + 8 = 9)&lt;br /&gt;
* 234 × 9 = 2106 (2 + 1 + 0 + 6 = 9)&lt;br /&gt;
* 578329 × 9 = 5204961 (5 + 2 + 0 + 4 + 9 + 6 + 1 = 27; 2 + 7 = 9)&lt;br /&gt;
* 482729235601 × 9 = 4344563120409 (4 + 3 + 4 + 4 + 5 + 6 + 3 + 1 + 2 + 0 + 4 + 0 + 9 = 45; 4 + 5 = 9)&lt;br /&gt;
There are other interesting patterns involving multiples of nine:&lt;br /&gt;
* 12345679 x 9 = 111111111&lt;br /&gt;
* 12345679 x 18 = 222222222&lt;br /&gt;
* 12345679 x 81 = 999999999&lt;br /&gt;
This works for all the multiples of 9.&lt;br /&gt;
&#039;&#039;n&#039;&#039;&amp;amp;nbsp;=&amp;amp;nbsp;[[3 (number)|3]] is the only other &#039;&#039;n&#039;&#039; &amp;gt; 1 such that a number is divisible by &#039;&#039;n&#039;&#039; if and only if its digital root is &#039;&#039;n&#039;&#039;. In [[positional notation|base N]], the [[divisor]]s of N&amp;amp;nbsp;−&amp;amp;nbsp;1 have this property. Another consequence of 9 being 10&amp;amp;nbsp;−&amp;amp;nbsp;1, is that it is also a [[Kaprekar number]].&lt;br /&gt;
&lt;br /&gt;
The difference between a base-10 positive integer and the sum of its digits is a whole multiple of nine. Examples:&lt;br /&gt;
* The sum of the digits of 41 is 5, and 41-5 = 36. The digital root of 36 is 3+6 = 9, which, as explained above, demonstrates that it is divisible by nine.&lt;br /&gt;
* The sum of the digits of 35967930 is 3+5+9+6+7+9+3+0 = 42, and 35967930-42 = 35967888. The digital root of 35967888 is 3+5+9+6+7+8+8+8 = 54, 5+4 = 9.&lt;br /&gt;
&lt;br /&gt;
Subtracting two base-10 positive integers that are transpositions of each other yields a number that is a whole multiple of nine. Examples:&lt;br /&gt;
* 41 - 14 = 27 (2 + 7 = 9)&lt;br /&gt;
* 36957930 - 35967930 = 990000, a multiple of nine.&lt;br /&gt;
This works regardless of the number of digits that are transposed. For example, the largest transposition of 35967930 is 99765330 (all digits in descending order) and its smallest transposition is 03356799 (all digits in ascending order); subtracting pairs of these numbers produces:&lt;br /&gt;
* 99765330 - 35967930 = 63797400; 6+3+7+9+7+4+0+0 = 36; 3+6 = 9.&lt;br /&gt;
* 99765330 - 03356799 = 96408531; 9+6+4+0+8+5+3+1 = 36; 3+6 = 9.&lt;br /&gt;
* 35967930 - 03356799 = 32611131; 3+2+6+1+1+1+3+1 = 18; 1+8 = 9.&lt;br /&gt;
&lt;br /&gt;
[[Casting out nines]] is a quick way of testing the calculations of sums, differences, products, and quotients of integers, known as long ago as the 12th Century.&amp;lt;ref&amp;gt;[[Cajori, Florian]] (1991, 5e) &#039;&#039;A History of Mathematics&#039;&#039;, AMS. ISBN 0-8218-2102-4. p.91&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Every prime in a [[Cunningham chain]] of the first kind with a length of 4 or greater is congruent to 9 mod 10 (the only exception being the chain 2, 5, 11, 23, 47).&lt;br /&gt;
&lt;br /&gt;
Six recurring nines appear in the decimal places 762 through 767 of [[pi]]. This is known as the [[Feynman point]].&lt;br /&gt;
&lt;br /&gt;
If an odd [[perfect number]] is of the form 36&#039;&#039;k&#039;&#039; + 9, it has at least nine distinct prime factors.&amp;lt;ref&amp;gt;Eyob Delele Yirdaw, &amp;quot;[http://arxiv.org/abs/0804.0152v1 Proving Touchard&#039;s Theorem from Euler&#039;s Form]&amp;quot; ArXiv preprint.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you divide a number by the amount of 9s corresponding to its number of digits, the number is turned into a [[repeating decimal]]. (e.g. 274/999 = 0.274274274274...)&lt;br /&gt;
&lt;br /&gt;
Nine is the binary complement of number [[6 (number)|six]]:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
9 = 1001&lt;br /&gt;
6 = 0110&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===List of basic calculations===&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; background: white&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width:105px;&amp;quot;|[[Multiplication]]&lt;br /&gt;
!1&lt;br /&gt;
!2&lt;br /&gt;
!3&lt;br /&gt;
!4&lt;br /&gt;
!5&lt;br /&gt;
!6&lt;br /&gt;
!7&lt;br /&gt;
!8&lt;br /&gt;
!9&lt;br /&gt;
!10&lt;br /&gt;
! style=&amp;quot;width:5px;&amp;quot;|&lt;br /&gt;
!11&lt;br /&gt;
!12&lt;br /&gt;
!13&lt;br /&gt;
!14&lt;br /&gt;
!15&lt;br /&gt;
!16&lt;br /&gt;
!17&lt;br /&gt;
!18&lt;br /&gt;
!19&lt;br /&gt;
!20&lt;br /&gt;
! style=&amp;quot;width:5px;&amp;quot;|&lt;br /&gt;
!21&lt;br /&gt;
!22&lt;br /&gt;
!23&lt;br /&gt;
!24&lt;br /&gt;
!25&lt;br /&gt;
! style=&amp;quot;width:5px;&amp;quot;|&lt;br /&gt;
!50&lt;br /&gt;
!100&lt;br /&gt;
!1000&lt;br /&gt;
|-&lt;br /&gt;
|&amp;lt;math&amp;gt;9 \times x&amp;lt;/math&amp;gt;&lt;br /&gt;
|&#039;&#039;&#039;9&#039;&#039;&#039;&lt;br /&gt;
|[[18 (number)|18]]&lt;br /&gt;
|[[27 (number)|27]]&lt;br /&gt;
|[[36 (number)|36]]&lt;br /&gt;
|[[45 (number)|45]]&lt;br /&gt;
|[[54 (number)|54]]&lt;br /&gt;
|[[63 (number)|63]]&lt;br /&gt;
|[[72 (number)|72]]&lt;br /&gt;
|[[81 (number)|81]]&lt;br /&gt;
|[[90 (number)|90]]&lt;br /&gt;
!&lt;br /&gt;
|[[99 (number)|99]]&lt;br /&gt;
|[[108 (number)|108]]&lt;br /&gt;
|[[117 (number)|117]]&lt;br /&gt;
|[[126 (number)|126]]&lt;br /&gt;
|[[135 (number)|135]]&lt;br /&gt;
|[[144 (number)|144]]&lt;br /&gt;
|[[153 (number)|153]]&lt;br /&gt;
|[[162 (number)|162]]&lt;br /&gt;
|[[171 (number)|171]]&lt;br /&gt;
|[[180 (number)|180]]&lt;br /&gt;
!&lt;br /&gt;
|[[189 (number)|189]]&lt;br /&gt;
|[[198 (number)|198]]&lt;br /&gt;
|[[207 (number)|207]]&lt;br /&gt;
|[[216 (number)|216]]&lt;br /&gt;
|[[225 (number)|225]]&lt;br /&gt;
!&lt;br /&gt;
|450&lt;br /&gt;
|[[900 (number)|900]]&lt;br /&gt;
|[[9000 (number)|9000]]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; background: white&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width:105px;&amp;quot;|[[Division (mathematics)|Division]]&lt;br /&gt;
!1&lt;br /&gt;
!2&lt;br /&gt;
!3&lt;br /&gt;
!4&lt;br /&gt;
!5&lt;br /&gt;
!6&lt;br /&gt;
!7&lt;br /&gt;
!8&lt;br /&gt;
!9&lt;br /&gt;
!10&lt;br /&gt;
! style=&amp;quot;width:5px;&amp;quot;|&lt;br /&gt;
!11&lt;br /&gt;
!12&lt;br /&gt;
!13&lt;br /&gt;
!14&lt;br /&gt;
!15&lt;br /&gt;
|-&lt;br /&gt;
|&amp;lt;math&amp;gt;9 \div x&amp;lt;/math&amp;gt;&lt;br /&gt;
|&#039;&#039;&#039;9&#039;&#039;&#039;&lt;br /&gt;
|4.5&lt;br /&gt;
|3&lt;br /&gt;
|2.25&lt;br /&gt;
|1.8&lt;br /&gt;
|1.5&lt;br /&gt;
|1.{{overline|285714}}&lt;br /&gt;
|1.125&lt;br /&gt;
|1&lt;br /&gt;
|0.9&lt;br /&gt;
!&lt;br /&gt;
|0.{{overline|81}}&lt;br /&gt;
|0.75&lt;br /&gt;
|0.{{overline|692307}}&lt;br /&gt;
|0.6{{overline|428571}}&lt;br /&gt;
|0.6&lt;br /&gt;
|-&lt;br /&gt;
|&amp;lt;math&amp;gt;x \div 9&amp;lt;/math&amp;gt;&lt;br /&gt;
|0.{{overline|1}}&lt;br /&gt;
|0.{{overline|2}}&lt;br /&gt;
|0.{{overline|3}}&lt;br /&gt;
|0.{{overline|4}}&lt;br /&gt;
|0.{{overline|5}}&lt;br /&gt;
|0.{{overline|6}}&lt;br /&gt;
|0.{{overline|7}}&lt;br /&gt;
|0.{{overline|8}}&lt;br /&gt;
|1&lt;br /&gt;
|1.{{overline|1}}&lt;br /&gt;
!&lt;br /&gt;
|1.{{overline|2}}&lt;br /&gt;
|1.{{overline|3}}&lt;br /&gt;
|1.{{overline|4}}&lt;br /&gt;
|1.{{overline|5}}&lt;br /&gt;
|1.{{overline|6}}&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; background: white&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width:105px;&amp;quot;|[[Exponentiation]]&lt;br /&gt;
!1&lt;br /&gt;
!2&lt;br /&gt;
!3&lt;br /&gt;
!4&lt;br /&gt;
!5&lt;br /&gt;
!6&lt;br /&gt;
!7&lt;br /&gt;
!8&lt;br /&gt;
!9&lt;br /&gt;
!10&lt;br /&gt;
! style=&amp;quot;width:5px;&amp;quot;|&lt;br /&gt;
!11&lt;br /&gt;
!12&lt;br /&gt;
!13&lt;br /&gt;
|-&lt;br /&gt;
|&amp;lt;math&amp;gt;9 ^ x\,&amp;lt;/math&amp;gt;&lt;br /&gt;
|&#039;&#039;&#039;9&#039;&#039;&#039;&lt;br /&gt;
|81&lt;br /&gt;
|729&lt;br /&gt;
|6561&lt;br /&gt;
|59049&lt;br /&gt;
|531441&lt;br /&gt;
|4782969&lt;br /&gt;
|43046721&lt;br /&gt;
|387420489&lt;br /&gt;
|3486784401&lt;br /&gt;
!&lt;br /&gt;
|31381059609&lt;br /&gt;
|282429536481&lt;br /&gt;
|2541865828329&lt;br /&gt;
|-&lt;br /&gt;
|&amp;lt;math&amp;gt;x ^ 9\,&amp;lt;/math&amp;gt;&lt;br /&gt;
|1&lt;br /&gt;
|[[512 (number)|512]]&lt;br /&gt;
|19683&lt;br /&gt;
|262144&lt;br /&gt;
|1953125&lt;br /&gt;
|10077696&lt;br /&gt;
|40353607&lt;br /&gt;
|134217728&lt;br /&gt;
|387420489&lt;br /&gt;
|[[1000000000 (number)|1000000000]]&lt;br /&gt;
!&lt;br /&gt;
|2357947691&lt;br /&gt;
|5159780352&lt;br /&gt;
|10604499373&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot; style=&amp;quot;text-align: center; background: white&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; style=&amp;quot;width:105px;&amp;quot;|[[Radix]]&lt;br /&gt;
!1&lt;br /&gt;
!5&lt;br /&gt;
!10&lt;br /&gt;
!15&lt;br /&gt;
!20&lt;br /&gt;
!25&lt;br /&gt;
!30&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
!35&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
!40&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
!45&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
!50&lt;br /&gt;
!60&lt;br /&gt;
!70&lt;br /&gt;
!80&lt;br /&gt;
!90&lt;br /&gt;
!100&lt;br /&gt;
|-&lt;br /&gt;
!110&lt;br /&gt;
!120&lt;br /&gt;
!130&lt;br /&gt;
!140&lt;br /&gt;
!150&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
!160&lt;br /&gt;
!170&lt;br /&gt;
!180&lt;br /&gt;
!190&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
!200&lt;br /&gt;
!250&lt;br /&gt;
!500&lt;br /&gt;
!1000&lt;br /&gt;
!10000&lt;br /&gt;
!100000&lt;br /&gt;
!1000000&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|rowspan=&amp;quot;2&amp;quot;|&amp;lt;math&amp;gt;x_{9} \ &amp;lt;/math&amp;gt;&lt;br /&gt;
|1&lt;br /&gt;
|5&lt;br /&gt;
|11&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|16&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|22&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|27&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|33&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|44&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|55&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|66&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|77&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|88&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|110&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|121&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|132&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|143&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|154&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|165&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|176&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|242&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|307&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|615&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|1331&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|14641&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|162151&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|1783661&amp;lt;sub&amp;gt;9&amp;lt;/sub&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===Numeral systems===&lt;br /&gt;
{| class=wikitable&lt;br /&gt;
|-&lt;br /&gt;
! [[Radix|Base]] !! [[Numeral system]]&lt;br /&gt;
|-&lt;br /&gt;
| 2 || [[Binary numeral system|binary]] || 1001&lt;br /&gt;
|-&lt;br /&gt;
| 3 || [[Ternary numeral system|ternary]] || 100&lt;br /&gt;
|-&lt;br /&gt;
| 4 || [[quaternary numeral system|quaternary]] || 21&lt;br /&gt;
|-&lt;br /&gt;
| 5 || [[quinary]] || 14&lt;br /&gt;
|-&lt;br /&gt;
| 6 || [[senary]] || 13&lt;br /&gt;
|-&lt;br /&gt;
| 7 || [[septenary]] || 12&lt;br /&gt;
|-&lt;br /&gt;
| 8 || [[octal]] || 11&lt;br /&gt;
|-&lt;br /&gt;
| 9 || [[novenary]] || 10&lt;br /&gt;
|-&lt;br /&gt;
| colspan=2 | over 9 ([[decimal]], [[hexadecimal]]) || 9&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===Probability===&lt;br /&gt;
In [[probability]], the &#039;&#039;&#039;nine&#039;&#039;&#039; is a [[logarithmic measure]] of probability of an event, defined as the negative of the base-[[10 (number)|10]] [[logarithm]] of the probability of the event&#039;s [[Probability axioms|complement]].&lt;br /&gt;
For example, an event that is 99% likely to occur has an unlikelihood of 1% or 0.01, which amounts to −log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;&amp;amp;nbsp;0.01&amp;amp;nbsp;=&amp;amp;nbsp;2 nines of probability.&lt;br /&gt;
[[0 (number)|Zero]] probability gives zero nines (−log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;&amp;amp;nbsp;1&amp;amp;nbsp;=&amp;amp;nbsp;0).   A 100% probability is considered to be impossible in most circumstances: that results in [[infinite improbability]].  The effectivity of processes and the [[availability]] of [[systems]] can be expressed (as a rule of thumb, not explicitly) as a series of &amp;quot;nines&amp;quot;. For example, [[5 nines|&amp;quot;five nines&amp;quot; (99.999%)]] availability implies a total [[downtime]] of no more than five minutes per year - typically a very high degree of [[:wikt:reliability|reliability]]; but never 100%.&lt;br /&gt;
&lt;br /&gt;
==Organizations==&lt;br /&gt;
* Divine Nine—The [[National Pan-Hellenic Council]] (NPHC) is a collaborative organization of nine historically African American, international Greek lettered fraternities and sororities.&lt;br /&gt;
&lt;br /&gt;
==Places and thoroughfares==&lt;br /&gt;
*[[List of highways numbered 9]]&lt;br /&gt;
*[[Ninth Avenue (Manhattan)|Ninth Avenue]] is a major avenue in Manhattan.&lt;br /&gt;
* Outside the Norwegian coast, east of the Barents sea [http://www.imr.no/galleri/v/mareano/terrengmodeller_bhavet/ number 9], in a 260 meters depth.&amp;lt;!-- ??? --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Religion and philosophy==&lt;br /&gt;
[[Image:Bahai star.svg|150px|right|A nine-pointed star]]&lt;br /&gt;
*Nine, as the highest single-digit number (in [[decimal|base ten]]), symbolizes completeness in the [[Bahá&#039;í Faith]]. In addition, the word Bahá&#039; in the [[Abjad numerals|Abjad notation]] has a value of 9, and a 9-pointed star is used to [[Bahá&#039;í symbols|symbolize]] the religion.&lt;br /&gt;
*The number 9 is revered in Hinduism and considered a complete, perfected and divine number because it represents the end of a cycle in the [[decimal]] system, which originated from the Indian subcontinent as early as [[30th century BC|3000]] BC.&lt;br /&gt;
*Important Buddhist rituals usually involve nine monks.&lt;br /&gt;
*The first nine days of the [[Hebrew calendar|Hebrew month]] of [[Av (month)|Av]] are collectively known as &amp;quot;The Nine Days&amp;quot; (&#039;&#039;Tisha HaYamim&#039;&#039;), and are a period of semi-mourning leading up to [[Tisha B&#039;Av]], the ninth day of Av on which both [[Temple in Jerusalem|Temples in Jerusalem]] were destroyed.&lt;br /&gt;
*Nine is a significant number in [[Norse Mythology]]. [[Odin]] hung himself on an ash tree for nine days to learn the runes.&lt;br /&gt;
*The [[Fourth Way Enneagram]] is one system of knowledge which shows the correspondence between the 9 integers and the circle.&lt;br /&gt;
*In the [[Christian angelic hierarchy]] there are 9 choirs of angels.&lt;br /&gt;
*[[Ramadan (calendar month)|Ramadan]], the month of fasting and prayer, is the ninth month of the [[Islamic calendar]].&lt;br /&gt;
&lt;br /&gt;
==Science==&lt;br /&gt;
===Astronomy===&lt;br /&gt;
*Before 2006 (when Pluto was [[Pluto#2006: IAU classification|officially designated as a non-planet]]), there were nine [[planet]]s in the [[solar system]].&lt;br /&gt;
*[[Messier object]] [[Messier 9|M9]] is a magnitude 9.0 [[globular cluster]] in the constellation [[Ophiuchus]].&lt;br /&gt;
* The [[New General Catalogue]] [http://www.ngcic.org/ object] [[NGC 9]], a [[spiral galaxy]] in the [[constellation]] [[Pegasus (constellation)|Pegasus]]&lt;br /&gt;
*The Saros [http://sunearth.gsfc.nasa.gov/eclipse/LEsaros/LEsaros1-175.html number] of the [[lunar eclipse]] series which began on [[-2501]] [[June 26]] and ended on [[-1149]] [[September 16]]. The duration of Saros series 9 was 1352.2 years, and it contained 76 lunar eclipses.&lt;br /&gt;
*The [[Saros cycle|Saros]] [http://sunearth.gsfc.nasa.gov/eclipse/SEsaros/SEsaros1-175.html number] of the [[solar eclipse]] series which began on [[-2568]] [[February 6]] and ended on [[-1252]] [[April 4]]. The duration of Saros series 9 was 1316.2 years, and it contained 74 solar eclipses.&lt;br /&gt;
&lt;br /&gt;
===Chemistry===&lt;br /&gt;
*The purity of chemicals (see [[Nine (purity)]])&lt;br /&gt;
*Nine is the [[atomic number]] of [[fluorine]].&lt;br /&gt;
&lt;br /&gt;
===Physiology===&lt;br /&gt;
A human [[pregnancy]] normally lasts nine months, the basis of the [[Naegele&#039;s rule]].&lt;br /&gt;
&lt;br /&gt;
==Sports==&lt;br /&gt;
[[File:9ball rack 2.jpg|thumb|right|200px|A [[Nine-ball]] [[Rack (billiards)|rack]] with the 9 ball at the center]]&lt;br /&gt;
&lt;br /&gt;
===Auto racing===&lt;br /&gt;
* A car in the [[Sprint Cup Series]] currently owned by [[Richard Petty Motorsports]]. The number was most notably borne by the car that [[Bill Elliott]] drove to the Cup Series title in [[1988 NASCAR Winston Cup Series|1988]] with [[Melling Racing]]. Evernham Motorsports, the predecessor team to Richard Petty Motorsports, acquired the number in [[2001 NASCAR Winston Cup Series|2001]] when Elliott joined that team after a brief stint [[Bill Elliott Racing|as a driver-owner]]. Elliott used this number again through the [[2003 NASCAR Winston Cup Series|2003 season]]. [[Kasey Kahne]] has driven the 9 car since [[2004 NASCAR Nextel Cup Series|2004]].  Currently, the 9 car is driven by [[Marcos Ambrose]]&lt;br /&gt;
&lt;br /&gt;
===Baseball===&lt;br /&gt;
* In [[baseball]], nine represents the [[right fielder]]&#039;s position.&lt;br /&gt;
*The number of [[Innings#Baseball|innings]] in a regulation, non-tied game of baseball.&lt;br /&gt;
*The number of players on the field including the pitcher.&lt;br /&gt;
*The number worn by [[Roy Hobbs]] in the movie &#039;&#039;[[The Natural]]&#039;&#039;.&lt;br /&gt;
*&#039;&#039;NINE: A Journal of Baseball History and Culture&#039;&#039;  published by the [[University of Nebraska Press]]&amp;lt;ref&amp;gt;{{cite web|url=http://nine.iweb.bsu.edu/|title=Web site for NINE: A Journal of Baseball History &amp;amp; Culture|accessdate=20 February 2013}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Billiards===&lt;br /&gt;
*[[Nine-ball]] is the standard professional pocket [[billiards]] variant played in the United States.&lt;br /&gt;
&lt;br /&gt;
===Rugby===&lt;br /&gt;
*In [[rugby league]], the jersey number assigned to the [[Hooker (rugby league)|hooker]].&lt;br /&gt;
*In [[rugby union]], the number worn by the starting [[Scrum-half (rugby union)|scrum-half]].&lt;br /&gt;
&lt;br /&gt;
===Soccer===&lt;br /&gt;
* In association [[soccer|football]] (soccer) the centre-forward/striker traditionally (since at least the fifties) wears the number 9 shirt.&lt;br /&gt;
&lt;br /&gt;
===All sports===&lt;br /&gt;
The jersey number 9 has been retired by several [[Major professional sports leagues in the United States and Canada|North American sports]] teams in honor of past playing greats (or in one case, an owner):&lt;br /&gt;
* In [[Major League Baseball]]:&lt;br /&gt;
** The [[Boston Red Sox]], for [[National Baseball Hall of Fame and Museum|Hall of Famer]] [[Ted Williams]].&lt;br /&gt;
** The [[Chicago White Sox]], for [[Minnie Miñoso]].&lt;br /&gt;
** The [[New York Yankees]], for [[Roger Maris]].&lt;br /&gt;
** The [[Oakland Athletics]], for Hall of Famer [[Reggie Jackson]].&lt;br /&gt;
** The [[Pittsburgh Pirates]], for Hall of Famer [[Bill Mazeroski]].&lt;br /&gt;
** The [[St. Louis Cardinals]], for Hall of Famer [[Enos Slaughter]].&lt;br /&gt;
* In the [[National Basketball Association|NBA]]:&lt;br /&gt;
** The [[Atlanta Hawks]], for [[Naismith Memorial Basketball Hall of Fame|Hall of Famer]] [[Bob Pettit]].&lt;br /&gt;
** The [[Phoenix Suns]], for [[Dan Majerle]].&lt;br /&gt;
** The [[Utah Jazz]], for owner [[Larry H. Miller|Larry Miller]].&lt;br /&gt;
* In the [[National Hockey League|NHL]]:&lt;br /&gt;
** The [[Boston Bruins]], for [[Hockey Hall of Fame|Hall of Famer]] [[Johnny Bucyk]].&lt;br /&gt;
** The [[Calgary Flames]], for Hall of Famer [[Lanny McDonald]].&lt;br /&gt;
** The [[Chicago Blackhawks]], for Hall of Famer [[Bobby Hull]].&lt;br /&gt;
** The [[Dallas Stars]], for [[Mike Modano]].&lt;br /&gt;
** The [[Detroit Red Wings]], for Hall of Famer [[Gordie Howe]].&lt;br /&gt;
** The [[Edmonton Oilers]], for Hall of Famer [[Glenn Anderson]].&lt;br /&gt;
** The [[Montreal Canadiens]], for Hall of Famer [[Maurice Richard]].&lt;br /&gt;
** The [[New York Islanders]], for Hall of Famer [[Clark Gillies]].&lt;br /&gt;
** The [[New York Rangers]], for Hall of Famer [[Andy Bathgate]] and [[Adam Graves]].&lt;br /&gt;
** The [[Toronto Maple Leafs]] have a policy of not retiring numbers unless the player honoured either died or suffered a career-ending incident while a member of the team. Other players whose numbers would otherwise be retired instead have their numbers enshrined by the team as &amp;quot;Honoured Numbers&amp;quot;, which remain in circulation for future players. The number 9 is currently honoured for Hall of Famers [[Ted Kennedy (ice hockey)|Ted Kennedy]] and [[Charlie Conacher]].&lt;br /&gt;
** The first NHL incarnation of the [[Winnipeg Jets (1972–96)|Winnipeg Jets]], also for Hull. Although the Jets moved from Winnipeg to become the [[Phoenix Coyotes]], the Coyotes continue to honor all numbers retired by the Jets. The Coyotes briefly took the number out of retirement for Hull&#039;s son [[Brett Hull]], also a Hall of Famer, in 2005–06 until the younger Hull retired five games into that season. The current [[Winnipeg Jets]] have yet to officially retire any numbers, but [[Evander Kane]] received Bobby Hull&#039;s blessing to wear the number.&lt;br /&gt;
* No [[National Football League|NFL]] team has yet retired #9.&lt;br /&gt;
&lt;br /&gt;
==Technology==&lt;br /&gt;
[[Image:Seven-segment 9.svg|25px|right]]&lt;br /&gt;
[[Image:Seven-segment 9 alt.svg|25px|right]]&lt;br /&gt;
* [[ISO 9]] is the [[International Organization for Standardization|ISO]]&#039;s standard for the transliteration of [[Cyrillic]] characters into [[Latin]] characters&lt;br /&gt;
* In the [[Rich Text Format]] specification, 9 is the language code for the [[English language]]. All codes for regional variants of English are congruent to 9 mod 256.&lt;br /&gt;
* The [[seven-segment display]] allows the number 9 to be constructed two ways, either with a hook at the end of its stem or without one. Most [[liquid crystal display|LCD]] calculators use the former, but some [[vacuum fluorescent display|VFD]] models use the latter.&lt;br /&gt;
* [[The9]] Limited (owner of [http://the9.com the9.com]) is a company in the video-game game industry, including former ties to the extremely popular [[MMORPG]] [[World of Warcraft]]&lt;br /&gt;
&lt;br /&gt;
==Other fields==&lt;br /&gt;
[[Image:ICS Niner.svg|right|thumb|100px|[[International maritime signal flag]] for 9]]&lt;br /&gt;
[[Image:9 playing cards.jpg|thumb|250px|[[Playing card]]s showing the 9 of all four suits]]&lt;br /&gt;
*Nine justices sit on the [[United States Supreme Court]].&lt;br /&gt;
*[[Stanine]]s, a method of scaling test scores, range from 1 to 9.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
{{Portal|Mathematics}}&lt;br /&gt;
*[[9 (disambiguation)]]&lt;br /&gt;
*[[0.999...]]&lt;br /&gt;
*[[wikt:cloud nine|Cloud Nine]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist|35em}}&lt;br /&gt;
&lt;br /&gt;
==Further reading==&lt;br /&gt;
*Cecil Balmond, &amp;quot;Number 9, the search for the sigma code&amp;quot; 1998, Prestel 2008, ISBN 3-7913-1933-7, ISBN 978-3-7913-1933-9&lt;br /&gt;
&lt;br /&gt;
{{Integers|zero}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:9 (Number)}}&lt;br /&gt;
[[Category:Integers|09]]&lt;/div&gt;</summary>
		<author><name>112.207.1.119</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Isosceles_triangle&amp;diff=3933</id>
		<title>Isosceles triangle</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Isosceles_triangle&amp;diff=3933"/>
		<updated>2014-02-02T09:34:56Z</updated>

		<summary type="html">&lt;p&gt;112.207.1.119: /* See also */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{ for|A kind of [[skipper (butterfly)]]|Caprona ransonnetti}}&lt;br /&gt;
&lt;br /&gt;
[[File:Golden Angle.svg|right|thumb|The golden angle is the angle subtended by the smaller (red) arc when two arcs that make up a circle are in the [[golden ratio]]]]&lt;br /&gt;
&lt;br /&gt;
In [[geometry]], the &#039;&#039;&#039;golden angle&#039;&#039;&#039; is the smaller of the two [[angle]]s created by sectioning the circumference of a circle according to the [[golden section]]; that is, into two [[Arc (geometry)|arc]]s such that the ratio of the length of the larger arc to the length of the smaller arc is the same as the ratio of the full circumference to the length of the larger arc.&lt;br /&gt;
&lt;br /&gt;
Algebraically, let &#039;&#039;a+b&#039;&#039; be the circumference of a [[circle]], divided into a longer arc of length &#039;&#039;a&#039;&#039; and a smaller arc of length &#039;&#039;b&#039;&#039; such that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \frac{a + b}{a} = \frac{a}{b}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The golden angle is then the angle [[subtend]]ed by the smaller arc of length &#039;&#039;b&#039;&#039;. It measures approximately 137.508°, or about 2.39996 [[radian]]s.&lt;br /&gt;
&lt;br /&gt;
The name comes from the golden angle&#039;s connection to the [[golden ratio]] &#039;&#039;&amp;amp;phi;&#039;&#039;; the exact value of the golden angle is&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;360\left(1 - \frac{1}{\varphi}\right) = 360(2 - \varphi) = \frac{360}{\varphi^2} = 180(3 - \sqrt{5})\text{ degrees}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
or &lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; 2\pi \left( 1 - \frac{1}{\varphi}\right) = 2\pi(2 - \varphi) = \frac{2\pi}{\varphi^2} = \pi(3 - \sqrt{5})\text{ radians},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where the equivalences follow from well-known algebraic properties of the golden ratio.&lt;br /&gt;
&lt;br /&gt;
== Derivation ==&lt;br /&gt;
The golden ratio is equal to &#039;&#039;&amp;amp;phi;&#039;&#039;&amp;amp;nbsp;=&amp;amp;nbsp;&#039;&#039;a&#039;&#039;/&#039;&#039;b&#039;&#039; given the conditions above.&lt;br /&gt;
&lt;br /&gt;
Let &#039;&#039;&amp;amp;fnof;&#039;&#039; be the fraction of the circumference subtended by the golden angle, or equivalently, the golden angle divided by the angular measurement of the circle.  &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; f = \frac{b}{a+b} = \frac{1}{1+\varphi}.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
But since&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;{1+\varphi} = \varphi^2,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
it follows that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; f = \frac{1}{\varphi^2} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is equivalent to saying that &#039;&#039;&amp;amp;phi;&#039;&#039;&amp;lt;sup&amp;gt;&amp;amp;nbsp;2&amp;lt;/sup&amp;gt; golden angles can fit in a circle.&lt;br /&gt;
&lt;br /&gt;
The fraction of a circle occupied by the golden angle is therefore&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;f \approx 0.381966. \,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The golden angle &#039;&#039;g&#039;&#039; can therefore be numerically approximated in [[Degree (angle)|degrees]] as:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;g \approx 360 \times 0.381966 \approx 137.508^\circ,\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
or in radians as :&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; g \approx 2\pi \times 0.381966 \approx 2.39996. \,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Golden angle in nature ==&lt;br /&gt;
[[File:Goldener Schnitt Blattstand.png|thumb|right|300px|The angle between successive florets in some flowers is the golden angle.]]&lt;br /&gt;
&lt;br /&gt;
The golden angle plays a significant role in the theory of [[phyllotaxis]]. Perhaps most notably, the golden angle is the angle separating the [[floret]]s on a [[sunflower]].&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{refbegin}}&lt;br /&gt;
*{{Cite journal&lt;br /&gt;
  | last =Vogel&lt;br /&gt;
  | first =H&lt;br /&gt;
  | title =A better way to construct the sunflower head&lt;br /&gt;
  | journal =Mathematical Biosciences&lt;br /&gt;
  | issue =44&lt;br /&gt;
  | pages =179–189&lt;br /&gt;
  | year =1979&lt;br /&gt;
  | doi =10.1016/0025-5564(79)90080-4&lt;br /&gt;
  | volume =44&lt;br /&gt;
}}&lt;br /&gt;
*{{cite book&lt;br /&gt;
  | last =Prusinkiewicz&lt;br /&gt;
  | first =Przemysław&lt;br /&gt;
  | authorlink =Przemysław Prusinkiewicz&lt;br /&gt;
  | coauthors =[[Aristid Lindenmayer|Lindenmayer, Aristid]]&lt;br /&gt;
  | title =The Algorithmic Beauty of Plants&lt;br /&gt;
  | publisher =Springer-Verlag&lt;br /&gt;
  | date =1990&lt;br /&gt;
  | location =&lt;br /&gt;
  | pages =101&amp;amp;ndash;107&lt;br /&gt;
  | url =http://algorithmicbotany.org/papers/#webdocs&lt;br /&gt;
  | doi =&lt;br /&gt;
  | isbn = 978-0-387-97297-8 }}&lt;br /&gt;
{{refend}}&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://mathworld.wolfram.com/GoldenAngle.html Golden Angle] at [[MathWorld]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Elementary geometry]]&lt;br /&gt;
[[Category:Golden ratio]]&lt;br /&gt;
[[Category:Angle]]&lt;/div&gt;</summary>
		<author><name>112.207.1.119</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Rectangle&amp;diff=1969</id>
		<title>Rectangle</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Rectangle&amp;diff=1969"/>
		<updated>2014-02-02T08:37:27Z</updated>

		<summary type="html">&lt;p&gt;112.207.1.119: /* Formulae */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;&#039;Satisficing&#039;&#039;&#039; is a [[decision-making]] strategy or cognitive [[heuristic]] that entails searching through the available alternatives until an acceptability threshold is met.&amp;lt;ref&amp;gt;{{cite book |first=Andrew |last=Colman |year=2006 |title=A Dictionary of Psychology |location=New York |publisher=Oxford University Press |page=670 |isbn=019861035}}&amp;lt;/ref&amp;gt; This is contrasted with [[optimal decision]] making, an approach that specifically attempts to find the best alternative available. The term &#039;&#039;satisficing&#039;&#039;, a [[portmanteau]] of &#039;&#039;satisfy&#039;&#039; and &#039;&#039;suffice&#039;&#039;,&amp;lt;ref&amp;gt;{{cite book |first=Ken |last=Manktelow |year=2000 |title=Reasoning and Thinking |location=Hove |publisher=Psychology Press |page=221 |isbn=0863777082 }}&amp;lt;/ref&amp;gt; was introduced by [[Herbert A. Simon]] in 1956,&amp;lt;ref&amp;gt;{{cite journal |title=Rational Choice and the Structure of the Environment |last=Simon |first=H. A. |journal=[[Psychological Review]] |volume=63 |issue=2 |year=1956 |pages=129–138 |doi=10.1037/h0042769 }} (page 129: &amp;quot;Evidently, organisms adapt well enough to ‘satisfice’; they do not, in general, ‘optimize’.&amp;quot;; page 136: &amp;quot;A ‘satisficing’ path, a path that will permit satisfaction at some specified level of all its needs.&amp;quot;)&amp;lt;/ref&amp;gt; although the concept &amp;quot;was first posited in &#039;&#039;[[Administrative Behavior]]&#039;&#039;, published in 1947.&amp;quot;&amp;lt;ref name=Brown2004&amp;gt;{{cite journal|last1=Brown|first1=Reva|title=Consideration of the Origin of Herbert Simon&#039;s Theory of &#039;Satisficing&#039; (1933-1947)|journal=Management Decision|volume=42|issue=10|year=2004|pages=1240–1256|doi=10.1108/00251740410568944}}&amp;lt;/ref&amp;gt;&amp;lt;ref name=AB1947&amp;gt;{{cite book | last = Simon | first = Herbert A. | authorlink = Herbert A. Simon | title = [[Administrative Behavior]]: a Study of Decision-Making Processes in Administrative Organization | publisher = Macmillan | location = New York | year = 1947 | edition=1st | oclc = 356505}}&amp;lt;/ref&amp;gt; Simon used satisficing to explain the behavior of decision makers under circumstances in which an optimal solution cannot be determined. He pointed out that human beings lack the cognitive resources to [[optimization|optimize]]: We can rarely evaluate all outcomes with sufficient precision, usually do not know the relevant probabilities of outcomes, and possess only limited memory. Simon formulated the concept within a novel approach to rationality, which takes into account these limitations. He referred to this approach as [[bounded rationality]]. Notice furthermore that some [[consequentialism|consequentialist]] theories in [[moral philosophy]] use the concept of satisficing in the same sense, though most call for optimization instead.&lt;br /&gt;
&lt;br /&gt;
== In decision-making ==&lt;br /&gt;
In decision making, satisficing explains the tendency to select the first option that meets a given need or select the option that seems to address most needs rather than the “optimal” solution.&lt;br /&gt;
&lt;br /&gt;
:Example: A task is to sew a patch onto a pair of jeans. The best needle to do the threading is a 4 inch long needle with a 3 millimeter eye. This needle is hidden in a haystack along with 1000 other needles varying in size from 1 inch to 6 inches. Satisficing claims that the first needle that can sew on the patch is the one that should be used. Spending time searching for that one specific needle in the haystack is a waste of energy and resources.&lt;br /&gt;
&lt;br /&gt;
Satisficing also occurs in consensus building when the group looks towards a solution everyone can agree on even if it may not be the best.&lt;br /&gt;
&lt;br /&gt;
:Example: A group spends hours projecting the next fiscal year&#039;s budget. After hours of debating they eventually reach a consensus, only to have one person speak up and ask if the projections are correct. When the group becomes upset at the question, it is not because this person is wrong to ask, but rather because the group has already come up with a solution that works. The projection may not be what will actually come, but the majority agrees on one number and thus the projection is good enough to close the book on the budget.&lt;br /&gt;
&lt;br /&gt;
In many circumstances, the individual may be uncertain about what constitutes a satisfactory outcome.&lt;br /&gt;
&lt;br /&gt;
:Example: An individual who only seeks a satisfactory retirement income may not know what level of wealth is required—given uncertainty about future prices—to ensure a satisfactory income.  In this case, the individual can only evaluate outcomes on the basis of their probability of being satisfactory. If the individual chooses that outcome which has the maximum chance of being satisfactory, then this individual&#039;s behavior is theoretically indistinguishable from that of an optimizing individual under certain conditions.&amp;lt;ref&amp;gt;{{cite journal |last=Castagnoli |first=E. |first2=M. |last2=LiCalzi |year=1996 |title=Expected Utility without Utility |journal=Theory and Decision |volume=41 |issue=3 |pages=281–301 |doi=10.1007/BF00136129 }}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal |last=Bordley |first=R. |first2=M. |last2=LiCalzi |year=2000 |title=Decision Analysis Using Targets Instead of Utility Functions |journal=Decisions in Economics &amp;amp; Finance |volume=23 |issue=1 |pages=53–74 |doi=10.1007/s102030050005 }}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal |last=Bordley |first=R. |first2=C. |last2=Kirkwood |year=2004 |title=Preference Analysis with Multiattribute Performance Targets |journal=Operations Research |volume=52 |issue=6 |pages=823–835 |doi=10.1287/opre.1030.0093 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Satisficing is often a good option when making a decision, but it can also be detrimental if used the wrong way.&lt;br /&gt;
&lt;br /&gt;
:Example: When considering a medical issue such as a diagnosis, satisficing is not the best decision making strategy to use. On the other hand, when choosing an outfit or an option from a menu, it can be helpful. When there is an unlimited amount of information available and it is necessary to eliminate options, satisficing is beneficial because it helps the person making the decision effectively and efficiently reach a conclusion.&amp;lt;ref&amp;gt;{{cite book |last=Sternberg |first=R. J. |year=2009 |title=Cognitive Psychology |edition=5th |location=Belmont, CA |publisher=Wadsworth |isbn=049550629X }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
=== Satisficing and optimization ===&lt;br /&gt;
One definition of satisficing is that it is [[Optimization (mathematics)|optimization]] where &#039;&#039;all&#039;&#039; costs, including the cost of the optimization calculations themselves and the cost of getting information for use in those calculations, are considered. As a result, the eventual choice is usually sub-optimal in regard to the main goal of the optimization, i.e., different from the optimum in the case that the costs of choosing are not taken into account.&lt;br /&gt;
&lt;br /&gt;
==== Satisficing as a form of optimization ====&lt;br /&gt;
Alternatively, satisficing can be considered to be just [[constraint satisfaction]], the process of finding a solution satisfying a set of constraints, without concern for finding an optimum. Any such satisficing problem can be formulated as an (equivalent) optimization problem using the [[Indicator function]] of the satisficing requirements as an [[objective function]]. More formally, if {{math|&amp;lt;var&amp;gt;X&amp;lt;/var&amp;gt;}} denotes the set of all options and {{math| &amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt; &amp;amp;sube; &amp;lt;var&amp;gt;X&amp;lt;/var&amp;gt;}} denotes the set of &amp;quot;satisficing&amp;quot; options, then selecting a satisficing solution (an element of {{math|&amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;}})  is equivalent to the following optimization problem&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;\max_{s\in X} I_{S}(s)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where {{math|I&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;}} denotes the [[Indicator function]] of {{math|&amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;}}, that is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;I_{S}(s):=\begin{cases} \begin{array}{ccc} 1 &amp;amp;,&amp;amp; s\in S\\&lt;br /&gt;
0 &amp;amp;,&amp;amp; s\notin S&lt;br /&gt;
\end{array}&lt;br /&gt;
\end{cases} \ , \ s\in X&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A solution {{math|&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt; &amp;amp;isin; &amp;lt;var&amp;gt;X&amp;lt;/var&amp;gt;}} to this optimization problem is optimal if, and only if,  it is a satisficing option (an element of {{math|&amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;}}). Thus, from a decision theory point of view,  the distinction between &amp;quot;optimizing&amp;quot; and &amp;quot;satisficing&amp;quot; is essentially a stylistic issue (that can nevertheless be very important in certain applications) rather than a substantive issue. What is important to determine is &#039;&#039;&#039;what&#039;&#039;&#039; should be optimized and &#039;&#039;&#039;what&#039;&#039;&#039; should be satisficed. The following quote from Jan Odhnoff&#039;s 1965 paper is appropriate:&amp;lt;ref&amp;gt;{{cite journal |last=Odhnoff |first=Jan |year=1965 |title=On the Techniques of Optimizing and Satisficing |journal=The Swedish Journal of Economics |volume=67 |issue=1 |pages=24–39 |jstor=3439096 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{{quote|In my opinion there is room for both &#039;optimizing&#039; and &#039;satisficing&#039; models in business economics. Unfortunately, the difference between &#039;optimizing&#039; and &#039;satisficing&#039; is often referred to as a difference in the quality of a certain choice. It is a triviality that an optimal result in an optimization can be an unsatisfactory result in a satisficing model. The best things would therefore be to avoid a general use of these two words.}}&lt;br /&gt;
&lt;br /&gt;
==== Satisficing applied to the utility framework ====&lt;br /&gt;
In [[economics]], &#039;&#039;&#039;satisficing&#039;&#039;&#039; is a [[behavior]] which attempts to achieve at least some [[minimum]] level of a particular [[Variable (mathematics)|variable]], but which does not necessarily maximize its value.&amp;lt;ref&amp;gt;{{cite book |chapterurl=http://huwdixon.org/SurfingEconomics/chapter7.pdf |chapter=Artificial Intelligence and Economic Theory |title=Surfing Economics: Essays for the Inquiring Economist |authorlink=Huw Dixon |first=Huw |last=Dixon |year=2001 |location=New York |publisher=Palgrave |isbn=0333760611 }}&amp;lt;/ref&amp;gt; The most common application of the concept in economics is in the behavioral [[theory of the firm]], which, unlike traditional accounts, postulates that producers treat [[Profit (economics)|profit]] not as a goal to be maximized, but as a constraint. Under these theories, a critical level of profit must be achieved by firms; thereafter, priority is attached to the attainment of other goals.&lt;br /&gt;
&lt;br /&gt;
More formally, as before if {{math|&amp;lt;var&amp;gt;X&amp;lt;/var&amp;gt;}}  denotes the set of all options {{math|&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt;}}, and we have the payoff function &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;(&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt;)}}&#039;&#039;&#039; which gives the payoff enjoyed by the agent for each option.  Suppose we define the optimum payoff {{math|&amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;}} the solution to&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\max_{s\in X} U(s)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with the optimum actions being the set &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;O&amp;lt;/var&amp;gt;}}&#039;&#039;&#039; of options such that {{math|&amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;(&amp;lt;var&amp;gt;s&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;&amp;lt;/var&amp;gt;) {{=}} &#039;&#039;U&#039;&#039;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;}} (i.e. it is the set of all options that yield the maximum payoff). Assume that the set &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;O&amp;lt;/var&amp;gt;}}&#039;&#039;&#039; has at least one element.&lt;br /&gt;
&lt;br /&gt;
We now introduce the idea of the &#039;&#039;&#039;Aspiration level&#039;&#039;&#039; as introduced by [[Herbert Simon]] and developed in economics by Richard Cyert and James march in their 1963 book &amp;quot;A [[Behavioral theory of the firm]]&amp;quot;.&amp;lt;ref&amp;gt;{{cite book |last=Cyert |first=Richard |last2=March |first2=James G. |year=1992 |title=A Behavioral Theory of the Firm |edition=2nd |publisher=Wiley-Blackwell |isbn=0-631-17451-6 }}&amp;lt;/ref&amp;gt; The aspiration level is the payoff that the agent aspires to: if the agent achieves at least this level it is satisfied, and if it does not achieve it, the agent is not satisfied. Let us define the aspiration level &#039;&#039;&#039;{{math|&#039;&#039;A&#039;&#039;}}&#039;&#039;&#039; and assume that {{math|&#039;&#039;A&#039;&#039; &amp;amp;le; &#039;&#039;U&#039;&#039;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;}}.  Clearly, whilst it is possible that someone can aspire to something that is better than the optimum, it is in a sense irrational to do so. So, we require the aspiration level to be at or below the optimum payoff.&lt;br /&gt;
&lt;br /&gt;
We can then define the set of satisficing options &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;}}&#039;&#039;&#039; as all those options that yield at least &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;A&amp;lt;/var&amp;gt;}}&#039;&#039;&#039;: {{math|&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt; &amp;amp;isin; &amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;}}  &#039;&#039;&#039;if and only if&#039;&#039;&#039;  {{math|&amp;lt;var&amp;gt;A&amp;lt;/var&amp;gt; &amp;amp;le; &amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;(&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt;)}}. Clearly since {{math|&amp;lt;var&amp;gt;A&amp;lt;/var&amp;gt; &amp;amp;le; &amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt;}}, it follows that {{math|&amp;lt;var&amp;gt;O&amp;lt;/var&amp;gt; &amp;amp;sube; S}}.  That is, the set of optimum actions is a subset of the set of satisficing options. So, when an agent satisfices, then she will choose from a larger set of actions than the agent who optimizes.  One way of looking at this is that the satisficing agent is not putting in the effort to get to the precise optimum or is unable to exclude actions that are below the optimum but still above aspiration.&lt;br /&gt;
&lt;br /&gt;
An equivalent way of looking at satisficing is &#039;&#039;&#039;epsilon-optimization&#039;&#039;&#039; (that means you choose your actions so that the payoff is within epsilon of the optimum).  If we define the &amp;quot;gap&amp;quot; between the optimum and the aspiration as &#039;&#039;&#039;{{math|&amp;amp;epsilon;}}&#039;&#039;&#039; where  {{math|&amp;amp;epsilon; {{=}} &#039;&#039;U&#039;&#039;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt; &amp;amp;minus; &#039;&#039;A&#039;&#039;}}.  Then the set of satisficing options &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;S&amp;lt;/var&amp;gt;(&amp;amp;epsilon;)}}&#039;&#039;&#039; can be defined as all those options &#039;&#039;&#039;{{math|&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt;}}&#039;&#039;&#039; such that {{math|&amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;(&amp;lt;var&amp;gt;s&amp;lt;/var&amp;gt;) &amp;amp;ge; &amp;lt;var&amp;gt;U&amp;lt;/var&amp;gt;&amp;lt;sup&amp;gt;*&amp;lt;/sup&amp;gt; &amp;amp;minus; &amp;amp;epsilon;}}.&lt;br /&gt;
&lt;br /&gt;
==== Other applications in economics ====&lt;br /&gt;
Apart from the behavioral theory of the firm, Applications of the idea of satisficing behavior in economics include the Akerlof and Yellen model of [[Menu costs]] popular in [[New Keynesian macroeconomics]].&amp;lt;ref&amp;gt;{{cite journal |last=Akerlof |first=George A. |last2=Yellen |first2=Janet L. |year=1985 |title=Can Small Deviations from Rationality Make Significant Differences to Economic Equilibria? |journal=[[American Economic Review]] |volume=75 |issue=4 |pages=708–720 |jstor=1821349 }}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal |last=Akerlof |first=George A. |last2=Yellen |first2=Janet L. |year=1985 |title=A Near-rational Model of the Business Cycle, with Wage and Price Intertia |journal=[[The Quarterly Journal of Economics]] |volume=100 |issue=5 |pages=823–838 |doi=10.1093/qje/100.Supplement.823 }}&amp;lt;/ref&amp;gt;  Also, in economics and [[Game theory]] there is the notion of an [[Epsilon equilibrium]], which is a generalization of the standard [[Nash equilibrium]] in which each player is within &#039;&#039;&#039;{{math|&amp;amp;epsilon;}}&#039;&#039;&#039; of his or her optimal payoff (the standard Nash-equilibrium being the special case where &#039;&#039;&#039;{{math|&amp;amp;epsilon; {{=}} 0}}&#039;&#039;&#039;).&lt;br /&gt;
&lt;br /&gt;
=== Endogenous aspiration levels ===&lt;br /&gt;
What determines the aspiration level? This can come from past experience (some function of an agent&#039;s or firm&#039;s previous payoffs), or some organizational or market institutions. For example, if we think of managerial firms, the managers will be expected to earn [[normal profits]] by their shareholders.  Other institutions may have specific targets imposed externally (for example state-funded universities in the UK have targets for student recruitment).&lt;br /&gt;
&lt;br /&gt;
An economic example is the [[Huw Dixon|Dixon]] model of an economy consisting of many firms operating in different industries, where each industry is a [[oligopoly|duopoly]].&amp;lt;ref&amp;gt;{{cite journal |last=Dixon |first=H. |year=2000 |title=Keeping Up with the Joneses: Competition and the Evolution of Collusion |journal=Journal of Economic Behaviour and Organization |volume=43 |issue=2 |pages=223–238 |doi=10.1016/S0167-2681(00)00117-7 }}&amp;lt;/ref&amp;gt;  The endogenous aspiration level is the average profit in the economy. This represents the power of the financial markets: in the long-run firms need to earn normal profits or they die (as [[Armen Alchian]] once said “This is the criterion by which the economic system selects survivors: those who realize positive proﬁts are the survivors; those who suffer losses disappear”&amp;lt;ref&amp;gt;{{cite journal |last=Alchian |first=A. |year=1950 |title=Uncertainty, Evolution and Economic Theory |journal=[[Journal of Political Economy]] |volume=58 |issue=3 |pages=211–222 |jstor=1827159 }}&amp;lt;/ref&amp;gt;).  We can then think what happens over time.  If firms are earning profits at or above their aspiration level, then they just stay doing what they are doing (unlike the optimizing firm which would always strive to earn the highest profits possible). However, if the firms are earning below aspiration, then they try something else, until they get into a situation where they attain their aspiration level. it can be shown that in this economy, &#039;&#039;&#039;satisficing&#039;&#039;&#039; leads to [[collusion]] amongst firms: competition between firms leads to lower profits for one or both of the firms in a duopoly. This means that competition is unstable: one or both of the firms will fail to achieve their aspirations and hence try something else. The only situation which is stable is one where all firms achieve their aspirations, which can only happen when all firms earn average profits.  In general, this will only happen if all firms earn the joint-profit maximizing or collusive profit.&amp;lt;ref&amp;gt;Dixon (2000), Theorem 1 page 228. for a non-technical explanation see [http://www.huwdixon.org/SurfingEconomics/chapter8.pdf Chapter 8],[http://www.huwdixon.org/SurfingEconomics/index.html Surfing Economics] by Dixon H&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== In psychology ==&lt;br /&gt;
&lt;br /&gt;
=== As a personality trait ===&lt;br /&gt;
Some research has suggested that satisficing/maximizing and other decision-making strategies, like [[personality]] traits, have a strong genetic component and endure over time. This genetic influence on decision-making behaviors has been found through classical [[twin studies]], in which decision-making tendencies are self-reported by pairs of twins and then compared between monozygotic and dizygotic twins.&amp;lt;ref&amp;gt;{{cite journal |last=Simonson |first=I. |last2=Sela |first2=A. |year=2011 |title=On the heritability of consumer decision making: An exploratory approach for studying genetic effects on judgment and choice |journal=Journal of Consumer Research |volume=37 |issue=6 |pages=951–966 |doi=10.1086/657022 }}&amp;lt;/ref&amp;gt; This implies that people can be categorized into &amp;quot;maximizers&amp;quot; and &amp;quot;satisficers&amp;quot;, with some people landing in between.&lt;br /&gt;
&lt;br /&gt;
=== Relationship with happiness ===&lt;br /&gt;
The distinction between satisficing and maximizing not only differs in the decision-making process, but also in the post-decision evaluation. Maximizers tend to use a more exhaustive approach to their decision-making process: they seek and evaluate more options than satisficers do to achieve greater satisfaction. However, whereas satisficers tend to be relatively pleased with their decisions, maximizers tend to be less happy with their decision outcomes. This is thought to be due to limited cognitive resources people have when their options are vast, forcing maximizers to not make an optimal choice. Because maximization is unrealistic and usually impossible in everyday life, maximizers often feel regretful in their post-choice evaluation.&amp;lt;ref&amp;gt;{{cite journal |last=Schwartz |first=B. |last2=Ward |first2=A. |last3=Monterosso |first3=J. |last4=Lyubomirsky |first4=S. |last5=White |first5=K. |last6=Lehman |first6=D. R. |year=2002 |title=Maximizing versus satisficing: Happiness is a matter of choice |journal=Journal of Personality and Social Psychology |volume=83 |issue=5 |pages=1178–1197 |doi=10.1037/0022-3514.83.5.1178 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== In survey methodology ==&lt;br /&gt;
As an example of satisficing, in the field of  [[social cognition]], [[Jon Krosnick]] proposed a theory of [[statistical survey]] &#039;&#039;&#039;satisficing&#039;&#039;&#039; which says that optimal question answering by a survey respondent involves a great deal of [[cognitive]] work and that some people would use satisficing to reduce that burden. Some people may shortcut their cognitive processes in two ways:&lt;br /&gt;
* Weak satisficing: Respondent executes all cognitive steps involved in optimizing, but less completely and with [[bias]].&lt;br /&gt;
* Strong satisficing: Respondent offers responses that will seem reasonable to the interviewer without any memory search or information integration.&lt;br /&gt;
&lt;br /&gt;
Likelihood to satisfice is linked to respondent ability, respondent [[motivation]] and task difficulty&lt;br /&gt;
&lt;br /&gt;
Regarding survey answers, satisficing manifests in:&lt;br /&gt;
* choosing explicitly offered no-opinion response option&lt;br /&gt;
* choosing socially desirable responses&lt;br /&gt;
* non-differentiation when a battery of questions asks for ratings of multiple objects on the same response scale&lt;br /&gt;
* acquiescence response bias, which is the tendency to agree with any assertion, regardless of its content&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
{{div col|4}}&lt;br /&gt;
* [[Alpha-beta pruning]]&lt;br /&gt;
* [[Decision theory]]&lt;br /&gt;
* [[Flipism]]&lt;br /&gt;
* [[Frame problem]]&lt;br /&gt;
* [[Homo economicus]]&lt;br /&gt;
* [[Optimism bias]]&lt;br /&gt;
* [[Portmanteau]]&lt;br /&gt;
* [[Principle of good enough]]&lt;br /&gt;
* [[Rationality]]&lt;br /&gt;
* [[Rational ignorance]]&lt;br /&gt;
* [[Satisfiability]]&lt;br /&gt;
* [[Utility maximization problem]]&lt;br /&gt;
{{div col end}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{Reflist|30em}}&lt;br /&gt;
&lt;br /&gt;
== Further reading ==&lt;br /&gt;
*{{cite journal |first=Michael |last=Byron |title=Satisficing and Optimality |journal=[[Ethics (journal)|Ethics]] |volume=109 |issue=1 |year=1998 |pages=67–93 |doi=10.1086/233874 }} A paper on satisficing considered from a [[philosophy|philosophical]] viewpoint.&lt;br /&gt;
*{{cite book |last=Byron |first=M. |year=2004 |title=Satisficing and Maximizing: Moral Theorists on Practical Reason |location=New York |publisher=Cambridge University Press |isbn=052181149X }}&lt;br /&gt;
*{{cite book |first=J. N. |last=Bearden |first2=T. |last2=Connolly |chapter=On Optimal Satisficing: How simple policies can achieve excellent results |editor1-first=T. |editor1-last=Kugler |editor2-first=J. C. |editor2-last=Smith |editor3-first=T. |editor3-last=Connolly |editor4-first=Y. J. |editor4-last=Son |title=Decision Modeling in Uncertain and Complex Environments |publisher=Springer |location=New York |year=2008 |isbn=9780387771311 }}&lt;br /&gt;
*{{cite book |first=Huw |last=Dixon |chapterurl=http://huwdixon.org/SurfingEconomics/chapter8.pdf |chapter=Donut world and the duopoly archipelago |title=Surfing Economics: Essays for the Inquiring Economist |publisher=Palgrave |location=New York |year=2001 |isbn=0333760611 }}&lt;br /&gt;
*{{cite journal |last=Holbrook |first=A. |last2=Green |first2=M. |last3=Krosnick |first3=J. |year=2003 |title=Telephone versus Face-to-Face Interviewing of National Probability Samples with Long Questionnaires: Comparisons of Respondent Satisficing and Social Desirability Response Bias |journal=[[Public Opinion Quarterly]] |volume=67 |issue=1 |pages=79–125 |doi=10.1086/346010 }}&lt;br /&gt;
*{{cite journal |last=Krosnick |first=J. |year=1991 |title=Response Strategies for coping with the cognitive demands of attitude measures in surveys |journal=Applied Cognitive Psychology |volume=5 |issue=3 |pages=213–236 |doi=10.1002/acp.2350050305 }}&lt;br /&gt;
*{{cite book |last=Simon |first=H. A. |year=1957 |title=Models of Man: Social and Rational |location=New York |publisher=Wiley }}&lt;br /&gt;
*{{cite journal |last=Simon |first=H. A. |year=1978 |title=Rationality as a Process and Product of Thought |journal=[[American Economic Review]] |volume=68 |issue=1 |pages=1–16 |jstor=1816653 }}&lt;br /&gt;
*{{cite book |last=Simon |first=H. A. |year=1983 |title=Reason in Human Affairs |location=Stanford |publisher=Stanford University Press |isbn=0804711798 }}&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
*[http://pespmc1.vub.ac.be/ASC/SATISFICING.html &#039;&#039;Web Dictionary of Cybernetics and Systems&#039;&#039; definition of &amp;quot;satisficing&amp;quot;]&lt;br /&gt;
*[http://www.moshe-online.com/satisficing/ A web page dedicated to a discussion  on the &amp;quot;satisficing&amp;quot; vs &amp;quot;optimizing&amp;quot; debate.]&lt;br /&gt;
*[http://video.google.com/videoplay?docid=6127548813950043200 Schwartz&#039;s Tech Talk (&amp;quot;The Paradox of Choice - Why More Is Less&amp;quot;) given at Google on April 27, 2006]&lt;br /&gt;
&lt;br /&gt;
[[Category:Underlying principles of microeconomic behavior]]&lt;br /&gt;
[[Category:Heuristics]]&lt;br /&gt;
[[Category:Organizational behavior]]&lt;/div&gt;</summary>
		<author><name>112.207.1.119</name></author>
	</entry>
</feed>