when use lots of \color{} command, can't change color

\documentclass{article}  \usepackage{xcolor}  \begin{document}  \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue  from here, something is wrong?  \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue \color{red}red  \color{green}green  \color{blue}blue  \end{document}


How to change DateTime to Local GMT DateTime in asp:BoundField?

I have a asp:GridView and it has a asp:BoundField that contains DateTime data comming form database. now here i want to show this DateTime to my local GMT DateTime only for view purpose.  I think it should need a client side solution.  source is below,   <asp:BoundField HeaderText="Registration Date" DataField="RegisteredDate" DataFormatString="{0:MM/dd/yyyy hh:mm:ss}" />   here RegisteredDate is the CurrentDateTime from database under DataField  Any help will be appreciated.


Given $X_1,...,X_n$ iid. random variables which follow a $\mathcal{N}(\mu, \sigma^2)$ distribution. I already proved that  $T:=\frac{1}{n}\sum_{i=1}^n (X_i-\mu)^2$ is a minimal sufficient statistic for $\sigma^2$. Since, I want to apply the Lehmann-Scheffe Lemma, I have further to show that $T$ is complete, meaning that $\mathbb{E}_{\sigma^2}[g(T)]=0\Rightarrow g(T)=0$ for any measurable function $g$.   However, I am unable to do this, as I don't know how $T$ is distributed. Also there is a theorem which states that in exponential families the statistic is complete if the parameter space contains an open neighbourhood about the origin, but this is clearly not applicable since $\sigma^2\in (0,\infty)$. I would appreciate a little hint.


Does every smooth local frame of the tangent bundle correspond to a chart?

Every smooth chart $(U,\phi)$ on a smooth manifold $M$ determines a smooth local frame $U \to TM$ on the tangent bundle, namely $(\partial/\partial x^i)$, where $(x_i)$ are the coordinate functions of $\phi : U \to \mathbb{R}^n$. But is the converse true? Namely, given any smooth local coordinate frame $(\sigma_i) : M \supset V \to TM$, can we construct a chart such that the $\sigma_i$ are partial derivatives of the coordinate functions?


What should PhD students do when they are told to add authors who did not contribute to the paper (e.g., head of school, international funders)?

There's a department at my university where the head of department is routinely put as author on papers he didn't contribute to, and where researchers from overseas who had no input (but who provide funding to the department) are put on papers.    As a pragmatic matter, how should a PhD student respond when they are told to put three names on a paper, when those people didn't contribute?  Assume that refusing to put the co-authors on is not an option, because:   There will be bad consequences if they do not, and  This practice is routinely done at a high level, and there is nobody at the university to complain to about it.   This is not a duplicate of , because its answer assumes that it is practical for the student to refuse.


i have a problem i want to change power button's location instead of right side i want it to be on left side is it possible i want to look it like mac please help me.  please if it is possible to change location of power button please help me


Group with more than one element and with no proper, nontrivial sub groups must have prime order.

I want to show that if $G$ is a group with more than one element, and that $G$ has no proper non-trivial subgroups. Prove that $|G|$ is prime. (Do not assume at the outset that |G| is finite).  My question is not that how to prove it.  I am saying that suppose $|G|\geq 2$ possibly $|G|=\infty.$ By assumption the only subgroups of $G$ are $\{e\}$ and $G$, i.e., the trivial groups. Let $a$ be non-identity element in $G$. Consider $\langle a\rangle$. Then  $\langle a\rangle=G.$ So $G$ is cyclic.   My question is, why can I say that $G=\langle a\rangle$. I know there are only two subgroups and $\langle a\rangle\neq e$ because $a\neq e$. Therefore we must have $G=\langle a\rangle$. But my problem is why cant I say that consider $a,b\in G$ and then we look at $\langle a,b\rangle$. And then I say $G=\langle a,b\rangle$ and then I cannot say that $G$ is cyclic, and then I will have problem proving question.


My Ubuntu installation has decided not to work anymore. I suspect it's something graphical or to do with memory. Read on for more.  Background.  I installed Ununtu 14.04 on my laptop a few months ago and have had no problems whatsoever with it up until a few days ago. I had closed the laptop temporarily and it went into Sleep Mode. Then when I opened it again, it awakened. Cool. However, the screen remained completely blank except for when I moved the mouse or pressed a key on the keyboard, which briefly flashed my desktop wallpaper. After rollong my eyes and cursing the previous fifty years of software development, I performed a hard reset, got to GRUB2 and proceeded with loading Ubuntu. Now the boot process stalls shortly after the GRUB screen and I am left with a blank screen and a blinking cursor.   Attempts at Recovery.   Loaded "Ubuntu with Linux [latest version available on laptop] (Recovery Mode)" and performed all available tasks. Interesting note: I cannot use the "failsafeX" option; selecting this option fails to load Ubuntu with limited graphics. It attempts do so, but fails and reverts back to the Recovery screen.  Tried to reinstall Ubuntu with the same USB drive I used to install it in the first place. I can get to the first menu, but when I select "Install Ubuntu", it quickly crashes with the last line ending "VFS: failed to mount root fs in unknown block [2, 0]". This happens every time. In Boot Command list, removed "quiet splash" and replaced in with "nomodeset" because several people in different treads suggested this, without giving an explanation as to why it should be done. So naturally, I gave it a go. It didn't make any difference as far as I could tell.   Summary.   Laptop: Lenovo T410, had Windows 7 previously installed (still exists on a separate partition), Intel CORE vPRO i5, 4ĢB RAM, Intel Graphics. Laptop was running fine, sent it to sleep, woke it up, couldn't log in/do anything. Rebooted it. Booted to GRUB screen, selected Ubuntu.  Ubuntu fails to load. I get a flash of "Loading initial ramdisk" before I get the blank screen with the blinking cursor. Tried a few things. None worked. Stumped. Came online for help.   If anyone can shed any light over what's going on here, I would be very grateful.   EDIT:  Responses.  dadexix86.  1. I have never manually performed a filesystem check.    Ubuntu does not boot with an older version of Linux. I get the same result, every time. I did not suspend it after an update. I was not running any "exotic" processes. By exotic I mean system-critical, or otherwise important to the running of the system-, processes. I have no external repositories or software.  Thanks for getting back me.   anonymous2. 1. I can still boot to Windows.   I have not performed a memtest. I will do so now and report back. | Memroy check completed, no errors. Thanks for getting back to me.   Android Dev. 1. No problem, homie.  ComputerGuy. 1. I don't have Nvidia graphics.    I will try your suggestion and report back. | OK, I tried resetting Unity and it returned "WARNING: no DISPLAY variable set, setting it to: 0" and "ERROR: the reset option is now deprecated." So I don't know if that worked. I tried reinstalling LightDM, but I need network connectivity to do that, and I'm not able to enable this. I'm currently looking into that.    Thanks for the help so far, folks.


Article usage: "We are offering the product at the price of $20 per pound." Or "at a price of $20 per pound"?

We are offering our product to you at the price of $20 (twenty dollars) per pound.   Wouldn't it be better to write     We are offering our product to you at a price of $20 (twenty dollars) per pound.   When googling, I seem to find both variants, and can't make out the difference.   The Google Ngram for "at the price of" vs. "at a price of" is puzzling too:


Evaluating a series with some given formula

I have a formula for the power series corresponding to the function $$\frac{z^{3k}}{(3k)!}$$ and I need to evaluate a new series with it but I can't see how to manipulate it even though I've had some ideas... Here it is : the series $$\frac{27^k}{(3k+1)!}.$$ I've tried to change it into $$\frac{3^{3k}}{(3k+1)!}$$ and then make the exponent of 3 3k+1 rather than 3k but it gives an expression that I can't use. I've had the idea of writing equalities with sums for multiples of 3, multiples of 3 substracting 1 and adding 1,... but it doesn't seem efficient... Any hint would be of great help, thank you!


Stackoverflow not showing notifications and rep changes in chrome

I'd like to know why is stackoverflow not showing proper styles on chrome and how to fix it. This started happening yesterday. I'm using Chrome: Version 33.0.1750.154 m: Windows 7 x64.  Chrome:    But on IE it appears fine:    Any help is highly appreciated. Thanks.


There are several distinct usages:   kernel density estimation   kernel trick   kernel smoothing   Please explain what the "kernel" in them means, in plain English, in your own words.


Friends I have to impliment something in project, I found some difficulties, and is as follows:  String name1 = "Bharath"  // its length should be 12 String name2 = "Raju"     //  its length should be 8 String name3 = "Rohan"    //  its length should be 9 String name4 = "Sujeeth"   //  its length should be 12 String name5 = "Rahul"  //  its length should be 11  " Means all Strings with Variable length"   I have the Strings and their Lengths.I need to get output as in the below format.By using string concatination and padding.I need answer in Groovy, Even if Java also it is fine..  "Bharath     Raju    Rohan    Sujeeth     Rahul     "   Means:  Bharath onwards 5 black spaces as lenth is 12 (7+5 = 12),  Raju onwards 4 black spaces as lenth is 8 (4+4 = 8),  Rohan onwards 4 black spaces as lenth is 9(5+4),  Sujeeth onwards 5 black spaces as lenth is 12 (7+5),  Rahul onwards 6 black spaces as lenth is 11(5+6),


I am need for apache to have access on all (well... most anyway) user folders on the same machine, so that I can access some data, do some magic and then display them on a webpage for remote viewing.  What I thought would be the simplest solution is to create a dir alias that points to /home folder and allowing it to be accessed only locally, since all the "magic" will be happening server side and only the results will be shown. Problem is I cannot make the Alias to work.  I added the following in my /etc/apache2/mods-enabled/alias.conf to check if it is working:  Alias /home/ "/home" <Directory "/home">      Options Indexes MultiViews FollowSymLinks      AllowOverride None      Require all granted </Directory>   but I'm getting a 403 Forbidden. I also tried adding it as a virtual host on sites-enabled/000-default.conf and apache2.conf neither of which worked.  I also added www-data to a user group that has access to /home, just to be sure.  What am I missing here?


What distribution results in adding two Pareto distributions

I'm wondering what distribution results in adding two (or more) type-one Pareto distributions of the form $x^{-\alpha}$. Experimentally, it looks like a two-mode power-law, asymptotic to the difference of alphas.


What's the derivative of: $ \sqrt{x+\sqrt{{x}+\sqrt{x+\cdots}}}$?

let $ y=\displaystyle \sqrt{x+\sqrt{{x}+\sqrt{x+\cdots}}}$, i'm really interesting to know how do I find :  $\displaystyle \frac{dy}{dx}$ ?.  Note: I have used the definition of derivative of the square root function but i don't succed .  Thank you for any help


I am working in a jee maven project that needs to make a JDBC connection to SqlServer, using windows authentication.  To achieve that, I need to have the "sqljdbc_auth.dll" in my java.library.path .  I tried multiple solutions, none of them worked: maven_surefire_plugin to modify the property path. System.setProperty("java.library.path", "..."): this changed the property, but the connection didn't succeed telling me that the driver isn't configured for integratedSecurity connection. Add the dll to a lib folder in Web_Inf & set the "Native Library_Path" of the maven dependency sqljdbc. Add the dll to the bin folder in the "wildfly" server: gave me an exception: Exception Access Violation (fatal)  I appreciate any help, thank's in advance.


For starters I am using this GREAT answer to achieve custom post types as well as a custom way to insert those post types into other pages, you can view that answer here:   I am running into a problem however when wordpress auto saves itself, it clears whatever metadata i have put into the forms.  EXAMPLE:  I select the 3 drop downs I want from my metabox and hit update.  The page reloads and the 3 choices are still selected.  In phpMyAdmin i can look up the metadata and see the array in place as it should be.  I now wait for wordpress to auto save.  As soon as this happens i can either refresh the page (not update, just refresh) and the metadata is lost, or i can look up the metadata in phpMyAdmin and it will display nothing (ie: its gone).  I'm guessing that this has something to do with needing to tie into another hook (some sorta auto update hook) or something, but even then it doesn't make sense that it would actually delete your metadata (rather than just not auto updating it).  Last note: If you copy and paste Mikes code into functions.php, you should be able to recreate my error (in wordpress 3.1) very easy.


How is it possible that when you divide 1 by 9,899, you get two-digit Fibonacci numbers also being carried, etc.?

When I divided $1$ by $9,899$, I got two-digit Fibonacci numbers also being carried: $0.0001010203050813213455904636\dots$  When I divided $1$ by $89$, I got one-digit Fibonacci numbers at the beginning: $0.0112359\dots$ (there was originally an eight, but there was carrying and it changed to a nine)  How does all of this happen?  There is more than this, you know.  What do you think is going on here?


How to import a module given the full path of the module in python 3.5?

How can I load a Python module given its full path? Note that the file can be anywhere in the file system, as it is a configuration option. i am using python 3.5 in ubutnu , my code so far is :  Create python module test.py  import sys sys.path.append("test/lib/") from tes1 import Client1 from tes2 import Client2 import tes3


I want to render every Nth frame of an animation, in this case every 12th frame. This way I can play back the animation at 2fps and see if everything is going correctly.  I'm a real novice with Blender Python and cobbled this together:  import bpy  for f in range(startframe,endframe,NthFrame):     bpy.context.scene.frame_current = f     bpy.ops.render.render()     bpy.data.images['Render Result'].save_render(filepath="" + str(f) + '.png')    This kind of works, the right images are rendered and saved. However it completely freezes up Blender, and after about an hour it crashes on windows due to being unresponsive I guess. How can I fix this? Preferably I'd like it to work like rendering an animation normally works, i.e. being able to still use Blender and seeing the progress of each rendered frame.


How to sort an multidimensional array in ascending order in C#?

I created a 2d array of type string, which stores name, marks of 3 subjects and total marks. I need to display the records on basis of the rank i.e the student with higher total marks should be shown first. How can i achieve this in C#? Please help.....  class Program     {         static void Main(string[] args)         {             int noOfStudents, totalMarks, position = 1;             string studentName, engMarks, mathMarks, computerMarks;              Console.Write("Enter Total Students: ");             noOfStudents = Convert.ToInt32(Console.ReadLine());             string[,] studentInfo = new string[noOfStudents, 5];              studentInformation(studentInfo);              for(int i = 0; i < studentInfo.GetLength(0) + 1; i++)             {                 int temp, count = 0;                 for(int j = 0; j < studentInfo.GetLength(1); i++)                 {                     if (int.Parse(studentInfo[i,4]) < int.Parse(studentInfo[i+1, 4]))                     {                         temp = int.Parse(studentInfo[i, 4]);                         studentInfo[i, 4] = studentInfo[i + 1, 4];                         studentInfo[i + 1, 4] = temp.ToString();                     }                     else                     {                         count++;                     }                 }                     Console.WriteLine("Student Name: {0}, Position: {1}, Total: {2}/300", studentInfo[i,0], position, studentInfo[i, 4]);                     position++;              }              Console.ReadKey();                 void studentInformation(string[,] a) {                 for(int i = 0; i < noOfStudents; i++)                 {                     Console.Write("Enter Student Name: ");                     studentName = Console.ReadLine();                     studentInfo[i, 0] = studentName;                      Console.Write("Enter English Marks(Out of 100): ");                     engMarks = Console.ReadLine();                     studentInfo[i, 1] = engMarks;                      Console.Write("Enter Maths Marks(Out of 100): ");                     mathMarks = Console.ReadLine();                     studentInfo[i, 2] = mathMarks;                      Console.Write("Enter Computer Marks(Out of 100): ");                     computerMarks = Console.ReadLine();                     studentInfo[i, 3] = computerMarks;                      Console.WriteLine("************************************");                     totalMarks = (int.Parse(engMarks) + int.Parse(mathMarks) + int.Parse(computerMarks));                     studentInfo[i, 4] = totalMarks.ToString();                 }              }         }     } }


Is it possible to save the ISO, aperture, and other settings along with the image?

Is it possible to have the ISO, Aperture, and other setting save with the JPEG or RAW image when taking photos?   I have the Canon T5i, and I'm fairly new to photography. I can keep a log book with these settings, but I didn't know if there was a way to store this information with the saved image.


Special Relativity metric and imaginary sentence

we know that the simple form of the metric in the special relativity is like this: $ds^2 = dr^2 - (cdt)^2$ that in this metric $dr^2 = dx^2 + dy^2 + dz^2 .$ I want to ask why we minus the time sentence? I know the mathematical reasons but I wanna know what happens in nature and reality by minus of the time sentence.


Prove that $\int \int_S \hat n dS = 0$ where $\hat n$ is the outward drawn normal to any closed surface S.

Prove that $$\int \int_S \hat n dS = 0$$ where $\hat n$ is the outward drawn normal to any closed surface S.   I have no idea how to start. For one, if $dS$ is scalar, what does it mean to integrate a vector anyway?  I thought of going about it as such:  $S:\vec r=x\hat i +y\hat j+z\hat k$  $dS=\sqrt {1+(z_x)^2+(z_y)^2}$  $\hat n dS$=$-\frac{\partial z}{\partial x}\hat i--\frac{\partial z}{\partial y}\hat j+1\hat k$  But this got me nowhere.  I'll be grateful if someone can guide me along this question.


About Planck tension in strings theory as stated in "The Elegant Universe"

In the book "The Elegant Universe" by Brian B. Greene, on chapter 6 it is stated that there's the so called "Planck tension" in string theory, and it is given a value of $10^{39}$ tons. This value is repeated some times.  But tension should be given in Newtons, not kilograms: is it saying $10^{42}$ kiloponds? so that'd be ~$10^{43}$ N ... But Planck force is ~$10^{44}$ N.  I think this is not a duplicate of the question , or at least I need some clarification, because in that answer, it is stated:      "Because the string tension is not far from the Planck tension - one   Planck energy per one Planck length or $10^{52}$ Newtons or so"   But Planck energy / Planck length = $1.9561·10^9$ J / $1.616199·10^{-35}$ m ~ $1.21·10^{44}$ N (Planck tension)  Or does $10^{52}$ N refers to string tension and not to Planck tension? But  $10^{52}$ >> $10^{44}$ N, so they don't seem "not far" one from the other...  So being the disagreement between   $10^{52}$ N, Greene's  $10^{39}$ tons, and Planck tension  $10^{44}$ N :   Which is a correct value in Newtons for string tension? It ranges then from $10^{43}$ N ($10^{39}$ tons) to $10^{52}$ N? Is the value of Greene's book correct or is it an errata (this is unlikely, as I have seen this value in tons in comments from ths book) and if it is correct, how must that $10^{39}$ tons be converted to Newtons ? Is it correct $10^{43}$ N?


Different formulas for calculating power

$P=IV$, $P=I^2R$, $P=\frac{V^2}{R}$, what are the distinctions between these equations? How do you know which equation to use when?


Best practice to maintain high charge count

I have a MacBook Pro, always plugged, I put it to sleep during the night. Is  that the best thing to do if I want to maintain a high number of remaining charges, while also keeping a healthy battery?   Or should I turn it off at night instead of sleep, plug it off, or something else?


Tables below footnotes, is this a good output routine algorithm or a bug?

Consider the minimal code below, which produces two different layouts depending on the  table position marks.    The first layout uses   \begin{table}   which results in the table ending below the footnotes and the second,  \begin{table}[htbp]   results in the table ending above the footnotes. Is this normal behaviour in LaTeX? I think a better algorithm would have been to try and position images or tables above the footnotes; is it some form of a bug? Here is the MWE.  \documentclass{book} \usepackage[paperwidth=4.75in,paperheight=7.25in,             textwidth=4.5in,textheight=6.5in,             headsep=0.1in, footskip=0.15in,             marginratio=1:1]{geometry} \usepackage[latin,english]{babel} \usepackage[demo]{graphicx} \usepackage{booktabs,lipsum} \begin{document}  \selectlanguage{latin} \chapter{Errora}  Una imagine tabula, figura et \ae nigma.\footnote{translatio via google}.   \begin{figure}[htbp] \centering \includegraphics[width=0.3\textwidth]{./graphics/amato} \caption{Uno pictorum}  \end{figure} \begin{table}%[htbp] %uncomment to see difference \centering \begin{tabular}{cccc}   \toprule   Error &Errors &error &errors\\   \bottomrule \end{tabular}       \caption{Test} \end{table} %\lipsum[1-3] \end{document}   Edit:  I had a look at the documentation of the footmisc recommended by Thorsten Donig as a workaround where  Robin Fairbairns describes this behaviour as an "infelicity". There is a further infelicity, if you let both floats to float freely, the table floats to the next page and the image goes in the footer area, while there is ample space to have stayed exactly in its position in the text.


Given $n \in \Bbb Z$, determine $\gcd(3n^2 + 7n + 4, n + 2)$.

I factored $3n^2+7n+4$ to $(3n+4)(n+1)$ and because there isn't a common factor of those and $n+2$ I said that the gcd is $1$, but is there any othere way to go about it that would come up with a gcd that isn't $1$?


Have the rules on hyperspace changed in canon now?

In Star Wars - hyperspace travel has some limitations. For one, you can't get to close to a gravitational body.  We see this in Ep IV - the Falcon must lift off on repulsorlifts and travel at sublight away from Tatooine before entering hyperspace.  I seem to recall something in the novelization about "six planetary radii" when it explained how the Death Star moved using hyperspace and sublight engines.  In the now Legends canon - this gravity limitation was the explanation for the Kessel Run being measure in parsecs (basically, how much of a corner a ship can cut past a cluster of black holes), and even used tactically by the Empire with their Interdictor cruisers.  So, in the new film, how could the Falcon fly through hyperspace to get under the Starkiller Base shields?


If is was to stand deep inside the center of a black hole and was to point a light gun straight up at the center of the event horizon, would the beam of light make it out of the black hole?


Is there a way to get all possible partitions of an integer? Possibly specifying max and/or min summand. I'm interested in partitions themselves, not just partition count.


How do I get the size of a Linux or Mac OS X directory from the command-line?

What command do I use to find the size of all the files (recursively) in a Linux or Mac OS X directory?


Why does a query run slower in a Stored Procedure than in the Query window?

I have a complex query which runs in 2 seconds in the query window, but about 5 minutes as a Stored Procedure. Why is it taking so much longer to run as a stored procedure?  Here's what my query looks like.   It takes a specific set of records (identified by @id and @createdDate), and a specific time frame (1 year starting from @startDate) and returns a summarized list of letters sent and estimated payments received as a result of those letters.  CREATE PROCEDURE MyStoredProcedure     @id int,     @createdDate varchar(20),     @startDate varchar(20)   AS SET NOCOUNT ON      -- Get the number of records * .7     -- Only want to return records containing letters that were sent on 70% or more of the records     DECLARE @limit int     SET @limit = IsNull((SELECT Count(*) FROM RecordsTable WITH (NOLOCK) WHERE ForeignKeyId = @id AND Created = @createdDate), 0) * .07      SELECT DateSent as [Date]          , LetterCode as [Letter Code]         , Count(*) as [Letters Sent]         , SUM(CASE WHEN IsNull(P.DatePaid, '1/1/1753') BETWEEN DateSent AND DateAdd(day, 30, DateSent) THEN IsNull(P.TotalPaid, 0) ELSE 0 END) as [Amount Paid]     INTO #tmpTable     FROM (          -- Letters Table. Filter for specific letters         SELECT DateAdd(day, datediff(day, 0, LR.DateProcessed), 0) as [DateSent] -- Drop time from datetime             , LR.LetterCode -- Letter Id             , M.RecordId -- Record Id         FROM LetterRequest as LR WITH (NOLOCK)         INNER JOIN RecordsTable as M WITH (NOLOCK) ON LR.RecordId = M.RecordId         WHERE ForeignKeyId = @id AND Received = @createdDate             AND LR.Deleted = 0 AND IsNull(LR.ErrorDescription, '') = ''             AND LR.DateProcessed BETWEEN @startDate AND DateAdd(year, 1, @startDate)             AND LR.LetterCode IN ('a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o')     ) as T     LEFT OUTER JOIN (          -- Payment Table. Payments that bounce are entered as a negative payment and are accounted for         SELECT PH.RecordId, PH.DatePaid, PH.TotalPaid         FROM PaymentHistory as PH WITH (NOLOCK)             INNER JOIN RecordsTable as M WITH (NOLOCK) ON PH.RecordId = M.RecordId             LEFT OUTER JOIN PaymentHistory as PR WITH (NOLOCK) ON PR.ReverseOfUId = PH.UID         WHERE PH.SomeString LIKE 'P_'              AND PR.UID is NULL              AND PH.DatePaid BETWEEN @startDate AND DateAdd(day, 30, DateAdd(year, 1, @startDate))             AND M.ForeignKeyId = @id AND M.Created = @createdDate     ) as P ON T.RecordId = P.RecordId      GROUP BY DateSent, LetterCode     --HAVING Count(*) > @limit     ORDER BY DateSent, LetterCode      SELECT *     FROM #tmpTable     WHERE [Letters Sent] > @limit      DROP TABLE #tmpTable   The end result looks like this:   Date        Letter Code     Letters Sent    Amount Paid 1/1/2012    a               1245            12345.67 1/1/2012    b               2301            1234.56 1/1/2012    c               1312            7894.45 1/1/2012    a               1455            2345.65 1/1/2012    c               3611            3213.21   I'm having problems figuring out where the slowdown is, because everything runs extremely fast in the query editor. It's only when I move the query to a stored procedure that it starts taking so long to run.   I'm sure it has something to do with the query execution plan getting generated, but I don't know enough about SQL to identify what could be causing the problem.  It should probably be noted that all the tables used in the query have millions of records.  Can someone explain to me why this is taking so much longer to run as a stored procedure than in the query editor, and help me identify what part of my query could be causing performance issues when run as a stored procedure?


Is my logic straight? Logistic regressions in R

I'm doing an experiment on people's ability to read facial expressions on faces with and without covid-19 face masks. It's a between-subject design with repeated measures. One participant either saw 36 images with masks or 36 images without masks and their task was to tell which facial expression the face was showing. The 36 images were of 6 different people showing 6 different emotions. Condition 1 was with masks, 2 was without masks I have a dataframe like this: id = participant id baseFace = id for image person faceSex = gender of image person faceEmotion = the facial expression of the image person response = the participants response of which facial expression they think they saw accuracy = well, accuracy condition = if they saw condition 1 stimuli or condition 2 stimuli id | baseFace | faceAgeGroup | faceSex | faceEmotion | response | accuracy | condition 1    001        young          male       angry        sad        0          1 1    002        medium         female     happy        happy      1          1 1    003        old            female     sad          sad        1          1 1    004        young          male       neutral      sad        0          1 2    001        medium         female     happy        happy      1          2 2    002        old            female     sad          sad        1          2 2    003        young          male       angry        sad        0          2 2    004        medium         female     happy        happy      1          2 3    001        old            female     sad          sad        1          2 3    002        young          male       neutral      sad        0          2 3    003        medium         female     happy        happy      1          2 3    004        old            female     sad          sad        1          2 4    001        young          male       angry        sad        0          1 4    002        medium         female     happy        happy      1          1 4    003        old            female     sad          sad        1          1 4    004        young          male       angry        sad        0          1 5    001        medium         female     happy        happy      1          2 5    002        old            female     sad          sad        1          2 5    003        medium         female     happy        happy      1          2 5    004        old            female     sad          sad        1          2  My hypothesis is 1 People are better at reading facial expressions in faces without face masks 2 People will report higher levels of confidence in decisions when evaluating faces without masks AND NOW TO MY QUESTION Since my outcome is binary (accuracy), I use a logistic regression model: lme4::glmer(accuracy ~ condition + (1|id), df, family = binomial)   This is to me the most logical way to build the model since I'm using condition as predictor for accuracy. The question is: Would I violate any rules or my own hypothesis if I included more predictors or random intercepts? Here is my whole dataframe (in .csv) if it is useful:  Thank you for any help. I also  on StackOverflow but I was told to try here instead.


I need help understanding the following isomorphisms:  $$\mathbb Z[\sqrt{-5}]/(2,1+\sqrt{-5}) \cong \mathbb Z[X]/(X^2+5,2,1+X) = \mathbb Z[X]/(2,1+X) \cong \mathbb Z/2\mathbb Z$$  In general, I am also wondering whether the following are true, and if so briefly why:   $\mathbb Z[\sqrt{D}] \cong \mathbb Z[x]/(x^2 - D)$ for all squarefree integers $D$ $(R/I)/J \cong R/(I +J)$, ie why do we have things like $\mathbb Z[x]/(2,x^2+5)\simeq \mathbb Z_2[x]/(x^2+5) $ where $\mathbb Z[x] / (2) \cong \mathbb Z_2[x]$?   Also for example for something like the following:  $$\,\mathbb Z[x]/(2,x^2+5)\simeq \mathbb Z_2[x]/(x^2+1)$$  Is it true because of the third isomorphism theorem? I'm guessing we set $R = \mathbb Z[x]$, $I = (2)$, and $J = (x^2 + 5)$, but please expand more on each step of the reduction.


How to grant a user the rights to access to all new (future) databases?

On my development machine, I often create new web instances that all run as NT AUTHORITY\NETWORK SERVICE. I want to grant this account rights to access all new databases that I create in the future in my SQL Server 2008 R2 instance. I want to do this because it is too much of a hassle to grant rights to new databases every time I create a new web site.


What is the significance of this hand-shaped rock formation?

At the end of Star Wars: The Force Awakens, there's a curious rock jutting out at the feet of       Luke Skywalker     To my eye the rock suggests a hand reaching up from the earth - I couldn't place such a reference, but I wondered if it had some significance.  My six year old had been whispering to me "look for the hand" for the last fifteen minutes or so, as I hadn't noticed this character's actual hand on the first viewing. So ... I was probably wired for hand-shaped things at this point. It does look a strange rock shape though, and incongruous to the other rocks in the scene IMO.


Broken apt, can't update libglvnd due to unmet dependencies (Nvidia)

I haven't installed any new packages recently or added any PPAs, just ran apt update.  After running 'apt upgrade'  Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt --fix-broken install' to correct these. The following packages have unmet dependencies:  libglvnd-dev : Depends: libglvnd0 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libglvnd-core-dev (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libegl1 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libgles2 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libgl1 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libglx0 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed                 Depends: libopengl0 (= 1.0.0-2ubuntu2.1) but 1.0.0-2ubuntu2.2 is installed E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution).   After running 'apt --fix-broken install' or 'apt-get install -f'  Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following additional packages will be installed:   libgles1 libglvnd-dev The following NEW packages will be installed:   libgles1 The following packages will be upgraded:   libglvnd-dev 1 upgraded, 1 newly installed, 0 to remove and 1 not upgraded. Need to get 0 B/14.6 kB of archives. After this operation, 66.6 kB of additional disk space will be used. Do you want to continue? [Y/n] y (Reading database ... 686678 files and directories currently installed.) Preparing to unpack .../libgles1_1.0.0-2ubuntu2.2_amd64.deb ... Unpacking libgles1:amd64 (1.0.0-2ubuntu2.2) ... dpkg: error processing archive /var/cache/apt/archives/libgles1_1.0.0-2ubuntu2.2_amd64.deb (--unpack):  trying to overwrite '/usr/lib/x86_64-linux-gnu/libGLESv1_CM.so.1', which is also in package nvidia-340 340.106-0ubuntu3 Preparing to unpack .../libglvnd-dev_1.0.0-2ubuntu2.2_amd64.deb ... Unpacking libglvnd-dev:amd64 (1.0.0-2ubuntu2.2) over (1.0.0-2ubuntu2.1) ... dpkg: error processing archive /var/cache/apt/archives/libglvnd-dev_1.0.0-2ubuntu2.2_amd64.deb (--unpack):  trying to overwrite '/usr/lib/x86_64-linux-gnu/libGLESv1_CM.so', which is also in package nvidia-340 340.106-0ubuntu3 Errors were encountered while processing:  /var/cache/apt/archives/libgles1_1.0.0-2ubuntu2.2_amd64.deb  /var/cache/apt/archives/libglvnd-dev_1.0.0-2ubuntu2.2_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)   I tried switching back to nouoveau temporarily but due to apt being messed up I can't. The control file asks for all the dependencies to be *-2.2 but when I try to upgrade it's asking for *-2.1.  UPDATE I fixed it by running  sudo dpkg -i --force-overwrite /var/cache/apt/archives/libglvnd-dev_1.0.0-2ubuntu2.2_amd64.deb sudo dpkg -i --force-overwrite /var/cache/apt/archives/libgles1_1.0.0-2ubuntu2.2_amd64.deb sudo apt -f install


Unable to run jQuery script in my template file

I really want to run a simple code in my template file.  E.g. if I put somethign like this in my page.php:  <script type="text/javascript">     jQuery(document).ready(function($) {         alert("Hello world!");     }); </script>   It's not working.  But simple javascript is working:  <script type="text/javascript">         alert("Hello world!"); </script>   Why is jQuery blocked in WP to be included in template files?  and maybe more important question     WHERE IN THE WP SETTINGS CAN I RE-ENABLE THIS?   I know I can use wp_register_script etc. but in my scenario I need to paste simple javascript code in the template files.  How to allow load jQuery code snippets in WP template's file too?  And why is it even blocked?


ext4, btrfs, zfs and Ubuntu's future in 2017

It's two years later (than ).  Ubuntu is at 16.10 and we are about to celebrate 2017.  (And there is also a ZFS wrench in the Canonical gears now.)  How much longer will ext4 remain the default file system? What will succeed it and when?


How can I type the underlined symbols in LaTeX? I cannot recognize what letters they are.


Ubuntu 20.04 no sound out of Bluetooth headphones

This is on a machine I upgraded from 18.04 to 20.04 a few days ago. No issues at all getting sound to play out of headphones on 18.04.  The headphones are paired with Bluetooth. I unpaired and repaired them just to be sure. The settings panel for sound has them as an output option and I can select it without issue. However, no sound ever comes out of the headphones. I've even adjusted the volume both in the settings panel, in alsamixer and in pavucontrol. Nothing changes.  I see no errors in the bluetooth service log.  Output of:  { sudo lshw | grep product | head -n1 && sudo lspci -knn | grep Net -A3 && lsusb -v; } >output.txt 2>&1


Can a device be damaged by water even if there is no power supplied?

For example, say I submerged a computer mouse entirely. Assuming that I ensured that all traces of the water were gone, would the device suffer any issues?  It is my understanding currently that provided that there is no power being supplied to a device, and assuming that non-electronic damage like rust etc. hasn't taken place, then once the device is completely dry, it can be used without issue. Is this correct?


I was copy/pasting some commands into CMD (Windows 7) and accidentally pasted in an entire cmd history (from the Select All command). This included something along the lines of  Y:/>database.mdb   Which executed and apparently wrote Y:/ is not a recognized command over database.mdb. I've tried Recuva, but It didn't find the file. It wasn't really deleted, which is why I suppose it didn't work. Is there any way to get the file back? I have a backup, but it isn't as recent as I would like.


Why are pagenumbers centered with \pagestyle{headings} on \chapter{}'s first pages?

I'm using documentclass report with options twoside and openright. The pagestyle is headings. This is a minimal working example:  \documentclass[twoside,openright]{report}  \usepackage{blindtext}  \pagestyle{headings}  \begin{document}   \chapter{Chapter}    \blindtext \blindtext    \section{Section}     \blindtext \blindtext  \end{document}   Why is the page number at the first page of the chapter centered at the bottom and not on the right even though the document style headings works on all other pages? How to move the page number on the first page of a chapter to the right side as it should be using the document option openright?


I have a scanned 3D model with color information in PLY format.  However, I failed to add this information to render image in blender.   Someones shows that the attribute node can do the job. But I even can't find this node in 2.78 in node editor.   It seems that the software changes a little bit. The only option for input are   coordinates   curve time   Image  Texture  I tried the material mode, still there is not attribute node.    Can someone help me in this?


Well, as a Webdeveloper, german language sucks.  I have a from. In the head, there is at the first place:  <meta charset="utf-8">   I also checked the header. The following is set:  Content-Type:text/html; charset=UTF-8   In php.ini my default-charset is:  default_charset="utf-8"   The problem is in HTML/PHP because when I write Umlauts (äöü) directly in the database, PHP gets the right string, when I var_dump it. On the other side when I fill out the textarea and send the form, the var_dump for the POST-Parameter has everytime 2 questionmarks instead of the Umlauts.  ä -> ??   How can I fix it?


How to save changes and installed packages so I can install them in other systems

I want to format my system, but I don’t want to lose my updates and installed packages. I also want the same packages on other systems as well.


Wasn't Mrs. short for mistress? Why do we read Mrs. as missus(or sometimes missis) instead of mistress?


Evaluating $\int_0^\infty \sin x^2\, dx$ with real methods?

I have seen the Fresnel integral  $$\int_0^\infty \sin x^2\, dx = \sqrt{\frac{\pi}{8}}$$  evaluated by contour integration and other complex analysis methods, and I have found these methods to be the standard way to evaluate this integral.  I was wondering, however, does anyone know a real analysis method to evaluate this integral?


Scheduled Apex Class Not Executing in Test Class

Hey guys so I’m having trouble with testing my scheduled apex class that is sending an email. The problem that is occurring for me is that when I click test, my System.assertEquals are not true meaning the job did not execute and the email did not send. Keep in mind that it works in my sandbox when I simply schedule it through the UI, but for my test class. It is not doing the same. So my main question is, how do I execute my scheduled job in my test class? Here is the original class, and the test class. Class: global class Survey_Reminder implements Schedulable {   public Static  String Chron= '0 35 11 ? 6 3'; global void execute(SchedulableContext ctx) {         List<test_sites__c> sitelist = [SELECT Name,Last_Survey_Date__c,Id FROM test_sites__c WHERE Status__c = 'Active'  AND  Last_Survey_Date__c <= :Date.Today().addDays(-30) AND Last_Survey_Date__c <= TODAY LIMIT 10];     String sitestring= ' ';     if(sitelist != null)     {     for(test_sites__c site : sitelist)     {          sitestring += site.Name + ' ';               }     } else     {         sitestring = 'No sites to Report';     }                Messaging.SingleEmailMessage mail = new Messaging.SingleEmailMessage();             String[] toAddress = new String[] {'testemail@testemaill.com'};             mail.setToAddresses(toAddress);             mail.setSubject('Test Email');             mail.setBccSender(false);             mail.setSenderDisplayName('Survey Reminder');             mail.setPlainTextBody('Testing email  ' + sitestring);             mail.setHtmlBody('<p>Testing email   </p> '+ sitestring);             Messaging.sendEmail(new Messaging.SingleEmailMessage[] { mail });  } }  Test: @isTest private class Reminder_Test {          static testmethod void testScheduledJob()     {List<test_sites__c> sites2 =  [SELECT Name FROM test_sites__c];      Integer sitecount = sites2.size();      System.debug('site count before insert: '+ sitecount);                        List<test_sites__c> sites = new List<test_sites__c>();         Date survey =  Date.today().addDays(-30);         for(integer i = 0; i<4; i++)         {             test_sites__c site = new test_sites__c();             site.Name = ' '+ i;              site.Last_Survey_Date__c= survey;                                     sites.add(site);         }         insert sites;            sites2 =  [SELECT Name FROM test_sites__c];       sitecount = sites2.size();      System.debug('site count after insert: '+ sitecount);               Test.StartTest();         Survey_Reminder reminder = new Survey_Reminder();          String Job = System.schedule('Test Rem', Survey_Reminder.Chron, reminder);                 integer beforeinvocations = Limits.getEmailInvocations();         System.assertEquals(0,beforeinvocations,'no email sent');                  Test.stopTest();         CronTrigger ct = [Select Id,CronExpression,TimesTriggered,NextFireTime FROM CronTrigger WHERE id = :Job];                  System.assertEquals(1, ct.TimesTriggered);         System.assertEquals(1, beforeinvocations,'email sent');               }  }


Congruence with a power of 2 as exponent

Anyone knows any elementary way of solving this?  What's the least integer $a>1$ for some $n$ positive integer such that $a^{2^n}-1$ is a multiple of 2015?


Proof that $\mathbb{Z}$ has no zero divisors

Everyone knows the rules of zero divisors like $$\forall \alpha,\beta\in\mathbb{R}\;:\;\alpha\cdot\beta = 0\Rightarrow\alpha=0\vee \beta=0.$$ But how can I prove it for $\mathbb{Z}$? My first try was this one: For $\alpha\cdot \beta=0$ and $\alpha\neq 0$ let $$0=\alpha^{-1}\cdot 0=\alpha^{-1}\cdot (\alpha\cdot\beta)=(\alpha^{-1}\cdot \alpha)\cdot\beta = \beta = 0\Rightarrow \beta = 0;$$ and the same for $\beta\neq 0\Rightarrow \alpha=0$, however i realized that the multiplicative inverse of a number $\alpha\in\mathbb{Z}$ is not defined in $\mathbb{Z}$ (because $(\mathbb{Z},\cdot)$ is not a multiplicative group). What now?  Furthermore the information: it's about basic multiplication and I should prove this via the basic "rules" neutrality of 0 and 1, comparability of 0 and 1, commutativity, associativity, distributivity, irreflexivity or transitivity. Group-theory should not be mentioned in the solution as out instructors don't want us to use these "advanced techniques"!  The rules (to use some from) are the following: $\forall a,b,c\in\mathbb{Z}:$   $a+0=a,\;\;\;\; a\cdot 1=a$ $0<1$ $1+(-1)=0,\;\;\;\; 0-a=(-1)\cdot a$ $a+b=a+c \Rightarrow b=c$ $a\cdot b=a\cdot c,a\neq 0\Rightarrow b=c$ $0 < a \Rightarrow a\neq 0$ $a<b\wedge b<c\Rightarrow a<c$ $a<b\rightarrow a+c<b+c$ $a<b\wedge 0<c\Rightarrow a\cdot c<b\cdot c$ $a<b\wedge c < 0\Rightarrow b\cdot c < a\cdot c$


Why is it Pythonic to initialize lists as empty rather than having predetermined size?

Short version of my question: Why is it common practice in Python to initialize an empty list even when the size of the list might change many times such as the following:  arr = [] for i in range(10):    arr.append(i)   Isn't it computationally expensive to change the size of an array iteratively?  Long version of my question: I'm used to using MATLAB and am relatively new to Python. When I want to create an array, it is common practice in MATLAB to initialize an array of zeros of appropriate size, and then replace the elements of the array with the elements you want to end up with. This is because changing the size of an array iteratively in MATLAB is computationally expensive. Is there something about Python that avoids this expense? When I see people answer Python questions on this website that involve preinitializing a list to be added to, they always create an empty list and subsequently change the size, something I have always regarded as inefficient.


How to represent a number with a repeating decimal as a ratio of integers

How to express the following number as a ratio of integers:  $10.1\overline {35}$  where 35 repeats infinetly. so:  $10.135353535353535353535353535\cdots$  Basically I did this so far  $\frac {101}{10} + (.35) *$ geometric infinite series $\left(\frac 1{10}\right)^n$  But this isn't right. What am I doing wrong with my infinite series? I want to make it correct so I can use the sum formula.  The answer is: $\frac {5017}{495}$  But I'm not sure how to get that answer.


Is there still the material override feature within render layers in Blender 2.8?

I could not find this feature in the alpha version of Blender 2.8, nor could I find any information on whether the feature will still be available with the release. I only found a hint in  where a responder said the interface for the layers is not yet fully implemented. Does anyone know if this feature will still be available with the new release? Thank you.


Why (and how) to verify the signature of a download?

I have downloaded rsync from the . Each rsync download is associated with a signature.  First, why should I check the signature? What am I risking if not doing that? I assume that if someone is able to inject malicious code to the website, then is also able to generate a new signature and replace the original one.  Second, how do I verify the signature with a command line tool? In my system I have got gpg installed, can I used that?


Is it possible that there is no theory of quantum gravity?

{{Under Construction}}      Short question: What published works and what research groups are investigating the possibility of non-existence of gravity at quantum level?  Long question: I am no physicist, but of what I read and understand of the subject, no-one has been able to fit the graviton into the standard model, it seems that the equations won't re-normalize, thus it would be useless for predictions. Gravity also is undetectable at the quantum level, it seems because the force is too small. Also, about every book about the subject traces a strong distinction between "quantum level" and "classical level", almost if they were different worlds that obey different laws of nature, and how they relate to each other is an open question. Finally, at least two sources I have seen state that Einstein's General Relativity is the most well verified theory of all physics, because of something related to pulsars.  Thus there are two distinct "worlds": in one gravity is pretty much settled, while in the other, it is neither detectable nor mathematically explainable in the most successful model. From that, the most logical and simple explanation I can have is that simply there is no such thing as quantum gravity, and that it is a purely classical phenomenon that arises from whatever may be the relation between both "worlds".  I like to imagine that space coordinates of both worlds are not quite the same, although very similar locally, thus, if classical world emerges from a projection of the quantum world, like a shadow, gravity is bumps in the surface where that shadow is projected (holographic principle comes in my mind now).  It doesn't seems to be the mainstream view of the problem, with millions of dollars spent in trying to find the mythical graviton (that is what a physicist of INPE, Brazilian's spacial research institute, told me yesterday). Thus, I want to know, what are the works, and what people shares with me this view of the problem?


Set value in dictionary if value not there?

I am using a dictionary to store a bunch of counters where each counter is counting the occurence of a file type (.wav, .mp3, etc).  filetypecounter = {}   When I come across a certain file type I want to be able to increase a counter in a pythonic way. So I am thinking...  filetypecounter[filetype] +=1   However, if the filetype is not in the dictionary I want to instantiate it to 1. So my logic is if filetype counter is there, add 1 to the counter value, else set it to one.  if filetype not in filetypecounter:     filetypecounter[filetype] = 1 else:      filetypecounter[filetype] +=1   Is there a more pythonic way?


Under "Settings" => "Reading", I have set "Blog pages show at most" to 6.  I have created a category called 1970s where one can see all the best Rock albums of the decade -> Meanwhile, I have created subcategories (1970, 71, 72, 73 etc...) where one can see the best albums of the respective year.  Here is the problem(s), in the subcategories I am getting exactly the same results as in the parent category + pagination is not working.  I am using the Genesis Framework and I am working with the Sample theme, Here is my custom category.php file:  function rock_custom_loop() { ?>
The Verybest of the:  <?php echo single_cat_title( '', false ) ?>
          <?php if ( category_description() ) :  ?>
<?php echo category_description(); ?>
         <?php endif; ?>            <?php     global $post;      $args = array(         'post_type'      => 'post',         'post_status'    => 'publish',         'paged'          => get_query_var( 'paged' )     );      global $wp_query;     $wp_query = new WP_Query( $args );      if ( have_posts() ) :         while ( have_posts() ) : the_post(); ?>

                     <a href="<?php the_permalink(); ?>" title="<?php the_title_attribute(); ?>"><?php the_post_thumbnail('category-thumb-2'); ?>

<a href="<?php the_permalink(); ?>" title="<?php the_title_attribute(); ?>"><?php the_title(); ?>

          <?php         endwhile;         do_action( 'genesis_after_endwhile' );     endif;      wp_reset_query(); }  add_action( 'genesis_loop', 'rock_custom_loop' ); remove_action( 'genesis_loop', 'genesis_do_loop' );   genesis();   So I hope you can help find the bug (Subcategories + pagination)!  I have attached the following 2 pictures for visualization


Java: Why is there a NullPointerException when there is no null?

This is my first time using this site so hopefully this makes sense. I have my code below and when I execute it its giving me a NullPointerException on line 38 in my Library class,  (the line says if (items[i].getTitle() != null && items[i].getTitle().equals(title)) {)   and another NullPointerException on like 29 in my MainMethod class,   (line is if (loaned == true) {).   To check the contents of items[i], after I added an item I had printed in the console to see if it was null and it successfully printed so I am confused as to why the NullPointerExpcetion is present. Any and all help will be greatly appreciated.  public class MediaItem {  private String title; private String format; public boolean onLoan; public String loanedTo; public String dateLoaned;  MediaItem() {     onLoan = false;     loanedTo = null;     dateLoaned = null;     title = null;     format = null; }  MediaItem(String title, String format) {     this.title = title;     this.format = format; }  public String getTitle() {     return this.title; }  public String setFormat(String format) {     this.format = format;     return this.format; }  public String getFormat() {     return format; }  void markOnLoan(String name, String date) {     if (onLoan == true) {         System.out.println(title + " is already on loan to " + loanedTo);     } else {         onLoan = true;         loanedTo = name;         dateLoaned = date;     } }  void markReturned() {  }   }  import java.util.Scanner;  public class Library {  int numberOfItems = 0; MediaItem[] items = new MediaItem[100];  int displayMenu() {     Scanner s = new Scanner(System.in);     System.out.println(             "1. Add an item \n2. Mark an item as on loan \n3. List all items \n4. Mark an item as returned \n5. Quit \n\nWhat would you like to do?");     int choice = s.nextInt();     return choice; }  void addNewItem(String title, String format) {     items[numberOfItems] = new MediaItem(title, format);      numberOfItems++;  }  void markItemOnLoan(String title, String name, String date) {     for (int i = 0; i <= 100; i++) {         if (items[i].getTitle() == title) {             items[i].onLoan = true;             items[i].loanedTo = name;             items[i].dateLoaned = date;         }     }  }  boolean checkIfLoaned(String title) {     char loaned = 'N';     System.out.println(items[0].getTitle());     for (int i = 0; i < 100; i++) {         if (items[i].getTitle() != null && items[i].getTitle().equals(title)) {             if (items[i].onLoan) {                 String personName = items[i].loanedTo;                 System.out.println(title + " is already on loan to " + personName);                 loaned = 'Y';             }         }      }     if (loaned == 'Y') {         return true;     } else {         return false;     } }   }  import java.util.Scanner;  public class MainMethod {  public static void main(String[] args) {     int choice = 1;     String personName;     String mediaName;     String format;     String loanDate;     Scanner s = new Scanner(System.in);     Library l = new Library();      while (choice != 5) {         choice = l.displayMenu();         switch (choice) {         case 1:             System.out.println("What is the title?");             mediaName = s.nextLine();             System.out.println("What is the format?");             format = s.nextLine();             l.addNewItem(mediaName, format);             break;         case 2:             System.out.println("Which item (enter the title)?");             mediaName = s.nextLine();             System.out.println("Who are you loaning it to?");             personName = s.nextLine();             boolean loaned = l.checkIfLoaned(mediaName);              if (loaned == true) {                 break;             }             System.out.println("When did you loan the item?");             loanDate = s.nextLine();             l.markItemOnLoan(mediaName, personName, loanDate);         }      } }   }


Principal $n$th root of a complex number

This is really two questions.   Is there a definition of the principal $n$th root of a complex number? I can't find it anywhere. Presumably, the usual definition is $[r\exp(i\theta)]^{1/n} = r^{1/n}\exp(i\theta/n)$ for $\theta \in [0,2\pi)$, but I have yet to see this anywhere. Is this because it has bad properties? For instance, according to this definition is it true that for all complex $z$ it holds that $(z^{1/a})^b = (z^b)^{1/a}$?


Prove Borel Measurable Set A with the following property has measure 0.

This question is exercise 4.10 of Richard F. Bass's Real Analysis for Graduate Students, 2nd edition.  Let $\epsilon \in (0,1)$, let $m$ be Lebesgue measure, and suppose $A$ is Borel Measurable subset of $\mathbb R$. Prove that if $$ m(A\cap I)\leq (1-\epsilon)m(I)$$  for every interval $I$, then $m(A)=0$.  Collection of my thoughts  1. Try to prove by contradiction, suppose $m(A)=a>0$ Borel Measurable Set satisfies the condition given. A property of any Borel Measurable Set on $\mathbb R$ is $A$ contains a closed set $F$ and is contained in open set $O$, and the measure of $F$ and $O$ can be arbitrarily close to $a$. 2. Obviously $A$ contains no interval, but it does not lead to contradiction, because we can find an example of $m(A)>0$ that contains no interval(fat Cantor Set(remove middle 1/4 each time) has measure $1/2$ and contains no interval).  2'. For fat Cantor Set $C$ and given $\epsilon>0$ how could we construct an interval I satisfies $m(C \cap I)>(1-\epsilon)m(I) ?$   Maybe try to write Borel measurable set as countable union/intersection of intervals.   I'm stucked here and will appreciate any help, some examples/special case will be great too.


Is there consensus in the field of statistics that one book is the absolute best source and completely covering every aspect of GLM - detailing everything from estimation to inference?


Why does the Ubuntu installer not detect the hard drive during installation?

I have a new computer with a Seagate ST500DM002 SATA internal hard drive.  I am trying to install Ubuntu 11.10 64-bit on it but the installer does not recognize/detect/see the hard drive. When I reach the Installation type step, the panel which is supposed to show devices and partitions looks empty.  sudo fdisk -l shows only /dev/sda1, the USB drive from which I am running the installation. I have already tried the following two solutions without any success:   sudo apt-get remove dmraid Switch the SATA mode in the BIOS from IDE to AHCI   I am sure it's not a hardware related problem as I have already successfully installed another operating system on the same computer.  The output of sudo lshw -class storage -class disk follows:    *-ide UNCLAIMED                 description: IDE interface        product: ASMedia Technology Inc.        vendor: ASMedia Technology Inc.        physical id: 0        bus info: pci@0000:06:00.0        version: 01        width: 32 bits        clock: 33MHz        capabilities: ide msi pm pciexpress cap_list        configuration: latency=0        resources: ioport:d040(size=8) ioport:d030(size=4) ioport:d020(size=8) ioport:d010(size=4) ioport:d000(size=16) memory:fe400000-fe4001ff   *-storage        description: SATA controller        product: 6 Series/C200 Series Chipset Family 6 port SATA AHCI Controller        vendor: Intel Corporation        physical id: 1f.2        bus info: pci@0000:00:1f.2        logical name: scsi1        version: 05        width: 32 bits        clock: 66MHz        capabilities: storage msi pm ahci_1.0 bus_master cap_list emulated        configuration: driver=ahci latency=0        resources: irq:44 ioport:f0b0(size=8) ioport:f0a0(size=4) ioport:f090(size=8) ioport:f080(size=4) ioport:f060(size=32) memory:fe705000-fe7057ff      *-cdrom           description: DVD-RAM writer           product: DVDRAM GH22NS70           vendor: HL-DT-ST           physical id: 0.0.0           bus info: scsi@1:0.0.0           logical name: /dev/cdrom           logical name: /dev/cdrw           logical name: /dev/dvd           logical name: /dev/dvdrw           logical name: /dev/scd0           logical name: /dev/sr0           version: EX00           capabilities: removable audio cd-r cd-rw dvd dvd-r dvd-ram           configuration: ansiversion=5 status=nodisc   *-scsi:0        physical id: 1        bus info: usb@1:1.2        logical name: scsi6        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           physical id: 0.0.0           bus info: scsi@6:0.0.0           logical name: /dev/sda           size: 14GiB (16GB)           capabilities: partitioned partitioned:dos           configuration: signature=0004e5a4   *-scsi:1        physical id: 2        bus info: usb@1:1.3        logical name: scsi7        capabilities: emulated scsi-host        configuration: driver=usb-storage      *-disk           description: SCSI Disk           product: Storage Device           vendor: USB Mass           physical id: 0.0.0           bus info: scsi@7:0.0.0           logical name: /dev/sdb           capabilities: removable         *-medium              physical id: 0              logical name: /dev/sdb   Any idea on what I could do to fix this problem?


Which number was removed from the first $n$ naturals?

A number is removed from the set of integers from $1$ to $n$. Now, the average of remaining numbers turns out to be $40.75$. Which integer was removed?  By some brute force, I got $61$. I want to know if there's any analytic approach?


How can you discover who is connected to a wifi network near you? (you not being connected to it).   I know that some tools can scan your own network, and that some tools like Wireshark can monitor packages (and you can see the MAC addresses of these packages). But what I want to find is a tool that is command-line based for networks where I don't belong.  Is there any simple kismet or nmap command to output this information?


Are there dynamic Tex Editors that are like Overleaf that one can download and use? My idea is one that can allow me to write Tex Code, and just press a button and have compiled in a split-screen. Currently, I have MikTex, and it works but if anyone knows how to make it be like a split-screen and not a new window? I see under window ribbon that side by side option, but I believe it is not the same thing.


Insufficient storage message when attempting to install app

I am using a Samsung Galaxy S2. I have been trying to download apps, but get the insufficient storage message even though I have enough space free. However, the internal storage is almost full (200 MB remaining). Below is the amount of storage space which is used on my phone:  Internal Storage: Used: 1.8GB/2.0GB Device Storage:   Used: 3.9GB/11.5GB SD Card Storage:  Used: 4.0GB/7.4GB


Create link from a text address box to automatically go to Google Maps Street View

I want to create a link that takes me to the address' Google Street View. I found this:   The solution for the question above was:  Pennsylvania Ave SE, Washington, District of Columbia, 20003  Is there a parameter I can add to the link to make it automatically go to Street View?  I am currently using the arcgis World Geocoder in my application, so I will try to pass the address entered into the link to google Street View.      function locate() {       map.graphics.clear();       var address = {         "SingleLine": dom.byId("address").value       };       locator.outSpatialReference = map.spatialReference;       var options = {         address: address       }       locator.addressToLocations(options);     }   Thank you!


What is a nice way to say "kicking ass"?

Often in a professional setting, I want to say "X has really been kicking ass (and taking names!)"  Sometimes I say "kicking butt" but it doesn't have quite the same emphasis. I don't want to say ass as I don't think its polite in some contexts. What is a equivalent expression that is polite yet just as encouraging?   In accordance with the comment suggestions, I will clarify that this question is asking about "kicking ass" in the form of doing really well, not necessarily beating someone else in a competitive sense - to trounce, cream, take them to the cleaners, etc. If Sarah is kicking ass at real estate sales, she's not necessarily beating anyone else, just doing really well.


How to fix font displaying as empty box in Ubuntu?

Font displaying as empty square in Ubuntu.


On a 120GB SSD hard drive in a MacBook only 70GB are available. The missing 50GB are not even shown as free space.  Here is what the output of Disk Utility looks like:        As you can see on the first screenshot the disk has 120GB. However, the partition chart on the same screenshot only shows 70GB. Also the other two screenshots show that only 70GB out of 120GB seem to be available.  The command diskutil list shows that the physical disk0 is 120GB big, but the synthesized disk1 only 70GB:  /dev/disk0 (internal, physical):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      GUID_partition_scheme                        *121.3 GB   disk0    1:                        EFI EFI                     209.7 MB   disk0s1    2:                 Apple_APFS Container disk1         70.0 GB    disk0s2  /dev/disk1 (synthesized):    #:                       TYPE NAME                    SIZE       IDENTIFIER    0:      APFS Container Scheme -                      +70.0 GB    disk1                                  Physical Store disk0s2    1:                APFS Volume Macintosh HD            60.2 GB    disk1s1    2:                APFS Volume Preboot                 21.7 MB    disk1s2    3:                APFS Volume Recovery                509.9 MB   disk1s3    4:                APFS Volume VM                      2.1 GB     disk1s4


The question is $n$ students are standing in a circle.  Find the number of ways in which $k$ students can be selected such that no two of them are together. I know one method to do this by comparing it with a question like "find number of triangles that can be formed inside an $n$-sided polygon such that no side of triangle is common to the $n$-sided polygon" but that'll be valid only when $k=3$. I want to know general method to solve such questions and also the principle behind that method. Any help appreciated 😃


When did Stack Exchange implement HTTPS?

This is new right?  I heard running sites over https was avoided because of issues with ads but now it looks like the entire network has it.  Connection doesn't run over https by default though, at least not on iOS safari.  You have to type in the url manually, anybody know why?    *EDIT    I guess this is somewhat of a duplicate but I checked the original thread and couldn't find anything anything about typing https manually into the url.  I'd still like to know if it's normal to have to do this or if stack exchange should be connecting automatically over https.


After installing system update I can't login to my user

At the login screen, I type my password, then hit enter and I see a quick black screen with some text, as if something crashed, and it goes back to the login screen..  Help?


Is dice stat rolling still legal in the Adventurer's League?

I was playing a good old one-off campaign tonight, and will be playing the same character through adventure league. I was playing a half-elf sorcerer, and my charisma modifier came into effect. I had rolled my stats, in the way it describes in the second chapter of the 5e handbook, and had gotten lucky with a 17. Half-elf adds two to that (19) and my proficiency bonus made it out to be +6. My DM told me promptly that there was no rolling involved with stats, and that it should be a +5.  This bugged me, so I stared at the page for 5-6 minutes, trying to find the lie. It says something along the lines of roll 4d6, and don't count the lowest number, and then rinse and repeat for 5 more numbers, and those are your stats.  Is this system still legal in adventure league?


Some hints for the evaluation of this infinite product would be appreciated.  $a_0 = 5/2$.  $a_k = (a_{k-1})^{2} - 2$ for $k\geq1.$  Evaluate : $$\prod_{k=0}^{\infty}{\left(1-1/a_k\right)}.$$  I tried finding $a_1$ $a_2$ and so on, and then multiplying them to see if I could find an easier sequence to solve but I could no proceed any further, any help would be appreciated.


Conditional probability problem of three choices

I have the following problem where I have difficulties grasping the intuition:      Lets say we have three boxes, with two of them empty and one   containing a gold price. Lets say we randomly select one of the boxes.   After our selection, we are given which one of the remaining two boxes does not contain the price. Now the question is: Should I   stick with my original selection or select another box from the two   possible alternatives left. What are the probabilities?   I empirically tried this problem by making a computer program to repeat this experiment 1,000,000 times with first staying with the original choice and then always changing the selection. I got the probabilities to be:   $$P(golden\; price\;with\;original\;selection)\approx33\%$$ $$P(golden\; price\;with\;changing\;selection)\approx 66\%$$  Intuitively the probabilities seem at first to be 50% for both of these choices, but it seems it's not the case. I can't grasp on why?...  P.S. please let me know if my question is unclear


What is the maximum effective range of the Death Star's Superlaser?

As we discussed it in , the Death Star  can deliver a mind-boggling amount of energy. If it is capable of blowing up an Earth-sized planet, this means the equivalent of the annihilation energy of over 1,200,000,000,000 tonnes of . In comparison, nukes measure on this scale in the gram range (the one used at Hiroshima being under one gram). This means, even if the shot gets a million times weaker due to distance, it is probably still enough to kill all multi-cellular life on a planet.  Regarding this, how much is the maximum effective range of the Death Star? By effective I mean that even if it does not blow up a planet Alderaan-style, it delivers enough damage on a planetary scale to effectively cripple a planet.  Is there any related information in the expanded universe?


Where is Google Play Books storage location?

I found hints that the location might be "Android/data/com.google.android.apps.books". I don't have that folder. I have searched every file in my system looking for the book file.  I have folders: "...apps.magazines"   and "....apps.maps", but no "...apps.books".  Also what does the thumbtack mean on the books page cover under library view... Is there a manual somewhere?


Need some help in recognizing a font on the image

Can't figure out, what kind of font is used here? Could somebody help?


Many questions have been asked about specific bugs and problems with global hotkeys, media keys, etc. especially in Ubuntu 14.04. I'm still having difficulty troubleshooting them though, so I wanted to clarify some basic background information about how they work.   Which general process(es) or packages are involved in detecting and/or responding to global hotkeys / shortcuts?  For a regular Ubuntu 14.04 installation, is this built in to Unity? (Honestly I'm a bit confused about the relation between Gnome and Unity, but it seems like Gnome is somehow still involved?) Aside from the "Keyboard" dialogue under "System Settings", are there other settings or configuration files that effect them?


Is $f(x)=x+\frac{x}{x+1}$ uniformly continuous on $(0,\infty)$   Going from the epsilon delta definition we get:   $$\forall x,y>1,\text{WLOG}:x>y \ ,\ \forall\epsilon>0,\exists\delta>0 \ s.t. \ |x-y|<\delta\rightarrow |x+\frac{x}{x+1}-y-\frac{y}{y+1}|<\epsilon$$  But I'm not really sure on how to continue from here.  Alternatively: if $\lim\limits_{x\to \infty}f(x)$ exists on $[0,\infty)$ then the function is uniformly continuous, well, it's easy to see here that $\lim\limits_{x\to \infty}f(x)=\infty$ but is that enough ?


I wish to draw the following diagram, but I do not know how to draw it correctly, may you please help me


How to get all href attributes values of

   How can I get Href attributes values in one array?


I need help with the minecraft dinosaur mod

I have a survival world I have been playing on it before I got the dinosaur mod. Can I get the fossils to spawn in caves on this world? Or do I have to make a new world in order for the fossils to spawn in caves and other world generation? I'm having the same issue with the dragons mounts mod.


Find all natural numbers $n$ and $m$ for which $n^m=(n-1)!+1$

Find all natural numbers $n$ and $m$ for which $$n^m=(n-1)!+1.$$  By the Wilson theorem, $n$ is prime. Obviously, $m < n$.  For example, some solutions $(n, m)$ are $(2, 1)$, $(3, 1)$ and $(5, 2)$.


I was reading a Python textbook when I saw this piece of code:  def print_matches(matchtext):     print "Searching for", matchtext     while True:         line = (yield)      if matchtext in line:         print line  matcher = print_matches("python") matcher.next() matcher.send("Hello World") matcher.send("python is cool") # prints "python is cool" matcher.send("yow!") matcher.close()   I always considered it a kind of return-sibling, so now I am really interested how (yield) works. Some people referred me to  and .  But as I am not a native speaker it's really hard for me to understand anything written in there. Could anyone please tell me in as simple language as possible how (yield) works?  I understand the syntax when you use "yield" to return object on demand. But I don't understand the implementation of "line = (yield)". Why "yield" is a value of a variable?


Probability that two people share the same birthday?

Suppose a room contains $n$ people. What is the probability that at least two people share the same birthday?   Let $A$ be the probability that at least two people have the same birthday. I know that the way to solve this question is actually to find the complement of A and solve $1 - P(A^c)$. However, I'm confused on why $A^c$ is the probability that no one shares the same birthday (everyone has different birthdays), and not the probability that at most two people share the same birthday. Isn't the opposite or complement of "at least two people share the same birthday" equal to "at most two people share the same birthday?"


Calculating average raster values around set of points using ArcGIS for Desktop (or R)?

I have a 30-m elevation raster as well as a set of points that overlay the raster.    For each point, I want to calculate the average elevation within a 5-km radius of the point.  One way I was thinking of doing this was by creating 5-km buffers around each point, then using those buffers to calculate the average values of the elevation raster.  This should work but I find it hard to believe that there is no easier way of doing this.  Does anybody know?    I would prefer a solution using ArcGIS 10.1 for Desktop but I could use R too.


One of my players have recently reached the age were they would start feeling the downsides of being old, and I haven’t found any rules about the effects. Is there any written rule that describes the effects of old age?


If you have more than one adjective to describe a noun, is there is a specific order you put them?

According to an answer in Quora to the question:  there is a specific way to position adjectives based in their type, how accurate is this?     Ordering of Adjectives#3: Ordering of Adjectives      If you have more than one adjective to describe a noun, there is a   specific order you put them in, or else the clause will sound very   awkward.      That order is:   Opinion-size-age-shape-colour-origin-material-purpose-noun.      The most common example of this is "the lovely little old rectangular   green French silver whittling knife."      If you put any of those adjectives out of order, the phrase will sound   extremely confusing   How confusing will sound to mix that order? I mean, would it just sound a little like a non-native speaker or it will mess the sentence meaning completely?  Doing a little research on the subject it seems that there is not even a consensus for the right order, so I wonder how important is this or under what conditions it may change (American English has the same order of Brithis English?, etc).  Example Order 1:   Example Order 2:


Are a monk's fists considered weapons for the purpose of being targeted with weapon-empowering spells?

I've read that a monk's fists are considered monk weapons. Does that enable a paladin to cast Holy Weapon on a friendly monk?  For clarification, I am not asking if an unarmed attack is a weapon attack; it is. What I am asking is if the hands are weapons, so that way they can be infused with spells like Holy Weapon, which only targets weapons.


Should there be an apostrophe in "Ladies' Coats" on the sign in a shop selling ladies' coats?

I work in a charity shop and we sell coats for ladies. Should the sign read "Ladies' Coats" or "Ladies Coats"? I argue for the apostrophe but some of my friends argue that as the coats do not belong to the ladies yet that there shouldn't be an apostrophe.


In $F = kma$, why $k$ is taken to be unitless?  If $k$ is unitless and 1, then we have $F=ma$. This means (I guess) the physical quantity Force is product of different (from Force) physical quantities mass and acceleration. But doesn't that mean we are equating entities that are physically different? What is the basis for the choice of $k$ to be unitless.


What happens if Metamorphic Alteration is enchanting a non-Creature?

Normally you would not be allowed to cast  targeting a non-Creature, because of its "Enchant creature" ability. But it could end up enchanting a card that is not normally a creature, due to an effect that makes it temporarily a creature, such as a a manland (). Or because it was enchanting a flip-walker () that has now transformed.  So you turn Inkmoth into a creature, then enchant it with Metamorphic Alteration, making it a copy of . At the end of the turn, Inkmoth's ability wears off, so now you have Metamorphic Alteration enchanting just a land.  However, that land isn't a land, it is a creature still, because it is copying Grizzly Bears.  So does 704.5m apply here? Is this an Aura attached to an illegal object, thus causing the Aura to go to the graveyard? Or, is the object actually legal, because it is being made a creature?     704.5m If an Aura is attached to an illegal object or player, or is not attached to an object or player, that Aura is put into its owner’s graveyard.


I downloaded a few themes, extracted the tar balls and copied the folders to both ~/themes and /usr/share/themes, but they still don't show up in gnome tweak manager. What should I do?


I've seen the property   $$f_{n+1} f_{n−1} = f_n^2 + (−1)^n, n ≥ 2.$$   for Fibonacci numbers at Abstract Algebra book of Thomas W. Judson. I've tried it for a few Fibonacci number, and I've really liked how the pattern goes. I've tried to prove it by induction, however I failed to do so. I would appreciate, if someone could prove and explain to me.   I would also like to state that, I'm not a math major. Therefore I would be really glad if you prove it as simple as possible.   Thanks.


I've tried to make a Villager trade Some stuff for a villager spawn egg, but I end up getting a blank spawn egg... I'm playing on 1.10, and I don't know if it's a bug or something they've changed. I should also mention that I use a generator, Link . Here is the code I used:  The trade I mentioned is at the bottom  /summon Villager ~1 ~ ~ {     Profession: 2,     CustomName: "Frank",     CustomNameVisible: 1,     Career: 1,     CareerLevel: 42,     CanPickUpLoot: 0,     PersistenceRequired: 1,     Invulnerable: 1,     Attributes: [         {             Name: "generic.maxHealth",             Base: 99999         }     ],     Offers: {         Recipes: [             {                  buy: {                      id: "rotten_flesh",                      Count: 1                  },                  buyB: {                      id: "coal",                      Count: 1                  },                  maxUses: 9999999,                  sell: {                      id: "leather",                      Count: 1                  },                  rewardExp: false             },             {                 buy: {                     id: "gunpowder",                     Count: 2                 },                 buyB: {                     id: "coal",                     Count: 2                 },                 maxUses: 9999999,                 sell: {                     id: "golden_apple",                     Count: 1                 },                 rewardExp: false             },             {                 buy: {                     id: "gunpowder",                     Count: 2                 },                 buyB: {                     id: "coal",                     Count: 3,                     Damage: 1                 },                 maxUses: 9999999,                 sell: {                     id: "golden_apple",                     Count: 1                 },                 rewardExp: false             },             {                 buy: {                     id: "rotten_flesh",                     Count: 1                 },                 buyB: {                     id: "coal",                     Count: 1,                     Damage: 1                 },                 maxUses: 9999999,                 sell: {                     id: "golden_apple",                     Count: 1                 },                 rewardExp: false             },             {                 buy: {                     id: "rotten_flesh",                     Count: 64                 },                 buyB: {                     id: "bone",                     Count: 32                 },                 maxUses: 9999999,                 sell: {                     id: "spawn_egg {EntityTag:{id:Villager}}",                     Count: 1,                 },                 rewardExp: false             }         ]     } }   How do I make a villager trade a spawn egg?


The usual definition of a finite number $n$ in the ZFC set theory is $n\in\mathbb{N}$, which is equivalent to "$n$ is 0 or a successor ordinal, and so are all its elements". But this is not obviously equivalent to the intuition of a finite number, which would rather be a group of sticks that one can draw on a paper or a wall. And by the compactness theorem, we can consistently add a new constant symbol $c$ to ZFC, together with the axioms $c\in\mathbb{N}$ and $0 < c, 1 < c, 2 < c, ...$ We call numbers such as $c$ non standard. I am particularly interested in proving the termination in finite time of certain algorithms or computer programs. And I am now concerned with the following type of reasoning : assume by contradiction that for all $n\in\mathbb{N}$, the program runs for more than $n$ steps, and derive a contradiction. Conclude that there exists an $n\in\mathbb{N}$ such as the program terminates in less than $n$ steps. What if this number $n$ was non standard ? It would prove nothing regarding the intended meaning of termination of a program. Is there a meta-theoretical property of ZFC, telling that every definable $n\in\mathbb{N}$ is standard ? Or telling that the proved existing $n$ above is standard ?


Using this code:  struct Foo<T1> {     public T1 Item1 { get; private set; }      public Foo(T1 item1)     {         Item1 = item1;     } }   I encounter this error:     Backing field for automatically implemented property 'Foo.Item1' must be fully assigned before control is returned to the caller. Consider calling the default constructor from a constructor initializer.   My question is, why is the property Item1 not fully assigned after the constructor is called?  Edit: Changed set to private set because this question has nothing to do with mutability.


Sometimes when I post an answer someone posts the same answer. But I think this is a problem at all. There are two way while this could happen:   Post nearly at the same time. (No problem, could happen)  Straight copy the answer and write it was your own. (NOT community conform)   I think there could be a new way to handle such happenings. The first point can be threaded with a f.e. handshake of both answerers, where they can approve each other as same but not copied answer and divide the reputation ( only my suggestion ;) )   But I think the more problematic way is the second where someone only copy-paste the answer to get his answer on top of the answer list (actives and new ones are on top) and the person who asked the question mark this pasted answer as "Answer".   Is there a way to mark such copy-paste actions as "Copied Answer"?


The subspace sum of closed subspaces is closed

Given an arbitrary Hilbert space $\scr H$ and closed subspaces $A,B\subseteq\scr H$ with trivial intersection, is it true that $A+B=\{x+y:x\in A,y\in B\}$ is closed? So far, I have the following:  Let $P_A(x)$ be the unique $z\in A$ such that $x-z\in B$. This is a well defined quantity for all $x\in A+B$ because $A\cap B=0$, and $x=P_A(x)+P_B(x)$ is a decomposition of $x$ into $A$ and $B$. Given any $(x_n)_{n\in\Bbb N}\subseteq A+B$ converging to $x$, we wish to show that $x\in A+B$. Assuming that $(P_A(x_n))_{n\in\Bbb N}$ and $(P_B(x_n))_{n\in\Bbb N}$ converge, they must converge to points $p_A\in A,p_B\in B$ respectively, since $A,B$ are closed, and then $x=p_A+p_B$ because of the continuity of $+$.  It remains to show that the projected sequence is Cauchy, but I'm stuck at showing something along the lines of $||P_A(x_n)-P_A(x_m)||\le C||x_n-x_m||$, because there is no reason to believe (I think) that $P_A$ is bounded.


Store file list of current directory to a file

How can I get a list of all files in the current directory and store that to a file named mycurrent using the command-line?


POST Route (via form) Vs. GET Route (post via URL Params)

I never understand these 2 completely, can someone please put an end to this ?   I have 2 routes :   1- Route::get('/admin/dashboard', 'DashboardController@dashboard');  2- Route::post('/admin/dashboard', 'DashboardController@dashboard_post');    If I do this   {hostname}/admin/dashboard?test=123  My first route should trigger.   If I create a form, with 1 input and submit the form to /admin/dashboard  My second route should trigger.     What is different between these 2 POST ?   Are they behaving the same thing ?   How would one know to use one over the other ?


This is difficult for me to explain, but how do I put words over a symbol? For instance, I want to add words over an equal sign. Anyone know the command/syntax for that?  Also adding ^ doesn't cut it..., I want the text to appear ON TOP.


Figure caption as name for digital signature

I use a image as my signature in a letter and I want my name directly underneath it.  so far, I have successfully changed the Figure caption by using   \renewcommand{\figurename}{}%To avouid Figure or Fig   Which results in :    Question: How can I align it directly below the image and avoid the "1:" and just have my name.


Why did Obi-wan think the fight was over because he had the high ground?

At the end of Star Wars: Episode III while Obi-wan and Anakin are fighting, Obi-wan gains the high ground and tells Anakin that the fight is over because of it.  What? The high ground has made no difference in any lightsaber fight for 3 movies. Why would Obi-wan declare himself the victor because of this?    Note: I'm not asking why Obi-wan won; that's already been answered in other questions. I'm asking why Obi-wan believed he would win for something as insignificant as having the higher ground.


Rounding very large numbers in Python (left of the decimal)

The Python round() function will theoretically take negative numbers to round to places left of the decimal. [ I.e. round(150, -2) => 200]   However, it seems to be very susceptible to floating point error.  For example, given a large number say 2e25, it gives weird results.  2e25 === 20000000000000000000000000  But, round(2e25, -23) gives a value like 20000000000000000273942742  When it should just be getting 20000000000000000000000000  I know there's a formatting function, a la this thread:   However, that only seems to work for rounding to the right of the decimal.  Am I wrong?  Is there another way to do this?  Very frustrating trying to get the math right.  Thanks!


I am aware    but I ask this regarding SE-2.0 sites, as the example I will take gaming:  Both answers on the question  make perfect sense to me, i.e. on the one hand this might overuse the tagging system but on the other hand it would help a lot for filtering.  Therefore I suggest a system which, in this case, would internally store the platforms to which a tag is relevant and   if a question is tagged with one of these platforms, nothing special will happen and the question is to be considered platform specific (e.g. a bug which only appears on the PS3 version) if the question is not tagged with a platform, the only result will be that the tag filter mechanism works a bit different compared to what would happen if the question was (invisibly) tagged with all platform tags:   If the invisible tagging is definite on interesting or ignore (i.e. there is not at least one ignored and one interesting tag) the usual mechanism works. if the tagging is ambiguous (i.e. contains both interesting and ignored tags), no filtering happens at all    The actually attributed tags must of course override this behaviour. That way questions about a game one likes but which is available for a platform one doesn't care about will still be highlighted unless specifically tagged with that platform, but no additional tags have to be used to filter a game which is only available on ignored platforms.  This can of course easily be extended to other sites, e.g. the  may be interesting both general and for c++ but totally uninteresting if the question is only about a JavaScript implementation.  I am only unsure whether search should include those hidden tags, too.


After many tries, CUDA rendering still doesnt show up

Ubuntu 15.04  Nvidia GTX 650  YES, I have tried modprobe. Nothing works. I'm using the proprietary drivers (352.63). Still, when I look at the menu, all that shows up is "CPU". It really sucks to have to wait forever to render something that my graphics card could be handling. Any tips?  EDIT: I have tried running blender as superuser. I still get this:    EDIT AGAIN: After combining everything the community has said, I was able to get it to work! Thanks a lot!  Sorry if this is a duplicate, I just couldn't find anyone else with the same problem.


Is the Wine PPA still needed for an up to date Wine version

I see that the 1.3 Dev package is found in the 11.10 version of Ubuntu but I am wondering if it still needed to use the PPA maintained by Scott or was it merged somehow to the Ubuntu repositories by default. For what I see the wine 1.3 that comes with Ubuntu is the 1.3.28 version and the one Scott has in his PPA is the latest 1.3.30. So my questions regarding this are:   Will the Ubuntu version update soon to be in sync with the PPA or latest wine version. Is the Ubuntu version of wine 1.3 a different version of Wine that is maintained separate from the PPA one (Which is also a 1.3 version and this is the confusion). What happens if I add the PPA to the repositories. Will it create some conflict between both 1.3 or will the latest be the one selected.


Computing $\gcd$ of very large numbers with powers

How to calculate $\gcd$ of $5^{2^{303} - 1} - 1$ and $5^{2^{309} - 1} - 1$?  I stumbled upon this interesting problem and tried elementary algebraic simplification and manipulation. But found no success.


An airplane is headed 123 degrees with an air speed of 310 mph with a wind of 40 mph on a bearing of 200 degrees. Find the ground speed to the nearest mph, and the true course of the airplane to the nearest degree.  I tried to draw the vectors but I am unable to figure it out.Please help me.


In c#, if I have already declared an array of length n, how can I add another element on to it, making it of length (n+1)?

Background on the program: the heart of the program needs to track all other Forms or other elements of the program. To do this, I am using a Form array  What I am wanting to do is take my initially defined array containing 1 element, and increase the length of the array to add a new element whenever a new Form is launched.The trouble I've run into is that I can't find out how to do this without using a second array to store the old array, re-declaring the original array with array.length += 1, looping through to re-add the original content from the second array, then adding the new element. It's heavy and inconvenient since I need to use similar processes elsewhere.   The code I have, which works but is ugly, is this:  public class PCB {     Form[] Runners;     public PCB()     {         Runners = new Form[1];         Runners[0] = new GUI;  .  .  .  .  .  void NewForm(Form app) {     Form[] TEMP = Runners;   //Create my new array equal to the first     Runners = new Form[Runners.Length + 1];  //re-create the old array, with an additional element     for (int k = 0; k < TEMP.Length; k++)     {         //add the original elements back to the original array         Runners[k] = TEMP[k];     }     Runners[TEMP.Length] = App; //add the final element to the array   I hate having to use the loop-structure, as I feel that it can be done cleaner. what I'm looking for is a function similar to the ListBox.Items.Add([[ITEM]]), but for an array.  Does such a function exist, or do I need to continue with my ugly loops?