C# dynamically set property using lambda?
Sum of items in a collection
My change password interface is not working on java eclipse web application Which tool for fixing wobbly crank? Any idea what kind of tool should I but to fix the loose left crank on my bike? I found this  but not sure if it's gonna suit. Or is it enough to buy only nut driver? Prove that $z^2 \equiv ab\pmod p$ is solvable if and only if both or neither of $x^2 \equiv a \pmod p$, $x^2 \equiv b \pmod p$ are solvable. Suppose the $p$ is an odd prime not dividing $ab$.  Prove that $z^2 \equiv ab \pmod p$ is solvable if and only if both or neither of $x^2\equiv a\pmod{p}$ and $x^2 \equiv b \pmod p$ are solvable. Using Regex to generate Strings rather than match them By definition $\aleph_1 = 2 ^{\aleph_0}$. And since $2 &lt; \aleph_0$, then $2^{\aleph_0} = {\aleph_1} \le \aleph_0 ^ {\aleph_0}$. However, I do not know what exactly $\aleph_0 ^ {\aleph_0}$ is or how I could compute it. In what cases does the gerund stemming from a transitive verb take the direct object of that verb and when is a prepositional complement used?  For example:    Brown's deft painting of his daughter is a delight to watch (it is a delight to watch while Brown deftly paints his daughter). Painting his daughter is an outlet for his energy. Securing safety for prisoners is the main problem for the penitentiary system. The widely discussed problem of the securing of prisoners' safety was given priority. I've seen many posts regarding a combinatorial proof of the following question. But for a non-combinatorial proof would the following method work? Also... is this the easiest way to arrive at a proof? It seems to be rather verbose.  Show the formula $k {n\choose k} = n {n-1 \choose k-1}$ is true for all integers $n,k$ with $0\le k \le n$.  My answer:  Observe that  $$\begin{align*} {n\choose k}&amp;= \frac {n}{k} {n-1 \choose k-1}\\ &amp;= \frac {n}{k}\left[ {n-2 \choose k-2} + {n-2 \choose k-1}\right]\\ &amp;= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-2-(k-2))!} + \frac {(n-2)!}{(k-1)!(n-2-(k-1))!}\right]\\ &amp;= \frac {n}{k}\left[ \frac{(n-2)!}{(k-2)!(n-k)!} + \frac {(n-2)!}{(k-1)!(n-k-1)!}\right]\\ &amp;= \frac{(n-1)!}{(k-1)!(n-k)!} + \frac {(n-1)!}{(k)!(n-k-1)!}\\ &amp;= \frac{(n-1)!}{(k-1)!(n-1-(k-1))!} + \frac {(n-1)!}{(k)!(n-1-k)!}\\ &amp;={n-1 \choose k-1} + {n-1 \choose k}={n \choose k}. \end{align*}$$ "Insufficient storage" when trying to install new app Prove that, if A and B is similar, then $A^T$ is similar to $B^T$.  Attempt: I try to use the defn of similarity, and then the rule to transpose in different order, but get nowhere. This should be simple...  (Note to self: page 92.) Prove that the additive groups of $\Bbb Z$ and $\Bbb Q$ are not isomorphic.    It is hard to create a map that will show homomorphism. I am interested in calculating area under the curve (AUC), or the c-statistic, by hand for a binary logistic regression model.  For example, in the validation dataset, I have the true value for the dependent variable, retention (1 = retained; 0 = not retained), as well as a predicted retention status for each observation generated by my regression analysis using a model that was built using the training set (this will range from 0 to 1).  My initial thoughts were to identify the "correct" number of model classifications and simply divide the number of "correct" observations by the number of total observations to calculate the c-statistic. By "correct", if the true retention status of an observation = 1 and the predicted retention status is > 0.5 then that is a "correct" classification. Additionally, if the true retention status of an observation = 0 and the predicted retention status is &lt; 0.5 then that is also a "correct" classification. I assume a "tie" would occur when the predicted value = 0.5, but that phenomenon does not occur in my validation dataset. On the other hand, "incorrect" classifications would be if the true retention status of an observation = 1 and the predicted retention status is &lt; 0.5 or if the true retention status for an outcome = 0 and the predicted retention status is > 0.5. I am aware of TP, FP, FN, TN, but not aware of how to calculate the c-statistic given this information. "Comments only" lock notice on closed questions mistakenly says that question is still accepting answers When a question has a &quot;comments-only&quot; lock, the following notice is displayed on top of the question:  Locked for X days. Comments on this question have been disabled, but it is still accepting new answers and other interactions.  However, I noticed that if the question is closed (even before the lock), the same notice is used:  ..which could be confusing, especially for new users. Proposed change to the notice on closed questions:  Locked for X days. Comments on this question have been disabled, but it is still accepting [votes and] other interactions.  Or, as others have suggested, the additional &quot;but it is still accepting [...]&quot; part can simply be removed as it hardly provides any new information. Why has this configuration chosen for feedback? Show that total orders are maximal orders A set $X$ together with a binary relation $\leq$ such that for all $x,y,z\in X$,  $O1$. $x\leq x$  $O2$. $x\leq y$ and $y\leq x$ then $x=y$  $O3$. $x\leq y$ and $y\leq z$ then $x\leq z$  is called an ordered or sometimes a partially ordered.  An ordered $(X,\leq)$ is called a total order if for all $x,y\in X$, either $x\leq y$ or $y\leq x$.  Question: Show that total orders are maximal orders  My question: is there a typo in the question?  What is a maximal order? How can I prove the question, can you help? Thanks... Can I use a variable in a Bash brace expansion? no Wi-Fi on Ubuntu 14.04 LTS Asus notebook with MEDIATEK MT7630e I'm new to Ubuntu. I installed it today, but the first thing I encounter is that I can only connect to the Internet through wifi.  Can someone help me?   iwconfig result :  eth0      no wireless extensions.  lo        no wireless extensions.   lspci:  00:00.0 Host bridge: Intel Corporation 3rd Gen Core processor DRAM     Controller (rev 09) 00:01.0 PCI bridge: Intel Corporation Xeon E3-1200 v2/3rd Gen Core processor PCI Express Root Port (rev 09) 00:02.0 VGA compatible controller: Intel Corporation 3rd Gen Core processor Graphics Controller (rev 09) 00:14.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB xHCI Host Controller (rev 04) 00:16.0 Communication controller: Intel Corporation 7 Series/C210 Series Chipset Family MEI Controller #1 (rev 04) 00:1a.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #2 (rev 04) 00:1b.0 Audio device: Intel Corporation 7 Series/C210 Series Chipset Family High Definition Audio Controller (rev 04) 00:1c.0 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 1 (rev c4) 00:1c.1 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 2 (rev c4) 00:1c.3 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 4 (rev c4) 00:1d.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #1 (rev 04) 00:1f.0 ISA bridge: Intel Corporation HM76 Express Chipset LPC Controller (rev 04) 00:1f.2 SATA controller: Intel Corporation 7 Series Chipset Family 6-port SATA Controller [AHCI mode] (rev 04) 00:1f.3 SMBus: Intel Corporation 7 Series/C210 Series Chipset Family SMBus Controller (rev 04) 01:00.0 3D controller: NVIDIA Corporation GF117M [GeForce 610M/710M/820M / GT 620M/625M/630M/720M] (rev a1) 03:00.0 Network controller: MEDIATEK Corp. MT7630e 802.11bgn Wireless Network Adapter 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device 5289 (rev 01) 04:00.2 Ethernet controller: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller (rev 0a)   lspci -nnk | grep 0280 -A2:  03:00.0 Network controller [0280]: MEDIATEK Corp. MT7630e 802.11bgn Wireless Network Adapter [14c3:7630]     Subsystem: Foxconn International, Inc. Device [105b:e074] 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device [10ec:5289] (rev 01) In Captain America: Civil War, T'Challa takes the mantle of the Black Panther after his father is killed. As the Black Panther, he appears to have enhanced abilities.  In , the Russos talk about T'Challa having superpowers and being enhanced during Civil War     JOE: It can absorb the energy, so it’s much harder to damage him as a character, and you can see that in the movie he can take a lot of punishment including bullets to the face. He is very well trained. He’s from one of the wealthiest countries on the planet, so there’s great infrastructure there; very technologically advanced country. So he’s been trained at the highest levels to fight, but he also has his own superpowers, which derive from the mythology of his nation. Those will be explored more in Black Panther, it’s clearly evident when he’s able to fight the Winter Soldier out of costume, and go toe-to-toe with him, that he is an enhanced individual.    In Black Panther, we see that in order to become the Black Panther,       one must imbibe juice from the heart-shaped flower and visit the spirit plane after being buried.   But before this,       T'Challa must have his Black Panther powers removed prior to the ritual combat challenge, which he does twice in the film.   This raises the question of how T'Challa could have possibly become the Black Panther abroad - or if he even really had.  How did Black Panther have his powers during Civil War? Is there a way I can share the 3.42 GB download of Windows 8.1 from Windows Store? I upgraded on a fresh install to Ubuntu 12.10, and I've tried installing wine many times, but I always get this:  This error could be caused by required additional software packages which are missing or not installable.  Furthermore there could be a conflict between software packages which are not allowed to be installed at the same time. The following packages have unmet dependencies:  wine:   It won't let me install the dependencies either it says it needs another set of dependencies to install them. Using Asus KJ50 64bit OS, dual boot with Windows 7  sudo apt-get install wine1.5 Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  wine1.5 : Depends: wine1.5-i386 (= 1.5.15-0ubuntu1) but it is not installable            Recommends: gnome-exe-thumbnailer but it is not going to be installed or                        kde-runtime but it is not going to be installed            Recommends: ttf-droid            Recommends: ttf-mscorefonts-installer but it is not going to be installed            Recommends: ttf-umefont but it is not going to be installed            Recommends: ttf-unfonts-core but it is not going to be installed            Recommends: winbind but it is not going to be installed            Recommends: winetricks but it is not going to be installed E: Unable to correct problems, you have held broken packages. Drawing function in tikzpicture