I have not come up with a solution for the following warning:  main.cpp: In member function 'void MyClass::increase()': main.cpp:350: warning: conversion to 'short unsigned int' from 'int' may alter its value   main.cpp:  class MyClass { public:    MyClass() : myShort(0) { }    void increase() { myShort *= 60; } // Line 350  private:    unsigned short myShort; };  int main(int argc, char** argv) {    MyClass myObj;    myObj.increase(); }
Very basic question: how do I write a short literal in C++?  I know the following:   2 is an int 2U is an unsigned int 2L is a long 2LL is a long long 2.0f is a float 2.0 is a double '\2' is a char.   But how would I write a short literal?  I tried 2S but that gives a compiler warning.
I recently re-watched Contact for the first time since my childhood, and while I thoroughly enjoyed it, I realized that there was something I'd never understood: why couldn't they corroborate Ellie's account of her journey?  As far as I could tell, the pod fell harmlessly through the machine.  That is, it didn't break anything, and the machine wasn't destroyed.  I don't recall any dialogue about circuits being fried or the system shutting down, so presumably it wouldn't be hard to simply hoist the pod up and go again.  I imagine the energy draw was substantial on the local Japanese power grid, but given the amount of effort and money already invested in the machine, surely "Round 2" wasn't out of the question?  I mean, they almost certainly expected that this machine would get more than one good use out of it, anyway!  So given Ellie's vehement insistence that the machine had worked, the public nature of the controversy surrounding her testimony, and the government's (secret) findings that her device had recorded 18 hours of static, why wasn't it the obvious choice to have someone else suiting up the next day, ready to drop through the machine and corroborate her story? When can I make opportunity attacks? Number of automorphisms of a direct product of two cyclic $p$-groups Suppose I have $G = Z_{p^m} \times Z_{p^n}$ for $m, n$ distinct natural numbers and $p$ a prime. Is there a combinatorial way to determine the number of automorphisms of $G$? My created page with link  The 404 page after following my new url. Prove by Mathematical Induction: $1(1!) + 2(2!) + \cdot \cdot \cdot +n(n!) = (n+1)!-1$ Prove by Mathematical Induction . . .  $1(1!) + 2(2!) + \cdot \cdot \cdot +n(n!) = (n+1)!-1$  I tried solving it, but I got stuck near the end . . .  a. Basis Step:      $(1)(1!) = (1+1)!-1$      $1 = (2\cdot1)-1$      $1 = 1 \checkmark$   b. Inductive Hypothesis     $1(1!) + 2(2!) + \cdot \cdot \cdot +k(k!) = (k+1)!-1$   Prove k+1 is true.     $1(1!) + 2(2!) + \cdot \cdot \cdot +(k+1)(k+1)! = (k+2)!-1$      $\big[RHS\big]$      $(k+2)!-1 = (k+2)(k+1)k!-1$      $\big[LHS\big]$      $=\underbrace{1(1!) + 2(2!) + \cdot \cdot \cdot + k(k+1)!} + (k+1)(k+1)!$ (Explicit Last Step)      $= \underbrace{(k+1)!-1}+(k+1)(k+1)!$ (Inductive Hypothesis Substitution)      $= (k+1)!-1 + (k+1)(k+1)k!$      $= (k+1)k!-1 + (k+1)^{2}k!$   My [LHS] looks nothing like my [RHS] did I do something wrong?  EDIT:     $ = (k+1)k! + (k+1)^2k! -1 $      $ = (k+1)(k!)(1 + (k+1))-1$      $ = (k+1)(k!)(k+2)-1 = (k+2)(k+1)k!-1$ Are these gerund sentences grammatically correct? I bought this book titled 2 Hari Taklukan Grammar, written by Edward Rahardian in Bahasa (Indonesian language) and mostly talk about gerund and infinitive. And these are some examples of the gerund sentences that I found.        His mother suggested having lunch before we leave.     I will try studying harder.     The car needs washing.     Your hair needs washing.     My teacher disliked me coming late.        Somehow those words sound unnatural for me because I've never heard those in daily conversations. As a learner, I only get exposed with English by watching TV series and any other entertainment resources.  So in my thought, they sound more natural like this:        His mother suggested to have lunch before we leave.     I will try to study harder.     The car needs to be washed.     Your hair needs to be washed.     My teacher disliked me to come late.       Are those sentences in the first group grammatically correct? And, is it normal for one to say them in normal/daily conversations? I've already defeated the Big Bug.   I see the hint that the small bugs disguised as cursors are vulnerable to the three words "Charity", "Uganda", and "Bram".  I think I have all keys available, I've tried undoing with the bugs on the three words, I've tried motions which include the three words in their range, I have each of the three words stored in a named register, but I haven't figured out how to defeat the three small bug minions underground in Level 14 of Vim Adventures.  I suspect I should have defeated them before defeating Big Bug, maybe even before finding 'undo'. Is there instead something I should do in the 'lorem' buffer where I found the three cursors (Blue, White, and Pink) at the beginning of the level?  How does one defeat the three small bug minions in Level 14? How can I represent an 'Enum' in Python? I'm mainly a C# developer, but I'm currently working on a project in Python.  How can I represent the equivalent of an Enum in Python? Proving that $\lim_{k\to \infty}\frac{f(x_k)-f(y_k)}{x_k-y_k}=f'(c)$ where $\lim_{k\to \infty}x_k=\lim_{k\to \infty}y_k=c$ with $x_k<c<y_k$ Question.  Suppose that a function $f$ is defined on an interval $I$, $c$ is a point of $I$, and {$x_k$} and {$y_k$} are any two sequences in $I$ such that $\lim_{k\to \infty}x_k=\lim_{k\to \infty}y_k=c$ with $x_k&lt;c&lt;y_k$ for all $k$. Prove that, if $f'(c)$ exists, then $\lim_{k\to \infty}\frac{f(x_k)-f(y_k)}{x_k-y_k}=f'(c).$   My Attempt.  Let $\epsilon_k=\frac{1}{k}$ be given.  For $\epsilon_1=1,$ there exists $\delta_1&gt;0$ such that $x_1,y_1\in I, x_1,y_1\in N'(c;\delta_1)$ implies $\vert \frac{f(x_1)-f(y_1)}{x_1-y_1} -f'(c) \vert&lt;\epsilon_1.$  For $\epsilon_2=\frac{1}{2},$ there exists $0&lt;\delta_2&lt;$min$\{\vert x_1-c \vert,\vert y_1-c \vert,\epsilon_2\}$ such that $x_2,y_2\in I, x_2,y_2\in N'(c;\delta_2)$ implies $\vert \frac{f(x_2)-f(y_2)}{x_2-y_2} -f'(c) \vert&lt;\epsilon_2.$  Similarly, for $\epsilon_{k}=\frac{1}{k},$ there exists $0&lt;\delta_k&lt;$min$\{\vert x_{k-1}-c \vert,\vert y_{k-1}-c \vert,\epsilon_k\}$ such that $x_k,y_k\in I, x_k,y_k\in N'(c;\delta_k)$ implies $\vert \frac{f(x_k)-f(y_k)}{x_k-y_k} -f'(c) \vert&lt;\epsilon_k.$  Then by taking the limit to infinity, we obtain $\lim_{k\to \infty}\frac{f(x_k)-f(y_k)}{x_k-y_k}=f'(c).$   It really took me a lot of time to finish the proof and I need this to be checked by an expert:) Is the proof okay? Any response would be appreciated! TeXnicCenter & Adobe Acrobat 10 Rails lists have .first and .second – is there a .hundredth or .sixty_nineth ? I never hear "scissor" or "pant" or "jean". It's always "scissors", "pants", and "jeans", respectively. Are they considered plural? How do we use drupal_add_library(), drupal_add_css() and drupal_add_js()? How do I use drupal_add_library(), drupal_add_css() and drupal_add_js() in Drupal 8?  I am porting a module that uses those functions. I am following what reported in , which says these functions have been removed in favor of #attached, but I am not able to attach these files to my configuration page.  The error I am getting is the following:     Uncaught PHP Exception LogicException: "You are not allowed to use js in #attached"   How do I attach CSS and JavaScript to a page? In a complex vector space, $\langle Tx,x \rangle=0 \implies T = 0$ Batch renaming files Diagonalizable matrix with parameters $$     \begin{bmatrix}     -2 &amp; -2 &amp; 0 &amp; 0 \\     -b &amp; -b &amp; 0 &amp; 0 \\      0 &amp; 0 &amp; -4 &amp; 4 \\      0 &amp; 0 &amp; b &amp; -b \\     \end{bmatrix} $$  I have this matrix and I need to find the values for $b$ that this matrix won't  be diagonalizable.  For what I got this matrix is diagonalizable for every $b$ value.  Please write me also the final answer, thank you very much. Does a surjective ring homomorphism have to be surjective on the unit groups? Is it possible to search for punctuation/special characters? I tried to find a related question here, but was unsuccessful.  Someone on SO asked ... I tried searching SO and was presented with the search options page. Even Google fails at this search.  So my question is, is there some way to search for an exact word (in quotes) that won't cause it to fail? I have just discovered that my local bank, Nordea, has decided to remove the only good thing about their entire operation: the so-called "simplified login" feature on their website, which allows (soon allowed) the customer to log in to a kind of very limited "read-only" mode which basically just allowed you to see your current balance, the last few transactions (limited descriptions) and see whether or not there are any new "customer support messages", but not read those messages, not make any kind of payments, edit accounts, etc.  Now, they will only allow "full" logins, which 100% prevents any kind of automation and requires you to sit with a hardware device and enter numbers into it and then into the webpage before it allows you to see as much as your account balance. Other than being very obnoxious for every customer, it also blocks me and other "advanced" users out from our custom-programmed bots which have always regularly logged in with that "simplified" login method just to regexp out the current balance/new messages and then notify us via whatever mechanism we use privately.  I have previously asked them if they have any kind of JSON/RSS API of any kind, but no. They don't even have as much as e-mail notifications! Nothing except their spyware "smartphone app" which I would never install, nor would I ever allow such a surveillance device to track me 24/7 in the first place. Only by being a registered corporation with special, way more costly account types do you get any kind of "API" access from them, even to do this most basic imaginable task.  Before you tell me to switch banks, the others are at least just as bad (even worse from what I can tell, and for a longer time), and the act of switching banks is practically impossible for me personally.  What I'm asking is if maybe somebody knows of some sort of "hidden standard" or something which all banks in the world support, but don't have documented, for people like me to automate basic things such as knowing my account balance. Needless to say, I have looked for this countless times on their website, asked them about it, and asked other people about it. Nobody seems to know anything, or, if they do, won't tell me.  I know that there are a bunch of "Nordea-supporting" PHP libraries and whatnot on Github, but they are all ancient and even if they were up to date, they were most likely using the same method as I have been using: automating the login process through their "simplified login" mechanism, which is "soon" to be gone. (Probably at new year; they didn't even mention any dates or time frames.)  And yes, I have a Bitcoin wallet and have that fully automated. The problem is that virtually nobody else in the world cares about my Bitcoin, so "switching to Bitcoin" remains a pipe dream which I would be ready to do, but the world clearly isn't. Cannot authenticate without a password