Search results
Jump to navigation
Jump to search
Page title matches
- ...De Broglie revolutionized quantum mechanics by producing the equation for matter waves. == Wavelength of Matter == ...2 KB (229 words) - 10:27, 15 May 2017
Page text matches
- ...De Broglie revolutionized quantum mechanics by producing the equation for matter waves. == Wavelength of Matter == ...2 KB (229 words) - 10:27, 15 May 2017
- ...er in a certain amount of volume has high density. An object with a little matter in the same amount of volume has a low density. ...ty decreases because the atoms are moving all around the place having less matter in one space. When the temperature of a substance decreases, the density i ...2 KB (343 words) - 11:27, 23 April 2017
- Xenon difluoride is [[solid]] in [[states of matter|state of matter]]. It is achromatic (without color) and in [[crystal]] form. Under high [[p ...\frac{kJ}{mol}</math>). That is because the reaction changes the state of matter from [[solid]] to [[gas]]. The gas needs more space in room. ...1 KB (209 words) - 21:15, 31 August 2017
- ...f [[antiparticle]]s. These have the same [[mass]] as particles of ordinary matter but have opposite [[charge]] and properties, such as [[lepton]] and [[baryo ...peed of light is such a big number, this means that even a small amount of matter can have a lot of energy (it has been projected to be 4 times more effectiv ...5 KB (898 words) - 00:12, 25 April 2016
- ...ative property''' of addition and multiplication tells us that it does not matter which number we add first, or multiply first. We will still get the same an ...<math>2+3</math> and <math>3+2</math> are both <math>5</math>. It doesn't matter whether the <math>2</math> or the <math>3</math> comes first. 2+3=3+2 is th ...1 KB (203 words) - 10:32, 6 October 2016
- ...Associativity of Addition'': When addition is done many times, it does not matter how it is grouped, the result will be the same. * ''[[Commutativity of addition]]'': When addition is done, it does not matter which element is on the right and left, the result will be the same. ...4 KB (740 words) - 01:36, 21 August 2017
- ...sociative operator (like +) in a row, the [[order of operations]] does not matter. ...1 KB (141 words) - 07:08, 3 February 2017
- ...s attraction" is another word for gravity, a force that exists between all matter. [[Category:Matter]] ...3 KB (496 words) - 11:10, 5 July 2017
- ...', describes the probability of finding an [[electron]] somewhere in its [[matter wave]]. To be more precise, the ''square'' of the wave function gives the p ...1 KB (187 words) - 14:02, 12 November 2014
- ...nd cannot travel through a [[vacuum]], which is a space without any air or matter. The speed of sound is affected by temperature. It travels slower at low [ ...1 KB (189 words) - 21:16, 20 March 2017
- To make matters even more confusing, [[Louis de Broglie]] suggested that matter might act the same way. Scientists then performed these same experiments w ...t ways by so many different people that scientists simply accept that both matter and light are somehow both waves and particles. Scientists generally admit ...4 KB (642 words) - 19:51, 24 November 2016
- ...mbers are taken, there will always be a third real number between them, no matter how close together the first two numbers are. ...6 KB (971 words) - 01:36, 21 August 2017
- ...not believed to be affected by electromagnetism. This would mean that dark matter does not have a charge, and does not give off light. ...4 KB (665 words) - 07:41, 25 June 2017
- ...at <math>x_0</math>, then for every value of <math>\varepsilon>0</math> no matter how small it is, there is a value of <math>\delta > 0</math>, so that whene ...2 KB (290 words) - 06:16, 8 October 2016
- ...': When the operation is used twice to combine three elements, it does not matter in what order they are done, because the answer will be the same. ...y element for this group is zero. Because the order of additions does not matter (or in other words, <math>a + (b + c) = (a + b) + c</math>), associativity ...6 KB (1,063 words) - 03:41, 3 March 2017
- ...e sets include all sets with a [[finite set|finite]] number of members, no matter how many. ...2 KB (379 words) - 14:57, 30 April 2017
- ...e digits repeat, but they never start repeating in an infinite pattern, no matter how far you go to the right of the decimal point. ...3 KB (465 words) - 01:36, 21 August 2017
- ...e number 1]] (one) can be written. Even though it is written like this, no matter how many [[9 (number)|nines]] there are before the [[ellipsis]], it is stil ...3 KB (505 words) - 16:43, 25 May 2017
- ...her across than A, and call its horizontal position ''x + h''. It does not matter how much ''h'' is, it is a very small number. ...e system, mathematicians have worked out rules which work all the time, no matter which function is being looked at. ('''Note''': here, <math>u</math> and <m ...8 KB (1,490 words) - 13:48, 21 June 2017
- ...r to cause density fluctuations. The places of higher density later caused matter to clump in those locations and form large-scale objects. ...3 KB (494 words) - 23:28, 18 October 2015
- ...is 2×2, or 4. If we want to know the 100-th number, it's 2×100, or 200. No matter which thing in the sequence we want, the rule can tell us what it is. ...3 KB (446 words) - 14:46, 31 December 2015
- ...cardinality <math>c</math>. Find a proper bound on <math>c</math> that no matter how to partition the <math>V</math> into <math>V_1, V_2,\cdots, V_n</math>, ...3 KB (592 words) - 14:37, 19 April 2010
- ...ht moves away from you at 1 c... or is it 1.5 c? It ends up that c is c no matter what. The next section explains why it's not c - 0.5c. ...3 KB (527 words) - 04:29, 31 March 2017
- ...apped around. In other words, the order of the terms in an equation do not matter. When the operator of two terms is an addition, the 'commutative property o ...erty of addition implies that, when adding three or more terms, it doesn't matter how these terms are grouped. Algebraically, this gives <math>a + (b + c) = ...13 KB (2,204 words) - 07:13, 30 July 2017
- ...[[electron]] and one [[neutrino]]. Since neutrinos rarely interact with [[matter]], we can ignore them from now on. The electron is propelled out of the [[a ...4 KB (754 words) - 04:34, 20 August 2017
- ...this simple problem, the answer is "yes" when we have 6 or more points, no matter how the lines are colored. But when we have 5 points or fewer, we can color ...5 KB (804 words) - 20:06, 6 April 2017
- ...nity is a process that never stops. For example, adding 10 to a number. No matter how many times 10 is added, 10 more can still be added. Actual infinity is ...6 KB (828 words) - 00:07, 11 November 2015
- ...'' of the genes of an individual in the next generation. It doesn't really matter how the genes arrive in the next generation. For an individual, it is equal ...5 KB (696 words) - 14:26, 23 June 2016
- At the [[Matter|physical]] level, simplifying many things: ...5 KB (850 words) - 06:03, 26 June 2016
- For some Markov chains, no matter what the initial distribution is, after running the chain for a while, the ...ath>. So the Markov chain converges to the same stationary distribution no matter what the initial distribution is. ...29 KB (4,888 words) - 09:13, 16 December 2011
- ...ain is just {4}. Namely, ''y''(0)=4, ''y''(−2.7)=4, ''y''(π)=4,.... No matter what value of ''x'' is input, the output is "4". ...7 KB (1,037 words) - 22:13, 9 August 2014
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...24 KB (4,365 words) - 11:50, 5 June 2013
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...25 KB (4,389 words) - 09:05, 12 January 2011
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...25 KB (4,523 words) - 13:54, 27 December 2015
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...25 KB (4,408 words) - 01:20, 10 November 2011
- ...ance with the [[minimum total potential energy principle]], the universe's matter flows towards ever more negative total potential energy. This cosmic flow i ...ntial energy is maximal (''i.e.'', zero), while the total actual energy of matter waves is minimal (''i.e.'', zero). Therefore, at the outset of the universe ...23 KB (3,626 words) - 09:52, 1 September 2017
- ...if the Earth was moving away from that star. However, they noticed that no matter who performed the experiments, where the experiments were performed, or wha ...ts before Einstein had written about light seeming to go the same speed no matter how it was observed. What made Einstein's theory so revolutionary is that i ...15 KB (2,495 words) - 16:23, 9 April 2017
- For some Markov chains, no matter what the initial distribution is, after running the chain for a while, the ...ath>. So the Markov chain converges to the same stationary distribution no matter what the initial distribution is. ...37 KB (6,516 words) - 08:40, 7 June 2010
- ...inct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. These digits are often used with a [[decimal separator]] which i ...7 KB (903 words) - 08:27, 1 October 2016
- For some Markov chains, no matter what the initial distribution is, after running the chain for a while, the ...ath>. So the Markov chain converges to the same stationary distribution no matter what the initial distribution is. ...40 KB (7,046 words) - 08:04, 2 June 2014
- For some Markov chains, no matter what the initial distribution is, after running the chain for a while, the ...ath>. So the Markov chain converges to the same stationary distribution no matter what the initial distribution is. ...40 KB (7,046 words) - 10:00, 13 December 2015
- For some Markov chains, no matter what the initial distribution is, after running the chain for a while, the ...ath>. So the Markov chain converges to the same stationary distribution no matter what the initial distribution is. ...40 KB (7,049 words) - 15:11, 8 June 2013
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...9 KB (1,741 words) - 03:58, 24 July 2011
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...32 KB (5,780 words) - 07:54, 28 November 2019
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...32 KB (5,780 words) - 02:49, 24 November 2016
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...32 KB (5,780 words) - 13:32, 2 December 2017
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...32 KB (5,800 words) - 07:57, 21 May 2014
- ...question is simple, the value of the surface integral will be the same no matter what parametrization one uses. ...10 KB (1,551 words) - 10:37, 24 June 2017
- ...''apple'' with ''sun'', and ''orange'' with ''moon''. The order does not matter. It is possible to pair the elements, and none is left out. But the set < ...10 KB (1,884 words) - 16:03, 30 June 2015
- ...such that many packets have to be delivered through the same edge, thus no matter what queuing policy is used, the maximum delay must be very high. ...12 KB (2,110 words) - 02:55, 19 July 2011
- ...e cannot know both of them about any [[particle]] (a very small thing), no matter how hard we try. The more we learn about one of such a pair, the less we ca Everything made of [[matter]] is attracted to other matter because of a fundamental force called [[gravity]]. Einstein's theory that e ...36 KB (5,991 words) - 08:00, 24 August 2017
- First, it is trivial to see that the theorem holds for <math>k=1</math> (no matter whether shifted). Next, we show that the theorem holds when <math>n=2k</math> (no matter whether shifted). For any <math>S\in{X\choose k}</math>, both <math>S</math ...50 KB (8,991 words) - 12:23, 21 May 2023
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...15 KB (2,698 words) - 02:36, 12 March 2023
- ...lity tests is to predict difficulty; writing better prose is quite another matter. As discussed in [[prose difficulty]], sentence length is an index of [[syn ...11 KB (1,581 words) - 08:33, 13 September 2015
- ...) The tiny but pesky differences between results were going to remain, not matter how much Heisenberg wished they would go away. ...inty principle depended on a model that did not consider that particles of matter such as electrons, protons, etc. have a wavelength. In 1926 Louis de Brogli ...42 KB (7,065 words) - 02:42, 24 August 2017
- ...e is 0) would be encoded as ''m'' = 0, which produces a ciphertext of 0 no matter which values of ''e'' and ''N'' are used. Likewise, a single ASCII <code>SO ...14 KB (2,168 words) - 11:19, 5 August 2017
- ...uniformly chosen from <math>S</math> at random. It is easy to see that no matter for what <math>k</math> it holds that <math>X(n)\ge \min(m,n-m)</math> wher ...19 KB (3,431 words) - 06:53, 14 April 2014
- ...d mean that no general, fast ways to solve those NP problems can exist, no matter how hard we look. However if all NP problems are P problems (P = NP), it wo ...15 KB (2,427 words) - 22:24, 16 August 2017
- ...guage was changed to allow different results where the difference does not matter and require a "strictfp" qualifier to be used when the results have to conf ...ed computable numbers which it may never be possible to correctly round no matter how many digits are calculated. For instance, if [[Goldbach's conjecture]] ...46 KB (7,060 words) - 01:36, 21 August 2017
- ...such that many packets have to be delivered through the same edge, thus no matter what queuing policy is used, the maximum delay must be very high. ...17 KB (3,066 words) - 06:06, 18 April 2013
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...20 KB (3,444 words) - 04:53, 7 October 2010
- ...that in the modified process (sample with replacement), each proposal, no matter from which man, is going to a uniformly and independently random women. And ...24 KB (4,172 words) - 15:38, 19 March 2013
- ...m be adaptive to the input. It actually covers all possible algorithms (no matter realistic or unrealistic) for the problem. ...25 KB (4,263 words) - 08:43, 7 June 2010
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,922 words) - 13:39, 2 April 2014
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,922 words) - 11:23, 25 April 2013
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,922 words) - 12:14, 28 October 2011
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,926 words) - 08:59, 23 October 2019
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,926 words) - 05:36, 31 October 2016
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,926 words) - 12:04, 12 November 2017
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,926 words) - 08:33, 24 November 2015
- ...that in the modified process (sample with replacement), each proposal, no matter from which man, is going to a uniformly and independently random women. And ...26 KB (4,614 words) - 07:53, 10 March 2014
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...27 KB (4,933 words) - 15:56, 27 April 2023
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...27 KB (4,933 words) - 02:57, 24 April 2024
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,298 words) - 05:54, 20 March 2013
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,298 words) - 06:51, 26 February 2014
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,338 words) - 12:04, 14 September 2015
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,338 words) - 09:04, 12 September 2017
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,338 words) - 13:15, 6 September 2019
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,338 words) - 12:57, 11 September 2016
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...24 KB (4,348 words) - 11:46, 6 March 2013
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...25 KB (4,460 words) - 11:41, 6 March 2024
- ...th> rectangles, so that only their orientations --- vertical or horizontal matter. ...25 KB (4,460 words) - 17:41, 23 March 2023
- ...such that many packets have to be delivered through the same edge, thus no matter what queuing policy is used, the maximum delay must be very high. ...27 KB (4,865 words) - 07:47, 24 March 2014
- ...such that many packets have to be delivered through the same edge, thus no matter what queuing policy is used, the maximum delay must be very high. ...27 KB (4,865 words) - 08:14, 24 March 2014
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...26 KB (4,583 words) - 04:53, 7 October 2010
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 05:22, 29 October 2019
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 06:23, 29 September 2016
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 03:44, 27 October 2017
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 13:15, 25 October 2020
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 04:31, 8 November 2021
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 07:54, 31 October 2018
- ...frac{1}{|S_i\cap U_t|}</math> (also note that this value is not changed no matter as in the <math>t</math>-th integration of the algorithm running on the ori ...33 KB (5,832 words) - 15:45, 19 November 2022
- ...that in the modified process (sample with replacement), each proposal, no matter from which man, is going to a uniformly and independently random women. And ...30 KB (5,405 words) - 09:12, 17 September 2015
- ...such that many packets have to be delivered through the same edge, thus no matter what queuing policy is used, the maximum delay must be very high. ...31 KB (5,481 words) - 03:52, 9 November 2010
- ...ple not knowing each other. In graph theoretical terms, this means that no matter how we color the edges of <math>K_6</math> (the complete graph on six verti ...33 KB (6,039 words) - 08:41, 7 June 2010
- ...that in the modified process (sample with replacement), each proposal, no matter from which man, is going to a uniformly and independently random women. And ...38 KB (6,912 words) - 15:45, 3 October 2022
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,673 words) - 09:03, 22 September 2016
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,750 words) - 15:39, 15 September 2017
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,705 words) - 11:24, 8 September 2020
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,705 words) - 08:44, 24 August 2021
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,705 words) - 07:31, 5 September 2022
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,705 words) - 05:26, 16 September 2019
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,708 words) - 10:34, 12 September 2023
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...43 KB (7,745 words) - 01:16, 10 September 2018
- :*for every edge (no matter parallel or not) in the form of <math>uw</math> or <math>vw</math> that con ...49 KB (8,708 words) - 08:53, 14 September 2023