Any time I try to watch a flash (or maybe HTML5) video in chrome, when I fullscreen it, Ubuntu freezes, goes black, and then my monitor says "no signal." This only happens on the second or third time of using fullscreen, oddly enough. I can do it once with no issues. This has only been an issue since the update of Chrome 40 a few days ago. The problem does not exist in Chrome. I'm using Intel Haswell graphics, if that is important.
I never had this problem until today. When I watch a youtube video everything is fine, until I make the video fullscreen. It actually continues to play perfectly when fullscreen, but when I then exit fullscreen my sidebar and topbar are gone, and the screen is just frozen. Also my cursor is gone. It does seem to respond to ALT-F4, but it takes about 15 seconds to even close the window, and after that everything is unusable (basically frozen). What's strange though, when I re-enter fullscreen after exiting (and unity being frozen) the video plays perfectly still.   For now my workaround is opening tty1 and executing pkill -u username which logs off the user. I have looked at /var/log/syslog but it seems to be empty.  Is this freezing a common problem, if not, how can I make steps to fix this?    EDIT with specs:  I'm on a simple Samsung laptop with:  Ubuntu 14.10 64-bit,  Intel® Core™ i5-3210M,  Intel® Ivybridge Mobile (So integrated intel hd graphics 4000),  8GB ram. I don't think i've ever changed my video drivers, but it's reported as i915.  Ubuntu is up to date, and my browser is Chrome 40.0.2214.91 (64-bit). (Will test out now with firefox, but already posting this because my pc might freeze again)     EDIT 2: It doesn't freeze on Firefox. Will try reinstalling chrome now... EDIT 3: Reinstalling chrome didn't help. Will try chrome 32-bit too now...
If $a$ and $b$ commute and $\text{gcd}\left(\text{ord}(a),\text{ord}(b)\right)=1$, then $\text{ord}(ab)=\text{ord}(a)\text{ord}(b)$. Prove if $\operatorname{ord}(a)=m$, $\operatorname{ord}(b)=n$, and $\operatorname{gcd}(m,n)=1$, then $\operatorname{ord}(ab)=mn$.   I was reading this and was thinking how this proof would look like. I tried to do it and am not sure if this is correct. Here is what I did:  If $a$ and $b$ commute then $(ab)^{mn} = a^{mn} * b^{mn} = (a^m)^n * (b^n)^m = 1 * 1 = 1.$ So $ord(ab) | mn$.  Now, take $k = \operatorname{ord}(ab) = m^\prime * n^\prime$ where m' is relatively prime with $n$ and $n'$ is relatively prime with $m$. By the result above $m' | m$ and $n' | n$. Now we have $((ab)^k)^{m/m'} = 1$ since $(ab)^k=1$. But on the other hand, by the commutativity:  $$((ab)^k)^(m/m') =$$  $$((ab)^(m' * n'))^(m/m') =$$  $$ a^{n'm} * b^{n'm} = $$  $$(a^m)^{n'} * b^{n'm'}=$$  $$b^{n'm'} = 1$$  This implies that $n' * m'$ is divisible by $n$. But $m'$ is relatively prime with $n$, so we must have $n' = n.$ By symmetry, $m' = m$. So $ord(ab) = mn$.  Just to say this again, I want to prove if $a$ and $b$ commute and $m$ and $n$ are relatively prime then   $$ord(ab)=mn.$$   The comments are vague. I guess this must be the answer then and there probably is not another way to do this. Easiest process for me to apply textures, created externally, to my models For the first time I'm working with an artist who is going to be creating the textures for the models I create in Blender.  Up till now I had been building the models and the texturing them myself using pre-built textures from websites.  My question is: What is the easiest process for me to apply the textures our artist creates to my model?  Should I give the artist the UV Map from my model, or should I just get textures from the artist and fit them to the UV Map?  Basically I have no idea how this process works in a professional environment. real memory usage The use of nominative "whom" (as in “persons whom it is foreseeable are likely to...”) From  page 48 of Law: A Very Short Introduction, by Raymond Wacks:     In other words, you owe a duty to persons whom it is foreseeable are likely to be harmed by your conduct.   To try to parse this, temporarily overlook 'it is foreseeable'. Then persons is the subject of the verb phrase are likely to be harmed. So , should the relative pronoun for persons be who instead? Is my parse wrong?   Are the (deleted) comments right: that this style predominates in law texts? If this is correct grammar, what is the general rule? Is it commonly used in other contexts? According to the , 3rd edition:        I wish to understand why this decision has been made. What's wrong with generic exceptions?  (As far as I know, generics are simply compile-time syntactic sugar, and they will be translated to Object anyway in the .class files, so effectively declaring a generic class is as if everything in it was an Object. Please correct me if I'm wrong.) Why does autoboxing make some calls ambiguous in Java? I noticed today that auto-boxing can sometimes cause ambiguity in method overload resolution. The simplest example appears to be this:  public class Test {     static void f(Object a, boolean b) {}     static void f(Object a, Object b) {}      static void m(int a, boolean b) { f(a,b); } }   When compiled, it causes the following error:  Test.java:5: reference to f is ambiguous, both method     f(java.lang.Object,boolean) in Test and method     f(java.lang.Object,java.lang.Object) in Test match  static void m(int a, boolean b) { f(a, b); }                                   ^   The fix to this error is trivial: just use explicit auto-boxing:  static void m(int a, boolean b) { f((Object)a, b); }   Which correctly calls the first overload as expected.  So why did the overload resolution fail? Why didn't the compiler auto-box the first argument, and accept the second argument normally? Why did I have to request auto-boxing explicitly? Does $\sum_{n=3}^\infty \frac {1}{(\log n)^{\log(\log(n)}}$ converge? Does the following series converge:  $$\sum_{n=3}^\infty \frac {1}{(\log n)^{\log(\log(n)}}$$  I've tried all test I know... Any ideas ? Differences between Verb + to be + adjectives and Verb + adjective How does the Green-Flame Blade cantrip interact with the tiefling feat Flames of Phlegethos? I’m playing an Eldritch Knight fighter, and I’m looking to optimize the damage of the green-flame blade cantrip. The description of the tiefling racial feat  states, in part (XGtE, p. 74-75):   When you roll fire damage for a spell you cast, you can reroll any roll of 1 on the fire damage dice, but you must use the new roll, even if it is another 1. Whenever you cast a spell that deals fire damage, you can cause flames to wreathe you until the end of your next turn. The flames don’t harm you or your possessions, and they shed bright light out to 30 feet and dim light for an additional 30 feet. While the flames are present, any creature within 5 feet of you that hits you with a melee attack takes 1d4 fire damage.   Would both the 1d4 fire damage and the re-roll 1s on fire damage trigger when using green-flame blade? Or is this meant for spells of level 1 and higher? Path connectedness of the set $\{(x,y):(x+1)^{2}+y^{2}\leq 1\}\cup\{(x,y):y=x\sin(\frac{1}{x}),x>0\}$ Let $A$ be the following subset of $\mathbb{R}^{2}$:$$A=\{(x,y):(x+1)^{2}+y^{2}\leq 1\}\cup\{(x,y):y=x\sin(\frac{1}{x}),x&gt;0\}$$ Then  $1.$ $A$ is connected.  $2.$ $A$ is compact.  $3.$ $A$ is path connected.  $4.$ $A$ is bounded.  It is clear that $A$ is unbounded as the graph of $x\sin(\frac{1}{x})$, so option $2$nd and $4$th are not correct. Again $A$ is connected by using the fact that closure of connected set is connected. But i am confused about path connectedness of $A$. Please help me about path connectedness of $A.$ Thanking you. How does one attack a two-time pad (i.e. one time pad with key reuse)? Difference between "I have got" and "I have gotten" Need a proofreading why all the units are satisfied $a^2-2b^2 =\pm1$ for $\mathbf{Z}[\sqrt{2}]$ All the units are satisfied Pell's equation $a^2-2b^2=\pm1$  for $\mathbf{Z}[\sqrt{2}]$, $a,b\in\mathbf{Z}$.  Here is my proof:  Let $a+b\sqrt{2}$ be a unit $\in\mathbf{Z}[\sqrt{2}]$. This implies $$(a+b\sqrt{2})(c+d\sqrt{2})=1, c+d\sqrt{2}\in\mathbf{Z}\sqrt{2}$$ $$\implies \mathrm{norm}((a+b\sqrt{2})(c+d\sqrt{2}))=1$$ $$\implies \mathrm{norm}(a+b\sqrt{2})\cdot \mathrm{norm}(c+d\sqrt{2})=1$$ $$\implies (a+b\sqrt{2})(a-b\sqrt{2})(c+d\sqrt{2})(c-d\sqrt{2})=1$$ $$\implies (a^2-2b^2)(c^2-2d^2)=1$$ $$\implies \left[ a^2-2b^2=1\text{ and } {c}^2-2{d}^2=1\right]\text{ or } \left[ a^2-2{b}^2=-1\text{ and }{c}^2-2{d}^2=-1\right]$$ $$\implies {a}^2-2{b}^2=\pm1$$ Can it be proven in $\sf ZF^{\neg\infty}$ that the sets $x_n=\{x_{n+1}\}$ do not exist? Mile or miles? Singular or plural? Could you explain me please, why sometimes the word "mile" is used in singular, sometimes in plural, while in both cases it refers to several and not 1 mile.  Example:     They took part in a 26 mile long swimming race.   After 12 miles he got tired.   Thanks in advance to those who can enlighten me! Books automatically deletes my books when offline, and when there is enough space on device How create Redirect pattern from old to new URLs? D7: I'm going to update an articles path pattern (/articles/[node:uid] → /post/[new tokens]) but I need redirect users from old path to new one using tokens. And I don't know how to do that.  I tried using the , but it allows set only separate URL for each node; no group redirect patterns are allowed. Also the  doesn't allow to set patterns. How can I achieve this?    The problem partially solves by applying "Update url alias" option in admin/content. I do not find out how to show all selected type nodes at one page without pages, because it is terrible slow applying option page by page. Anyway, by this way, old aliases still exist, work, and don't redirect to new aliases. Bug with Excavator Badge I edited this post today  on stack overflow. I was approved of the edit, so I waited a few minutes to get my  badge because this answer was posted on Jan 28 '10 at 1:06, but it never came. I have read multiple articles on meta that there have been bugs with this badge, but they have been about winning it multiple times (), or earning it then losing it (). Am I missing something here? jsp:useBean scope Finitely generated monoids- axiomatization- compactness theorem.