<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=49.249.0.0%2F16</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=49.249.0.0%2F16"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/49.249.0.0/16"/>
	<updated>2026-07-28T00:15:06Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=I-beam&amp;diff=241207</id>
		<title>I-beam</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=I-beam&amp;diff=241207"/>
		<updated>2015-01-08T05:21:44Z</updated>

		<summary type="html">&lt;p&gt;49.249.54.78: /* Indian standard beams ISMB */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[http://www.senatorwonderling.com cheap luke bryan tickets] Luke is actually a celebrity from the building plus the profession development to start with next to his 3rd resort album,  And , is the evidence. He broken to the picture in 2006 with his funny combination of straight down-property accessibility, movie celebrity wonderful looks and  lines, is scheduled t within a major way. The newest re about the land graph and #2 around the take   [http://lukebryantickets.pyhgy.com the today show luke bryan] charts, creating it the next highest first appearance in those days of 2014 for a region designer. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;The child of your ,  is aware determination and determination are important elements in relation to a prosperous  profession- . His to start with record,  Stay Me, created the most notable  reaches “All My Girlfriends Say” and “Country Person,” while his  work, Doin’  Factor, found the performer-about three directly No. 4 single men and women:  In addition Calling Is a Good Point.”&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Inside the fall of 2007, Concert tours: Luke  And that had an impressive selection of , which includes   [http://www.hotelsedinburgh.org luke bryan concert tickets 2014] Downtown. “It’s much like you are getting a   approval to visit to the next level, claims these musicians that were a part of the  Tourabove in to a bigger measure of musicians.” It covered as the most successful  tours in its ten-12 months history.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Here is my web page ... concert tickets for luke bryan ([http://www.banburycrossonline.com your input here])&lt;/div&gt;</summary>
		<author><name>49.249.54.78</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Law_of_demand&amp;diff=5711</id>
		<title>Law of demand</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Law_of_demand&amp;diff=5711"/>
		<updated>2014-01-17T17:46:01Z</updated>

		<summary type="html">&lt;p&gt;49.249.130.152: /* Assumptions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[number theory]], a branch of [[mathematics]], the &#039;&#039;&#039;special number field sieve&#039;&#039;&#039; (SNFS) is a special-purpose [[integer factorization]] algorithm. The [[general number field sieve]] (GNFS) was derived from it.&lt;br /&gt;
&lt;br /&gt;
The special number field sieve is efficient for integers of the form &#039;&#039;r&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;e&#039;&#039;&amp;lt;/sup&amp;gt; &amp;amp;plusmn; &#039;&#039;s&#039;&#039;, where &#039;&#039;r&#039;&#039; and &#039;&#039;s&#039;&#039; are small (for instance [[Mersenne number]]s).&lt;br /&gt;
&lt;br /&gt;
[[Heuristic]]ally, its [[Computational complexity theory|complexity]] for factoring an integer &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; is of the form:&amp;lt;ref&amp;gt;{{Citation|last=Pomerance|first=Carl|author-link=Carl Pomerance|date=December 1996|title=A Tale of Two Sieves|periodical=Notices of the AMS|volume=43|issue=12|pages=1473–1485|url=http://www.ams.org/notices/199612/pomerance.pdf}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\exp\left(\left(1+o(1)\right)\left(\tfrac{32}{9}\log n\right)^{1/3}\left(\log\log n\right)^{2/3}\right)=L_n\left[1/3,(32/9)^{1/3}\right]&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
in [[Big O notation|O]] and [[L-notation]]s.&lt;br /&gt;
&lt;br /&gt;
The SNFS has been used extensively by NFSNet (a volunteer [[distributed computing]] effort), [http://escatter11.fullerton.edu/nfs/ NFS@Home] and others to factorise numbers of the [[Cunningham project]]; for some time the [[Integer factorization records|records for integer factorisation]] have been numbers factored by SNFS.&lt;br /&gt;
&lt;br /&gt;
==Overview of method==&lt;br /&gt;
&lt;br /&gt;
The SNFS is based on an idea similar to the much simpler [[rational sieve]]; in particular, readers may find it helpful to read about the [[rational sieve]] first, before tackling the SNFS.&lt;br /&gt;
&lt;br /&gt;
The SNFS works as follows. Let &#039;&#039;n&#039;&#039; be the integer we want to factor. As in the [[rational sieve]], the SNFS can be broken into two steps:&lt;br /&gt;
*First, find a large number of multiplicative relations among a &#039;&#039;factor base&#039;&#039; of elements of [[Modular arithmetic#Ring of congruence classes|&#039;&#039;&#039;Z&#039;&#039;&#039;/&#039;&#039;n&#039;&#039;&#039;&#039;&#039;Z&#039;&#039;&#039;]], such that the number of multiplicative relations is larger than the number of elements in the factor base.&lt;br /&gt;
*Second, multiply together subsets of these relations in such a way that all the exponents are even, resulting in congruences of the form &#039;&#039;a&#039;&#039;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;amp;equiv;&#039;&#039;b&#039;&#039;&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; ([[modular arithmetic|mod]] &#039;&#039;n&#039;&#039;). These in turn immediately lead to factorizations of &#039;&#039;n&#039;&#039;: &#039;&#039;n&#039;&#039;=[[greatest common divisor|gcd]](&#039;&#039;a&#039;&#039;+&#039;&#039;b&#039;&#039;,&#039;&#039;n&#039;&#039;)×gcd(&#039;&#039;a&#039;&#039;-&#039;&#039;b&#039;&#039;,&#039;&#039;n&#039;&#039;). If done right, it is almost certain that at least one such factorization will be nontrivial.&lt;br /&gt;
&lt;br /&gt;
The second step is identical to the case of the [[rational sieve]], and is a straightforward [[linear algebra]] problem. The first step, however, is done in a different, more [[algorithmic efficiency|efficient]] way than the rational sieve, by utilizing [[algebraic number field|number fields]].&lt;br /&gt;
&lt;br /&gt;
==Details of method==&lt;br /&gt;
&lt;br /&gt;
Let &#039;&#039;n&#039;&#039; be the integer we want to factor. We pick an [[irreducible polynomial]] &#039;&#039;f&#039;&#039; with integer coefficients, and an integer &#039;&#039;m&#039;&#039; such that &#039;&#039;f&#039;&#039;(&#039;&#039;m&#039;&#039;)&amp;amp;equiv;0 ([[modular arithmetic|mod]] &#039;&#039;n&#039;&#039;) (we will explain how they are chosen in the next section). Let &#039;&#039;&amp;amp;alpha;&#039;&#039; be a [[Root of a function|root]] of &#039;&#039;f&#039;&#039;; we can then form the [[ring (mathematics)|ring]] &#039;&#039;&#039;[[integer|Z]]&#039;&#039;&#039;[&amp;amp;alpha;]. There is a unique [[ring homomorphism]] &amp;amp;phi; from &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;] to [[Modular arithmetic#Ring of congruence classes|&#039;&#039;&#039;Z&#039;&#039;&#039;/n&#039;&#039;&#039;Z&#039;&#039;&#039;]] that maps &#039;&#039;&amp;amp;alpha;&#039;&#039; to &#039;&#039;m&#039;&#039;. For simplicity, we&#039;ll assume that &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;] is a [[unique factorization domain]]; the algorithm can be modified to work when it isn&#039;t, but then there are some additional complications.&lt;br /&gt;
&lt;br /&gt;
Next, we set up two parallel &#039;&#039;factor bases&#039;&#039;, one in &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;] and one in &#039;&#039;&#039;Z&#039;&#039;&#039;. The one in &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;] consists of all the prime  ideals in &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;] whose norm is bounded by a chosen value &amp;lt;math&amp;gt;N_{\max}&amp;lt;/math&amp;gt;. The factor base in &#039;&#039;&#039;Z&#039;&#039;&#039;, as in the rational sieve case, consists of all prime integers up to some other bound.&lt;br /&gt;
&lt;br /&gt;
We then search for [[relatively prime]] pairs of integers (&#039;&#039;a&#039;&#039;,&#039;&#039;b&#039;&#039;) such that:&lt;br /&gt;
*&#039;&#039;a&#039;&#039;+&#039;&#039;bm&#039;&#039; is [[smooth number|smooth]] with respect to the factor base in &#039;&#039;&#039;Z&#039;&#039;&#039; (i.e., it is a product of elements in the factor base).&lt;br /&gt;
*&#039;&#039;a&#039;&#039;+&#039;&#039;b&amp;amp;alpha;&#039;&#039; is smooth with respect to the factor base in &#039;&#039;&#039;Z&#039;&#039;&#039;[&#039;&#039;&amp;amp;alpha;&#039;&#039;]; given how we chose the factor base, this is equivalent to the norm of &#039;&#039;a&#039;&#039;+&#039;&#039;b&amp;amp;alpha;&#039;&#039; being divisible only by primes less than &amp;lt;math&amp;gt;N_{\max}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
These pairs are found through a sieving process, analogous to the [[Sieve of Eratosthenes]]; this motivates the name &amp;quot;Number Field Sieve&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
For each such pair, we can apply the ring homomorphism &amp;amp;phi; to the factorization of &#039;&#039;a&#039;&#039;+&#039;&#039;b&amp;amp;alpha;&#039;&#039;, and we can apply the canonical ring homomorphism from &#039;&#039;&#039;Z&#039;&#039;&#039; to &#039;&#039;&#039;Z&#039;&#039;&#039;/n&#039;&#039;&#039;Z&#039;&#039;&#039; to the factorization of &#039;&#039;a&#039;&#039;+&#039;&#039;bm&#039;&#039;. Setting these equal gives a multiplicative relation among elements of a bigger factor base in &#039;&#039;&#039;Z&#039;&#039;&#039;/n&#039;&#039;&#039;Z&#039;&#039;&#039;, and if we find enough pairs we can proceed to combine the relations and factor &#039;&#039;n&#039;&#039;, as described above.&lt;br /&gt;
&lt;br /&gt;
==Choice of parameters==&lt;br /&gt;
&lt;br /&gt;
Not every number is an appropriate choice for the SNFS: you need to know in advance a polynomial &#039;&#039;f&#039;&#039; of appropriate degree (the optimal degree is conjectured to be &amp;lt;math&amp;gt;\left(3 \frac{\log N}{\log \log N}\right) ^{1/3}&amp;lt;/math&amp;gt;, which is 4, 5, or 6 for the sizes of N currently feasible to factorise) with small coefficients, and a value &#039;&#039;x&#039;&#039; such that &amp;lt;math&amp;gt;f(x) \equiv 0 \pmod N&amp;lt;/math&amp;gt; where N is the number to factorise.  There is an extra condition: &#039;&#039;x&#039;&#039; must satisfy &amp;lt;math&amp;gt;ax+b \equiv 0 \pmod N&amp;lt;/math&amp;gt; for a and b no bigger than &amp;lt;math&amp;gt;N^{1/d}&amp;lt;/math&amp;gt;.  &lt;br /&gt;
&lt;br /&gt;
One set of numbers for which such polynomials exist are the &amp;lt;math&amp;gt;a^b \pm 1&amp;lt;/math&amp;gt; numbers from the [[Cunningham project|Cunningham tables]]; for example, when NFSNET factored 3^479+1, they used the polynomial x^6+3 with x=3^80, since (3^80)^6+3 = 3^480+3, and &amp;lt;math&amp;gt;3^{480}+3 \equiv 0 \pmod {3^{479}+1}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Numbers defined by linear recurrences, such as the [[Fibonacci number|Fibonacci]] and [[Lucas number|Lucas]] numbers, also have SNFS polynomials, but these are a little more difficult to construct. For example, &amp;lt;math&amp;gt;F_{709}&amp;lt;/math&amp;gt; has polynomial &amp;lt;math&amp;gt;n^5 + 10n^3 + 10n^2 + 10n + 3&amp;lt;/math&amp;gt;, and the value of &#039;&#039;x&#039;&#039; satisfies &amp;lt;math&amp;gt;F_{142} x - F_{141} = 0&amp;lt;/math&amp;gt;.&amp;lt;ref&amp;gt;{{cite web&lt;br /&gt;
  | last = Franke&lt;br /&gt;
  | first = Jens&lt;br /&gt;
  | title = Installation notes for ggnfs-lasieve4&lt;br /&gt;
  | url=http://stuff.mit.edu/afs/sipb/project/pari-gp/ggnfs/Linux/src/lasieve4/INSTALL.and.USE&lt;br /&gt;
  | publisher =[[MIT]] Massachusetts Institute of Technology}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you already know some factors of a large SNFS-number, you can do the SNFS calculation modulo the remaining part; for the NFSNET example above, 3^479+1 = (4*158071*7167757*7759574882776161031) times a 197-digit composite number (the small factors were removed by [[elliptic curve method|ECM]]), and the SNFS was performed modulo the 197-digit number.  The number of relations required by SNFS still depends on the size of the large number, but the individual calculations are quicker modulo the smaller number.&lt;br /&gt;
&lt;br /&gt;
==Limitations of algorithm==&lt;br /&gt;
&lt;br /&gt;
This algorithm, as mentioned above, is very efficient for numbers of the form &#039;&#039;r&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;e&#039;&#039;&amp;lt;/sup&amp;gt;&amp;amp;plusmn;&#039;&#039;s&#039;&#039;, for &#039;&#039;r&#039;&#039; and &#039;&#039;s&#039;&#039; relatively small. It is also efficient for any integers which can be represented as a polynomial with small coefficients.  This includes integers of the more general form &#039;&#039;a&#039;&#039;&#039;&#039;r&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;e&#039;&#039;&amp;lt;/sup&amp;gt;&amp;amp;plusmn;&#039;&#039;b&#039;&#039;&#039;&#039;s&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;f&#039;&#039;&amp;lt;/sup&amp;gt;, and also for many integers whose binary representation has low Hamming weight.  The reason for this is as follows: The Number Field Sieve performs sieving in two different fields.&lt;br /&gt;
The first field is usually the rationals. The second is a higher degree field.  The efficiency of the algorithm strongly depends on the norms of certain elements in these fields.  When an integer can be represented as a polynomial with small coefficients, the norms that arise are much smaller than those that arise when an integer is represented by a general polynomial.  The reason is that a general polynomial will have much larger coefficients, and the norms will be correspondingly larger.  The algorithm attempts to factor these norms over a fixed set of prime numbers.  When the&lt;br /&gt;
norms are smaller, these numbers are more likely to factor.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[General number field sieve]]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
==Further reading==&lt;br /&gt;
*{{Citation |last=Byrnes |first=Steven |lastauthoramp= |date=May 18, 2005 |title=The Number Field Sieve |journal=Math 129 |volume= |issue= |pages= |url=http://modular.fas.harvard.edu/129-05/final_papers/Steve_Byrnes.pdf |issn= }}&lt;br /&gt;
*{{Citation |doi=10.1090/S0025-5718-1993-1182953-4 |last=Lenstra |first=A. K. |authorlink=Arjen Lenstra |last2=Lenstra |first2=H. W., Jr. |authorlink2=Hendrik Lenstra |last3=Manasse |first3=M. S. |last4=Pollard |first4=J. M. |lastauthoramp=yes |year=1993 |title=The Factorization of the Ninth Fermat Number |journal=Mathematics of Computation |volume=61 |issue=203 |pages=319–349 |url=http://www.std.org/~msm/common/f9paper.ps |issn= }}&lt;br /&gt;
*{{citation |editor-last=Lenstra |editor-first=A. K. |editor2-last=Lenstra |editor2-first=H. W., Jr. |title=The Development of the Number Field Sieve |series=Lecture Notes in Mathematics |volume=1554 |year=1993 |publisher=Springer-Verlag |location=New York |isbn=3-540-57013-6 |pages= |url= }}&lt;br /&gt;
*{{citation |last=Silverman |first=Robert D.  |title=Optimal Parameterization of SNFS |journal=J. Mathematical Cryptology |volume=1 |year=2007 |publisher=de Gruyter  |pages= 105–124 |doi=10.1515/JMC.2007.007}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* http://www.nfsnet.org/&lt;br /&gt;
&lt;br /&gt;
{{number theoretic algorithms}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Integer factorization algorithms]]&lt;/div&gt;</summary>
		<author><name>49.249.130.152</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Plug_flow_reactor_model&amp;diff=11799</id>
		<title>Plug flow reactor model</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Plug_flow_reactor_model&amp;diff=11799"/>
		<updated>2013-12-04T16:15:35Z</updated>

		<summary type="html">&lt;p&gt;49.249.199.48: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{for|a more general mathematical discussion|Conjugate variables}}&lt;br /&gt;
{{Thermodynamics|cTopic=[[List of thermodynamic properties|System properties]]}}&lt;br /&gt;
&lt;br /&gt;
In [[thermodynamics]], the [[internal energy]] of a system is expressed in terms of pairs of &#039;&#039;&#039;conjugate variables&#039;&#039;&#039; such as temperature and entropy or pressure and volume. In fact, all [[thermodynamic potential]]s are expressed in terms of conjugate pairs.&lt;br /&gt;
&lt;br /&gt;
For a mechanical system, a small increment of energy is the product of a force times a small displacement. A similar situation exists in thermodynamics. An increment in the energy of a thermodynamic system can be expressed as the sum of the products of certain [[Generalized force|generalized &amp;quot;forces&amp;quot;]] that, when unbalanced, cause certain [[Generalized coordinates|generalized &amp;quot;displacements&amp;quot;]], and the product of the two is the energy transferred as a result. These forces and their associated displacements are called conjugate variables. The thermodynamic force is always an [[intensive variable]] and the displacement is always an [[extensive variable]], yielding an extensive energy transfer. The intensive (force) variable is the derivative of the internal energy with respect to the extensive (displacement) variable, while all other extensive variables are held constant.&lt;br /&gt;
&lt;br /&gt;
The [[thermodynamic square]] can be used as a tool to recall and derive some of the [[thermodynamic potential]]s based on conjugate variables.&lt;br /&gt;
&lt;br /&gt;
In the above description, the product of two conjugate variables yields an energy. In other words, the conjugate pairs are conjugate with respect to energy. In general, conjugate pairs can be defined with respect to any thermodynamic state function. Conjugate pairs with respect to [[Free entropy|entropy]] are often used, in which the product of the conjugate pairs yields an entropy. Such conjugate pairs are particularly useful in the analysis of irreversible processes, as exemplified in the derivation of the [[Onsager reciprocal relations]]. The present article is concerned only with energy-conjugate variables.&lt;br /&gt;
&lt;br /&gt;
== Overview ==&lt;br /&gt;
Just as a small increment of energy in a mechanical system is the product of a force times a small displacement, so an increment in the energy of a thermodynamic system can be expressed as the sum of the products of certain generalized &amp;quot;forces&amp;quot; which, when unbalanced, cause certain generalized &amp;quot;displacements&amp;quot; to occur, with their product being the energy transferred as a result. These forces and their associated displacements are called &#039;&#039;&#039;conjugate variables&#039;&#039;&#039;.&amp;lt;ref name=&amp;quot;Alberty 2001 p1353&amp;quot;&amp;gt;Alberty (2001) p&amp;amp;nbsp;1353&amp;lt;/ref&amp;gt; For example, consider the &#039;&#039;PV&#039;&#039; conjugate pair. The pressure &#039;&#039;P&#039;&#039; acts as a generalized force: Pressure differences force a change in volume &#039;&#039;dV&#039;&#039;, and their product is the energy lost by the system due to work. Here, pressure is the driving force, volume is the associated  displacement, and the two form a pair of conjugate variables. In a similar way, temperature differences drive changes in entropy, and their product is the energy transferred by heat transfer. The thermodynamic force is always an [[intensive variable]] and the displacement is always an [[extensive variable]], yielding an extensive energy. The intensive (force) variable is the derivative of the (extensive) internal energy with respect to the extensive (displacement) variable, with all other extensive variables held constant.&lt;br /&gt;
&lt;br /&gt;
The theory of thermodynamic potentials is not complete until one considers the number of particles in a system as a variable on par with the other extensive quantities such as volume and entropy. The number of particles is, like volume and entropy, the displacement variable in a conjugate pair. The generalized force component of this pair is the [[chemical potential]]. The chemical potential may be thought of as a force which, when imbalanced, pushes an exchange of particles, either with the surroundings, or between phases inside the system. In cases where there are a mixture of chemicals and phases, this is a useful concept. For example, if a container holds liquid water and water vapor, there will be a chemical potential (which is negative) for the liquid which pushes the water molecules into the vapor (evaporation) and a chemical potential for the vapor, pushing vapor molecules into the liquid (condensation). Only when these &amp;quot;forces&amp;quot; equilibrate, and the chemical potential of each phase is equal, is equilibrium obtained.&lt;br /&gt;
&lt;br /&gt;
The most commonly considered conjugate thermodynamic variables are (with corresponding [[SI]] units):&lt;br /&gt;
&lt;br /&gt;
:Thermal parameters:&lt;br /&gt;
:* [[Temperature]]: &#039;&#039;T&#039;&#039;&amp;amp;nbsp; ([[Kelvin|K]])&lt;br /&gt;
:* [[Entropy]]: &#039;&#039;S&#039;&#039;&amp;amp;nbsp; (J K&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
:Mechanical parameters:&lt;br /&gt;
:* [[Pressure]]: &#039;&#039;P&#039;&#039;&amp;amp;nbsp; ([[Pascal (unit)|Pa]]= J m&amp;lt;sup&amp;gt;−3&amp;lt;/sup&amp;gt;)&lt;br /&gt;
:* [[volume (thermodynamics)|Volume]]: &#039;&#039;V&#039;&#039;&amp;amp;nbsp; (m&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt; = J Pa&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
::or, more generally,&lt;br /&gt;
&lt;br /&gt;
:* [[Cauchy stress tensor|Stress]]: &amp;lt;math&amp;gt;\sigma_{ij}\,&amp;lt;/math&amp;gt; ([[Pascal (unit)|Pa]]= J m&amp;lt;sup&amp;gt;−3&amp;lt;/sup&amp;gt;)&lt;br /&gt;
:* Volume &amp;amp;times; [[strain tensor|Strain]]: &amp;lt;math&amp;gt;V\times\varepsilon_{ij}&amp;lt;/math&amp;gt; (m&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt; = J Pa&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
:Material parameters:&lt;br /&gt;
:* [[chemical potential]]: μ (J)&lt;br /&gt;
:* [[particle number]]: &#039;&#039;N&#039;&#039;&amp;amp;nbsp; (particles or mole)&lt;br /&gt;
&lt;br /&gt;
For a system with different types &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; of particles, a small change in the internal energy is given by:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mathrm{d}U = T\mathrm{d}S - P\mathrm{d}V + \sum_i \mu_i \mathrm{d}N_i\,,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &#039;&#039;U&#039;&#039; is internal energy, &#039;&#039;T&#039;&#039; is temperature, &#039;&#039;S&#039;&#039; is entropy, &#039;&#039;P&#039;&#039; is pressure, &#039;&#039;V&#039;&#039; is volume, &amp;lt;math&amp;gt;\mu_i&amp;lt;/math&amp;gt; is the chemical potential of the &#039;&#039;i&#039;&#039;-th particle type, and &amp;lt;math&amp;gt;N_i&amp;lt;/math&amp;gt; is the number of &#039;&#039;i&#039;&#039;-type particles in the system. &lt;br /&gt;
&lt;br /&gt;
Here, the temperature, pressure, and chemical potential are the generalized forces, which drive the generalized changes in entropy, volume, and particle number respectively. These parameters all affect the [[internal energy]] of a thermodynamic system. A small change &amp;lt;math&amp;gt;\mathrm{d}U&amp;lt;/math&amp;gt; in the internal energy of the system is given by the sum of the flow of energy across the boundaries of the system due to the corresponding conjugate pair. These concepts will be expanded upon in the following sections.&lt;br /&gt;
&lt;br /&gt;
While dealing with processes in which systems exchange matter or energy, classical thermodynamics is not concerned with the [[derivative|rate]] at which such processes take place, termed [[Kinetics (physics)|kinetics]]. For this reason, the term &#039;&#039;thermodynamics&#039;&#039; is usually used synonymously with &#039;&#039;equilibrium thermodynamics&#039;&#039;. A central notion for this connection is that of [[quasistatic process]]es, namely idealized, &amp;quot;infinitely slow&amp;quot; processes. Time-dependent thermodynamic processes far away from equilibrium are studied by [[non-equilibrium thermodynamics]]. This can be done through linear or non-linear analysis of [[irreversible process]]es, allowing systems near and far away from equilibrium to be studied, respectively.&lt;br /&gt;
&lt;br /&gt;
== Pressure/volume and stress/strain pairs ==&lt;br /&gt;
&lt;br /&gt;
As an example, consider the PV conjugate pair. The [[pressure]] acts as a generalized force – pressure differences force a change in [[volume (thermodynamics)|volume]], and their product is the energy lost by the system due to [[mechanical work]]. Pressure is the driving force, volume is the associated displacement, and the two form a pair of conjugate variables.&lt;br /&gt;
&lt;br /&gt;
The above holds true only for non-viscous fluids. In the case of [[viscosity|viscous fluids]], [[Plasticity (physics)|plastic]] and [[Elasticity (physics)|elastic]] solids, the pressure force is generalized to the [[stress tensor]], and changes in volume are generalized to the volume multiplied by the [[strain tensor]] {{harv|Landau|Lifshitz|1986}}. These then form a conjugate pair.  If &amp;lt;math&amp;gt;\sigma_{ij}&amp;lt;/math&amp;gt; is the &#039;&#039;ij&#039;&#039; component of the stress tensor, and &amp;lt;math&amp;gt;\varepsilon_{ij}&amp;lt;/math&amp;gt; is the &#039;&#039;ij&#039;&#039; component of the strain tensor, then the mechanical work done as the result of a stress-induced infinitesimal strain  &amp;lt;math&amp;gt;d\varepsilon_{ij}&amp;lt;/math&amp;gt; is:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\delta w = -V\sum_{ij}\sigma_{ij}d\varepsilon_{ij}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
or, using [[Einstein notation]] for the tensors, in which repeated indices are assumed to be summed:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\delta w = -V\sigma_{ij}d\varepsilon_{ij}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In the case of pure compression (i.e. no shearing forces), the stress tensor is simply the negative of the pressure times the [[Kronecker delta|unit tensor]] so that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\delta w = -V\,(-P\delta_{ij})\,d\varepsilon_{ij}=PVd\varepsilon_{kk}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The [[Trace (linear algebra)|trace]] of the strain tensor (&amp;lt;math&amp;gt;\varepsilon_{kk}&amp;lt;/math&amp;gt;) is just the fractional change in volume so that the above reduces to &amp;lt;math&amp;gt;\delta w = PdV&amp;lt;/math&amp;gt; as it should.&lt;br /&gt;
&lt;br /&gt;
== Temperature/entropy pair ==&lt;br /&gt;
&lt;br /&gt;
In a similar way, [[temperature]] differences drive changes in [[entropy]], and their product is the energy transferred by [[heat]]ing. Temperature is the driving force, entropy is the associated displacement, and the two form a pair of conjugate variables. The temperature/entropy pair of conjugate variables is the only &#039;&#039;&#039;heat&#039;&#039;&#039; term; the other terms are essentially all various forms of &#039;&#039;&#039;work&#039;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
== Chemical potential/particle number pair ==&lt;br /&gt;
&lt;br /&gt;
The [[chemical potential]] is like a force which pushes an increase in [[particle number]]. In cases where there are a mixture of chemicals and phases, this is a useful concept. For example, if a container holds water and water vapor, there will be a chemical potential (which is negative) for the liquid, pushing water molecules into the vapor (evaporation) and a chemical potential for the vapor, pushing vapor molecules into the liquid (condensation). Only when these &amp;quot;forces&amp;quot; equilibrate is equilibrium obtained.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Generalized coordinate]] and [[generalized force]]: analogous conjugate variable pairs found in classical mechanics.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
* {{cite journal&lt;br /&gt;
 | author=Alberty, R. A.&lt;br /&gt;
 | url = http://www.iupac.org/publications/pac/2001/pdf/7308x1349.pdf&lt;br /&gt;
 | title = Use of Legendre transforms in chemical thermodynamics&lt;br /&gt;
 | journal=Pure Appl. Chem.&lt;br /&gt;
 | year=2001 | volume= 73 | issue=8 | pages=1349–1380&lt;br /&gt;
 | doi = 10.1351/pac200173081349&lt;br /&gt;
 }}&lt;br /&gt;
* {{cite book&lt;br /&gt;
 | author=Lewis, Gilbert Newton; Randall, Merle: Revised by Pitzer, Kenneth S. &amp;amp; Brewer, Leo&lt;br /&gt;
 | title=Thermodynamics&lt;br /&gt;
 | publisher= McGraw-Hill Book Co.&lt;br /&gt;
 | location = New York, NY USA&lt;br /&gt;
 | edition=2nd&lt;br /&gt;
 | year=1961&lt;br /&gt;
 | isbn =0-07-113809-9&lt;br /&gt;
 }}&lt;br /&gt;
* {{cite book&lt;br /&gt;
 | last1 = Landau&lt;br /&gt;
 | first1 = L. D.&lt;br /&gt;
 | authorlink1 = Lev Landau&lt;br /&gt;
 | last2 = Lifshitz&lt;br /&gt;
 | first2 = E. M. &lt;br /&gt;
 | authorlink2 = Evgeny Lifshitz&lt;br /&gt;
 | others = (Translated from Russian by  J.B. Sykes and W.H. Reid)&lt;br /&gt;
 | year = 1986&lt;br /&gt;
 | title = Theory of Elasticity (Course of Theoretical Physics Volume 7)&lt;br /&gt;
 | edition = Third&lt;br /&gt;
 | publisher = Butterworth Heinemann&lt;br /&gt;
 | location = Boston, MA &lt;br /&gt;
 | isbn = 0-7506-2633-X&lt;br /&gt;
 | ref = harv&lt;br /&gt;
 }}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Conjugate Variables (Thermodynamics)}}&lt;br /&gt;
[[Category:Thermodynamics]]&lt;/div&gt;</summary>
		<author><name>49.249.199.48</name></author>
	</entry>
</feed>