After I completed "Hard Answers", Karliah said to meet her at the Ragged Flagon in Riften but it didn't give me the quest. I went to the Ragged Flagon but she's not here. Please help.
During the 'Hard Answers' Thieves Guild quest, Karliah asked me to meet her at the Ragged Flagon.  However, it seems that she doesn't show up at the rendezvous point.  Where do I find her?
I am working on the following problem asked in an examination: "What is the maximum number of cylindrical pencils of 0.5 cm diameter that can be stood in a square shaped stand of 5cm × 5cm inner cross section? 1. 99    2. 121   3. 100    4. 105." A simple calculation yielded me the answer 100.  But the answer in the key is 105. I don't how such an answer is possible. Any hint please.....Thanks in advance! Semigroup analogue to the classification of finite simple groups? Is there a semigroup analogue to the classification of finite simple groups?  If so what are some of the major results?  --Edit, reference links--- Using mask as a garbage matte to hide an object Adding a script to the page dynamically with jQuery never uses the cached file How do I convert all files in a folder to a different line ending? (on Windows) I just downloaded a DVD which is for a movie. After uncompressing the DVD file I see .VOB, .IFO and .BUP files. If I open the first .VOB file it shows me the DVD menu but I can't interact with it. So, my question is... is Totem able to play those kind of files? If so, how can I achieve that? What other app could I use in order to reproduce those files?  Edit  Using VLC didn't work neither. I forgot to mention I have already tried that. Let me rephrase: if I open the first video file it shows the DVD menu, BUT I can't interact with it. Possible Duplicate:             Well, I remembered this after having Algebra II a year ago, is it possible that this is a valid proof that $1 = -1$?  $$ 1 = \sqrt{1} = \sqrt{-1\cdot-1} = \sqrt{-1} \cdot \sqrt{-1} = i \cdot i = i^2 = -1 $$  $$ \therefore 1 = -1 $$  So is this actually fully valid? Or can it be disproved? What does "$$" mean in the shell? What does the output of the command below mean? (result is positive integer)  echo $$ Suppose there is a message that is encrypted with AES-128-CBC.  The message is as follows, new lines are used to delimit the 16 byte boundary for each block:  Wire funds from: Alice to Bob in   the amount of $ 1   Because this message is encrypted using CBC mode,  any modification of the first block of cipher text would propagate throughout the message.   However, the amount of the fund transfer falls in the last block.  I am under the assumption that an attacker can use the property of  to alter the last block and produce a valid amount that is greater than \$1 in far fewer than $2^{128}$ operations.   Is this a correct assumption?  Is there a name for this attack or do you know of a real world example?    My instinct is that if you just need one byte of the 16 byte block to be of a specific value then it would only require $2^8$ operations because the other 120 bits of the plain text could be any value. For example lets say we wanted the last block of cipher text to decrypt to 9\0 (where \0 denotes a single null byte, and the message would be interpreted as \$9), then it would take only $2^{16}$ operations to find this cipher text block.  Is there something I am missing? How to create & execute a script file Is there a way to create and execute a script file in Ubuntu 14.04?  Perhaps something like Windows batch files.  Specifically, I mean the default scripting language of the Ubuntu terminal (Bash).  How do you make a text file containing bash commands which will be run by the Ubuntu terminal from the top of the file to the bottom. For holomorphic functions, if $\{f_n\}\to f$ uniformly on compact sets, then the same is true for the derivatives. Let $\Omega$ be an open subset in $\mathbb{C}$. Let $\{f_n\}$ be a sequence of holomorphic functions on $\Omega$ such that $f_n\to f$ pointwise and converges uniformly on any compact subset $K\subseteq \Omega$. Then by Cauchy Theorem and Morera Theorem, $f$ is holomorphic. Let $f_n$ and $f'$ be the derivatives of $f_n$ and $f$ respectively. Prove that $f_n'\to f'$ uniformly on any compact subset $K\subseteq \Omega$.   How to prove? what is the general definition for some partial differential equation being called elliptic, parabolic or hyperbolic - in particular, if the PDE is nonlinear and above second-order.  So far, I have not found any precise definition in literature. How should tiny $p$-values be reported? (and why does R put a minimum on 2.22e-16?) For some tests in R, there is a lower limit on the  calculations of $2.22 \cdot 10^{-16}$. I'm not sure why it's this number, if there is a good reason for it or if it's just arbitrary. A lot of other stats packages just go to 0.0001, so this is a much higher level of precision. But I haven't seen too many papers reporting $p &lt; 2.22\cdot 10^{-16}$ or $p = 2.22\cdot 10^{-16}$.   Is it a common/best practice to report this computed value or is it more typical to report something else (like p &lt; 0.000000000000001)? food safety regarding re freezing twice cooked chicken systemd-resolve high cpu usage after update to 17.04 Ok, I have to admit, I don't really delve too deep into the semantics of the spatial operators list below, I'm more of a user, I write software to drive the SQL most of the time and don't really think about it too much.  However, I have a situation where a spatial operation I'm doing is going dog slow, on a table that has great indexes on and has never caused a problem before now.  As a result, I'm trying to figure out which of the following is my best bet to use, that will give me the best performance, however, sometimes I find my searches don't return anything when I know they should, and sometimes return stuff when they shouldn't.  SO I'm reaching out, to ask if some one can give me the actual definition, such as criteria to match, fully within enclosing geometry, or within outer ring etc etc of each of the following operations:  Equals(Geom1, Geom2):int Disjoint(Geom1, Geom2):int Touches(Geom1, Geom2):int Within(Geom1, Geom2):int Overlaps(Geom1, Geom2):int Crosses(Geom1, Geom2):int Intersects(Geom1, Geom2):int Contains(Geom1, Geom2):int Relate(Geom1, Geom2):int   If you can give a concrete example of when they will and will not match too, that would be great.  For reference, I'm searching on a table of Linestrings, using a rectangular polygon, rotated to be pointing in the direction of travel (It's part of a traffic managment app)  For further reference, here is a sample of the SQL the app generates to perform a search:  SELECT recordID,AsBinary(geometry) AS geometry,Distance(GeomFromText('POINT(-1.84101 54.85078)',4326), geometry) AS distanceFromGps FROM linegrid WHERE Intersects(GeomFromText('POLYGON ((-1.8413149820810311 54.850782468607292, -1.8409507853094111 54.850952257034713, -1.8408279009723911 54.850864894077496, -1.8411920982612455 54.850695105650068, -1.8413149820810311 54.850782468607292))'), geometry)   You can see in this example I'm using intersects trying the others as mentioned doesn't quite give the results I expect, hence why I'm asking the question.  Please note, I'm not particularly bothered about actual faster/other ways of doing this at the moment, BUT if you do happen to spot a better way do feel free to shout up :-)  For now all I'm mostly trying to understand is the differences between each of the operations.  As for doing it faster/better I intend to open a different question for that at a later date.  For more reference, the Spatial engine this is working against is Spatilite 2.3.0, and I can't upgrade it due to the devices it's running on not having a more up to date build for it (Windows CE)    I'm going to choose mintix'es answer here as that provided a super easy to understand grid and description of all the various operations, which answered my question.  I'm still faced with getting performance on the routines up, but I do now have a few strategies to try on that one, I may still seek advice here from the group with regards to that.  @Vince deserves some credit too, as that white paper is definitely the definitive answer, but it's also quite challenging to read (I had to read through it several times) , for anyone wanting the real I am on these operations The Clementini paper is the way to go, if you need an easy to understand overview while developing solutions however, the FME link should be open in another browser tab. The sum $\sum_{k=1}^nk(k!)$ can be easily calculated by noting $k(k!)=(k+1)!-k!$. Is there a way to calculate the sum nicely using a combinatorial argument. Is it possible to notice it is $(n+1)!-1$ combinatorially? When is $\mathbb{F}_p[x]/(x^2-2)\simeq\mathbb{F}_p[x]/(x^2-3)$ for small primes? I've been considering the rings $R_1=\mathbb{F}_p[x]/(x^2-2)$ and $R_2=\mathbb{F}_p[x]/(x^2-3)$, where $\mathbb{F}_p=\mathbb{Z}/(p)$.   I'm trying to figure out if they're isomorphic (as rings I suppose) or not for primes $p=2,5,11$.   I don't think they are for $p=11$, since $x^2-2$ is irreducible over $\mathbb{F}_{11}$, so $R_1$ is a field. But $x^2-3$ has $x=5,6$ as solution in $\mathbb{F}_{11}$, so $R_2$ is not even a domain.  For $p=5$, both polynomials are irreducible, so both rings are fields with $25$ elements.  I know from my previous studies that any two finite fields of the same order are isomorphic, but I'm curious if there is a simpler way to show the isomorphism in this case, without resorting to that theorem.  For $p=2$, neither ring is even a domain as $x=0$ is a solution of $x^2-2$ and $x=1$ is a solution for $x^2-3$, but I'm not sure how to proceed after that. Thank you for any help. Yesterday I had 3,606 reputation but today I have 3,592.  My profile shows that I lost 6 reputation when a user was removed, but that would put me on 3,600 - 8 reputation has magically disappeared.  Adding up all of my reputation does work out at 3,591 (I'm assuming by default new users have 1 rep, so that would make sense).  Somewhere a reputation change since yesterday isn't being displayed. I don't know what this would be for, but -8 would lead me to believe that someone removed their up-vote on an answer I'd posted which already had a down-vote (could it be from that deleted user?).  I don't know if this is a bug or if there is simply a delay between reputation updating, but I figured it was worth reporting.    Sadly I cannot prove that I had 3,606 reputation yesterday. To show that $\sum a_nb_n$ is absolutely convergent Assume that $\sum a_n$ is convergent and $\sum b_n$ is absolutely convergent.To show that $\sum a_nb_n$ is  absolutely convergent  My try::Consider the sequence of partial sums of $\sum |a_nb_n|$  $S_n=|a_1b_1|+|a_2b_2|+......+|a_nb_n|$  Now $(a_1b_1+a_2b_2+......+a_nb_n)\leq ( (a_1^2+a_2^2+..+a_n^2))^\frac{1}{2}((b_1^2+b_2^2+..+b_n^2)^\frac{1}{2})$  How to proceed from here?