The ttf-mscorefonts-installer is installed but no fonts in  /usr/share/fonts/truetype/msttcorefonts. message in this folder reads:  License refused.  Please reinstall the ttf-mscorefonts-installer package (e.g. via apt-get install --reinstall ttf-mscorefonts-installer to get prompted for the license again.   Re-installing the installer proceeds until license. Unable to click OK at bottom.  When attempting to install netflix-desktop I have the same problem. Message reads   It appears you have not installed MS true type fonts. You need to accept the license agreement and install these fonts for Netflix Desktop to work properly.   I checked the accept box in the previous screen but still get this message.

After a recent update, ttf-mscorefonts-installer prompted me to accept its license agreement.     ┌─────────────────┤ Configuring ttf-mscorefonts-installer ├─────────────────┐  │                                                                           │   │ TrueType core fonts for the Web EULA                                          │                                                                               │ END-USER LICENSE AGREEMENT FOR MICROSOFT SOFTWARE                             │                                                                               │ IMPORTANT-READ CAREFULLY: This Microsoft End-User License Agreement           │ ("EULA") is a legal agreement between you (either an individual or a          │ single entity) and Microsoft Corporation for the Microsoft software           │ accompanying this EULA, which includes computer software and may include      │ associated media, printed materials, and "on-line" or electronic              │ documentation ("SOFTWARE PRODUCT" or "SOFTWARE"). By exercising your          │ rights to make and use copies of the SOFTWARE PRODUCT, you agree to be        │ bound by the terms of this EULA. If you do not agree to the terms of          │ this EULA, you may not use the SOFTWARE PRODUCT.                              │                                                                               │                                  <Ok>                                         │                                                                           │   └───────────────────────────────────────────────────────────────────────────┘    Screenshot:   For some reason my terminal will not allow me to accept, or for some reason I am pressing the wrong hotkey...  I've tried every letter on the keyboard and Enter among others...  I'm sure there is a very simple and obvious solution to this.  I've also just tried to remove the package completely however the terminal states that due to the package not being correctly installed, I should reinstall the package before removing it.  Very frustrating!  Essentially, because I cannot successfully install this package, I can't really ever upgrade my system because I always have to end up terminating the terminal with the license agreement (thus the upgrade fails).


What is the difference between the following sentences:     He may have arrived now.   He might have arrived now.   He could have arrived now.

Are they always interchangeable or subtle meaning differences occurred when we prefered one to another?  Here some sentences I came across. Can we rewrite these sentences with keeping their meanings?     General: We may have been able to save victims, we'll never know.(original sentence)   Possible variations:     General: We might have been able to save victims, we'll never know.      General: We could have been able to save victims, we'll never know.      General: We would have been able to save victims, we'll never know.     Another example sentence :     If he had worked harder, he may /might/could/would have been able to   get A at the exam.     Another example sentence :     I may/might/could/would have gone to university but I decided to get a   job.


I'm trying to determine $U(\mathbb{R}[x])$, where $U(R)$ denotes the unit group of a ring $R$.  I think the answer is all non-zero constant polynomials, but I'm having trouble showing that these are the only units.

If $R$ is a field, what are the units of $R[X]$?   My attempt: Let $f,g \in R[X]$ and $f(X)g(X)=1$. Then the only solution for the equation is both $f,g \in {R}$. So $U(R[X])=R$, exclude zero elements of $R$.  Is this correct ?


I was recently asked this in Abstract Algebra class on group theory:     Let G be a group and G' its commutator subgroup (i.e. its minimal subgroup containing all commutators $ [x,y] = xyx^{-1}y^{-1} $ where $ x,y \in G $ ). Where are asked to show G' is the minimal normal subgroup such that the quotient group $  G/G' $ is Abelian (if $ H \unlhd G $ and G/H is Abelian then we must have $ G' < H $)   To be honest I have tried but could not seem to be able to solve this. I have shown G' is normal and quotient group $ G/G' $ is abelian, but I cannot prove G' is minimal normal subgroup with this property. I really would appreciate the help on this. Thanks all

Good day. I'm not too sure how I should go about asking my question, so if it is in anyway confusing, feel free to edit it.   In my Group Theory course we defined and showed a few properties of the commutator subgroup $[G,G]$ of a group $G$. And then we stated and proved a lemma in lecture that I'm having some difficulty wrapping my head around. I'll state it here for clarity.  Lemma a) The commutator subgroup $[G,G]$ of $G$ is a normal subgroup of $G$. b) The quotient group $G / [G,G]$ is the largest abelian quotient of G in the sense that every homomorphism $\varphi : G \to A$ where $A$ is an an abelian group, induces a unique homomorphism $\bar \varphi : G/[G,G] \to A$ so that $\varphi =\bar \varphi \circ \pi$ where $\pi : G \to G/[G,G]$ is the quotient homomorphism.  Now, it's not the proof of this lemma that I'm having trouble with, it's the italicized text that is messing with me. I completely understand what it is that the italicized text is saying, I'm just not too sure why it is that the property gives us the "largeness" that is claimed. I can see that the above forces $G$ to "pass through" $G/[G,G]$ before it "reaches" $A$ (I apologize for the casual terminology), so I can sort of see why $G/[G,G]$ should be the largest quotient, in a non-rigorous sort of way.  Overall I'm very confused. Perhaps I'm missing something very simple. Any help or nudges in the right direction would be much appreciated.   As a side note I did try a search on Google and here on Stack Exchange and couldn't find anything that answered my question. So if I missed something obvious, then my apologies. Thank you in advance.


If $I_n=\int _0^{\pi }\:sin^{2n}\theta \:d\theta $, show that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, and hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $  Hence calculate $\int _0^{\pi }\:\:sin^4tcos^6t\:dt$  I knew how to prove that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$ ,, but I am not very good at English, what does it mean Hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $ do we need to prove this part as well or is it just a hint to use? and for the other calculation to find $\int _0^{\pi }\:\:sin^4tcos^6t\:dt$ is there something in the first part that I can do to help me solve this question because otherwise it becomes very long and it's part of the question.

If $I_n=\int _0^{\pi }\sin^{2n}\theta \:d\theta $, show that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, and hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $  Hence calculate $\int _0^{\pi }\:\sin^4t\cos^6t\:dt$  I knew how to prove that $I_n=\frac{\left(2n-1\right)}{2n}I_{n-1}$, but I am not very good at English, what does it mean Hence $I_n=\frac{\left(2n\right)!}{\left(2^nn!\right)2}\pi $ do we need to prove this part as well or is it just a hint to use? and for the other calculation to find $\int _0^{\pi }\:\sin^4t\cos^6t\:dt$ is there something in the first part that I can do to help me solve this question because otherwise it becomes very long and it's part of the question.


Why it's unable to update item value based on a condition using LINQ  Here is my code :  class Program {     public static List<Items> items = new List<Items>();     static void Main(string[] args)     {           // Add items to list         for (int i = 65; i <= 70 ; i++)         {         var RowItem = new Items();             RowItem.Code = i;             RowItem.Char = (char)(i);             items.Add(RowItem);         }           //Update item         items             .Where(s => s.Code == 70)             .Select(s => { s.Char ='*' ; return s; })             .ToList();          Console.WriteLine("\n\n\n");         foreach (var item in items)         {             Console.WriteLine("\t " + item.Code + " ----> " + item.Char);         }          Console.ReadKey(true);     } }   Item class defined as below Item class defined as below Item class defined as belowItem class defined as below  public class Items {     public int Code { get; set; }     public Char Char { get; set; } }

Is there a way to do the following using LINQ?  foreach (var c in collection) {     c.PropertyToSet = value; }   To clarify, I want to iterate through each object in a collection and then update a property on each object.  My use case is I have a bunch of comments on a blog post, and I want to iterate through each comment on a blog post and set the datetime on the blog post to be +10 hours. I could do it in SQL, but I want to keep it in the business layer.


I have two JavaScript objects with the structure below.  var obj1  = {id1: 10, name1: "stack"}; var obj2  = {id2: 20, name2: "overflow"};   I want to concat them together as a single object (not array) using Javascript.  The result should be like this.  var res = {id: 10, name1: "stack", id2: 20, name2: "overflow"};   Is there an easy way to do this using pure javascript?  Note: I don't need jQuery to do this and I want to concat is for json objects, not as json arrays using concat method. Is there any simple method or way to achieve this?

I need to be able to merge two (very simple) JavaScript objects at runtime.  For example I'd like to:  var obj1 = { food: 'pizza', car: 'ford' } var obj2 = { animal: 'dog' }  obj1.merge(obj2);  //obj1 now has three properties: food, car, and animal   Does anyone have a script for this or know of a built in way to do this?  I do not need recursion, and I do not need to merge functions, just methods on flat objects.


I am working on a VEC model atm, testing for cointegration between 4 variables (the Nikkei, interest rate, M2, and unemployment).  My question is this however: When assessing the VECM output, how important is it that all four variables have a negative coefficient and statistical signifcance?   For example, if my output looked like this:   Error Correction:   D(LNNK) D(LNR)  D(LNM2) D(LNUP)  CointEq1    -0.016525   -0.029369    0.000543    0.003737      (0.00455)   (0.01041)   (0.00033)   (0.00229)     [-3.63253]  [-2.82135]  [ 1.65503]  [ 1.63485]  Whereby, the first-difference of log-Nikkei has -.16% adjustment. And the first-diference of the interest rate has -.29% adjustment.   How important is it that the remaining two variables have a negative and significant coefficient?   If they don't have a negative sign, is the entire cointegrating equation undermined? Or is it regarded that only the interest rate would be cointegrated with the Nikkei, and the other two (positive coefficients), are regarded as not having a long-run correction path.  Any expertise on this would be greatly appreciated guys.   If I am wrong, I would appreciate any recommendations for remedies on Eviews please  Andrew

I did a Johansen test. The max eigenvalue test resulted in 5 cointegrated variables with contegration rank being 1. The trace test resulted in 5 cointegrated variables with contegration rank being 3.   Below is the estimated VECM with cointegration rank of 3:  cajorls(ca.jo(mydata, ecdet="none", type="trace", spec="transitory", K=29),r=3) $rlm  Call: lm(formula = substitute(form1), data = data.mat)  Coefficients:               BIST100.d   Gold.d      Oil.d       TRY_USD.d   USD_EUR.d  ect1          -4.843e-02   2.939e-05   1.634e-04  -7.808e-07   9.200e-07 ect2          -1.780e+02   1.322e-01   2.673e-01   5.668e-04   1.891e-03 ect3          -1.217e+01   2.622e-02   1.023e-02  -1.245e-04   4.935e-04 constant      -1.335e+04   1.941e+01  -1.246e+01   2.701e-01   1.689e-01 BIST100.dl1   -2.772e-02   2.683e-05  -1.036e-04  -4.862e-06  -2.745e-07 Gold.dl1       9.454e+01  -4.467e-03   6.449e-02   4.761e-03  -3.065e-04 ......          ......      ......        ....       .....     ....... $beta                 ect1          ect2          ect3 BIST100.l1  1.000000e+00  0.000000e+00  4.336809e-19 Gold.l1    -1.136868e-13  1.000000e+00  0.000000e+00 Oil.l1     -3.197442e-14  2.775558e-17  1.000000e+00 TRY_USD.l1  1.152179e+05 -4.851482e+01 -5.183614e+01 USD_EUR.l1  8.984704e+04 -8.461897e+01 -3.174152e+02   I expect an error correction term of the format $y_1-\beta_2 y_2-\beta_3 y_3-\beta_4 y_4-\beta_5 y_5$. Or equivalently, all signs being "$-$" in the above ect1, ect2, ect3 terms. All are not "$-$", e.g., for the 1st ect1: -4.843e-02, +2.939e-05, +1.634e-04, -7.808e-07, +9.200e-07. There are "$+$" and "$-$" coefficients in the error correction terms above.  Does this show wrong unsuitable formulation in VECM? The cointegration rank is either 1 (max eigen) or 3 (trace). Both present "$+$" and "$-$" coefficients in error correction terms.  Below is the estimated VECM with cointegration rank of 1:      cajorls(ca.jo(mydata, ecdet="none", type="eigen", spec="transitory", K=29),r=1) $rlm  Call: lm(formula = substitute(form1), data = data.mat)  Coefficients:               BIST100.d   Gold.d      Oil.d       TRY_USD.d   USD_EUR.d  ect1           6.592e-03  -1.138e-05   1.275e-05  -1.830e-07  -8.523e-08 constant      -1.035e+04   1.782e+01  -1.999e+01   2.857e-01   1.334e-01 BIST100.dl1   -5.707e-02   5.970e-05  -1.134e-05  -5.482e-06   6.044e-07 ......          ......      ......        ....       .....     ....... $beta                  ect1 BIST100.l1      1.000 Gold.l1     -5829.934 Oil.l1      -1100.681 TRY_USD.l1 455111.151 USD_EUR.l1 932542.892   Any idea? Can I go with the usual ritual vec2var(ca.jo(...), r=1 or r=3) or something must be handled properly?


I'm attempting to find the name of a book series that I read in the mid 90's that was (I believe) new at the time.   It is either a 2 or 3 part series in which humanity is attacked by an alien race (not very specific I know).    I distinctly remember the first book being told from the perspective of the humans and the second book was told from the perspective of the aliens that attacked.  I seem to recall that it was a trilogy, but I don't remember whose perspective it was for it.

I remember reading it in mid-to-late 90s.  It was a hardcover with a huge starship drawn on the cover.  The plot was about humans making first contact with a new alien species, when aliens suddenly attack and quite easily destroy the entire fleet.  Only one survivor is taken prisoner to the aliens' homeworld, where he is being prodded, tested, and evaluated.  The survivor happens to be a son of some important general who sends an elite force of commandos to rescue him.  In the meantime humans are preparing for the inevitable invasion.  The ending seemed open, as if this book was part of a set.  Seems like I may be missing closure to this story.


I have installed Scilab manually, copied the Scilab.desktop to the directory /user/share/applications.  When I open Scilab using the Scilab command, it works well.But when I open Scilab through Dash, Scilab is opened, then closed immediately.  Can someone explain this and help me fix the issue?

Firstly, I saw topics such as 'How to install manually a software...' but it did not solve my problem. I've downloaded Scilab 5.4.1 from the official website and I extracted the .tar.gz file into:  /home/scilab-5.4.1  I then tried the commands below, but they gave several errors:  $ cd scalib-5.4.1 $ configure        @1 $ make             @2 $ make install     @3   these gave the following messages in the terminal:  @1: configure: command not found @2: make: *** No targets specified and no makefile found.  Stop. @3: make: *** No rule to make target `install'.  Stop.   I tried following commands:  $ cd scilab-5.4.1 $ cd bin $ scilab   which gave the message:  The program 'scilab' is currently not installed.  You can install it by typing: sudo apt-get install scilab


I have this:  \documentclass[12pt]{article} \usepackage[table]   \begin{document}  %\begin{tabular}[h]{lr}  \begin{table}[h] \centering \begin{tabular}{| p{2.2cm}| p{2.2cm} |}     \hline     \multicolumn{2}{|c|}{Europa} \\     \hline     País & Ciudad \\     \hline \hline     España & Madrid \\ \hline     España & Sevilla \\ \hline     Francia & París \\ \hline \end{tabular} \caption{Tabla de ancho fijo.} \label{tabla:anchofijo} \end{table}  %\hfill  \begin{table}[h] \centering \begin{tabular}{| p{2.2cm}| p{2.2cm} |}     \hline     \multicolumn{2}{|c|}{Europa} \\     \hline     País & Ciudad \\     \hline \hline     España & Madrid \\ \hline     España & Sevilla \\ \hline     Francia & París \\ \hline \end{tabular} \caption{Tabla de ancho fijo.} \label{tabla:anchofijo} \end{table}  %\end{tabular}  \end{document}     I want the two tables next  How can I do it?  Thanks!

Suppose I have two tables that don't have many columns (3, for example). How can I position them side by side?


Throughout the entire series, it was rumored that there is a jinx on the post of "Defence Against the Dark Arts" teacher, which leads to the fact that, no wizard can hold that post for more than 1 year. This curse was cast by Lord Voldemort.  If Dumbledore knew the existence of this curse, why didn't he do anything to lift the curse?

The facts:   The job was cursed.       Oh, he definitely wanted the Defence Against the Dark Arts job. The Aftermath of our little meeting proved that. You see, we have not been able to keep a Defence Against the Dark Arts professor for more than a year since I refused the post to Lord Voldemort.   - Albus Dumbledore, Harry Potter and the Half-Blood Prince  It lasted From 1957 until the fall of Voldemort (1998)       1957 (Y-23) [Voldemort] resurfaces and applies to teach [Defence Against the Dark Arts] Ten years after the death of [Hepzibah Smith], [Voldemort] returns to [Hogwarts], where Dumbledore] refuses to grant him a teaching job. He then curses the [Defence Against the Dark Arts] position, and since that day, no professor has stayed for more than one year in that post. Again we don't know exactly when this happened, but since most evidence points to [Dumbledore] becoming headmaster in 1956 [[Y-24]], [Voldemort] couldn't have come looking for a job much sooner than this. (HBP20)  No one could hold that position for more than one year       It's well seen throughout the series that there is a "curse" on the DADA teacher position, that no one can hold that post for more than a year    Is there (preferably canon) information on:   How did Voldemort manage to do such a powerful curse? Why didn't Dumbledore, knowing about the curse, not do anything to lift it? Why didn't Voldemort put that curse in the headmaster's position, or on the whole Gryffindor house?


I need help proving that the next equation has only two roots (under $\mathbb R$)   $$\frac{1}{x-a}+\frac{1}{x-b}+\frac{1}{x-c} =0$$   $$a\lt b\lt c$$    Here is what I tried:  If I define a function $f(x)=\frac{1}{x-a}+\frac{1}{x-b}+\frac{1}{x-c}$ I could show that this is a continuous function and for different values I get positive  or negative values and by the continuity it will be equal 0 exactly twice.  Maybe it has something to do with the function derivative?  Any ideas?

Prove that given $ a < b < c $ this equation:  $$\frac{1}{x-a} + \frac{1}{x-b} + \frac{1}{x-c} = 0 $$   has precisely 2 real roots.   I understand there are 3 point of discontinuities, but I have no idea how to prove this. Can you give me a hint?   Thanks in advance.


In this story, the reach of this technique (being able to see the past through the eyes of your ancestors, eventually including pre-human ones) is extended further and further into prehistory. This is a novel, not a short story.

Read it in the 90's. I remember one specific part where the inventor of the peeking mechanic has his Eureka moment, and has the presence of mind to give a thumbs-up/wave to the future, when they look back on his Eureka moment.  I also remember that they had computer screens that were like plastic cloth that they would just unfold on whatever surface was handy.  Sorry I don't have much more to go on.  Please and thank you!


I would like to know whether there is any formula that would help me compute the number of possible delta waves from (0,0) to (N,0).  eg. for N = 4, we have number of waves possible = 9 as explained

A $n \times n$ square is made of square tiles of dimensions $1\times1$. A mouse can leap along the diagonal or along the  side of square tiles. In how many ways can the mouse reach the right lower corner vertex of the square from the lower left corner vertex of the square leaping exactly  $n$ times?  In one of my exam, I encountered a particular version of this problem with $n=5$. With a semi-brute force (case counting) kind of approach I derived the answer as $21$. How to derive the general solution for any $n \in \mathbb{N}$ ?


Suppose $a,b,c$ are non-zero real numbers such that $$(ab+bc+ca)^3=abc.(a+b+c)^3$$ Prove that $a,b,c$ must be terms of a $G.P.$  I simplified this equation too $$(ab)^3+(bc)^3+(ca)^3=abc.(a^3+b^3+c^3)$$ I tried to subtract $3(abc)^2$ from both sides and it gave a factorised form. $$(ab+bc+ca).((ab)^2+(bc)^2+(ca)^2-abc.(a+b+c))=abc.(a+b+c).(a^2+b^2+c^2-ab-bc-ca)$$ How can I proceed after that?

You are supposed to show that if  $a,b,c$ are nonzero real numbers   and  $(ab+bc+ca)^3 =abc(a+b+c)^3$  $a, b, c$ are terms of a geometric sequence.  One given solution is that:  $(ab+bc+ca)^3 −abc(a+b+c)^3 = (a^2 −bc)  (b^2 −ac)  (c^2 −ab)$   How does the new factorization imply that $a,b,c$ are part of geometric sequence?


Ok so I'm teaching myself (along with the help of some youtube videos) java. So after a few videos I thought I would try and test my skills by setting up a calculator. now I had done this before with lua but its a somewhat diffrent ball game here. my issue is that no matter how i set up any variables or if/else statements, the program always ends up just skipping over the else ifs. i put a final else at the base of the code to see if it was even reaching the bottom and it was definitly, so heres my code  import java.util.Scanner;   public class calculator { public static void main(String[] args){     double Answer;     String op;     double num1;     double num2;      Scanner input = new Scanner(System.in);      System.out.print("What opperation would you like to preform? +,-,*,/, :");     op = input.nextLine();       System.out.print("What is the first number? : ");     num1 = input.nextDouble();      System.out.print("And the seccond number? : ");     num2 = input.nextDouble();       if(op == "+"){         Answer = (num1 + num2);         System.out.print(Answer);      }else if(op == "-"){         Answer = num1 - num2;         System.out.print(Answer);      }else if(op == "*"){         Answer = num1 * num2;         System.out.print(Answer);      }else if(op == "/"){         Answer = num1 / num2;         System.out.print(Answer);      }else{         System.out.print("ilikecake");     }  }  }   as you can see, i used a string for the opperation (op) variable due to the flexability of strings in this particular application, also, i couldn't figure out how to get scanner to accept a char variable. i keep getting the string can not be converted to char error so i just set it up as a string. if you can help thank you! also please ignore any akward formatting from the post, i couldn't figure out how to make the code appear properly so i did my best :/

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I would like to sum numerical values listed in the third column of the table below based on entries were given in the first column of the same table. The table content is as follows:  John|Login|2 Mary|Login|10 Mary|Payroll|100 John|Login|200 John|Logout|10 Mary|Payroll|10   The expected outcome is as follows:  John|Login|202 John|Logout|10 Mary|Login|10 Mary|Payroll|110   How can I use awk to get this output?

I am trying to sum certain numbers in a column using awk. I would like to sum just column 3 of the "smiths" to get a total of 212. I can sum the whole column using awk but not just the "smiths". I have:  awk 'BEGIN {FS = "|"} ; {sum+=$3} END {print sum}' filename.txt   Also I am using putty. Thank you for any help.  smiths|Login|2 olivert|Login|10 denniss|Payroll|100 smiths|Time|200 smiths|Logout|10


I'm using biblatex and wish to print a name (which has a "ä" character, say "Därwin") bold every time it shows up in the bibliography.   provides a solution that works, provided my tex file is ISO-8859 encoded (I'm not sure I understand all the details about encoding). However, it ruins the detection of the last author in the list, whose name should be preceded by "and" and not followed by a comma. So instead of "Smith and Doe (1990)" I get "Smith, Doe, (1990)", even when the author printed in bold is Därwin.  Here's a MWE:   \documentclass{article}  \usepackage[latin9]{inputenc}   \usepackage[style=authoryear-comp,natbib=true,%  minbibnames=15,%  maxbibnames=15,%  backend=biber]{biblatex}  \usepackage{filecontents}  \begin{filecontents}{\jobname.bib}  @Book{Darwin.84,    author =      {C. D\"{a}rwin},    title =   {The different forms of flowers on plants of the same species},    publisher =   {John Murray},    address =      {London},    edition =      2,    year =    1884}   @ARTICLE{Davies.pnas04,  AUTHOR = {Davies, T. J. AND Barraclough, T. G. AND Chase, M. W. AND Soltis, P. S. AND Soltis, D. E. AND Savolainen, V.},  TITLE = {D\"{a}rwin's abominable mystery: {Insights} from a supertree of the angiosperms.},  JOURNAL = {Proc. Natl. Acad. Sci. U.S.A.},  VOLUME = {101},  PAGES = {1904--1909},  YEAR = {2004},  MONTH = Feb,  NUMBER = {7}  }   @ARTICLE{Vamosi.el10,  AUTHOR = {Vamosi, J. C. AND Vamosi, S. M.},  TITLE = {Key innovations within a geographical context in flowering plants: towards resolving {D\"{a}rwin}'s abominable mystery.},  JOURNAL = {Ecol. Lett.},  VOLUME = {13},  PAGES = {1270--1279},  YEAR = {2010},  MONTH = Oct,  NUMBER = {10}  }    \end{filecontents}  \addbibresource{\jobname.bib}   \newcommand{\makeauthorbold}[1]{%  \DeclareNameFormat{author}{%    \ifnumequal{\value{listcount}}{1}      {\ifnumequal{\value{liststop}}{1}        {\expandafter\ifstrequal{##1}{#1}{\textbf{##1\addcomma\addspace ##4\addcomma\isdot}}{##1\addcomma\addspace ##4\addcomma\isdot}}        {\expandafter\ifstrequal{##1}{#1}{\textbf{##1\addcomma\addspace ##4}}{##1\addcomma\addspace ##4}}}      {\ifnumless{\value{listcount}}{\value{liststop}}        {\expandafter\ifstrequal{##1}{#1}{\textbf{\addcomma\addspace ##1\addcomma\addspace ##4}}{\addcomma\addspace ##1\addcomma\addspace ##4}}        {\expandafter\ifstrequal{##1}{#1}{\textbf{\addcomma\addspace ##1\addcomma\addspace ##4\addcomma\isdot}}{\addcomma\addspace ##1\addcomma\addspace ##4\addcomma\isdot}}%      }%  }%  }  \makeauthorbold{Därwin}    \makeatother   \begin{document}   Les \oe{}uvres de \citeauthor{Darwin.84} ont souvent été citées, par exemple par \citet{Davies.pnas04,Vamosi.el10}.    \printbibliography   \end{document}   It produces this output:   How to get "and Savolainen, V. (2004)" ?

I am writing my CV in LaTeX. I am using biblatex and want my name (and only my name) to be bold for every reference. Is there a magic way to do this?  A similar question  was asked, but that answer used BibTeX. While I use the BibTeX backend, I use biblatex.  Any suggestions?


I'm running this command to find all the files named deploy.php in my whole project and make a copy of them and place them in the same directory as they were found, with name deploy_bkp.php  find . -type f -name "deploy.php" -exec cp  {} deploy_bkp.php  \;    But it's not working recursively, it's only working for files on the top directory.

Let's say I'm in a directory which has some subdirectories, dir1, dir2, and dir3.  Each of these directories have a file foo and I would like to execute the same command on each foo in each of the directories and have that command executed from inside that directory.  If I were to do it "by hand", it would look something like this:  cd dir1 (execute on foo) cd ../dir2 (execute on foo) cd ../dir3 (execute on foo)   It is imperative that the command be executed from each of the directories.  foo is a batch scheduling script (for HTCondor, if you care to know) and must be executed from each subdirectory so that the output of the runs started by the scheduling scripts will end up in each subdirectory.  The question "", as far as I can tell, does not answer my question. The first answer to that question is more of a workaround which will not work in my case, and the second answer does not have enough of an explanation for me to know how to use it.


This is my array:  $url_parameter = Array ( 'country' => 'USA', 'city' => 'WDC', 'from' => 'Japan' );   I want to covert it so that output is:  country=USA&city=WDC&from=Japan   Is there any easy code to do this task?

I'm looking for the name of the PHP function to build a query string from an array of key value pairs. Please note, I am looking for the built in PHP function to do this, not a homebrew one (that's all a google search seems to return). There is one, I just can't remember its name or find it on php.net. IIRC its name isn't that intuitive.


Can anyone please help me converting current date to this format:      "2017-06-15T05:15:31.158Z".   I need this format only, another format is not acceptable to my backend.  Friend, please help me here.

How do I convert, NSDate to NSString so that only the year in @"yyyy" format is output to the string?


I'm interested in finding a nice closed form expression for the sum $\sum_{k=1}^n\frac{1}{k}\binom{n}{k}$. I've tried using the Binomial Theorem to get  \begin{align*} \sum_{k=1}^n\frac{1}{k}\binom{n}{k}x^k & =\int_0^1\frac{(1+x)^n-1}{x} \, dx\\ &=\int_1^2 (1+u+\cdots+u^{n-1}) \, du \end{align*} using the substitution $u=1+x$ but I can't quite to simplify this integral either. I have also not been able to come up with a combinatorial approach, which may not exist since the summation and its terms are in general not integers. Any help in evaluating this sum would be appreciated, thanks!

I got this sum, in some work related to another :  $$S_m=\sum_{k=1}^m  \frac{1}{k}{m \choose k} $$  Are there any known results about this (bounds, asymptotics)?


I've been trying to find an answer to as per title. How can I block a specific email address domain from being able to submit Drupal webform?  Example:  Webform has fields:  Name, Email address, Subject, Query - all fields are set to required.  What I want is a webform submission to be blocked when a visitor is trying to submit it using a specific email address domain, for example *@example.com.  I need my Drupal webform to be able to act similarly to a registration form equipped with  module.  Many thanks in advance.

I have created the country and state fields with the Webform module, and I want to add a field validation for the state field when user select US as country.   How can I achieve this?


I'm thinking about a problem. It states that :  If a rectangular (with length $a$ and width $b$; $a>b>0$ ) can be covered by finitely many squares, then $\dfrac{a}{b} \in \mathbb {Q}$.   (I've thought about an idea: Choose some sequences of squares in type I and type II, an arbitrary sequence of type I has sum of the sides of all squares (in this sequence) is equal to $a$, a sequence of type II has sum of the sides of all squares (in this sequence) is equal to $b$.   If we can construct some sequences of type I and type II such that if a square belongs to exactly one sequence of type I if and only if it belongs to exactly one sequence of type II, and there's no squares that belong to at least 2 sequences of one type, then we can conclude that $\dfrac{a}{b}\in \mathbb {Q}$.)

For what positive real numbers $x,y$ can an $x\times y$ rectangle be partitioned into a finite number of squares?  When $\dfrac{x}{y}$ is a rational number, it is not hard to see that we can partition it.  Also, we can scale the width to $1$, so, say we're dealing with a $1\times c$ rectangle. For what values of $c$ can we do the partition?


TLDR: I have feelings for my TA, think she winked at me, and would like to ask her out after the end of the semester.  So my eyes do this weird thing sometimes when I'm sleep-deprived or stressed where it can look to an observer as if I might be winking. This can sometimes lead to problems for me for obvious reasons. However, a few weeks ago in class on a day when my eyes were particularly acting up I believe I might have received a first-- an unexpected return wink. My TA, turning around from the chalkboard momentarily, smiled and gave a very clear wink towards the direction of the room where I was sitting. I had been looking her way over the course of the class since she's the instructor, so it seems quite possible to me that she thought I was winking at her.  However, this was the final day of class before we transitioned to Zoom lectures due to coronavirus, and it's been really difficult to explore my suspicion that she's interested in me through online communication alone. I feel like the odds are low that she was winking at someone else. There were only about 15-20 students in the room, around 40-50% of whom are men. The seating arrangement meant that only about 5-7 people were seated in the direction of the room I was seated in. I wasn't really sure what to make of this when it first happened, but in recent weeks I've noticed myself developing feelings. When I contacted her with a question about an assignment, she responded by inviting me to toss some ideas around over zoom "for fun." I did a few days later, and she also made a point of asking me how I'd been doing with all that's going on and whether I'd be staying in town over the summer. I notice her tone of voice changing a bit when she talks to me, as well.  I really do enjoy talking to her and feel like I would genuinely like to get to know more about her academic passions and interests. As a 24-year-old re-entry student, I feel that the age gap isn't all that intense. In fact, I think I would probably have more in common with her than I would with most undergraduates. The area her work is focused in is also one of my intended majors.  With only two more weeks of instruction, I feel pressured to act before she loses interest. I was having trouble falling asleep most of the night last night due to my mind being so preoccupied with this, so I don't think I could feel alright with doing nothing and letting this pass. My plan was to continue to ask the occasional question during and after class and maybe schedule an office hours appointment for an assignment I genuinely have questions about, wait until the semester is over, and email her 1-2 weeks into the summer asking if she might be interested in getting coffee once social distancing restrictions begin to lift. Does this sound like a reasonable idea, or could it be that all the quarantine and social isolation is just getting to my head?

I, a twenty-year-old female, have come to admire the graduate teaching assistant for my summer course quite strongly. I'm extremely interested in what he has to say, I always pay attention, never use my phone and use eye contact to show interest. I do like them very much and I think about them with warmth often. I want to know about their work, I want to know what he is interested in. I would like to at least be their friend. Despite my strong admiration I must emphasize that I have not and do not plan to cross professional boundaries until the end of the course. I have spoken to them though it was only a short conversation about the work that was assigned to us the following weekend, however he did seem quite warm and open to conversation. Specifically he emphasizes in his syllabus to not hesitate to contact him with any questions we may have at all. I would like to be able to talk to them more without bothering them, and over stepping professional boundaries. I hopefully plan to ask them out once the course has ended, but I would still like to be able to have the chance to talk to them too as friends outside of course hours about the course material. Would this be ethical? Should I just back down? Specifically I wanted to thank him for giving me a very positive, in-depth feed back in the essay assignment that I had turned in that I got a perfect grade on. I've been going through a really rough time in my personal life. Despite having flunked before, I made a promise to myself to work harder and to never give up on my goals. Truly their receptiveness, warmth and passion has genuinely inspired me to keep going and to study harder. I would very much like to thank them for inspiring me and being a good teacher which has helped me understand the material.  Would it be ethical to express these sentiments of admiration and gratitude to them during their office hours?  Would it be possible to date them after the course has ended since he is essentially a normal graduate student instead of a true professor?   *edit Class has ended and we have a date planned! Thanks all for your advice! *edit #2 We are still dating and our 9 month anniversary is coming up soon! The relationship is going really well and it is the best and most loving relationship we’ve ever been in! We are excited to grow together and the mention of having children someday has come up occasionally. Sometimes he jokes about being my TA but he is very adamant about making it clear he didn’t like me during the course, but in conclusion we are both doing fantastic! Thanks for all your help ! (May 7th 2020) *edit # 3 Not sure if anyone comes across this anymore but our one year anniversary passed a few months ago and we're growing strong! I'm really happy that I went out of my comfort zone and found a lasting relationship. (10/28/2020)


I'm getting dos on a dedicated server with windows+apache, ive asked support to install a firewall and got a cisco pix 501, the attacks are on port 80 to a certain site, what can I do to block it?  I thought of putting a cap on amount of connections Disallowing access for certain ip ranges (the attackers use mainly ukraine and india)  Any ideas?  more than that, how do I do it with the cisco? any command lines would help

This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it?


Several proofs pf Chebyshev's estimates for $\pi(n)$ include the following as a preliminary step (eg ): $$\frac{2^{2n}}{2n} \leq {2n \choose n}$$ I can't see why this is true. (I would appreciate answers accessible to readers without university training in mathematics.)

Show that $\frac{2^{2n}}{2n} \le {2n \choose n}$, $n\in\mathbb{N}$.  What I can see easily is that $\frac{2^{2n}}{2n + 1} \le {2n \choose n}$, since $(1+1)^{2n} = \sum_{m=0}^{2n}{2n \choose m} = 2^{2n}$. This sum contains $2n+1$ terms with the largest being ${2n \choose n}$. So ${2n \choose n}$ is larger than $\frac{2^{2n}}{2n + 1}$. However I have found the statement $\frac{2^{2n}}{2n} \le {2n \choose n}$, which is not obvious to me.


Objects partially hides when are modeled in full size. These ar 900mm high. It happens in every view.

Zooming in to inspect texture details in 3D view clips some closer faces like shown in the image. It's not the camera view so changing camera settings doesn't help.   Where can the distance to the clipping plane be adjusted?


When I was about 12 (c. 2002), I read a fiction book, but today I can't remember its title or who wrote it. May have been a two part series, and I'm not sure how old the book was at the time.  Protagonist was a child, found a box that could not be opened normally.  I remember they had to put their head on the lid, with their hands on the sides and rotate their hands in opposite directions.  The box lid would then disappear and inside was a species of sentient insectoid aliens.  I remember they said "Have you eaten well?" as a formal greeting.  The box also contained a smaller box with a dial on it.  The dial would alter gravity, which would affect how the holder perceived time, as well as the weight of the containment box.  Increasing the gravity made the box heavier while time sped up around the holder.  Decreasing gravity would make the box lighter while slowing time around the holder.  I don't remember much about the plot, but at one point the box containing the aliens was taken by a group of people (possibly a government agency), and the protagonist had to use the dial to get the box back.  There was also something dealing with the protagonist's uncle.  I believe he had gone missing, but later on it's found that he had a working replica of the dial, and was using it to slow time for himself, allowing him to live a great deal of time without aging.

I have a very, very vague recollection of this book that I read around 1999-2001.  A kid or tweenager finds some kind of creature -- the visual image in my mind is of something like a horseshoe crab but that's hardly reliable -- that I think can time travel, or allows him to time travel. Unfortunately that's about all I remember of it, but it was such a distinctively weird concept that hopefully someone else remembers it as well.  The overall vibe seemed "dark" to me, as a young person. There might have been another kid involved later on.


How can I write a macro with more than 10 arguments?

I have a mathematical transformation that takes 16 parameters (grouped into 3+8+5) and would like to make a latex command for it, so that I can easily change the notation for it if the need arises.  As far as I know, both \def and \newcommand take a maximum of 9 arguments, is there any (recommended) way to extend this?


I had windows 7 in C drive and windows 8.1 in D drive. But I installed Ubuntu 13.10 and the system got formatted. I wanted to have 3 OS. But lost the other two. I didnt make any partitions.Now I want to uninstall Ubuntu and install windows 8.1, How to do it?> P.S : I dont know much about partioning.

I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot.


Note:  is the same question, but it does not have enough answers and it is almost a year old.  question is similar, with many answers, but a conjecture is similar to, but not the same as a pattern. For example, one of the answers is: "Choose n points around the circumference of a circle, and join every point to every other with a line segment. Assuming that no three of the line segments concur, how many regions does this divide the circle into?" It is clear that this is not a conjecture. Mathematical conjectures are proposed (usually) after being computationally tested for many cases. Because of this computational evidence, many are thought to be probably true, and many theorems are derived considering that they are true. But this not always the case. Some conjectures that were thought to be true (because of computational evidence) were false, for example that $\pi(x)-\mathrm{li}(x)$ is always positive (disproved by Littlewood). So my question is  What are some conjectures that were widely believed to be true but turned out to be false?  Like many big list question, please give only one example per answer. Some include (these are from the answers, I wrote these because if this question gets many answers, than it would be inconvenient to scroll all the way down to see them):  Squaring the circle Euler's sum of powers conjecture

Often, when I try to describe mathematics to the layman, I find myself struggling to convince them of the importance and consequence of "proof". I receive responses like: "surely if Collatz is true up to $20×2^{58}$, then it must always be true?"; and "the sequence of number of edges on a complete graph starts $0,1,3,6,10$, so the next term must be 15 etc."  Granted, this second statement is less logically unsound than the first since it's not difficult to see the reason why the sequence must continue as such; nevertheless, the statement was made on a premise that boils down to "interesting patterns must always continue".  I try to counter this logic by creating a ridiculous argument like "the numbers $1,2,3,4,5$ are less than $100$, so surely all numbers are", but this usually fails to be convincing.  So, are there any examples of non-trivial patterns that appear to be true for a large number of small cases, but then fail for some larger case? A good answer to this question should:   be one which could be explained to the layman without having to subject them to a 24 lecture course of background material, and have as a minimal counterexample a case which cannot (feasibly) be checked without the use of a computer.   I believe conditions 1. and 2. make my question specific enough to have in some sense a "right" (or at least a "not wrong") answer; but I'd be happy to clarify if this is not the case. I suppose I'm expecting an answer to come from number theory, but can see that areas like graph theory, combinatorics more generally and set theory could potentially offer suitable answers.


I'm trying to prove that if $z,w$ are non non-zero complex numbers then $|z+w|=|z|+|w|$ iff there exists a positive real $c$ st $z=cw$.  Now I've proved the leftward implication but I'm having difficulties with the rightward one, so I'd appreciate any hint.  NOTE: I can't use the exponential or polar representation of complex numbers nor the notion of scalar product but only the basic algebraic properties of complex numbers.

This is Exercise EP $8$ from Fernandez and Bernardes's book Introdução às Funções de uma Variável Complexa (in Portuguese).     If $z,w\in \mathbb{C}^{\times}$, then $|z+w|=|z|+|w|$ iff $w=tz$ for   some $t\gt 0.$   I supposed that $|z+w|=|z|+|w|$ and by squaring it I got  $\operatorname{Re}(z\bar{w})=|z||w|$ and I am stuck.  I would appreciate a hint in this question.


Show that $$G=\left\{\begin{pmatrix}a\ b \\ c\ d\end{pmatrix} : a,b,c,d\in\mathbb{Z}_3, ad-bc\ne 0 \text{ in }\mathbb{Z}_3\right\}$$ is a group with the usual matrix multiplication and $|G| = 48$.   I already proved that it's a group, but I'm bit lost on how to "efficiently" determine the order of such a group (that is, not just listing and counting, I also say this because I'll need some way to determine the cardinality of some larger groups).   At first I looked for some theorem on groups that I've already seen but found none of them to be useful here (surely I must be wrong on this). Then I thought that there are $3^4 = 81$ matrices with entries on $\mathbb{Z}_3$ and then I need to exclude those with $ad=bc$. Any hints to continue on this line? Or for calculating order of groups in general?  Thanks in advance.

I am trying to solve this problem for homework but unable to get anything. The question is to find the number of invertible 2x2 matrices in mod p? Each entry can be from the set {0,1,2....(p-1)} where p is prime.


I have a laptop with 2 drives:   a 1TB HDD with 600GB occupied by /home and 400GB free a 120GB SSD with other Ubuntu paths   I would like to install a Windows OS on the 400GB free space on the HDD. Is that possible?

I have Ubuntu on my laptop. Now I want install Windows 7 in a dual-boot. How can I do this? I can't lose my Ubuntu files, and I'm afraid that I might break . Go  for UEFI only!


I am using IB to place a UIImageView (top) ADBannerView (bottom) and within the same View. When running in the Simulator, if I click on the ad, after dismissing the ad screen, the UIImageView is pushed 20px down, leaving a gap between the status bar and UIImageView.   I've tried playing with all of the AutoResizing settings in the Inspector with no luck. Strangely, other objects, like UITextViews that are superimposed over the UIImageView also shift, but respond to AutoResizing settings such that after setting the struts appropriately, the UITextViews stay in place after returning from the ad animation. ??  This issue seems to be similar to . However, adding  self.view.frame = [[UIScreen mainScreen] applicationFrame];   to viewDidLoad is unsuccessful. (I think that's probably because in 3022773 the subview is created programmatically, whereas here its part of the nib)  Also, this post  implies that my parent View (the view holding both UIImageView & ADBannerView) must be a "fullscreen view", but I can't figure out how that applies when using IB. (I don't see ANY settings in Inspector that allow me to tell XCode that the parent View should have that property)  Any ideas out there?   Much appreciated!

What is the proper way to implement the status bar and navigation bar that go on top of an UIView?


Is there a way to synchronize two windows 7 computers (like Dropbox but this time for the entire OS preferences*)?  *Wherever possible.

How can I automatically synchronize accounts between two Windows (7) computes? I'd like to keep the user-specific information in sync, that means the whole %USERPROFILE% folder.  Those computers may not be always connected to each other, but when they are, the accounts should synchronize automatically.


You ever had a post in front of you where the OP did mix up blockquote and code formatting? Not those easy cases where he/she wrote a > character before the paragraph himself, but those cases when you have several dozen lines of code or command output, often with line lengths greater than the edit window's width, and the OP used the blockquote-formatting-button!  In such cases, it does not only add the > character in front of every line, but also totally messes up every kind of indentation and reorganizes all the line breaks to fit the editor window width instead of the original structure.  You are not sure what I mean? Here is a horrible example in its original state (with blockquotes):  And here is my attempt to fix the structure as good as I can:   I propose to change the behavior of the blockquote formatting button!  The optimal and easiest way to convert a paragraph to a blockquote would be to just write a single > in front of the paragraph's first line and keep all indentations and line-breaks just as they are. The output will be no different. If you have problems implementing this with checking the end of the paragraph (I don't think so, but...), it would be even an improvement if we stay with the > sign in front of every line selected to be formatted as blockquote and just stop reformatting the content!  Everybody who once tried to edit such a monster has to vote for this and hope for the StackExchage stuff to soon implement this. Thank you for your support and any reactions.

I've seen too many newbies hit the "quote" button instead of the "code" button while posting. This is much worse than if they just left the code inline, because the quote button rewraps all the text and saves the post with mangled code.  For example, here's some (bad) C++:  class X{};  X& foo() {     X x;     return x; } int main() {     X &x = foo(); }   and some quote-mangled C++:  > class X{}; >  > X& foo() {    X x;    return x; } int main() {    X &x = foo(); }   Once they've saved the post, it is impossible to recover the original formatted code without a substantial amount of effort. One user  producing an unreadable mess, not realizing that "quote" was the wrong function for a nicely-formatted stacktrace.  I understand the holdover from email, but it seems unnecessary for StackOverflow to rewrap given that quoted text renders essentially identically to unquoted text (aside from being enclosed in a <blockquote>). It seems to me it would be easier to have the quote button just prefix >  to each selected line, kind of like how the code button prefixes     , and leave it at that.  So the question is: why does the quote button have to rewrap text when you push the button?    For reference, here's how quoted text appears, first using the quote button and second by manually prefixing > :     class X{};      X& foo() {       X x;       return x; } int main() {       X &x = foo(); }   and     class X{};      X& foo() {       X x;       return x;   }   int main() {       X &x = foo();   }   The appearance is identical, but the latter quote can actually be reversed into proper code later on.


I am using Charter for math (mathdesign package) and Bitstream Vera for body text (through XeLaTeX's fontspec package. However, when using things like \text{} in math mode, the text still appears in the Vera font. It's hard to explain without a visual, so here is one now:   $$\Delta v = v_\text{exhaust} \ln \frac{m_\text{initial}}{m_\text{final}}$$   Which returns the following image:    I would like to know how I can make the words 'exhaust', 'initial', and 'final' use the Charter font like the rest of the equation.

Although many have attempted to explain the difference among \mathrm, \textrm, \textnormal and \text (and others?), I found them misleading.  See for example the LaTeX's Wiki \mathrm explanation   Why is it wrong? Let's try all of them within an article and a beamer and you'll see the difference and, therefore, error.  equation.tex  \begin{eqnarray*}   \int_1^9\! \cos{x} \,\mathrm{d}x & & \textrm{this is textrm}\   \sum_1^9 y                       & & \textsf{this is textsf}\   \prod_1^9 z                      & & \textnormal{this is textnormal}\   \bigcup_1^9 w                    & & \text{and this is just text} \end{eqnarray*}   article.tex  \documentclass{article} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb}  \begin{document}   \input {equation} \end{document}     And until here everything looks fine...  beamer.tex  \documentclass{beamer} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb}  \begin{document}   \begin{frame}     \input{equation}   \end{frame} \end{document}     And here we can clearly see that \mathrm does not behave as expected, i.e. does not provide a function aspect to the d. Does anyone know what am I supposed to use here instead? Just \text?? o.O  Moreover, I cannot see any difference between \textnormal and \text.  Finally, \textrm looks useless..


I understand how offhand attack works. However, when you roll to hit, would you still add your bonuses to the attack roll?

I understand that you have to use the two weapon fighting style to add your ability modifier to damage, but I was wondering if there were any penalties to the offhand attack modifier?


I'm trying to use the gnome-terminal profiles to cd to a given directory and register some aliases just after the terminal opens.  I have created a script:  ~/Document/project1/ops-setup.sh  #!/bin/bash alias up='docker-compose up -d' alias down='docker-compose stop' ...   Then a new gnome-terminal Project 1 profile running the following as "custom command"  bash -c "cd ~/Document/project1;. ./ops-setup.sh"   I can see my script launched when I open the terminal with this profile, the terminal remains opened but it does not leave the prompt.     The child process exited normally with status 0.   I tried to add a bash run after it so the prompt remains  bash -c "cd ~/Document/project1;. ./ops-setup.sh";bash   but no alias registered (I guess that's because it is a new process)  I also tried --init-file  bash --init-file <(echo "cd ~/Document/project1;. ./ops-setup.sh")   but bash complains     bash: cd ~/Document/project1;. ./ops-setup.sh): No such file or directory   How can I keep my aliases registered for this Project 1 profile ?    There are  to keep the terminal opened after running scripts and I that's not my issue. I'm really talking about keeping aliases registered

I have a script in file bla.sh and it is executable. When I click on it, the script is executed and the window is closed. I'd like the window to stay open.  Something like command cmd /k** command in Windows.  P.S. I don't want to use pause, but I want to able to write more commands after the script was executed.


I have now made 2 different bases in Fallout 4.  I have the expensive shops in both bases ( the ones that cost 3000 caps )  So yesterday I packed my Sanctuary base up and I went to the Castle.  I was expecting to be able to pull all the packed up items out and use them.  I had 10 turrets, 3 Expensive shops, lot of water purifiers, lot of generators and a whole lot of different stuff. There seems to be no items that are prebuilt in my inventory or in the Workshop inventory.  When I want to place one of the items in the new base I end up using resources again.  So my question is how do you pull the stored (made) items out of the storage in a different base?  EDIT ( because it was suggested that this is a duplicate ) I am NOT asking about resources. As i know how that works. I am asking about structures here!! I have put many structures in the sanctuary workshop. I cant access those from the Castle. so it is not a duplicate.

From the descriptions I've seen online, once I have set up a supply line between two settlemens they should share resources. However, when I look at their respective inventories they seem separate.  How does resource sharing work, exactly? What happens when I set up a supply line?


I am unable to reach one of my faculty member through email, phone call or even in person, who have agreed on providing me with a recommendation letter. He is not replying to my email, phone number is unavailable and even not coming to the office. I do not know what is wrong or what is the matter, I might miss a deadline of a university which I am really intending to attend.I have given him multiple reminder and not even sure whether he has seen them or not.

One of my professors this term promised to write me a recommendation letter for grad school. However, tomorrow is the deadline and her letter is not on the application website. She really liked me, so it's probably a case of her forgetting about/misremembering the deadline.  However, I can't reach her via e-mail, and she's the kind of person who puts absolutely no information online (phone, travel plans, etc). Perhaps she's on some sort of trip to a conference or something.   What can I do (with respect to the graduate programs I have applied to) to resolve this? Is there usually some sort of university policy regarding this situation? I really don't want to be unable to apply for grad school because a professor forgot to check her e-mail.  This situation is different from , because in my situation the deadline has not yet passed.


the question in a random study problem says show that x - $\frac{x^3}{6} < sinx< x $ for $x>0$. ( taylor series). I am assuming the question means about x=0 I have tried finding the maximum error which you end up as lagrange $R (2) < \frac{x^3}{6}$ but that only lets me prove $sinx<x$

Prove that $x - \frac{x^3}{3!} < \sin(x) < x$ for all $x>0$   This should be fairly straightforward but the proof seems to be alluding me.    I want to show $x - \frac{x^3}{3!} < \sin(x) < x$ for all $x>0$.  I recognize this shouldn't be too difficult but perhaps finals have fried my brain.


Question:   Suppose $a,b,c,d$ are real numbers such that  $a+b+c+d=a^7+b^7+c^7+d^7=0$  Show that  $a(a+b)(a+c)(a+d)=0$  My attempt: Using $a+b+c+d=0$, I get  $a(a+b)(a+c)(a+d)= 0 \implies a=0, \text{or}$ $ a(bc+cd+db)+bcd=0$  How can I use $a^7+b^7+c^7+d^7=0$ to prove $a(bc+cd+db)+bcd=0$ ?  Edit:(courtesy @mathguy)   Replacing $d$ by $-(a+b+c)$ we see that the hypothesis is equivalent to   $(a+b+c)^7=a^7+b^7+c^7$, and the conclusion equivalent to $a(a+b)(a+c)(b+c)=0$. The polynomial $(a+b+c)^7-a^7-b^7-c^7$ is divisible by $(a+b)(a+c)(b+c)$, and another irreducible fourth degree symmetric polynomial $P(a,b,c)$ .  Also, $P(0,b,c)= b^4+2b^3c+3b^2c^2+2bc^3+c^4$. It remains to be shown that $P(a,b,c)=0$ when $a=0$

Given $x_1,x_2,x_3,x_4$ real numbers such that $x_1+x_2+x_3+x_4 = 0$ and $x_1^7+x_2^7+x_3^7+x_4^7 = 0,$ how can I use symmetric functions and Newton's sums to prove that $x_1(x_1+x_2)(x_1+x_3)(x_1+x_4)=0$?  This is what I have so far:   Note that $x_1 = -(x_2+x_3+x_4)$ and the relation between Newton's sums, elementary symmetric polynomials, and power sums gives us that $P_7-S_1 P_6+S_2 P_5-S_3 P_4+S_4P_3=0,$ where $P_k$ denotes the $kth$ power sum and $S_k$ denotes the $kth$ elementary symmetric polynomial of $x_1,x_2,x_3,x_4.$   We want to show that $(x_2+x_3+x_4)(x_2+x_3)(x_2+x_4)(x_3+x_4) = 0.$  But how?


It takes  clicking "leave open" in the close-vote queue to remove the question from the queue.  How about diamond mods?  Do they remove it from the queue in one click, or not?

I've noticed that the number of reviews required to remove a post from a queue varies. For example, to accept/reject a suggested edit, you need two votes of the same kind. If the votes are conflicting, the number goes higher. This seems to be the case for the other queues as well. (Additionally, I think that a mod-review is binding) So, my question is: what are the criteria for a review to be marked as a "completed" review? Also, when is a review considered invalidated (i.e. "no longer reviewable")? Formerly When is a post removed from a review queue?.


I booted Ubuntu from my SSD. Then I plugged in my HDD into my Computer after linux had booted. As expected, it wasn't detected. How can I make my system detect it?

So from what I've read online, if AHCI is enabled in the BIOS, I should be able to hot-swap a SATA drive and it will supposedly "just work".  However, that has not been my experience.  When I hot-swap a SATA drive on my system, it is never detected. It doesn't show up in lsblk, it doesn't show up in Gparted, nothing even shows in dmesg.  So, I am wondering what the issue is?  I am using 16.04 on an Asus M5A97 R2.0    Edit to address Takkat's suggestion:  I have no such option:


I am building some backlinks to a page of my website that is high likely to get deindexed (I have to build to that specific page) mainly because of duplicate content.  Will my page, if deindexed, pass link juice if I permanently redirect (301) it to another page (also within my website)?

I need to change a URL of an interior page that has a Google PageRank of 4. It was recommended by a coworker that I create the new URL but have it redirect to the old one, thus allowing a buildup of PR for the new URL, and the existing page continues to maintain a PR of 4.  Does anyone have any insight as to whether this will actually work?


I'd like to boot into Ubuntu using the Windows Boot Manager on Windows 10 using UEFI. Can I do this? Thanks a lot.

As noted by many people, Windows 8's UEFI requirements might will won't get in the way of installing Linux (or whatever), as the replacement bootloader will also need to be signed somehow. Some systems All systems will let you disable the signature requirement, but the feature might be hidden to disable or you might not be willing to give up on the benefits of a secure bootloader.  Is it necessary to replace the bootloader in the first place? To keep ourselves to software that's gone golden, how can I install Ubuntu 11.04 using Windows 7's own bootloader?


It looks like there's been a  in the profile picture system. However, that appears to have broken images which are not squares.  This is what I see on my profile page. It's horizontally stretched, and it looks quite ugly:        For comparison, here's the top bar, which looks fine.        I've seen other peoples' pictures which are stretched vertically presumably their pictures have landscape-oriented originals, while mine is in a portrait configuration.  I'm on Chrome 71.0.3578.98 for Windows 10.

Just noticed on :        Yes, all we know that internet is fast nowadays, but ... 1.5Mb for (scaled) 164x164 px image is too much.


I have dual booted Windows 10 and Ubuntu 16.04 in UEFI mode (secure boot off). My time in BIOS is correct.  When I boot into Ubuntu and then boot into Windows 10, it shows the wrong time. I have to correct it manually or by the internet in Windows 10, and when I reboot into Windows 10 then it is not a problem. The clock will show the correct time. And then when I reboot to Linux the clock is correct, but switching back to Windows 10 the clock messes up again.

Dual boot system Windows XP Pro and Ubuntu 12.04.  I have the bios set for the correct time and Ubuntu set for US Eastern time.  Ubuntu will boot up and the time will be off by -4 hours.  If I correct the time in Ubuntu then when I boot up in Windows XP the time will be off by + 4 hours.  This is a fresh install of 12.04. I did not have this problem before reinstalling Ubuntu.


If $f: \mathbb R^2 \rightarrow \mathbb R$ is a continuous function such that $f(x)=0$ for only finitely many values of $x$, then prove/disprove the following :   $(a)$ Either $f(x) \geq 0 ~~\forall x\in  \mathbb R^2  $ or $f(x) \leq 0 ~~\forall x\in  \mathbb R^2  $  $(b)f $ is onto  $(c)$ $f$ is one-one  Attempt: I have an intuition that the continuous nature of function $f$ would play a part in this problem. however, unfortunately, I am not able to decipher how to move ahead.  Any directions on this problem shall be really great.  Thank you.

Let  $f : \mathbb{R}^2\rightarrow \mathbb{R}$ be a continuous map such that $f(x)=0$ only for finitely many values of $x$. Which of the following is true?   Either $f(x)\leq 0$ for all $x$ or $f(x)\geq 0$ for all $x$. the map $f$ is onto. the map $f$ is one one. None of the above.   What I have done so far is :   I would take polynomial in two variables.. This need not be like $f(x)\geq 0$ for all $x$ or $f(x)\geq 0$ for all $x$.So,first option is eliminated. The map is not one one assuming that $f$ has more than one zero. So, third option is wrong.   I could not think of an example in which it is not onto..  Only examples i am getting in my mind are polynomials and they are onto..  So, I am having trouble with surjectiveness of the function.  Please help me to clear this.  Thank you..


How do I use the /testfor command in a command block to test for a specific word that a Minecraft player playing on the server says. For my example, if a player says:     [Player] - Hi   The command block then says:     [Command Block] - Hello.   Please help, just trying to create a cool command =) {If This Works Please Tell Me}

I want to be able to detect if a certain word in chat is said like: Console: Please say yes to be teleported or no to remain Player1: yes Player1 teleported to [insert random coordinates here]  Something that would monitor the chat for a certain word.


I'm trying to identify a book I read a long time ago.  The premise was that far in the future humans had technology that could accomplish just about anything (teleportation, body manipulation creating elves and dwarves, force fields, etc),  but due to their extremely long lives, the population had decreased to where there's just a few thousand people left.  Then, there is a war in the ruling council that basically ties up all the energy people were using to run their technology causing the world to drop back to a roughly medieval level.  There's also a world wide "Mother" AI that prevents any explosive energy from being used, so the best you might get is steam powered engines.  I do remember it being the first book in a series.

I read this book probably 10 or 15 years ago. I remember it starting out with a  young woman (I think) talking to a computer and altering her appearance in a mirror. I believe she was making subtle changes that were up-to-date with what was popular for the time and I believe the book explained that other people had chosen to make less subtle changes and go full-on were-animal.   The book follows her and her father who becomes a leader of a new civilization, when the main computer is hit by terrorists or something. They fall into the dark ages and have to resort to surviving like they did in the middle ages. It was very descriptive at one point as the woman was trying to figure out how they used to handle menstrual cycles without technology. I remember there was bad guy, and I believe he was were-tiger or panther man, but he wanted the girl. He started raiding the small settlements that had arose in the aftermath, and became like a warlord wreaking havok, pillaging, and raping. The girls boyfriend fought the last battle with him and lost his arm.   I'm pretty sure the book was written in the 1950s. I remember thinking that it was strangely accurate and advanced for when it was written. I have been trying to remember this book for the last 10 years because it was open-ended and I believe it was part of a series. I remember this book being one of the best I've ever read. It could make you clench your teeth, laugh and cry all at once. Can anyone help me find it?


I want to start photography as an hobby. So to start I need a camera. I now a reflex would be the best, but I have no idea what to look for: pixels or ISO. What would the most adapted lens for landscape pictures. I'm ready to spend a maximum of 500$ in a camera.

I am thinking of buying a digital SLR camera. What things should I be looking for?


my AMD graphic card is the Radeon HD 6470M I downloaded the drivers from AMD website but I have some problems with installation and I tried two ways : First : i doubled click the deb file and it opens the snap store when I click the install button thats whats happen  Second : I tried to install it useing the terminal by the instructions in AMD website using sudo dpkg -i command but thats what I get :  sudo dpkg -i fglrx_15.201-0ubuntu1_amd64_UB_14.01.deb (Reading database ... 210469 files and directories currently installed.) Preparing to unpack fglrx_15.201-0ubuntu1_amd64_UB_14.01.deb ... dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x dpkg-divert: warning: please specify --no-rename explicitly, the default will change to --rename in 1.20.x Unpacking fglrx (2:15.201-0ubuntu1) over (2:15.201-0ubuntu1) ... dpkg: dependency problems prevent configuration of fglrx:  fglrx depends on fglrx-core; however:   Package fglrx-core is not installed.  fglrx depends on libqtcore4 (>= 4:4.7.0~beta2); however:   Package libqtcore4 is not installed.  dpkg: error processing package fglrx (--install):  dependency problems - leaving unconfigured Processing triggers for systemd (245.4-4ubuntu3.2) ... Processing triggers for desktop-file-utils (0.24-1ubuntu3) ... Processing triggers for gnome-menus (3.36.0-1ubuntu1) ... Processing triggers for mime-support (3.64ubuntu1) ... Errors were encountered while processing:  fglrx  BTW Im new to linux so I'll br thankful if the answers was simple .

I have 14.04.5/16.04 or newer and an AMD GPU. I'm not getting the performance I want, and some programs say they need things like OpenCL.  I've heard about fglrx, but if I try to install it on my machine, it breaks and I have no GUI.  Is there anything I can do to get my AMD card working to its full potential?


The OpenSSL Random Number generator documented  uses an OS-provided entropy source coupled with a MD5 hash function.  Does it impact the quality of randomness to use a broken cryptographic hash such as MD5 for random number generation?  The topic is partially addressed , with a focus on SHA1 rather than MD5 tough.   And if any impact, of which nature? Is it a risk of the RNG being predictable?  Back to OpenSSL: Though selecting another hash function seems to be doable at compilation time, there is no (apparent) configuration setting to change the MD5 to SHA2. So if there's any impact, I'd expect that most OpenSSL instances today are affected.

I'm wondering if the openssl rand command produces cryptographically secure random bytes. For example when in need for a random password or token:  openssl rand -hex 32   The man page unfortunately does neither state it's cryptographically secure, nor that it's not.  On the one hand, I think this is openssl, its sole purpose is to do cryptography. On the other hand, the man page states something about reading and writing seed data instead of directly querying a CSPRNG.  So it is somewhat unclear for the end user. Does someone know?


There's a story that I read at some point several years ago, but I can't remember when or where. My best guess is that it was either in an out of print book of older SF stories (probably 30+ years old) or it was an online post someplace (probably less than 10 years old).  The premise, as best as I can remember it, is that galactic civilizations have decided (at some point in the distant past) that humanity is too dangerous and have effectively quarantined our solar system. But a couple of aliens are wondering just what could possibly be so scary about us. So they decide to build a laboratory environment that would be absolutely impossible to escape from and abduct one single human being and stick him in it, in order to observe him.  There are multiple levels of security ensuring that there's no way to possibly escape. But it turns out that the thing that distinguishes humans from all other intelligent beings in the galaxy is that they just can't comprehend the concept of something being "impossible". So, despite the fact that there's no chance of success, the human insists on repeatedly trying time and again to get out.  Of course, he eventually succeeds. And steals the aliens' ship. And they realize that they've made a terrible, terrible mistake.  Does anyone else remember this story? One thing I do know is that it's not "With Friends Like These..." by Alan Dean Foster (I checked that one already).

I always thought the book was Manifest Destiny but its not. The story that sticks in my head was a human in a cage over a pit? Aliens walk in and discuss how dangerous humans were. He eventually escapes. Man I miss this book. wish I wouldve written down every book I ever read. Ugh


I'm planning on buying a Dell with pre-installed Ubuntu image.  In case something goes wrong, how do I reinstall Ubuntu from scratch with the Dell's image containing all of Dell's specific drivers?   I couldn't even find a downloadable image on  :-(

Background  My Lenovo X250 is arriving in two weeks, which according to  will work well only with "a special image of Ubuntu pre-installed by the manufacturer."   points out that the X250 has "Excellent" compatibility to the Linux OSes they install. On the other hand, a quick search on  or  shows that a standard image of Ubuntu on the X250 is rife with hardware problems.  Ubuntu Certified Hardware acknowledges this for the X250: "Standard images of Ubuntu may not work at all on the system or may not work well." This  clearly shows the difference between an Ubuntu standard image installation and the one that comes pre-installed by the manufacturer. Hardware seems to work fully on the OEM version.  Question  Any idea where we may access or download these "special images of Ubuntu"?  (Hopefully not only for the X250, but also for the other systems out there.)


I have installed the Ubuntu OS in my PC. but the adapters are not working properly in the Ubuntu OS so I want to uninstall this. due to installation is completed in the same windows partition of the hard drive (dual boot feature). my windows OS is original that have licence key, I don't want to corrupt the windows. what can I do for uninstall safely without any damage of windows?

I have a Win/Ubuntu 11.10 dual-boot setup, where I am running the OSes on separate partitions of my laptop HDD. I assume the best method of uninstalling is 'simply' a matter of deleting the Ubuntu partitions -once I've made sure control is given to the Windows bootloader instead of grub after POST.  The question is: How do I do that?  Stuff I've tried:  I tried the boot-repair CD (), but that was a bit beyond my abilities to figure out if I could do it with that tool :/.  I also tried EasyBCD (). It couldn't identify my ext3 partitions, let alone change the bootloader.  Lastly, I tried installing startup-manager in Ubuntu, and using that to set the Win7 bootloader as default. But upon restart, it still loads grub.


Even if your period is lasting overly long. Wouldn't starting to ovulate end menstrating?

Is that possible that ovulation happens in the time of actual menstrual haemorrhage in human females - let say in a case that woman has 21 day cycle and her menstrual period is 7 days?   If yes, does it means that in this particular case the woman has lower chances to conceive?


My 2018 MacBook Pro is connected to external displays and peripherals via a Thunderbolt 3 dock.  When I step away from my desk I lock the computer by pressing ctrl+cmd+Q on my external keyboard.  This works as expected, kicking the system back to the lock screen.  However, after a few minutes of this state, the system goes to sleep, turning off the screen and requiring time to become interactive again after jabbing the power button.  How can I prevent the laptop from going to sleep once locked if connected to power? The most important aspect of this is that Touch ID stays active, so I can instantly resume work at my desk with a single touch of the sensor.

I tried control+shift+power button as well as command+shift+power button. Neither seem to work.


I am in my first semester of college learning Java. This will be probably a pretty basic loop for you all but I am truly stuck. Now please I am taking suggestions/help but I do not want this code completed for me. I want to learn this code. Thank you!  Context: Write a routine that will read words from the keyboard until the word “done” is entered. For each word except “done”, report only if its first character is equal to its last character.    MY WHILE Loop Code:  while (word != "done") // Test Phase  {     if (word != "done")    {      System.out.println("End While Loop Version");      break;    }    else    {      System.out.println("Next Word: " + word);      System.out.println("Char " + first + " appears at the start and end of " + word);    }     count++;  }   Now I know the break; is messing up my console output. But I do not know how else to stop the program OR move onto the else condition. I also have to use a simple While Loop. (I have to do all 3. Done with for.)

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I'm trying to find units of $\mathbb Z[\sqrt{-5}]$.  So let $a,b\in \mathbb Z[\sqrt{-5}]$ s.t. $ab=1$. if $a=a_1+\sqrt{-5}a_2$ and $b=b_1+\sqrt{-5}b_2$, then we get $$\begin{cases}a_1b_1-5a_2b_2=1\\ a_1b_2+b_1a_2=0\end{cases}.$$ First equation give us $a_1,b_1\in \mathbb Z/5\mathbb Z$ and thus $$(a_1,b_1)\in \{(1,1),(2,3),(4,4)\}, $$ but how can I continue ? I was wondering to solve the second equation in $\mathbb Z/5\mathbb Z$, but I get $a_1b_2=4b_1a_2$, but it's unfortunately not conclusive.

I need help describing all the units in the ring $\mathbb{Z}[\sqrt{-d}]=\{a+b\sqrt{-d}|a,b\in\mathbb{Z}\}$ where $d>0$ and is square-free.  Thanks.


Given that there is no change in relative kinetic energy attributable to the expansion of the universe, what accounts for the difference in energy emitted vs energy absorbed (i.e. the red shift component) by two very distant bodies of mass whose relative velocities only exist due to the expansion of the universe and are therefore effectively zero?  Consider a photon that got emitted some time back in a far-off galaxy and absorbed today on earth. Also assume that there is no peculiar velocity involved, and that it was emitted due to an energy change in a hydrogen atom. The wavelength we would see were we able to observe the photon would be greater than that of a similar photon emitted from earth, and we might put that red-shift  down to the space stretching effect of the expansion of the universe that had taken place between emission and absorption. All well and good in terms of observation, but not so good in terms of energy conservation. The photon energy, being only dependent on its frequency, is lower than expected. But unless there is another energy transfer taking place, the energy emitted must equal the energy absorbed right? How can this be explained?

If a photon (wave package) redshifts (stretches) travelling in our expanding universe, is its energy reduced?  If so, where does that energy go?


I have been given this space in a question but I am unsure what it means  I know that $S^3=\{(z_1, z_2) \in \mathbb{C^2}\mid |z_{1}|^2 + |z_{2}|^2=1 \}$  Could you help me understand what set of points are contained in $S^3/S^1$ and perhaps what it is homeomorphic to?    Motivation:

Write $S^3=\{(z_1,z_2)\in\mathbb{C}^2:|z_1|^2+|z_2|^2=1\}$. Let $S^1$ act on $S^3$ by $z\cdot(z_1,z_2)=(zz_1,zz_2)$.   (a) Show that $f:S^3\rightarrow \mathbb{C}\times\mathbb{R}$ given by $f(z_1,z_2)=(z_1\bar{z_2},|z_1|^2)$ induces a homeomorphism $\bar f:S^3/S^1\rightarrow K$, where $K$ a compact subset of $\mathbb{C}\times\mathbb{R}$.  (b) Show that $\bar f(S^3/S^1)\cap(\mathbb{C}\times\{t\})$ is homeomorphic to a circle for all $t\in(0,1)$.  (c) Show that $S^3/S^1$ is homeomorphic to $S^2$.  For (a), the equivalence classes of $S^3/S^1$ are $[x]=\{y:\exists t\in[0,1)\;\; \mathrm{with}\;\; e^{2\pi it}y=x\}$. But I'm not sure how to show it is a homeomorphism. $K$ should be closed and bounded so that it is compact by Heine-Borel.  For the rest, I'm pretty stumped.


Try searching something in the search bar that returns more than 10,000 total results.  This happens:   15 results per page: page 666 works, page 667 or past shows nothing 30 results per page: page 333 works, page 334 or past shows nothing 50 results per page: page 200 works, page 201 or past shows nothing   How To Reproduce This Error: Type &page=x at the end of the search URL.  Going past 10,000 search results used to work fine (like last year), but now there's a bug that prevents users from doing so.

If you make a search for something that returns more than 10,000 items in result. For example, search for  return 161,338 results on MSE. But if you select a page where 10,000+ result should be shown:        In the edge case  shows zero results:        But this is actual for any page where per_page * page_number is more than 10,000.  Though this does not happen for Stack Overflow in English. It looks like all other sites are affected.  Related bug report on ruSO.meta:


Few Definitions: Let $R$ be a nonzero commutative ring which does not necessarily contain identity. Let $S$ be a multiplicatively closed subset of $R$ such that $S$ does not contain the zero element and zero divisors.  Define an Equivalence relation $\sim$ on $R\times S$ by setting $(r, s) \sim (r',s')$ if $rs' = sr'$. and denote the equivalnece class of $(r, s)$ by $\frac{r}{s}=\{(a,b)|a\in R, b\in S \enspace \text{and}\ rb=as\}$.  Now, the set $S^{-1}R$ is the set of equivalence classes under $\sim$.  Define multiplication and addition on $S^{-1}R$ by  $$\frac{a}{b}+\frac{c}{d}=\frac{ad+bc}{bd} \enspace \text{and}\ \frac{a}{b}\times \frac{c}{d}=\frac{ac}{bd}$$  My Question:     Let $R$ be a commutative ring with $1\neq 0$. Let $s$ be a nonzero   divisor of $R$ and $S$ denote the multiplicatively closed subset   $\{1,s,s^2,...\}$.Then prove that $$S^{-1}R\cong \frac{R[x]}{(sx-1)}$$   My Idea: Define $$\varphi:R[x]\rightarrow S^{-1}R\\r\mapsto r \enspace \forall \enspace r\in R\\x\mapsto \frac{1}{s}\enspace \forall \enspace s\in S$$ Now, I need to show that this map is surjective ring Homomorphism and need to determine its kernel. Then, I will use First Isomorphism Theorem for Rings to get the result.  It is easy to note that $\varphi$ is a ring homomorphism under the above definition.  Now, any element $\alpha \in S^{-1}R$ is of the form $\frac{a}{s^m}$ for some $m\in \mathbb{N}\cup\{0\}$, where $a\in R$ and $s^m\in S$. Now, $$\frac{a}{s^m}=a\times \frac{1}{s^m}= a\times (\frac{1}{s})^m\\=\varphi(a)\times (\varphi(x))^m\\=\varphi(a)\times \varphi(x^m) =\varphi(ax^m)$$ Therefore,  $\varphi$ is a surjective ring homomorphism.    But I don't know how to compute its Kernel.  Can Anyone please help me and show me a proof?

Apologies in advance for the naivety of this question.  Let $R$ be a commutative (resp. non-commutative) ring, $S \subset R$, and let $R' = R[x_s (s \in S)]$ be the polynomial ring obtained by adding a formal variable $x_s$ for each $s \in S$.  Let $I$ be the ideal (resp. 2-sided ideal) generated by {$sx_s-1\ |\ s \in S$}.    Does the quotient $R'/I$ yield the localization $S^{-1}R$ in general?  If not, what if we assume $R$ is commutative and/or $S$ is finite?    EDIT: Thanks to Mariano and Arturo for the quick responses!  Both of their responses say that my construction works in the non-commutative case when $R'$ is replaced with a "non-commutative polynomial ring."  But the Wikipedia article on the localization of a ring states that in the non-commutative case, the localization doesn't exist for all prospective sets of units $S$.  What gives?


This is probably going to be a poorly written question, since I know really a little of physics. Imagine a object of small mass, let's say a book, is floating in the universe in absence of any gravitational force pulling it. Now, let's say a massive object suddenly appears several light-minutes far and its gravity begins pulling the book towards it. My question is, how long before gravitational pull starts taking effect? Does the book move immediately as the object appears, or it takes some time before gravity "reaches" it? Also, if the pull is immediate, doesn't it mean an entity faster than light exists in the universe?

A thought experiment: Imagine the Sun is suddenly removed. We wouldn't notice a difference for 8 minutes, because that's how long light takes to get from the Sun's surface to Earth.   However, what about the Sun's gravitational effect? If gravity propagates at the speed of light, for 8 minutes the Earth will continue to follow an orbit around nothing. If however, gravity is due to a distortion of spacetime, this distortion will cease to exist as soon as the mass is removed, thus the Earth will leave through the orbit tangent, so we could observe the Sun's disappearance more quickly.  What is the state of the research around such a thought experiment? Can this be inferred from observation?


If $A$ and $B$ are measurable, then there is an equality: $\lambda(A)+\lambda(B)=\lambda(A \cup B)+\lambda(A \cap B)$. But is $\lambda^*(A \cap B) + \lambda^*(A \cup B) \leq \lambda^*(A) + \lambda^*(B)$ true for any sets $A$ and $B$.

Let $m^*$ be an outer measure on a set $X$. Is the following equality always true for every  $A \subset X$ and measurable set of $ E\subset X$ ?   $m^*(E\cup A)+m^*(E\cap A) = m^*(E)+m^*(A)$  Note: I read Another thing on   .  but in the book of Aliprantis that is always true . thanks


I have a login page that is absolutely centered in the middle of the page both horizontally and vertically.  Inside there are 2 divs, smaller pink one and bigger blue one.  How can I center the bigger one?    .container {     background: rgba(249, 249, 249, 1);     bottom: 0;     box-shadow: 0 4px 8px 0 rgba(0, 0, 0, 1), 0 0px 4px 0 rgba(0, 0, 0, 1);     height: 342px;     height: max-content;     left: 0;     margin: auto;     padding: 60px 30px 60px 30px;     position: absolute;     right: 0;     top: 0;     width: 300px;     overflow: visible;  } .smaller {     background: pink; } button {     background: linear-gradient(rgba(239, 83, 80, 1), rgba(179, 47, 47, 1));     border: 0;     color: rgba(255, 255, 255, 1);     margin: 10px;     padding: 8px 70px 8px 20px;     box-sizing: content-box;     width: 50px; } .bigger {     width: 400px;     text-align: center;     background: blue }

Sign In
     <input>

     <button>Back</button><button>Login</button>

How can I horizontally center a
 within another
 using CSS?

Foo foo


I have this HTML:

   The CSS is:   .page-title .title_right {   width: 55%;   float: left;   display: block; }  .mid_center {     width: 370px;     margin: 0 auto;     text-align: center;     padding: 10px 20px; }  div.top_menu {     height: 167px;     vertical-align: middle; }   How can I center those buttons vertically? I don't want to patch it using padding.

What is the best way to vertically center the content of a div when the height of the content is variable.  In my particular case, the height of the container div is fixed, but it would be great if there were a solution that would work in cases where the container has a variable height as well. Also, I would love a solution with no, or very little use of CSS hacks and/or non-semantic markup.


Case Scenario   Let's assume that I have 3 files:   Dir/      a.py      b.py      c.py   and I have 10 commits, each one of which is involving changes to ALL of those three files.      For example commit with hash code ABCD is changing 3 lines from a, 10 lines from b and 1 line from c. Same stands for the rest for the commits.   At that point I am realizing that ALL the changes have been made in file a.py are useless.    How can I revert ALL the changes of file a.py WITHOUT reverting my changes in the other two files?  And what is the best practice to approach this kind of scenarios?

I have made some changes to a file which has been committed a few times as part of a group of files, but now want to reset/revert the changes on it back to a previous version.   I have done a git log along with a git diff to find the revision I need, but just have no idea how to get the file back to its former state in the past.


I'd like to replace broken images with default one in a image gallery. I use jQuery to do this:  <img src="#{articleController.getArticleMainImageLink(index)}"       class="articleImage" alt="#{msg['no.image.data']}" />  <script type="text/javascript">     $(document).ready(function () {         $("img.articleImage").on("error", function(){             $(this).attr("src", "http://images5.fanpop.com/image/photos/28900000/Adriana-Lima-adriana-lima-28919058-1280-1024.jpg");         })     }); </script>   The problem is that the default images do not appear immediately after page reload but after about two minutes (browser timeout?)  (tested with Firefox 31, Safari 6.1.6). Is there any way to resolve this problem?

I have a web page that includes a bunch of images. Sometimes the image isn't available, so a broken image is displayed in the client's browser.  How do I use jQuery to get the set of images, filter it to broken images then replace the src?    --I thought it would be easier to do this with jQuery, but it turned out much easier to just use a pure JavaScript solution, that is, the one provided by Prestaul.


I need to open .stl files with blender, without importing them!  In the properties of my .stl file, blender is set as "open with", but when I double click on the file it just opens blender as my preset user preference (without any objects). The same happens when I drag the file over the blender icon to open it that way.  Whats funny is that if I drag and drop the file over an older version of blender (2.49) then it opens the .stl file fine.  Any ideas?  Thanks

Is there a way to make Blender auto import files that are not .blend when you open them?  For example if you open a .fbx file by double clicking on it, and you have Blender set as default application, then import it to a new .blend.  Is it possible to make Blender import this .fbx file just like you would do it manually by using File > Import > FBX?  By default, Blender just opens up and loads default new scene when you open anything that is not .blend file.


If gravity at a place increases or decreases, does it affect the sound wave propagating through that place. If for certain place gravity increases on earth will there be change in direction or wavelength of the sound wave.

Someone asked me this question and I don't think I gave him an adequate answer (I was trying to think of the extreme case - that of neutron stars)


I get the 'objType' is a variable but is used like a type compiler error when I try the following code:  Type objType = Type.GetType(objFullyQualifiedName); object jsonObj= JsonConvert.DeserializeObject<objType> (jsonString);   How can I pass the type I obtain from the fully qualified class name to the DeserializeObject method?

What's the best way to call a generic method when the type parameter isn't known at compile time, but instead is obtained dynamically at runtime?  Consider the following sample code - inside the Example() method, what's the most concise way to invoke GenericMethod<T>() using the Type stored in the myType variable?  public class Sample {     public void Example(string typeName)     {         Type myType = FindType(typeName);          // What goes here to call GenericMethod<T>()?         GenericMethod<myType>(); // This doesn't work          // What changes to call StaticMethod<T>()?         Sample.StaticMethod<myType>(); // This also doesn't work     }      public void GenericMethod<T>()     {         // ...     }      public static void StaticMethod<T>()     {         //...     } }


In a tabularx, I try to set the text color for a complete column as follows:  \documentclass{article} \usepackage[papersize={60mm,60mm},margin=5mm]{geometry} \usepackage{array,xcolor,colortbl,tabularx,ragged2e} \pagestyle{empty}\parindent0pt \begin{document}  \begin{tabularx}{50mm}[t]{|   >{\color{blue}\hsize=.7\hsize\RaggedLeft}X|   >{\hsize=.3\hsize}X |}\hline Hello & World\\ Hello & World\\\hline \end{tabularx}  \end{document}   How can I prevent the the \color{blue} to cause extra white space in the top of each cell?

In the following example, the space after the red equation is much larger than the space after the black one.  \documentclass[12pt]{article} \usepackage{xcolor} \begin{document} \[ a = b \]  The quick brown fox jumps over the lazy dog. \color{red} \[ a = b \] \color{black}  The quick brown fox jumps over the lazy dog. \end{document}   It appears to me that the presence of \color{black} fools TeX into thinking there is something on the line after the equation, so the paragraph break causes a spurious blank line before the text. Section 3.7 of  mentions spacing problems, but doesn't really explain the situation. What is on the line after the red equation?  Note that there is already ; I want to understand what is going on.


How can I get the length of the array 'source'? I have this so far I was wondering if anyone had any suggestions. Thank you  For size I get -2074.   I do not know the length of the array, it's a random input.  #include <ctype.h>  int StrToUpper(char *destination[],  const char *source[]) {     int size = *(&source + 1) - source;      return size; }

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I am attempting to install Ubuntu 17.04 on my Dell XPS 15. I have disabled secure boot and hibernation mode in Windows. When I run the Ubuntu installer from a USB drive, it skips asking me what "installation type" I would prefer, and brings me right to the manual partitioning option. The problem is that nothing shows up, and clicking on the "+" and "change" buttons causes the installer to freeze: . According to GParted, Ubuntu is not recognizing my computer's SSD, merely the USB drive that I am using to boot it: . Is there a fixable bug that could be causing Ubuntu to fail to recognize the SSD?

I'm having a problem installing Ubuntu, and Kali as well. I downloaded the iso from the official site & tried installing using USB. I also tried desktop installation, but the problem is same.  It shows a single drive i.e. my total Hard Disk and if I select it, it asks me to create a new partition & shows total space as FREE.  It's with all Ubuntu I downloaded, 11.10 Server, 12.10 and 13.04. I also tried to install BackTrack's new version Kali Linux but again I got the same problem.  I hope I meet thier system requirements. Here's my system details for your ease:   OS: Windows 7 Ultimate Processor: Intel P4 2.80 GHz RAM: 3GB Hard Disk: 320GB No of Local Drives: 4 (1 Primary, 3 Logical) Free Space: 195GB (about) Motherboard: G31 Cache: 1MB Help me, please.