Java: Decrease value of primitive from getter or use setter?
Is Java "pass-by-reference" or "pass-by-value"?
How do I use the Cherokee keyboard layout to type English characters? Wow, I've really done it this time. I've locked myself out of my machine.  In preparing for a Cherokee language course, I added the Cherokee keyboard layout to my options. However, I was unable to generate any Cherokee characters by selecting that input device.  I found an article on the web which instructed me to use the dpkg-reconfigure keyboard-configuration command in a terminal.  Once I did that, I rebooted as instructed. Once I was presented with the login screen, I entered my password as usual only for it to fail.  After failing a few times, I gave my attention to what is usually a mundane exercise (i.e., logging in).  While I carefully entered my password, each time, I get the message, "Sorry that didn't work..."  So, I brought up the onscreen keyboard... But the password box displays an asterisk for only the first character of my password.  I attempted to use the direct Unicode input method (ctrl-shift-Uxxxx) but the Cherokee keyboard has no "U" key.  Can anyone please help me troubleshoot this? Is SO/SE about to be sold (and does that explain recent events)? I was solving a few problems from a textbook and I came across this one:     Find the tangent lines to the graph of $x^2+4y^2 = 36$ that go through   the point $P=(12,3)$   I could find the tangency points $$ but my solution was completely messy (I had four equations that I had to go back-and-forth with.  Is there an elegant/simple solution to that?  Tangency points:  $$P_1 = (0,3)$$ $$P_2 = \left( \frac{24}{5} , 3-\frac{24}{5} \right)$$ Constant Amortized Time What is meant by "Constant Amortized Time" when talking about time complexity of an algorithm? I have attempted a proof of this, but upon looking at my notes, I feel it might be incorrect: it is noticeably simpler than the one in my notes.  Proposition: any permutation in $S_n$ can be written as a product of disjoint cycles.  Proof (attempt): $s\in S_n$. Let $\langle s\rangle$ act on $X=\{1,\cdots,n\}$. Define $x\sim x'\iff x'\in\text{Orb}(x)$ for $x,x'\in X:$ this is clearly an equivalent relation, hence the orbits partition $X$. Each orbit corresponds a cycle in $s$, so we are done.  Does this hold, or have I missed something vital? What do I need to consider to choose between dSLR, mirrorless, or a compact as my first "serious" camera? Let, $D=\{z\in \mathbb C:|z|&lt;1\}$. Which are correct?   there exists a holomorphic function $f:D \to D$ with $f(0)=0$ &amp; $f'(0)=2$. there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{3}{4}\right)=\dfrac{3}{4}$ &amp; $f'\left(\dfrac{2}{3}\right)=\dfrac{3}{4}$. there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{3}{4}\right)=-\dfrac{3}{4}$ &amp; $f'\left(\dfrac{3}{4}\right)=-\dfrac{3}{4}$ there exists a holomorphic function $f:D \to D$ with $f\left(\dfrac{1}{2}\right)=-\dfrac{1}{2}$ &amp; $f'\left(\dfrac{1}{4}\right)=1$.   With the help of Schwarz lemma &amp; its applications, we find that $(1)$ is false &amp; $(3)$ is true.  But, I can not think about options $(2)$ &amp; $(4)$. 101 positive integers placed on a circle A Pigeonhole Principle problem:     101 positive integers are placed on a circle whose sum is 300. Prove   that it is possible to choose from these numbers some consecutive   numbers whose sum is equal to 200.   (I don't know if the word 'consecutive' is appropriate in this case ,I mean that these numbers follow each other on that circle) Python: Invalid Token How do I get on a Minecraft PE server when it says 'invalid name'? I am having trouble getting onto a server in Minecraft PE on iOS. When I tap on the person's server it just says invalid name:    I have tried turning off and restarting the iPad, going to home screen and logging back into the server but I have had no luck and no change. Is there a reason why this is so? How do you interpret a significant but weak correlation? Front suspension or full suspension mountain bike I want to turn a photo in a engraving style picture, like  using GIMP and, if possible, then make an SVG out of it with Inkscape.  Can you recommend any filters/tools/plugins/tutorials for this? header and footer of the first page of every chapter It maby be weird, I want to make header and footer for every page including the first page of each chapter, how can I do this? Number of ancestors 750 years ago I have 2 ancestors, a father and a mother. Two generations back - 4 ancestors. Three generations back - 8 ancestors.  30 generations back: 2^n = 2^30 = ~1,000,000,000 ancestors.  If a generation is 25 years long, 30 generations are 750 years and 30 generations ago the year was 1,267. But the world population was only 400,000,000 people so how can my math be wrong? and is there a way to estimate the number of ancestors I had 750 years ago? Require reputation earned on the main site to vote on a per-site meta Upvoting requires 15 reputation, but the association bonus is taken into account, so if you have at least 200 reputation on any site, you can upvote on all sites in the network.  This is a bit problematic when it comes to per-site metas. The votes there are used to gauge the opinion of the community, and they are often taken into account when implementing new policies.  What can happen is that a post from a per-site meta is linked in an unrelated high-traffic chat room, usually because there is some entertaining drama going on or because someone posted a particularly bad idea. This can lead to an influx of votes from external users that usually wouldn't visit or use the site, but currently still can vote on their meta due to the association bonus.  I think a very low minimum participation on the site should be required to vote on meta issues. This would make the votes on the per-site meta more robust and less easily skewed by being linked from outside.  Not counting the association bonus for the upvote privilege would be enough, then all users would have to earn 14 reputation on the site itself. And now I am unable to chmod it back.. or use any of my other system programs. Luckily this is on a VM I've been toying with, but is there any way to resolve this? The system is Ubuntu Server 12.10.   I have attempted to restart into recovery mode, unfortunately now I am unable to boot into the system at all due to permissions not granting some programs after init-bottom availability to run- the system just hangs. This is what I see:  Begin: Running /scripts/init-bottom ... done [   37.062059] init: Failed to spawn friendly-recovery pre-start process: unable to execute: Permission denied [   37.084744]  init: Failed to spawn friendly-recovery post-stop process: unable to execute: Permission denied [   37.101333] init: plymouth main process (220) killed by ABRT signal   After this the computer hangs. Changing an element's ID with jQuery I need to change an element's ID using jQuery.    Apparently these don't work:  jQuery(this).prev("li").attr("id")="newid" jQuery(this).prev("li")="newid"   I found out that I can make it happen with the following code:  jQuery(this).prev("li")show(function() {     this.id="newid"; });   But that doesn't seem right to me. There must be a better way, no? Also, in case there isn't, what other method can I use instead of show/hide or other effects? Obviously I don't want to show/hide or affect the element every time, just to change its ID.  (Yep, I'm a jQuery newbie.)  Edit I can't use classes in this case, I must use IDs. Inequality : $\sum_{k=1}^n x_k\cdot \sum_{k=1}^n \frac{1}{x_k} \geq n^2$ I have to show the inequality of $$\left(\sum_{i=1}^n x_i\right)*\left(\sum_{i=1}^n \frac{1}{x_i}\right) \geq n^2.$$For $x_1, ... x_n \in \mathbb{R_{&gt;0}}$ and $ n \geq 1$. I wanted to show this inequality by induction. The basis is clear, but I am not sure how to do the inductive step. Can someone help me with that? Cooperative game vs Multiplayer game Can any one tell what is difference between cooperative game and multiplayer game?