n.

錯乱、混乱、撹乱、乱れ

関: (vt.)derange 乱す、混乱させる; confound、confuse、confusion、derange、disarray、disorder、disorganized、disorient、disrupt、disruption、disturbance、perturb、perturbation、upset

WordNet

a state of mental disturbance and disorientation (同)mental unsoundness, unbalance
used of an unexpected defeat of a team favored to win; "the Bills upset victory over the Houston Oilers"
the act of disturbing the mind or body; "his carelessness could have caused an ecological upset"; "she was unprepared for this sudden overthrow of their normal way of living" (同)derangement, overthrow
the act of upsetting something; "he was badly bruised by the upset of his sled at a high speed" (同)overturn, turnover
a tool used to thicken or spread metal (the end of a bar or a rivet etc.) by forging or hammering or swaging (同)swage
cause to lose ones composure (同)discompose, untune, disconcert, discomfit
defeat suddenly and unexpectedly; "The foreign team upset the local team"
disturb the balance or stability of; "The hostile talks upset the peaceful relations between the two countries"
mildly physically distressed; "an upset stomach"
be confusing or perplexing to; cause to be unable to think clearly; "These questions confuse even the experts"; "This question completely threw me"; "This question befuddled even the teacher" (同)throw, fox, befuddle, fuddle, bedevil, confound, discombobulate
make unclear, indistinct, or blurred; "Her remarks confused the debate"; "Their words obnubilate their intentions" (同)blur, obscure, obnubilate
mistake one thing for another; "you are confusing me with the other candidate"; "I mistook her for the secretary" (同)confound
cause to feel embarrassment; "The constant attention of the young man confused her" (同)flurry, disconcert, put off
a disorderly outburst or tumult; "they were amazed by the furious disturbance they had caused" (同)disruption, commotion, flutter, hurly burly, to-do, hoo-ha, hoo-hah, kerfuffle
an unhappy and worried mental state; "there was too much anger and disturbance"; "she didnt realize the upset she caused me" (同)perturbation, upset
the act of disturbing something or someone; setting something in motion
disturb or interfere with the usual path of an electron or atom; "The electrons were perturbed by the passing ion"
throw into great confusion or disorder; "Fundamental Islamicists threaten to perturb the social order in Algeria and Egypt" (同)derange, throw out of kilter
disturb in mind or make uneasy or cause to be worried or alarmed; "She was rather perturbed by the news that her father was seriously ill" (同)unhinge, disquiet, trouble, cark, distract, disorder
cause a celestial body to deviate from a theoretically regular orbital motion, especially as a result of interposed or extraordinary gravitational pull; "The orbits of these stars were perturbed by the passings of a comet"
(physics) a secondary influence on a system that causes it to deviate slightly
a disposition that is confused or nervous and upset (同)fluster
activity that is a malfunction, intrusion, or interruption; "the term `distress connotes some degree of perturbation and emotional upset"; "he looked around for the source of the disturbance"; "there was a disturbance of neural function" (同)disturbance

PrepTutorEJDIC

精神錯乱,狂気 / 乱すこと,乱れ,混乱
『…‘を'ひっくり返す』,転覆させる / 〈計画など〉‘を'『だめにする』,だいなしにする,狂わす / 〈人〉‘の'『心お乱す』,'を'ろうばいさせる / 〈体など〉‘の'調子お狂わせる / 《米》(競技などで)〈相手〉'を'思いがけなく負かす / ひっくり返った / (計画などが)だいなしの,狂った / 《捕語にのみ用いて》(精神的に)混乱した,ろうばいした / (体などの)調子がおかしくなった / 〈U〉〈C〉『転倒』,転落 / 〈C〉(計画.心などの)『混乱』,乱れ;(体の)不調 / 〈C〉《話》けんか / 〈C〉《米》(競技などでの)番狂わせ
(…と)'を'『混同する』,取り違える《+『名』+『with』+『名』》 / 〈人〉'を'『とまどわせる』,当惑させる / 〈論点・情況・順序など〉'を'混乱させる
〈U〉乱す(騒がす,妨害する)こと;乱れた状態 / 〈C〉騒ぎ,騒動,動乱 / 〈C〉乱す(騒がす,妨害する)もの
〈人・人の心〉‘を'非常に不安にさせる(心配させる)
〈U〉動揺,不安;混乱 / 〈C〉不安(混乱)のもと

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2014/01/02 00:34:44」(JST)

wiki en

[Wiki en表示]

For the psychological condition, see psychosis.

Number of possible permutations and derangements of n elements. n! (n factorial) is the number of n-permutations; !n (n subfactorial) is the number of derangements — n-permutations where all of the n elements change their initial places.

Table of values
	Permutations,	Derangements,
0	1 =1×10⁰	1 =1×10⁰	= 1
1	1 =1×10⁰	0	= 0
2	2 =2×10⁰	1 =1×10⁰	= 0.5
3	6 =6×10⁰	2 =2×10⁰	≈0.33333 33333
4	24 =2.4×10¹	9 =9×10⁰	= 0.375
5	120 =1.20×10²	44 =4.4×10¹	≈0.36666 66667
6	720 =7.20×10²	265 =2.65×10²	≈0.36805 55556
7	5 040 ≈5.04×10³	1 854 ≈1.85×10³	≈0.36785 71429
8	40 320 ≈4.03×10⁴	14 833 ≈1.48×10⁴	≈0.36788 19444
9	362 880 ≈3.63×10⁵	133 496 ≈1.33×10⁵	≈0.36787 91887
10	3 628 800 ≈3.63×10⁶	1 334 961 ≈1.33×10⁶	≈0.36787 94643
11	39 916 800 ≈3.99×10⁷	14 684 570 ≈1.47×10⁷	≈0.36787 94392
12	479 001 600 ≈4.79×10⁸	176 214 841 ≈1.76×10⁸	≈0.36787 94413
13	6 227 020 800 ≈6.23×10⁹	2 290 792 932 ≈2.29×10⁹	≈0.36787 94412
14	87 178 291 200 ≈8.72×10¹⁰	32 071 101 049 ≈3.21×10¹⁰	≈0.36787 94412
15	1 307 674 368 000 ≈1.31×10¹²	481 066 515 734 ≈4.81×10¹¹	≈0.36787 94412
16	20 922 789 888 000 ≈2.09×10¹³	7 697 064 251 745 ≈7.70×10¹²	≈0.36787 94412
17	355 687 428 096 000 ≈3.56×10¹⁴	130 850 092 279 664 ≈1.31×10¹⁴	≈0.36787 94412
18	6 402 373 705 728 000 ≈6.40×10¹⁵	2 355 301 661 033 953 ≈2.36×10¹⁵	≈0.36787 94412
19	121 645 100 408 832 000 ≈1.22×10¹⁷	44 750 731 559 645 106 ≈4.48×10¹⁶	≈0.36787 94412
20	2 432 902 008 176 640 000 ≈2.43×10¹⁸	895 014 631 192 902 121 ≈8.95×10¹⁷	≈0.36787 94412
21	51 090 942 171 709 440 000 ≈5.11×10¹⁹	18 795 307 255 050 944 540 ≈1.88×10¹⁹	≈0.36787 94412
22	1 124 000 727 777 607 680 000 ≈1.12×10²¹	413 496 759 611 120 779 881 ≈4.13×10²⁰	≈0.36787 94412
23	25 852 016 738 884 976 640 000 ≈2.59×10²²	9 510 425 471 055 777 937 262 ≈9.51×10²¹	≈0.36787 94412
24	620 448 401 733 239 439 360 000 ≈6.20×10²³	228 250 211 305 338 670 494 289 ≈2.28×10²³	≈0.36787 94412
25	15 511 210 043 330 985 984 000 000 ≈1.55×10²⁵	5 706 255 282 633 466 762 357 224 ≈5.71×10²⁴	≈0.36787 94412
26	403 291 461 126 605 635 584 000 000 ≈4.03×10²⁶	148 362 637 348 470 135 821 287 825 ≈1.48×10²⁶	≈0.36787 94412
27	10 888 869 450 418 352 160 768 000 000 ≈1.09×10²⁸	4 005 791 208 408 693 667 174 771 274 ≈4.01×10²⁷	≈0.36787 94412
28	304 888 344 611 713 860 501 504 000 000 ≈3.05×10²⁹	112 162 153 835 443 422 680 893 595 673 ≈1.12×10²⁹	≈0.36787 94412
29	8 841 761 993 739 701 954 543 616 000 000 ≈8.84×10³⁰	3 252 702 461 227 859 257 745 914 274 516 ≈3.25×10³⁰	≈0.36787 94412
30	265 252 859 812 191 058 636 308 480 000 000 ≈2.65×10³²	97 581 073 836 835 777 732 377 428 235 481 ≈9.76×10³¹	≈0.36787 94412

In combinatorial mathematics, a derangement is a permutation of the elements of a set such that none of the elements appear in their original position.

The numbers of derangements !n for sets of size n are called "de Montmort numbers" or "derangement numbers" (and can be generalized to rencontres numbers); the subfactorial function (not to be confused with the factorial n!) maps n to !n.^[1] No standard notation for subfactorials is agreed upon, and n¡ is sometimes used instead of !n.^[2]

The problem of counting derangements was first considered by Pierre Raymond de Montmort^[3] in 1708; he solved it in 1713, as did Nicholas Bernoulli at about the same time.

Example[edit]

Suppose that a professor has had 4 of his students – student A, student B, student C, and student D - take a test and wants to let his students grade each other's tests. Of course, no student should grade his or her own test. How many ways could the professor hand the tests back to the students for grading, such that no student received his or her own test back? Out of 24 possible permutations (4!) for handing back the tests, there are only 9 derangements:

BADC, BCDA, BDAC,

CADB, CDAB, CDBA,

DABC, DCAB, DCBA.

In every other permutation of this 4-member set, at least one student gets his or her own test back.

Another version of the problem arises when we ask for the number of ways n letters, each addressed to a different person, can be placed in n pre-addressed envelopes so that no letter appears in the correctly addressed envelope.

Counting derangements[edit]

Suppose that there are n persons numbered 1, 2, ..., n. Let there be n hats also numbered 1, 2, ..., n. We have to find the number of ways in which no one gets the hat having same number as his/her number. Let us assume that the first person takes hat i. There are n − 1 ways for the first person to make such a choice. There are now two possibilities, depending on whether or not person i takes hat 1 in return:

Person i does not take the hat 1. This case is equivalent to solving the problem with n − 1 persons n − 1 hats: each of the remaining n − 1 people has precisely 1 forbidden choice from among the remaining n − 1 hats (i's forbidden choice is hat 1).
Person i takes the hat 1. Now the problem reduces to n − 2 persons and n − 2 hats.

From this, the following relation is derived:

with the starting values !0 = 1 and !1 = 0.

Notice that this same recurrence formula also works for factorials with different starting values. That is 0! = 1, 1! = 1 and

which is helpful in proving the limit relationship with e below.

Also, the following formulas are known:^[4]

Where [x] is the nearest integer function.

where is the floor function. The following recurrence relationship also holds:^[5]

Starting with n = 0, the numbers of derangements of n are:

1, 0, 1, 2, 9, 44, 265, 1854, 14833, 133496, 1334961, 14684570, 176214841, 2290792932, ... (sequence A000166 in OEIS).

These numbers are also called subfactorial or rencontres numbers.

Perhaps a more well-known method of counting derangements uses the inclusion-exclusion principle.

Limit of ratio of derangement to permutation as n approaches ∞[edit]

Using this recurrence, it can be shown that, in the limit,

This is the limit of the probability p_n = d_n/n! that a randomly selected permutation is a derangement. The probability converges to this limit quickly as n increases. The above semi-log graph shows that the derangement graph lags the permutation graph by an almost constant value.

More information about this calculation and the above limit may be found in the article on the statistics of random permutations.

Generalizations[edit]

The problème des rencontres asks how many permutations of a size-n set have exactly k fixed points.

Derangements are an example of the wider field of constrained permutations. For example, the ménage problem asks if n opposite-sex couples are seated man-woman-man-woman-... around a circular table, how many ways can they be seated so that nobody is seated next to his or her partner?

More formally, given sets A and S, and some sets U and V of surjections A → S, we often wish to know the number of pairs of functions (f, g) such that f is in U and g is in V, and for all a in A, f(a) ≠ g(a); in other words, where for each f and g, there exists a derangement φ of S such that f(a) = φ(g(a)).

Another generalization is the following problem:

How many anagrams with no fixed letters of a given word are there?

For instance, for a word made of only two different letters, say n letters A and m letters B, the answer is, of course, 1 or 0 according whether n = m or not, for the only way to form an anagram without fixed letters is to exchange all the A with B, which is possible if and only if n = m. In the general case, for a word with n₁ letters X₁, n₂ letters X₂, ..., n_r letters X_r it turns out (after a proper use of the inclusion-exclusion formula) that the answer has the form:

for a certain sequence of polynomials P_n, where P_n has degree n. But the above answer for the case r = 2 gives an orthogonality relation, whence the P_n's are the Laguerre polynomials (up to a sign that is easily decided).^[6]

Computational complexity[edit]

It is NP-complete to determine whether a given permutation group (described by a given set of permutations that generate it) contains any derangements.^[7]

References[edit]

^ The name "subfactorial" originates with William Allen Whitworth; see Cajori, Florian (2011), A History of Mathematical Notations: Two Volumes in One, Cosimo, Inc., p. 77, ISBN 9781616405717 .
^ Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics (1994), Addison–Wesley, Reading MA. ISBN 0-201-55802-5
^ de Montmort, P. R. (1708). Essay d'analyse sur les jeux de hazard. Paris: Jacque Quillau. Seconde Edition, Revue & augmentée de plusieurs Lettres. Paris: Jacque Quillau. 1713.
^ Hassani, M. "Derangements and Applications." J. Integer Seq. 6, No. 03.1.2, 1–8, 2003
^ See the notes for (sequence A000166 in OEIS).
^ Even, S.; J. Gillis (1976). "Derangements and Laguerre polynomials". Mathematical Proceedings of the Cambridge Philosophical Society 79 (01): 135–143. doi:10.1017/S0305004100052154. Retrieved 27 December 2011. Cite uses deprecated parameters (help)
^ Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism", SIAM Journal on Computing 10 (1): 11–21, doi:10.1137/0210002, MR 605600 . Babai, László (1995), "Automorphism groups, isomorphism, reconstruction", Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 1447–1540, MR 1373683, "A surprising result of Anna Lubiw asserts that the following problem is NP-complete: Does a given permutation group have a fixed-point-free element?" .

External links[edit]

Baez, John (2003). "Let's get deranged!".
Bogart, Kenneth P. and Doyle, Peter G. (1985). "Non-sexist solution of the ménage problem".
Dickau, Robert M. "Derangement diagrams". Figures Using Mathematica.
Hassani, Mehdi. "Derangements and Applications". Journal of Integer Sequences (JIS), Volume 6, Issue 1, Article 03.1.2, 2003.
Weisstein, Eric W. "Derangement". MathWorld–A Wolfram Web Resource.
Debra K. Borkovitz. "Derangements and the Inclusion-Exclusion Principle". Articles, Associate Professor of Mathematics, Wheelock College.

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

1. 小児におけるショックの生理学および分類 physiology and classification of shock in children
2. 膝窩（ベーカー）嚢腫 popliteal bakers cyst
3. X連鎖重度複合型免疫不全（SCID） x linked severe combined immunodeficiency scid
4. Overview of monoarthritis in adults
5. 関節血腫 hemarthrosis

English Journal

Alzheimer's as a Systems-Level Disease Involving the Interplay of Multiple Cellular Networks.

Castrillo JI1, Oliver SG.
Methods in molecular biology (Clifton, N.J.).Methods Mol Biol.2016;1303:3-48. doi: 10.1007/978-1-4939-2627-5_1.
Alzheimer's disease (AD), and many neurodegenerative disorders, are multifactorial in nature. They involve a combination of genomic, epigenomic, interactomic and environmental factors. Progress is being made, and these complex diseases are beginning to be understood as having their origin in altered
PMID 26235058

Look beyond Catechol-O-Methyltransferase genotype for cathecolamines derangement in migraine: the BioBIM rs4818 and rs4680 polymorphisms study.

De Marchis ML1, Barbanti P, Palmirotta R, Egeo G, Aurilia C, Fofi L, Piroso S, Ialongo C, Della-Morte D, D'Andrea G, Ferroni P, Guadagni F.
The journal of headache and pain.J Headache Pain.2015 Dec;16:520. doi: 10.1186/s10194-015-0520-x. Epub 2015 Apr 30.
BACKGROUND: The study of COMT gene polymorphisms in migraine could be of particular interest since impaired catecholaminergic neurotransmission, namely chronic dopaminergic and noradrenergic hypofunction, is a peculiar migraine trait. In this study, for the first time, we focused on the role of COMT
PMID 25929431

Impact of type of intervention for aortic valve replacement on heart rate variability.

Compostella L1, Russo N2, Compostella C3, Setzu T4, D'Onofrio A5, Isabella G5, Tarantini G5, Iliceto S5, Gerosa G5, Bellotto F2.
International journal of cardiology.Int J Cardiol.2015 Oct 15;197:11-5. doi: 10.1016/j.ijcard.2015.06.004. Epub 2015 Jun 14.
BACKGROUND: It is known that coronary heart surgery leads to varying degrees of cardiac autonomic derangement, clinically detectable as depression of heart rate variability (HRV) parameters. Few studies report that also surgical replacement of the aortic valve (SAVR) may lead to HRV abnormalities, w
PMID 26113470

Metabolic comorbidities in Cushing's syndrome.

Ferraù F1, Korbonits M2.
European journal of endocrinology / European Federation of Endocrine Societies.Eur J Endocrinol.2015 Oct;173(4):M133-57. doi: 10.1530/EJE-15-0354. Epub 2015 Jun 9.
Cushing's syndrome (CS) patients have increased mortality primarily due to cardiovascular events induced by glucocorticoid (GC) excess-related severe metabolic changes. Glucose metabolism abnormalities are common in CS due to increased gluconeogenesis, disruption of insulin signalling with reduced g
PMID 26060052