A few years ago I was told not to use that word because, in addition to its negative meaning, it comes from Latin denigratus, past participle of denigrare, which means to blacken. Therefore, "to denigrate someone" would be "to blacken that person". Considering its current definition (see below) and the wish to be politically correct, I wonder whether the word has come to acquire any racist overtone.   The reason why I'm asking is because I was reading "Language Myths" a book by Laurie Bauer recently, and came across this passage which contained that word  "...certain educational institutions denigrate the way certain ethnic minorities and lower-working-class children talk."  Then I remembered I was once told not to use "denigrate" as it might be misinterpreted by some people.      denigrate - from    1. to say very critical and often unfair things about (someone)   2. to attack the reputation of, to deny the importance or validity of, belittle   EDIT (on Dec 17th, 2017) - This article,  which Mari-Lou A mentions in one of the comments, shows very clearly the writer's feelings about this word, with very good arguments to bear him out.  Then again, there are those who think otherwise. For one, , the character played by Denzel Washington in the 2007 feature film "The Great Debaters", says the word has racist undertones. -  Edit (on May 6th, 2020)

A few years ago there was a  controversy over the word niggardly — a perfectly innocent word that unfortunately sounds like a racial slur.   Given that controversy, is it safe to use denigrate, which is actually derived from the Latin niger?   Can whole families of words become tainted purely by association?


I have a class named "note" which provides a note with a title, a note, and a color. I save all the notes in a SQLite database. BDDManager is my SQLite database manager it inserts, removes etc... notes from database.      private void readNotes(){     Note note = new Note();      BDDManager.open();      note = BDDManager.getNoteWithTitle("Title");      if(note != null && note.getTitle() == "Title"){          addCardNote(note);         Toast toast = Toast.makeText(this, note.getCouleur(), Toast.LENGTH_LONG);         toast.show();      }      BDDManager.close(); }   In this part of the code, if I don't remove "note.getTitle()=="Title"" it doesn't work. And all the strings from my database are not equal to what they are supposed to be equal

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?


Does this mean that only the current release receives updates (including security updates) and fixes while older/all other versions do not?  Quoting from the openwrt website   " Historic Releases  The releases linked here are mostly for historic interest - they are long out of date and completely unmaintained. "  But on the , many older versions are recommended.  A related question is asked here () but it does not address this.

I'd like to install OpenWRT on an Asus WL-520GU router I have a couple of Asus WL-520GU modems and Raspberry Pi (model B) boards floating around and I'd like to put some of them to use in some capacity around my  network. I want to install OpenWRT and would prefer to use one of the Asus boxes. Actually, one already has an old release from 2008 on it—but I'd like to upgrade it to the latest as at the writing of this, 15.05. But I'm not quite understanding the compatibility of these devices in relation to the "Current Release Support" you see on various pages. From the  search page for the device page for the , it appears the latest support version is 10.03.1 Also in relation to the Raspberry Pi (model B), ( and  pages), it would appear the latest supported version is 14.07. My question is: What is exactly meant by Current Release on the  page? Confusion: What I'm confused about: will Chaos Calmer run on these devices? My thinking:  YES. It's really a matter of building/compiling the package (unsure of exact terminology) for the device you're using. Maybe, (or it probably will), it's just that no-one has compiled it for these yet or that maybe someone has tried and were unsuccessful, gave up and moved on, and so with a little extra work/research it possibly could work No. That chipset, memory, other some other feature of the board is no longer supported and it will cause too many headaches to move on.  Just some of the notes I've made about it:  WiFi/radio issues—not working in kernel 2.6, but worked in  2.4, what about 3+? —USB and wireless, doesn't seem insurmountable —various stuff including the page stops at Attitue Adjustment and Barrier Breaker. There's no mention of Chaos Calmer at all The one that has something installed is Kamakazi (unsure what version, but release 12857, so it's a bit old) I'm aware I can get and use 10.03.1 from the  if that is as far as I can go I am aware of another question (which is from 2011), although he's using the Asus WL-520GU as well, it's about an  because of the 2.6 kernel problem, which AFAIK remains unanswered for later distros  Finally I'm not scared to get in there and give it a go (I really don't have much idea as to what I'm doing with building/compiling these sorts of things, but I'm adventurous) :) but I don't want to waste my time either if it's a definite 'no go'.


I was trying to do some tutorials and experiments for Volume shader. In a final render as well as in viewport I am getting totally different results with GPU and CPU. What is strange, when GPU (gtx 970) is used the Volume is very noisy and the quality is much lower (it looks very flat). This is first time i saw such difference in CPU vs GPU result. What is going on?

Alrighty.  I've searched all over the place and even put in a couple of requests from every deity I could think of, but nothing on my issue.  So, I'm messing around with making up volumetric light cones for spotlights in Cycles for a project.  I've got all of the parts set up and in scene.  I start rendering and I get some odd results.  With GPU Compute and GPU+CPU I get wicked amounts of noise inside the cones.  As if the density of the scatter isn't high enough.  Then I try CPU only, it comes out smooth as butter.  Now I'm running a 9900k 32GB RAM and an RTX 2080 on the current stable release of 2.80.  I just can't figure it out.  I mean, I can handle just using my CPU and eating the much longer render times, but I'd much rather use the full power of my rig and get the same if not better results.  I'll put up some pics for examples of what I've got going on.


Where is question mark on below?  After What or Alan  "What?" yelled Alan.

The American convention in quotations is (typically) to place punctuation inside quoted text. But I always run into situations where the punctuation of the quote interferes with the punctuation of the sentence. How would you punctuate this (American, non technical)?     When my friends ask, "What do you want for your birthday?", I never know how to respond.   It seems odd to place the last comma outside the quote simply because of the question mark. Is that the preferred (i.e. most often accepted) standard?


Today for some reason I dreamed about this problem, but I dont remember reading it anywhere. I was curious to know if the problem has a name and what the solution is. I'm no mathematician so I hope I don't make many expression blunders. Given a random permutation of a set of n elements, Where each element has one, and exactly one matching element in the set different from itself. Find an expressión that calculates the probability of the set, for a given n, to not have any matching pairs contiguous to each other, and the probability of having exactly 1 matching pair contiguous. Do this assuming that the pair relations are not necessarily reciprocal, and again assuming that they are. Thanks in advance. Edit: Lets take for example the case in which the relations are never reciprocal. Using the alphabet, lets asume that each letter matches the next one, for a list of size n, and that the last one matches the first one (otherwise the last element wouldn't have a match, even if the previous element has this one as his matching element, because the relations are never reciprocal). This can be understood as some kind of love triangle, A likes B, B likes C and C likes A. I made a small program to check all combinations and the number of valid permutations by changing the size n, maybe this will make things a bit more clear: N = 2 | Valid combinations: 0 | Example: None | Combinations: 2 | Probability: 0.0% N = 3 | Valid combinations: 0 | Example: None | Combinations: 6 | Probability: 0.0% N = 4 | Valid combinations: 0 | Example: None | Combinations: 24 | Probability: 0.0% N = 5 | Valid combinations: 10 | Example: ECADB | Combinations: 120 | Probability: 8.3333% N = 6 | Valid combinations: 60 | Example: FDBECA | Combinations: 720 | Probability: 8.3333% N = 7 | Valid combinations: 462 | Example: GECFBDA | Combinations: 5040 | Probability: 9.1667% N = 8 | Valid combinations: 3920 | Example: HFDGCAEB | Combinations: 40320 | Probability: 9.7222% N = 9 | Valid combinations: 36954 | Example: IGEHFCADB | Combinations: 362880 | Probability: 10.1835% N = 10 | Valid combinations: 382740 | Example: JHFIGECADB | Combinations: 3628800 | Probability: 10.5473% N = 11 | Valid combinations: 4327510 | Example: KIGJHFDBECA | Combinations: 39916800 | Probability: 10.8413% It seems like the probability of a permutation with no contiguous matching non reciprocal pairs increases as the size increases, which makes sense (I wonder what the probability is for the size of 7 billion). This is not the same as this question  because in that question the new list has no matching elements in it, but in this one the list does have all, but ordered in such a way that they arent contiguous. The formula is not appliable. I did a search of the sequence generated by the permutations, and seems to be similar to the Hertzsprung problem, the specific OEIS sequence for this: .

In how many ways can we choose k items from n distinct items put in a circle.   Then further extension of the question, if I want to find out the number of ways to choose k items from n distinct items in a circle such that no 2 are together.  Thanks


I'm trying to loop through a list box text instead of having to select a line, but I am unsure on how to do so.  webBrowser1.Document.GetElementById("user").SetAttribute("value", listBox1.Text);

I'm getting the error below when trying to loop through a listbox and then remove the item.     List that this enumerator is bound to has been modified. An enumerator can only be used if the list does not change.   foreach (string s in listBox1.Items) {     MessageBox.Show(s);     //do stuff with (s);     listBox1.Items.Remove(s); }   How can I remove the item and still loop through the contents?


I am in creative mode and I want to respawn at my house. I tried the /kill command and it said "killed Steve" but I'm still in the void.  Can you help? I am very frustrated and aggravated at this point. I created a big house and I want to get back to it but can't figure out how.

I wandered too far to go look for sheep and now I'm on a completely different island.  How do I find my way back to my house?


Question: For the layman, what does it mean for data (say $n$ samples covering $m$ variables) to be identically distributed, and how is it practically achieved when conducting machine learning?  So let's say each sample measures X and Y predictors, and I want to predict outcome Z.   To satisfy IID, should I be aiming for $X$ and $Y$ to look the same when I plot their estimated density functions? Or does it mean something else entirely?  I have read about "normalizing" your sample data by subtracting the mean and dividing by the standard deviation. Is the purpose of this to fulfill IID?   The context of my question is machine learning, specifically XGBoost for a regression problem. It is performing in a mediocre to poor fashion and I want to understand why. Perhaps my data is not IID. I thought it didn't matter for tree-based models, but I am obviously missing something.

In statistical learning, implicitly or explicitly, one always assumes that the training set $\mathcal{D} = \{ \bf {X}, \bf{y} \}$ is composed of $N$ input/response tuples $({\bf{X}}_i,y_i)$ that are independently drawn from the same joint distribution $\mathbb{P}({\bf{X}},y)$ with  $$ p({\bf{X}},y) = p( y \vert {\bf{X}}) p({\bf{X}}) $$  and $p( y \vert {\bf{X}})$ the relationship we are trying to capture through a particular learning algorithm. Mathematically, this i.i.d. assumption writes:  \begin{gather} ({\bf{X}}_i,y_i) \sim \mathbb{P}({\bf{X}},y), \forall i=1,...,N \\ ({\bf{X}}_i,y_i) \text{ independent of } ({\bf{X}}_j,y_j), \forall i \ne j \in \{1,...,N\} \end{gather}  I think we can all agree that this assumption is rarely satisfied in practice, see this related  and the wise comments of @Glen_b and @Luca.  My question is therefore:      Where exactly does the i.i.d. assumption becomes critical in practice?    [Context]   I'm asking this because I can think of many situations where such a stringent assumption is not needed to train a certain model (e.g. linear regression methods), or at least one can work around the i.i.d. assumption and obtain robust results. Actually the results will usually stay the same, it is rather the inferences that one can draw that will change (e.g. heteroskedasticity and autocorrelation consistent HAC estimators in linear regression: the idea is to re-use the good old OLS regression weights but to adapt the finite-sample behaviour of the OLS estimator to account for the violation of the Gauss-Markov assumptions).   My guess is therefore that the i.i.d. assumption is required not to be able to train a particular learning algorithm, but rather to guarantee that techniques such as cross-validation can indeed be used to infer a reliable measure of the model's capability of generalising well, which is the only thing we are interested in at the end of the day in statistical learning because it shows that we can indeed learn from the data. Intuitively, I can indeed understand that using cross-validation on dependent data could be optimistically biased (as illustrated/explained in ).   For me i.i.d. has thus nothing to do with training a particular model but everything to do with that model's generalisability. This seems to agree with a paper I found by Huan Xu et al, see "Robustness and Generalizability for Markovian Samples" .   Would you agree with that?  [Example]   If this can help the discussion, consider the problem of using the LASSO algorithm to perform a smart selection amongst $P$ features given $N$ training samples $({\bf{X}}_i,y_i)$ with $\forall i=1,...,N$ $$ {\bf{X}}_i=[X_{i1},...,X_{iP}] $$ We can further assume that:   The inputs ${\bf{X}}_i$ are dependent hence leading to a violation of the i.i.d. assumption (e.g. for each feature $j=1,..,P$ we observe a $N$ point time series, hence introducing temporal auto-correlation) The conditional responses $y_i \vert {\bf{X}}_i$ are independent. We have $P \gg N$.    In what way(s) does the violation of the i.i.d. assumption can pose problem in that case assuming we plan to determine the LASSO penalisation coefficient $\lambda$ using a cross-validation approach (on the full data set) + use a nested cross-validation to get a feel for the generalisation error of this learning strategy (we can leave the discussion concerning the inherent pros/cons of the LASSO aside, except if it is useful).


I would like to write something of the sort. It's a form of an accent but I do not know how to write letters instead of just dots or a tilde.  Thank you

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


I have an application that is capable of plugins (MEF). The plugins are WPF UserControls that import services.  The user can select the wanted plugin from the main menu of the application.  To do this, i use the following loop:  foreach(IToolPlugin Plugin in ToolPlugins) {     Plugin.Init();     MenuItem PluginMenuItem = Plugin.MenuItem; //New MenuItem but with Header set.     PluginMenuItem.Click += new RoutedEventHandler(delegate(object o, RoutedEventArgs e) { DoSomething(Plugin.Control);});     PluginsMenu.Items.add(PluginMenuItem); }   That works very fine for a single item. But as soon as i have more than 1 plugin, all menuitems execute the delegate of the last loop. Or at least with the Plugin.Control of the last loop.  How can i fix this? Thanks for any help.

I met an interesting issue about C#. I have code like below.  List<Func<int>> actions = new List<Func<int>>();  int variable = 0; while (variable < 5) {     actions.Add(() => variable * 2);     ++ variable; }  foreach (var act in actions) {     Console.WriteLine(act.Invoke()); }   I expect it to output 0, 2, 4, 6, 8. However, it actually outputs five 10s.  It seems that it is due to all actions referring to one captured variable. As a result, when they get invoked, they all have same output.  Is there a way to work round this limit to have each action instance have its own captured variable?


I am creating a game in java, during the process, i implemented a generic class called ScrollingObjectHandler that takes a  game object as a type parameter and handles it's movement, this game object must extends an abstract class called ScrollingObject,  this is the handler's decleration:  public abstract class ScrollingObjectHandler<T extends ScrollingObject> {     private T objects[];     // other fields....      @SuppressWarnings("unchecked")     protected ScrollingObjectHandler(int size) {         //initialization of other fields....          objects = (T[]) new ScrollingObject[size];          for(int i = 0;i < size;i++) {             objects[i] = create();         }     }      // init each ScrollingObject      protected abstract T create();       // the getter for the contained array     public T[] getAll() {         return objects;     }      // rest of the code....  }   I use this class for handling 2 types of game objects; a Ground:   public class Ground extends ScrollingObject {     // code.... }   and a TubePair:  public class TubePair extends ScrollingObject {     // code.... }   , and this is the initialization code of the 2 handlers in my main GameWorld class:  // initialization and decleration are separated in the class ScrollingObjectHandler<TubePair> tubePairHandler = new ScrollingObjectHandler<TubePair>() {     @Override     public TubePair create() {         // returns a new TubePair     } }; ScrollingObjectHandler<Ground> groundHandler = new ScrollingObjectHandler<Ground>() {     @Override     public Ground create() {         // returns a new Ground     } };   When i call getAll() to check the collision of another game object with each TubePair object using this loop :   for(TubePair tubePair : tubePairHandler.getAll()) {     // checking collision code.... }   , i get a ClassCastException like this:   Exception in thread "LWJGL Application" java.lang.ClassCastException: [Lcom.maiconelements.flappybird.gameobjects.ScrollingObject; cannot be cast to     [Lcom.maiconelements.flappybird.gameobjects.TubePair;     at  com.maiconelements.flappybird.world.GameWorld.update(GameWorld.java:142) (this line -> for(TubePair tubePair : tubePairHandler.getAll()))     ....   The same problem also arises in a similar enhanced for loop that draws the Ground objects in another class, this is the getter for the Ground array  from the GameWorld class :  Ground[] getGrounds() {     return groundHandler.getAll(); }   , this is where the grounds are drawn:  for(Ground ground : world.getGrounds()) {     // drawing code.... }   , i also get the same ClassCastException:  Exception in thread "LWJGL Application" java.lang.ClassCastException: [Lcom.maiconelements.flappybird.gameobjects.ScrollingObject; cannot be cast to     [Lcom.maiconelements.flappybird.gameobjects.Ground;    at  com.maiconelements.flappybird.world.GameWorld.getGrounds(GameWorld.java:87)  (this line -> return groundHandler.getAll();)     ....   What am i doing wrong here ? I am not actually trying to cast anything but the array in the ScrollingObjectHandler class, so why is this happening ?  Thanks in advance.

I think there must be something subtle going on here that I don't know about. Consider the following:  public class Foo<T> {   private T[] a = (T[]) new Object[5];    public Foo() {     // Add some elements to a   }    public T[] getA() {     return a;   } }   Suppose that your main method contains the following:  Foo<Double> f = new Foo<Double>(); Double[] d = f.getA();   You will get a CastClassException with the message java.lang.Object cannot be cast to java.lang.Double.  Can anyone tell me why? My understanding of ClassCastException is that it is thrown when you try to cast an object to a type that cannot be casted. That is, to a subclass of which it is not an instance (to quote the documentation). e.g.:  Object o = new Double(3.); Double d = (Double) o; // Working cast String s = (String) o; // ClassCastException   And it seems I can do this. If a was just a T instead of an array T[], we can get a and cast it without a problem. Why do arrays break this?  Thanks.


Show that if $n, k \in \mathbb{Z}, n>1, k>0$, then   $$\frac{1}{n} +  \frac{1}{n+1} + \cdots + \frac{1}{n+k}$$   is not an integer.    I thought about showing the result by first showing $k \geq n$ and using the fact that for every $n \in \mathbb{N}$ there is a prime $p$ such that $n <p \leq 2n$, but am not sure if there is another way. If not, how can we proceed and conclude?  EDIT: There is a question like this already asked that I did not see. I do not need assistance with this question.

Assume that $k,n\in\mathbb{Z}^+$. Prove that the sum \begin{equation*} \dfrac{1}{k+1}+\dfrac{1}{k+2}+\dfrac{1}{k+3}+\ldots +\dfrac{1}{k+n-1}+\dfrac{1}{k+n} \end{equation*} is not an integer.   The case $k=0$ is proved in this question: ""


I need to add a watermark on all pages of a latex document but the first.  Currently, I'm using , but I haven't suceeded yet.  Any advice or suggestion?  I tried the xwatermark package, as suggested , but it came out that it is not compatible with other packages I'm using.

I am using draftwatermark package. Is there any option to exclude watermark from some specific pages? Say no watermark from pg 3-4. I can not use xwatermark package. It conflicts with the geometry package of my document.  MWE:  \documentclass[12pt,a4paper]{exam} \usepackage{draftwatermark}  \usepackage{lipsum}   \SetWatermarkAngle{45}  \SetWatermarkLightness{.8}  \SetWatermarkFontSize{10cm}  \SetWatermarkScale{5}  \SetWatermarkText{\tt{12345}}  \begin{document}  \lipsum[1-20]  \end{document}


I have read that there is and electrical current, but why and how?    How big can this current (and voltage) be (does an amount of foil, saliva, tooth filling have any influence on this)? Can it "dry out" after some time? Can it be harmful if occurs for longer period?

I recently came to know about the Conventional Current vs. Electron Flow issue. Doing some search I found that the reason for this is that Benjamin Franklin made a mistake when naming positive and negative charges. There is even this little comic about that   My question is, how can a naming convention be wrong? Perhaps I don't understand what is the actual mistake here, I don't know. But I don't see how a naming convention could be wrong or right. There is no right and wrong about that. It could've been any other name, like charge A and charge B.  I'll appreciate anyone can help me understand what is wrong in all this.


Am reposting this because I wasn't clear in my previous post.  Check the image to understand my headache.

Whenever I model objects that has different look at front and back. Viewing it from front perspective or orthographic the model displays back of the object.


I have looked at the questions and answer here at U&L but I still cannot get my default group to change from a user.  [red@ws-red-l ~]$ whoami red [red@ws-red-l ~]$ groups yellow green [red@ws-red-l ~]$ sudo usermod -g green red usermod: no changes [red@ws-red-l ~]$ sudo usermod -G green red [red@ws-red-l ~]$ groups yellow green [red@ws-red-l ~]$ touch file [red@ws-red-l ~]$ ls -l file -rw-r--r-- 1 red yellow 0 Feb 18 13:51 file   I would prefer if red did not belong to group yellow so when I do a touch file the group of the file would be green.  What am I doing wrong here?

I changed permissions of a file (chmod g+w testfile) and running ls -l testfile gives:  -rwxrwxr-x 1 user1 user1 0 2011-01-24 20:36 testfile   I then added a user to that group ("/etc/group" has user1:x:1000:user2 line), but am failing to edit that file as user2. Why is this so?


I bought "Castle of Illusion" on my iPhone, and I am signed into my iCloud with my Apple ID and such on my laptop, and downloaded the app in the Mac App store. I pressed "Install" and it said "Installing". Did I just BUY the app AGAIN? Is it linked with my iPhone apps?

I bought a paid app on my iMac, and a few months later tried to download it on my iPhone but it’s forcing me to pay again for it. I thought the App Store linked purchases on multiple devices?


How to find such limits :   $$\lim_{m \to \infty} \lim_{n \to \infty}  cos^{2m}(n! \pi x)$$  Please suggest not getting any idea how to approach such problems, will be of great help thanks.

I have to find out the following limit $$\lim_{m\to\infty}\lim_{n\to\infty}[\cos(n!πx)^{2m}]$$ for $x$ rational and irrational. for $x$ rational $x$ can be written as $\frac{p}{q}$ and as $n!$ will have $q$ as its factor the limit should be equal to 1. the second part of irrational is giving me problems. I first thought that limit should be zero as absolute value of cosine term is less than 1 and power it to infinity you should get $0$. But then I realised that it was wrong. I brought the limit down to this form. $$e^{-\sin^2(n!πx)m}$$ after this I find the question quite ambiguous as they have just said $x$ is irrational. If I take $x$ as $\frac{1}{n!π\sqrt{m}}$ I get the limit as $\frac{1}{e}$ but if I take  $x$ as $\frac{2}{n!π\sqrt{m}}$ I get the limit as $\frac{1}{e^4}$. please help me and tell me where have I gone wrong?


I'm trying the following code:  <?php $test = "326101347676";  echo sprintf("%014d\n", $test);   But it's giving me 00002147483647 output.  What I expect is 00326101347676  I know it's causing by the sprintf function, but I don't know why, could you please help me to solve this problem.  FYI: I'm in PHP/5.3.0  Note: The referred post didn't help me to solve the problem, besides I already tried the bcmod command and didn't go well with my code. Now @devpro last snippet in the comment section working well for me.

To use  as you would require when using the  with large numbers (100,000+), it calls for some very large calculations.  When I multiply two large numbers (eg: 62574 and 62574) PHP seems to cast the result to a float. Getting the modulus value of that returns strange values.  $x = 62574 * 62574; var_dump($x);          // float(3915505476) ... correct var_dump($x % 104659); // int(-72945)  ... wtf.   Is there any way to make PHP perform these calculations properly? Alternatively, is there another method for finding modulus values that would work for large numbers?


I have the Canon EOS 70D with the standard 18-135 lens on it. The camera was working fine and I dropped the aperture down when taking a photo and the camera froze. I turned it off and when I turned it back on, I get the following message:  Err 01 - Communications between the camera and lens is faulty. Clean the lens contacts.  I took the lens off and put it back on - no change.  I then cleaned the lens contacts - no change.  I tried a different lens incase it was the lens - no change.  I tried with a lens attached - same error coming up.  I can't access any menu options etc, as soon as I turn the camera on - this error comes up and I can't do anything on the camera.  Can someone tell me how to fix this issue as I have a shoot in around 5 hours and this has happened.  Thanks

So I just got a Canon Rebel T4i and I'm having trouble with my lens (18-135mm STM lens). It's when I have my camera on movie mode, when I'm setting my aperture the blades won't change. I can only set to f/3.5 and f/20, and when I keep trying to change it my camera will give me error 01. So I clean the lens contacts and when I try again, my lens makes a noise and error 01. please help. I don't know what to do...


I have a material, that is not assigned to any object. I use it as a material override in a pass (View Layer) only.  Do someone knows a way to edit (see) materials in the shader editor, that are not assigned to any object?  Thank you

I'm trying to work on the materials for my scene without touching the rest of the scene for now. When I try to switch between scenes by clicking the outlined thing, it automatically applies the selected material to the active object. Is this the wrong button? Should I be clicking something else in order to edit the material properties without applying it to my objects?   Thanks for the help in advance.


I want to configure the A4 paper size in latex to the standard size, i.e. 8.27 x 11.69 in. Right now my generated pdf has size of 8.50 x 11.00 in   How do I get the right size so that I can print it out without dimensions being corrupted. I generate the pdf file by using LATEX->PDF option. My preamble setting is as follows:    \documentclass[11pt]{report} \usepackage[top=2.5cm, bottom=2.5cm, left=2.75cm, right=2.75cm]{geometry}

I noticed that the paper size invoked by a4paper is not working right in my examples:  \documentclass[a4paper,11pt,oneside]{article} \begin{document} Test \end{document}   I checked with Preview.app and it tells me the paper size is 21.59 cm × 27.94 cm. A4 should be 21.0 cm × 29.7 cm.  When I use \usepackage[a4paper]{geometry} I notice a different size of the paper (it gets narrower) and Preview.app says: 21.01 cm × 29.71 cm, which seems right. I can reproduce this exact behavior with every class: article, book etc., scrartcl, scrreprt, etc., g-brief2 except memoir which gives me 21.01 cm x 29.71 cm    Is there something wrong or am I missing something?


var parent = document.getElementById("parent").children; for (var i = 0; i < parent.length; i++) {   var m = Math.floor((Math.random() * 300) + 100);   console.log(m);   parent[i].style.margin = m+'px 0 0 0'; } #parent div {     display: block;     height: 200px;     width: 200px;     text-align: center;     vertical-align: middle;     font-size: 100px;     background-color: black;     color: white; }

1

2

3

4

5

     how can i tell if i scrolled on top of one of the child divs?  i tried using  parent.onscroll = function(){   ... ... ... }   but it does not work at all because it does not tell if scrolled on the children or not

I'm loading elements via AJAX. Some of them are only visible if you scroll down the page. Is there any way I can know if an element is now in the visible part of the page?


I'm making a simple cuboidal room, but as soon as I solidify my mesh it gets weird black patches around the corners.  If I turn fill rim to off it looks good, but obviously I want to fill the rims. I guess the normals are flipped or something leading to a lighting issue. It also persists in final rendered version   From outside  Notice the dark shade just above the 3D cursor    From inside  Again above the 3d cursor    .

I'm currently working on a model of an X-wing that I'm intending for use in a game and running into a bit of trouble with the shading of the mesh. The upper nose is rounded off where the sensor cone attaches, but at the point it reaches the canopy frame it flattens out and meets at a corner.  Everything is fine and dandy when the sides are modeled:    but once I close it off and add the top of the nose, the shading goes to hell:    As you can see, the smoothing gets confused at the lip of the cockpit.  I've tried a couple different means of getting around this, none of which looks right while maintaining the correct shape. The transition from the rounded to flat is a fairly important part of the ship's character, so I don't want to discard the contours, either.  Any tips or suggestions on modeling this area?  Addendum:  If I eliminate that second angle where the canopy frame meets the fuselage as marked in red:    this also fixes the smoothing. However this is not a solution, as the angle is a part of the design. It DOES give me another thought on fixing, but I won't be able to test it until I get home.


I have an ajax call:  jQuery.ajax({   type:'POST',   url: 'http://www.mytestsite.com/wp-admin/admin-ajax.php',   data:{        'action':'display_image',        'id_page': 9        },   success:function(data){     $('#ajax').html(data);   } });    It works perfectly my div ID "ajax" display the html code:  HELLO   The problem is in my footer page i have:  $('#test').on('click', function(){ alert('test'); });   When i click on "HELLO" (the html return of my ajax call) an alert box will display but it doesnt work. I dont know why...

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I'm using the below code to trim the string based on the condition like 15 characters per line, in this below code, 15 was hard-coded.But I need to make it dynamic like defining variable and pass into replace function.  var str = "Here's to your next step.Keep Walking.Keep Watching" result = str.replace(/(.{1,15})(?:\n|$| )/g, "$1|\n"); console.log(result);   How I need  var trim_val =15; var str = "Here's to your next step.Keep Walking.Keep Watching" result = str.replace(/(.{1,trim_val})(?:\n|$| )/g, "$1|\n"); //here i have to pass that variable console.log(result);   Thanks in Advance

I would like to create a String.replaceAll() method in JavaScript and I'm thinking that using a regex would be most terse way to do it.  However, I can't figure out how to pass a variable in to a regex.  I can do this already which will replace all the instances of "B" with "A".  "ABABAB".replace(/B/g, "A");   But I want to do something like this:  String.prototype.replaceAll = function(replaceThis, withThis) {     this.replace(/replaceThis/g, withThis); };   But obviously this will only replace the text "replaceThis"...so how do I pass this variable in to my regex string?


Can we ascertain the size of the electron? If it really is zero radius, then it can't be matter because it doesn't occupy space?  Definition of matter (Google): physical substance in general, as distinct from mind and spirit; (in physics) that which occupies space and possesses rest mass, especially as distinct from energy.

According to :     The electron has no known substructure. Hence, it is defined or assumed to be a point particle with a point charge and no spatial extent.   Does point particle mean the particle should not have a shape, surface area or volume?  But when I searched Google for the "electron shape" I got many results (like  and ) that says electrons are round in shape.


I've read abt the ton of complications/problems ppl are facing with UEFI when installing Ubuntu alongside Windows, but I haven't been able to find a solution to the one I encountered.   I have a Windows 8 OS and we installed Ubuntu 12.04 next to it. However, the dual boot menu did not pop up upon reboot. It loaded Windows directly. (Secure boot & rapid technologies are disabled).   After some research & forum reading, we verified that Ubuntu was indeed present in the EFI partition and we ran boot-repair. Eventually, the boot menu appeared, but it did so at every second reboot (from a shutdown not a restart). Then, it disappeared again and the laptop goes directly into Windows.   When the dual boot menu appeared, we went into Ubuntu and life was good so the installation  -or some parts of it- worked... But how do i now get the dual boot menu to appear as it's supposed to?   Furthermore, I read that with Windows 8 the dual boot menu becomes graphical... But we just had the regular old list.   Any tips??   Thanks!

This is NOT an installation problem question. I've had both op sys working fine side-by-side for a couple of weeks now. I'm using Ubunutu 12.04 64-bit.  This morning when I tried to switch from Win8 to Ubuntu, it just rebooted into Win8. No grub screen whatsoever. This is the 3rd machine I've had dual-booting & have never seen this, but then Win8 is a 1st for me & has thrown some pretty awesome blocks in the path to get to here. Atrocious op sys...  I'm assuming the ASUS updater did this yesterday. (ASUS R503U)  So, do I just put the Ubuntu disk in & reinstall grub?


When I render to OpenEXR (multilayer) in Blender 2.80 (Cycles) and then import it back into After Effects (2019) the image looks way too dark.  What it looks like in Blender 2.80:    What it looks like in After Effects:    I've tried playing around with the color management settings in Blender but it doesn't seem to make a difference. I've tried opening the EXR in other applications like IrfanView and Photoshop but that doesn't work at all (either an error or a black image).

How do you apply colormanagement settings to EXR files?  When i do some color adjustment by using colormanagement and try to save exr file and open it in photoshop it looks like colormanagement settings was not applied to it.


I am new at gpg and I have just encrypted a file and decrypted it. I was asked to enter the passphrase for the first time.  Then, when I decrypt the file again gpg does not ask for any password anymore. This is not secure.  I would like to make it ask for my password everytime I try to dercypt the file.  Thanks for your help.

i used this command to decrypt my file  gpg -d myfile.gpg   it asked me for passphrase when i entered it showed me the content of the file  now when i run the command again it did not ask me the passphrase and directly decrypted the file   how can i reduce the passphrase remember time.  Thanks  Is there any way to do this through command line or every from a software.


This  specifically answer's my question  In Junit is there a way to make sure the code makes it past a certain point?  ex:  @Test(expect = SpecialException.class) public void testMyCode() {     essentialMethodThatCantBeMockedThatMayThrowSpecialException()      // stuff      actualMethodIAmTestingAndWillAlsoThrowSpecialException() }   The main purpose is that I am doing a major refactor and if I can outfit my existing tests with something like an expect x number of assertions.  Then that would make sure that my tests throw exceptions for the correct reasons and not the wrong reasons.  A good example of something that does this is Qunit which has a expect(numberOfAssertions)  which will fail the test if that many assertions are not called.  I have been looking a long time for something like this in JUnit but I can't find it.

How can I use JUnit4 idiomatically to test that some code throws an exception?  While I can certainly do something like this:  @Test public void testFooThrowsIndexOutOfBoundsException() {   boolean thrown = false;    try {     foo.doStuff();   } catch (IndexOutOfBoundsException e) {     thrown = true;   }    assertTrue(thrown); }   I recall that there is an annotation or an Assert.xyz or something that is far less kludgy and far more in-the-spirit of JUnit for these sorts of situations.


I simply want to get an image in gnome like this one:    And here is how mine looks like:      To clarify, I want to add my name near the arrow as above and when I click on it I want to get an image I choose. Like the image above of "wanda".  So how can I set an image like this?

I have Ubuntu GNOME 14.04 LTS and from installation, my name has not appeared in the panel. I have enabled it via dconf in org.gnome.desktop.privacy, but it has yet to appear even after a re-login and restart.  Can I receive some assistance into the cause of this and a solution?  This is where I would like it to appear:


Suppose we have a smooth manifold $M$ and an embedded/immersed submanifold $N \subset M$.  As usual, for every $p \in N$, we identify $T_pN$ as $(di)_p(T_pN)$, where $i:N \hookrightarrow M$ is the inclusion. Now let's say that we have two smooth vector fields $X$ and $Y$ on $M$ which happen to be tangent to $N$ (i.e. $X_p, Y_p \in T_pN, \forall p \in N$). We know that in this case, the Lie bracket of $X$ and $Y$ in $M$, call it $[X,Y]_M$ is also tangent to $N$. However, what about their Lie bracket on $N$? By this I mean, taking the restrictions $X^*$ and $Y^*$ of these vector fields to $N$ (i.e. two smooth vector fields $X^*, Y^*$ on $N$ which are $i$-related with $X$ and $Y$, respectively), how would we compute the Lie bracket of $[X^*, Y^*]_N$ in $N$? It seems "trivial" that $$ [X^*, Y^*]_N = \left. [X, Y]_M \right|_{TN}. $$ However, how would we go about proving this? I don't really know how to start, as it seems just too trivial. Context: I firstly thought about this when I encountered the vector fields $$  X_1 = z\partial_y - y\partial_z, X_2 = x\partial_z - z\partial_x, X_3 = y\partial_x - x\partial_y, $$ which are smooth vector fields on $\mathbb{R}^3$ but also "happen" to be tangent to the sphere $S^2$. I then wanted to compute the Lie bracket $[X_1, X_2]$ on $S^2$. I just computed it in the classical way in $\mathbb{R}^3$, and then restricted it to $S^2$.

Let $X_1, X_2$ be vector fields over a smooth manifold $M$ and likewise $Y_1, Y_2$ vector fields over a smooth manifold $N$. Furthermore, let $X_1$ and $Y_1$ aswell as $X_2$ and $Y_2$ be $\Phi$-related for some morphism $\Phi: T M \to T N$ (i.e. we have $\Phi \circ Y_i = X_i \circ \phi$ where $\phi: M \to N$ is the projection mapping of $\Phi$). I now want to show that the commutator/Lie bracket $[X_1, Y_1]$ is also $\Phi$-related to $[X_2, Y_2]$.  Now I tried to go by the definition of the commutator and write out   $$[X_1, Y_1] \circ \phi  = X_1 Y_1 \circ \phi - Y_1  X_1 \circ \phi \\   = X_1 \circ (\Phi \circ Y_2) - Y_1 \circ (\Phi \circ X_2) \\$$  But I'm not really sure how to go from there as I don't think I could interchange $X_i \circ \Phi$ for $\Phi \circ X_i$? I would need to show that this expression is equal to   $$\Phi \circ [X_2, Y_2] = \Phi(X_2 Y_2 - Y_2 X_2)$$  but approaching it from this side, I again don't know how to continue from here, as I don't think I could just "pull in" $\Phi$ into the individual summands? Is there something about the commutator that I'm misunderstanding or forgetting? It seems like an easy thing to show yet I'm a bit lost here.


I'm creating a new VPN service, to enable players of the Crysis 1, Crysis Wars, and Crysis 2 games to continue playing after the online multiplayer is shut down at the end of this month.  The purpose of this VPN service is to provide a private LAN, where players can connect to the VPN and view the LAN server list to connect to servers (servers obviously have to be connected to the VPN also).  This is where the problem lies; I only want the VPN server to support this server network, and not allow people access to the internet. This is because if they download torrents, watch video, etc, it will make the VPN server slow. Obviously I can just block all access to the web, but unfortunately most players like to browse the internet, play music on YouTube, etc, while playing.  Is it possible on Windows to only allow the games and servers to use the VPN, while forcing users to bypass the VPN for other internet communication? Is there some Windows Firewall rule that can be applied to create this behaviour? I only want the gameservers and games to use the VPN server.  If this isn't possible, is it possible programmatically? C++ and Lua can only be used for this.  The VPN is on Linux.

I have access to a VPN and want to use it only for some applications, not all.  For example: If I connect to a VPN I want only the applications Opera and Newsbin to use that VPN connection. All other applications, like f.e. Outlook, should use the normal internet connection (while the VPN is connected/open).  Afaik this isn't possible, but I'm not totally sure. So therefore my question: is it doable?


I want to custom name items with anvils and commands, but have the names not be in italic.

I came across a map and when I was playing I found some coloured and bolded item names. I thought it isn't possible as at most you can only use the custom name tag to rename things! Is there a way to colour and bold item names in vanilla Minecraft? External programs are OK. Oh, and the wiki page of formatting codes doesn't really do much.


I've heard that it is possible to present a bijection $\phi : \mathbb{R}^n \to \mathbb{R}^m$ due to Cantor that although not continuous show that those sets have the same cardinality independent of the dimension as a vector space. The problem is that I couldn't find about it anywhere. Can someone tell me where I can find about this bijection and how to show it's existance?  Thanks very much in advance!

Could any one give an example of a bijective map from $\mathbb{R}^3\rightarrow \mathbb{R}$?  Thank you.


I am a Linux guy and as such I am very lost when I try and do anything is Windows. I am trying to create the following link:  mklink /d C:\backup\data \\myth\backup\data   But I do not have sufficient privilege to preform this operation. How do I get sufficient privileges in Windows 7?  UPDATE:  Right clicked on C:\backup\data and changed the permissions to full access for authenticated user, restarted the machine and tried the command again with no luck. Anyone have any further suggestions?

How can I grant a particular user the permission to create symlinks in Windows 7?  I've searched through "Group Policy" and Google, but haven't found anything.  On a side note, is there a way to search through everything in Group Policy Editor? The filters only seem to work on particular subtrees. I never actually found anything using the filters.


I want to write a SELECT statement that returns value but excludes any that appear in a text list  So I have a text list COL1, COl2, COL4, COL5 (called myString)  And I want to say...  SELECT COLUMN_NAME  FROM INFORMATION_SCHEMA.COLUMNS  WHERE TABLE_NAME = 'INTERFACE' AND COLUMN_NAME NOT IN(myString);   How would I do that?  I am trying to solve this problem in a stored procedure and though that just getting back to basics would help me understand. My SP code looks like this...  INSERT INTO @excludeFieldTable VALUES ('CASENO'),('INTLINENO'),('INTMEMBNO'),('INTSTATUS'),('RECTYPE'),('EFFDTE'),('INTERR'),('INTERR2'), ('INTWARN'),('AUTHORISED'),('EXCLUDE'),('UPDATED'),('INTMEMBNO2'),('INTSTATUS2'),('ALTKEY');      INSERT INTO @intColumnList SELECT DISTINCT(COLUMN_NAME) FROM INFORMATION_SCHEMA.COLUMNS WHERE TABLE_NAME='INTERFACE' AND COLUMN_NAME NOT IN (SELECT DISTINCT(excludeFieldName) FROM @excludeFieldTable);   but the NOT IN against the @excludeFieldTable is not evaluating for some reason (so intColumnList still has the values 'CASENO', 'INTLINENO' etc)

How do I parameterize a query containing an IN clause with a variable number of arguments, like this one?  SELECT * FROM Tags  WHERE Name IN ('ruby','rails','scruffy','rubyonrails') ORDER BY Count DESC   In this query, the number of arguments could be anywhere from 1 to 5.  I would prefer not to use a dedicated stored procedure for this (or XML), but if there is some elegant way specific to , I am open to that.


I'm trying to hook up a projector that only has an VGA input to my laptop that has only an HDMI output. I would like to avoid spending extra money on a HDMI to VGA converter box, is it possible to do the same with these two converters chained:  and ? Will that work?  I am trying to establish if this particular scenario (two converters chained) would work, the that this is marked of duplicate doesn't discuss this.

I just bought a new HP Pavilion dv7t Quad Edition laptop that has HDMI out. I already have a couple of monitors that are VGA and I'd like to hook up one of these to dual monitors.  I've read some sketchy reviews of products that try to convert directly from HDMI (digital) to  VGA (analog), so I was wondering if someone has a good recommendation on how to hook these two together.


I tried searching searching but couldn't come across any. Many thanks in advance.

The code   \documentclass{article}  \usepackage{fontspec}  \usepackage{wasysym} \begin{document} \textrecipe \end{document}    works properly generating unicode character (U+211E) But when I add \setmainfont{Sanskrit 2003} downloaded from here  , it fails to generate the unicode character. This may be related to availability of symbol in font or for some other reason, but I need to retain both the symbol and font in the document. Kindly help.   \documentclass{article}  \usepackage{fontspec}  \usepackage{wasysym} \setmainfont{Sanskrit 2003} \begin{document}     \textrecipe \end{document}


W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/saucy/Release  Unable to find expected entry 'main/binary-1386/Packages' in Release file (Wrong sources.list entry or malformed file)  I think need to edit this from  main/binary-1386/Packages to main/binary-i386/Packages.  I'm new to Ubuntu so could someone give me a step by step guide to finding and altering this entry?

How can I fix this? I can't update anything at all.   I've tried to switch to my best server in the options.  When I do sudo apt-get update, this is what I get:     W: Failed to fetch     Unable to find   expected entry 'universe/binary-1386/Packages' in Release file (Wrong   sources.list entry or malformed file) E: Some index files failed to   download. They have been ignored, or old ones used instead.*   When I do sudo apt-get upgrade, I get this:     Reading package lists... Done      Building dependency tree             Reading state information... Done      0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   the contents of my source.list:     deb  quantal universe restricted main   ....update: when I update, it looks for 'universe/binary-1386/Packages'  however, if I go to: ubuntu.mirror.rafal.ca/ubuntu/dists/quantal/Release with Google Chrome, I see that the file is actually named "universe/binary-i386/Packages" (it's with an i, not a 1) . how can I fix this and make it expect the proper package?


I know that $a \neq b$, then $\frac{a}{b}+\frac{b}{a}$ would not equal to $m$ (an integer) so I set them into one that wasn't a fraction by squaring. So I got $\frac{a^2+b^2}{ab}$. How can I show that $a^2+b^2$ is not divisible by $ab$?

Some observations I made is for $\frac{a}{b}+\frac{b}{a}$, is either:   the denominator has to be one, the numerator has to be a multiple of the denominator or  the numerator and denominator have to be the same.    Obviously, with the given conditions case 3 is eliminated since  $a \neq b$.  For case 1, if $b=1$, then $a=1$ which is a contradiction to the given condition that says $a \neq b$.  For case 2, I would think of examples. For example if $b=2$ then a multiple is $4$, so $a=4$. Then we have:  $$\frac{a}{b}+\frac{b}{a}=\frac{4}{2}+\frac{2}{4}=\frac{10}{4}$$  which is not an integer, but how would i proceed to show this case for all integers.


I have the following list: item = [['01jan.jpg', 'Cluny', 'Tres Riches Heures', 'January'],         ['02feb.jpg', 'Cluny', 'Tres Riches Heures', 'February']]  and want to extract the first entry and change the .jpg to .png: x = item[0][0]    print(x)  # gives '01jan.jpg' y = slice(x[:-4]) print(y)  # gives 'slice(None, '01jan', None)'  and I can't get the middle term out because slice object is not iterable. How do I get '01jan' as a variable?  Other items have varying names but all have the same .jpg so I want to slice off the back of the first item.

Is there a function to extract the extension from a filename?


I need to read first line of a file and match it with a text. If the text matches, I need to do certain operation.  Problem is if command is unable to compare the variable with the string.  file_content=$(head -1 ${file_name}) echo $file_content if [[ $file_content = 'No new data' ]]; then     echo "Should come here" fi echo $file_content if [ "${file_content}" = "No new data" ]; then   echo "Should come here" fi   The if block is not working. I think the value that I am capturing in line 1 has some issues.

Everybody knows :-) that in Windows plain text files lines are terminated with CR+LF, and in Unix&Linux - with LF only. How can I quickly convert all my source code files from one format to another and back?


For an assignment, I was asked to make a simple addition calculator in Python using a loop, so I made a program that usually works, but when I add some floats, the total is off just by a little. Here is my program:  number = 0 total = float(input('Enter positive numbers you want to add, or enter a\ \nnegative number to calculate the sum:\n\t')) while number >= 0:     total += number     number = float(input('+\t')) if number < 0:     print('=\t', format(total, ','), sep='')   An example of an incorrect output is when 0.1+0.2+0.3 is input, the output is 0.6000000000000001. Does anyone know what's causing this very small difference?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I was try to plot the Poisson distribution as a discrete graph and only found continuous graph examples like this:    Formula is:  &space;0" target="blank">&space;0" title="P{\lambda}(k) = \frac{\lambda^k}{k!}e^{-\lambda} \quad for \quad k \in \mathbb{N}_0,\quad \lambda > 0" />  How can I plot the discrete graph?

I am new to 'drawing' in LaTeX with pgfplots, tikz, etc. I am trying to plot a Poisson distribution with varying means. Here is what I have tried (based on )  \documentclass{article} \usepackage{pgfplots} \pgfmathdeclarefunction{poiss}{1}{%   \pgfmathparse{(#1^x)*exp(-#1)/(x!)}% } \begin{document} \begin{figure} \begin{tikzpicture} \begin{axis}[every axis plot post/.append style={   mark=none,domain=0:20,samples=20},   axis x line*=bottom,   axis y line*=left,   enlargelimits=upper]   \addplot {poiss(1)};   \addplot {poiss(2)};   \addplot {poiss(3)}; \end{axis} \end{tikzpicture} \end{figure} \end{document}   What happens next is very strange to me; if I plot this with domain=0:20,samples=20, it looks like the following:    However, if I change domain=0:10,samples=10, it looks like the following:    You can see that the higher mean distributions are 'taller' than they should be, depending on the number of samples; the larger the number samples, the more correct the distributions look but obviously a graph going from 0 to 50 on the x-axis with nothing interesting after 10 is no good!  I'm wondering why is this happening, and how can I fix it? Forgive me if it's something painfully obvious. Thanks.


I would like to create a String.replaceAll() method in JavaScript and I'm thinking that using a regex would be most terse way to do it.  However, I can't figure out how to pass a variable in to a regex.  I can do this already which will replace all the instances of "B" with "A".  "ABABAB".replace(/B/g, "A");   But I want to do something like this:  String.prototype.replaceAll = function(replaceThis, withThis) {     this.replace(/replaceThis/g, withThis); };   But obviously this will only replace the text "replaceThis"...so how do I pass this variable in to my regex string?


I know if $\ i\ $  of the following form $\ 3x^2 + (6y-3)x - y\ $ or $\ 3x^2 + (6y-3)x + y - 1, \ \ x,y \in \mathbb{Z}^{+},i \in \mathbb Z_{\ge 0}$,  then $\ 12i + 5\ $ must be composite number, because:  $12(3x^2 + (6y-3)x + y - 1) + 5 = 36x^2 + (72y - 36)x + (12y - 7) = (6x + 12y - 7)(6x  + 1)$  How come if $\ i\ $ not of the following form $\ 3x^2 + (6y-3)x - y\ $ and $\ 3x^2 + (6y-3)x + y - 1\ $,  then $12i + 5$ must be prime? $\ x,y \in \mathbb{Z}^{+},i \in \mathbb Z_{\ge 0}$.  For example: $\ 5 = \ 3*1^2 + (6*1-3)*1 - 1\ $ ,when $\ x = y = 1\ $, as proved before,$\ 5*12+5\ $ must be composite number;  $\ 0, \ 1. \ 2.\ 3.\ 4\ $ can't of the following form $\ 3x^2 + (6y-3)x - y\ $ and $\ 3x^2 + (6y-3)x + y - 1\ $,  $\ 12*0 + 5 = 5\ $, $\ 5 $ is prime,$\ 12*1 + 5 = 17\ $, $\ 17 $ is prime, and so on, sure this is true and there's a long proof, but too long to see.


I have iPhone with a SIM card and a phone number. I would like to activate iMessages, but only for my Apple ID's e-mail address, and not phone numbebr. Is it possible to do this?

I'd like to remove my phone number from my iMessage account, but still have my phone enabled to receive messages sent to my email address (also used on iPad, Mac). Is there a way of doing this?


I am looking to replace Windows 7 with Ubuntu 14.04 but my system configuration is: Processor: Intel(R) Atom(TM) CPU N550 @ 1.50GHz Installed Memory(RAM): 2.00 GB System type: 32-Bit Operating System  please recommend me how will I get Ubuntu 14.04 in my system Can you point to a site that can guide through the process

I would like to see a full how-to guide on how to install Ubuntu.


I am curious about why we pronounce "know" as though it rhymes with "go", but "now" is pronounced as though it rhymes with "cow".  My first thought was that somehow a "k" before an "n" modified the vowel, but "knight" and "night" rhyme.  Are the origins of these two words completely different causing the difference in pronunciation?

Why is it that the "ow" in now makes the /aʊ/ sound while "ow" in snow makes the /oʊ/ sound? Has this always been, was it spelled differently and then changed, or was it spelled this way but the sound changed?


Every highway's entrance or exit is causing traffic problem.    As you can see, there is a small road that immediately goes in the large road.  What is the best way(s) to deal with traffic in a highway's entrance/exit? Is there something I'm doing wrong with the highway on the picture?

Initial note: Having read , the answers there do not help in this specific situation, as they rely on having lots space to spare - I have very little.  When I started my city, I designed a simple exit from the default highway that I thought was sustainable: I left enough space around it to upgrade the road as I needed to, which has worked up until now. However, I am now stuck with a six-lane one-way exit from the highway that isn't getting used: since cars seem to pick the most efficient lane to get where they want to go, regardless of traffic, the rightmost lane fills up, then spills over onto the highway. This blocks the highway, my bus routes, and more importantly my planned emergency routes.  My setup looks like this:    The red arrows show road direction, and the orange line is the traffic backed up. Note that in this image, I have replaced the six-lane one-way exit with a highway exit, as this is just about as efficient...  This situation is getting to be pretty bad, and is bringing half my city to a standstill. Its effects compound themselves further down the highway:    In this image, the orange line is the traffic directly caused by this exit not working. This traffic jam then blocks two exits/entrances further down, on the red crosses; the yellow line shows the traffic jam caused by these being blocked. In other words, my inefficient exit design is now blocking itself from moving.  So this is a two part problem.   Considering that I'm constructing a residential district in the space above left of the problem exit, and would like to keep the solution inside the power line, how can I redesign this exit to be more efficient? How do I solve the ring of traffic jams? Is it a simple case of just deleting and replacing a bit of road?


I connect to the internet through a VPN service. Is there anything I can do to not receive this? I'm not doing anything suspicious and the first Google search I do yields this. I trust Google enough that I don't mind them knowing my identity but I know of no way to exempt certain websites from VPN. The next time this happens (which isn't always) I'll try logging into my Google account.

So, I'm getting the occasional CAPTCHA message, which is irritating but fine, but occasionally Google just blocks my network wholesale. I've submitted automated requests to unblock it, but I have no idea who I can email directly to clarify the issue.  I've run all manner of anti-virus, parsed my router's logs, combed through Fiddler to see if any errant packets were slipping by. Nothing. The only Google searches that happen are made by me through the web-browser.  Who or what do I have to do to get Google to stop falsely flagging my network as a spam-bot?


I wrote some algorithms using pseudocode, but when compiling the document, each algorithm ends with =0 (at line\end{algorithmic}). What I have to do to avoid this problem?

Can you suggest me what is wrong with using return command in algorithms. when I add  \RETURN $C   to my LaTeX document I get   return C =0,   what I need is just return C.  \begin{algorithm}                      % enter the algorithm environment   \caption{ lloyd's kmeans}         \label{alg1}                             \begin{algorithmic}[1]                    % enter the algorithmienvironment     \RETURN{$C$}   \end{algorithmic} \end{algorithm}   I get two extra characters =0. I wonder where its coming from. if it helps,there is  "Missing number, treated as zero",and  Missing = inserted for \ifnum. in the error log generated


From the post , I can see comment/answer that we can only see the flags in our own profile and not others. Also it is available in our profile section. The reason why i am asking is because, going through the badges section, I can see 3 moderation badges:         Where can I see the list of flags that I cast and how useful they were? Please note that I am not talking about upvotes/downvotes. Update : As per @Servy's comments i can see a detailed list through the flag-summary link. But it still doesnt show actually a simple count like :  Total Flags : 100 Helpful Flags : 50 Non-Helpful : 50  Hope i am more clear..

The  (click on your number of helpful flags in your profile) is cool, however some posts have a gray background, some don't. What does it mean?  example:


I rather like xscreensaver. It allows me configure its gltext module as a clock, which also displays a current date.   I wondered If I could install it onto Ubuntu MATE 64-bit without breaking anything in my system. When I tried to uninstall my default screensaver I got a message stating that mate-desktop would be removed as well.

I once advised someone to remove a package that depends on ubuntu-desktop meta-package, if she didn't need it (EG: if one uses a different editor than gedit). Someone else said that doing so (removing gedit which will in turn remove ubuntu-desktop) could break things. Is this true? Are there any other potential problems?


I'm a regular on your site and learning English. I read the newspaper on a regular basis. Today I have come across this underlined sentence in the newspaper, it  sounds bit  odd to me.  "IN NO REALM OF LIFE HAS THE COVID 19 PANDEMIC WREAKED AS MUCH VISIBLE UPHEAVAL AS EDUCATION"  Here "HAS" is not immediately followed by "WREAKED". I suppose it's an example of "inversion". Is that right?

Possible Duplicate:             In the following, why does subject-verb inversion occur? Is it necessary? And what is this type of inversion called?   Colleague’s original:     Only in cases where A is B, the Company shall do X.   I changed to the following:     Only in cases where A is B shall the Company do X.    Searching Google for “shall the Company” gives examples such as:     In no event shall the Company ...   Under no circumstances shall the Company ...    And these all seem quite natural.   “In no event” and “under no circumstances” seem to be prepositional phrases, yet I would say simply, with no inversion:     In the fridge, you will find some beer.    Is the S-V inversion maybe some sort of archaic style that remains in legal or maybe religious texts? Perhaps a remaining German-style syntax?


I am using raring and just noticed that I can't install packages any more (404). I checked a couple repositories and raring is not there. Turns out it's been EOL'd, at barely 10 months old, it seems a bit harsh.  Is there some way I can avoid an entire reinstall? I really don't want to go through the whole thing of setting up the desktop again, etc. It doesn't matter if the repository isn't being maintained any more, I just want to grab a couple packages. Can I do a dist-upgrade without a ton of stuff breaking?  I just switched over from Debian six months ago, and I am pretty shocked that they expect me to upgrade. Why do some version have no scheduled EOL date? (Ref )  To the person that closed this post, this question is time relevant and an answer that is more than 3 years old doesn't necessarily help. Both the articles linked in that post are 404 or way out of date.

Where can I get the old repositories for Ubuntu versions? In my case, it's 9.04 Jaunty?   I found all the official repositories and their mirrors have been removed. I am wondering where I can get the repository list for this version?


I'm working on a project that requires me to write partial borders around individual symbols, like this:  I haven't been able to find any conclusive answers to how to do it, so I figured I'd ask.

I am trying to draw a partial box around one or more words within a paragraph--that is, a rectangle with one or more sides missing. I have read the documentation for the fancybox package and it doesn't seem to be able to do what I want. I was able to produce thus ugly hack:    That's just a vertical bar | followed by a word with \overline and \uline. The trick is to connect the vertical and horizontal lines so that you have a rectangle missing just one side.  Is there an easy, general way to do this, perhaps with Tikz? I don't know enough about that package to be able to do this myself, but I'm wondering if there might be other solutions too.


I am using Ubuntu 18.04 with Gnome on Wayland. Today I needed to ad a folder to my Home directory and I couldn't find a simple way to do it in Nautilus. Eventually I remembered the "Control + Shift + N" option and that worked.   What has happened to the GUI options for this everyday task?  Edit: I found the answer. The "Add folder" option is now an icon, in the top left of the pull down menu.

It is a question of Nautilus file manager of Ubuntu 18.04. Is there a simple way to create a Folder when file list is full of items?


I am writing a thesis and this is what I have in my title:  \title{ {Trading Strategies Performance and Risk Evaluation Methodologies Investigation} \\         {\large Institution} \\         {\includegraphics[scale=0.3]{inst_logo.jpg}} \\         {\medium Supervisor: Prof Someone} \\         \hfill \break         \hfill \break         \hfill \break         {\small A dissertation submitted in partial fulfillment of the requirements for the degree of}         }   Now, the \hfill \break does work but I get errors in my latex file. Is there a better way to create an empty line?

The standard titlepage is quite simple. I am looking for a very  and need help customizing my title page.  It should match the  classicthesis doctoral thesis template  Below a minimal working example:   \documentclass[12pt,a4paper,footinclude=true,twoside,headinclude=true]{scrbook} \XeTeXinputencoding iso-8859-1 \usepackage[marginparsep=8pt,left=3.5cm,right=3.5cm,top=3cm,bottom=3cm]{geometry}  \usepackage[parts,pdfspacing,dottedtoc]{classicthesis}    \frontmatter  \begin{document}     \pagestyle{scrheadings}        %this is the place to set up my cover sheet.       %*******************************************************      % Abstract     %*******************************************************    %\renewcommand{\abstractname}{Abstract}    \pdfbookmark[1]{Résumé}{Résumé}   \begingroup    \let\clearpage\relax    \let\cleardoublepage\relax    \let\cleardoublepage\relax       \chapter{Résumé}     Résumé de la thèse en français\dots      \vfill      \chapter*{Summary}   Résumé de la thèse en anglais\dots    \endgroup             \vfill     \end{document}


I've been trying to rig a fox-shaped mesh in Blender for quite some time now and keep on failing to move legs independently. Although i carfully weight-painted the mesh after using with automatic weigthpaint, moving one leg always leads to movement of vertices that are not at all weigthpainted. I would be so grateful for any piece of advice!    A couple of Vertices is moving back and forth in accordance with the pposite leg without beening weight-painted. Espacially those in the red circle. I have been looking at it in vertex selection masking as well and i'm sure there's no accidental weight on the right legt      Thanks for looking into this in Advance!!

I have made a simple character model and am adding a skeleton to it, so i can use it as reference and so i can get a feel for how rigging and weight painting are.  The white box (Shoulder_L) has weight and is the one linked to the bone that's within it, however for some reason some vertices in the right arm move when i pose the shoulder, despite not having any weight.   (The area within the circle is where the vertex that moves is located)  Blend File


I keep seeing 18% gray color backgrounds being used in different areas of photography. What's special about it, why 18% and not 17 or 19?

I have heard about 18% gray tone — what is it really, and why 18% (and not 20% or some other value), and how can I make it in Photoshop?


In /etc/sudoers, there is always:  root    ALL=(ALL:ALL) ALL   However, the root user (with UID 0) doesn't need to enter password when they run sudo command.  For other users, a password is required unless their entry contains NOPASSWD or a previous authentication hasn't timed out:  user    ALL=(ALL:ALL) NOPASSWD:ALL                       ^^^^^^^^

My /etc/sudoershas content:  Defaults        env_reset Defaults        mail_badpass Defaults        secure_path="/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/snap/bin"  # Host alias specification  # User alias specification  # Cmnd alias specification  # User privilege specification root    ALL=(ALL:ALL) ALL  # Members of the admin group may gain root privileges %admin ALL=(ALL) ALL  # Allow members of group sudo to execute any command %sudo   ALL=(ALL:ALL) ALL  # See sudoers(5) for more information on "#include" directives:  #includedir /etc/sudoers.d   There is no rule above specifying NOPASSWD. I was wondering  why user root seem to be able to execute any command as any user without providing password?  Thanks.


Given a Banach space: $E$ and chosen a Hamel basis: $\mathcal{B}$  Any vector induces a (noncanonical) algebraic linear functional by: $$\delta:E\to E^*:\delta_b(b'):=\delta_{b,b'}\text{ defined linearly and extended linearly}$$ How to show that the induced linear functionals are continuous iff the Banach spaces is finite dimensional?

If $X$ is a vector space over $\mathbb R$ and $B=\{x_i; i\in I\}$ is a Hamel basis for $X$, then for each $i\in I$ we have a linear functional $a_i(x)$ which assigns to $x$ the $i$-th  coordinate, i.e., the functions $a_i$ are uniquely determined by the conditions that $$x=\sum_{i\in I} a_i(x)x_i,$$ where only finitely many summands are non-zero.  If $X$ is a Banach space, then at most finitely many of them can be continuous.  I have learned the following argument from comments in .     Suppose that $\{b_i; i\in\mathbb N\}$ is an infinite subset of $B$ such that each $f_{b_i}$ is continuous. W.l.o.g. we may assume that $\lVert{b_i}\rVert=1$.      Let   $$y:=\sum_{i=1}^\infty \frac1{2^i}b_i.$$   (Since $X$ is complete, the above sum converges.)      We also denote $y_n:=\sum_{i=1}^n \frac1{2^i}b_i$. Since $y_n$ converges to $y$, we have $f_{b_k}(y)=\lim\limits_{n\to\infty} f_{b_k}(y_n)=\frac1{2^k}$ for each $k\in\mathbb N$. Thus the point $x$ has infinitely many non-zero coordinates, which contradicts the definition of Hamel basis.   I have stumbled upon  in the book Christopher Heil: A Basis Theory Primer. Springer, New York, 2011. In this exercise we are working in an infinite-dimensional space $X$. Basically the same notation as I mentioned above is introduced, $a_i$'s are called coefficient functionals and then it goes as follows:     (a) Show by example that it is possible for some particular functional $a_i$ to be continuous.      (b) Show that $a_i(x_j) = \delta_{ij}$ for $i,j\in I$.      (c) Let $J = \{i\in I : a_i \text{ is continuous}\}$. Show that $\sup \{j\in J; \lVert a_j \rVert<+\infty\}$      (d) Show that at most finitely many functionals $a_i$ can be continuous, i.e., $J$ is finite.      (e) Give an example of an infinite-dimensional normed linear space that has a Hamel basis $\{x_i; i\in I\}$ such that each of the associated coefficient functionals $a_i$ for $i\in I$ is continuous.   The part (c) can be shown easily using  (a.k.a. Uniform boundedness principle). But I guess that the author of the book has in mind a different proof for part (d) from what I sketched above, since (c) is an easy consequence of (d) -- so he would probably not be put the exercises in this order. (But maybe I was just trying to read to much between the lines.)  Question: I was not able to find a proof od (d) which uses (c). Do you have some idea how to do this?  NOTE: My question is not about the parts (a), (b), (e). I've included them just for the sake of the completeness, in order to include sufficient context for the question.


I am trying to write a love message at the end. I tried \hfill\mbox thing but could not get them working as intended, see below and . It requires somehow making background images that go over the document. I would also love to make it so that the last page number is missing to make it more rebellious.  How can I make a love message at the end of document with all references?  In way it would be super awesome if there were beautiful Teddy bears looking here and there over the document, is it possible? Like over marginals randomly over the document?   You can find the Teddy . Goal    So far

I would like to put a small graphic in the bottom right corner of a the title page of an article. Is there a way to specify a precise location for a graphic on a page (that has text on it)?   I've tried doing it with a \parbox but haven't been able to so far.


I'm following a recipe for a roast beef tenderloin with caramelized onion and mushroom stuffing from "The Best of America's Test Kitchen" (2008) cookbook. After butterflying the roast, stuffing and rolling it, and then tying it off, I'm told to:  Stir together 1 tablespoon of oil, 1.5 teaspoons kosher salt, and 1.5 teaspoons pepper in a small bowl. Rub the roast with the oil mixture and let stand at room temperature for 1 hour.  (emphasis mine. Full recipe here: , ) Though I can't find a link at the moment, I remember reading that the USDA advised against leaving meats in "danger zone" temperatures (like room temp). Is this safe to do?

If I left food out of the refrigerator for some period of time, is it still safe? If I left it out too long, can I salvage it by cooking it more?


This is the equation:  \begin{equation} U^*=\arg \underset{U}{\max } \sum _{m=1}^M  \omega _m \left[\ln \left(P_{\Lambda _m} (X(U,m)|C)\right)- \omega _{\text{KLD}} D_{\Lambda_m}\left(C(U),C\right)\right] \end{equation}   I try to use split but it has error:  \begin{equation} \begin{split} U^*=\arg \underset{U}{\max } \sum _{m=1}^M  & \omega _m \left[\ln \left(P_{\Lambda _m} (X(U,m)|C)\right)- \\  &\quad \omega _{\text{KLD}} D_{\Lambda_m}\left(C(U),C\right)\right] \end{split} \end{equation}     I follow , but it seems not work for me.  How to make it effect?

I am having the following equation:  \begin{equation}   Q(\lambda,\hat{\lambda}) = -\frac{1}{2} P(O \mid \lambda ) \sum_s \sum_m \sum_t \gamma_m^{(s)} (t) \left( n \log(2 \pi ) + \log \left| C_m^{(s)} \right| + \left( \mathbf{o}_t - \hat{\mu}_m^{(s)} \right) ^T C_m^{(s)-1} \left(\mathbf{o}_t - \hat{\mu}_m^{(s)}\right) \right) \end{equation}   which does not very well fit on one line. How can I split this over two lines? What I have in mind is that I specify the splitting place, and that the first line is left aligned and the second line right aligned to make clear that it is still the same equation.  The linebreak \\ does not work.


If I cast Haunt on an enemy and it's ticking along, and then later cast Piranhas on the same enemy (which gives a 15% damage bonus against affected enemies), will Haunt do more damage for the duration of the Piranhas, or does Haunt have to be re-cast to gain the effects of the new damage buff?

I'm playing Witch Doctor and making use of several of the wonderful Intelligence boosts they can get (Gruesome Feast, Soul Harvest...). I need to know when to time these boosts, however, to get the best use of them. So, how does gaining Intelligence affect the following?   A Grasp of the Dead in play Corpse Spiders already thrown Monsters already taking damage from Locust Swarm or Haunt and lastly, minions in play, like Gargantuan   This question could be used in general for other classes as well, I just used Witch Doctor as an example.


Well, as I have read, a massive body can cause light to bend around itself due to its gravitational attraction. What I don't understand is how, as the  is $$F = \frac{Gm_1m_2}{r^2}.$$ As photons do not have (rest) mass, shouldn't there be no attraction between light and the celestial bodies, and therefore no bending? Surely I am missing a key point. Please point out my logical flaw?

I've heard that light can form a curve if they travel near high-mass stars or even a black hole with strong gravity. Which is according to this   $$\large F_{g}=\dfrac{Gm_1m_2}{r^2}.$$  But I've also heard that photons do not have (rest) mass! So it doesn't fit that equation anymore! But why can photons be pulled by gravities without (rest) mass? Could someone explain that?


Can you see the problem in my code? I get this exception:  java.lang.NullPointerException:   Attempt to invoke virtual method 'void android.support.v7.widget.RecyclerView.setLayoutManager(android.support.v7.widget.RecyclerView$LayoutManager)' on a null object reference   With this code:   RecyclerView recyclerView; RecyclerView.Adapter adapter;  @Nullable @Override public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {     View view = inflater.inflate(R.layout.latest_events_fragment, container, false);      recyclerView = (RecyclerView)view.findViewById(R.id.events_recycler);     LinearLayoutManager linearLayoutManager = new LinearLayoutManager(getActivity());     recyclerView.setLayoutManager(linearLayoutManager );     list.add("A");     list.add("B");     list.add("C");;     // specify an adapter     adapter = new EventsRecyclerAdapter(list);     recyclerView.setAdapter(adapter);       return view; }   here is my .xml file it's called events_list.xml `   `

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I recently got a fingerprint reader for my Windows machine and I absolutely love it. I was on Amazon and did not see any fingerprint readers for Mac’s. Can anyone recommend an aftermarket fingerprint reader for a MacBook Pro?

I would like to use an external keyboard, mouse, monitor, etc and have my MacBook closed. The only issue is that I can no longer access the fingerprint scanner. Is there a way to use an external one? FYI, I have installed  which is very useful but doesn't cover all cases where a fingerprint can be used.  Yes, I read the similar question but thought this one was different since that one referenced a 10-yr old Macbook that didn't have the Touchbar. And there are ways to solve the problem in that question.


I am modelling no. days exercised in a given week and so therefore I am using a binomial GLM. Yet the model is massively overdispersed (even as quasibinomial). When I model as poisson distributed however, the overdispersion is removed. What's more, my p value for the most significant predictor (wake-up time) is pretty much the same (0.08) when its binomial and poisson and the effect sizes are pretty similar (although I know that GLM p values etc. are just approximations). Is the overdispersion when binomial a sign that I should model using a poisson distribution?

Top is Poisson, bottom is Binomial Source of variation is different people observed over a week long period. 118 people to be exact.  want to make predictions about the proportion of days/week one exercises if they wake up at a given time.  > summary(FMR7)  Call: glm(formula = No.Days.Ex ~ WaketimeStand, family = poisson, data = PSD)  Deviance Residuals:       Min        1Q    Median        3Q       Max   -2.99043  -0.64677  -0.03492   0.67393   1.51943    Coefficients:               Estimate Std. Error z value Pr(>|z|)     (Intercept)    1.36991    0.04689  29.218   <2e-16 *** WaketimeStand -0.08309    0.04806  -1.729   0.0839 .   --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for poisson family taken to be 1)      Null deviance: 124.55  on 115  degrees of freedom Residual deviance: 121.51  on 114  degrees of freedom AIC: 479.71  Number of Fisher Scoring iterations: 4  > summary(FMR6)  Call: glm(formula = cbind(No.Days.Ex, No.Days.NotEx) ~ WaketimeStand,      family = quasibinomial(link = logit), data = PSD)  Deviance Residuals:      Min       1Q   Median       3Q      Max   -3.7483  -0.9585  -0.0625   1.0428   2.9739    Coefficients:               Estimate Std. Error t value Pr(>|t|)   (Intercept)     0.2595     0.1009   2.571   0.0114 * WaketimeStand  -0.1869     0.1020  -1.832   0.0695 . --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for quasibinomial family taken to be 2.015388)      Null deviance: 288.42  on 115  degrees of freedom Residual deviance: 281.57  on 114  degrees of freedom AIC: NA  Number of Fisher Scoring iterations: 4  Quite clear that there is much more overdispersion on the quasibinomial than the poisson. The response variable is no.days exercise per week and so my original thought was to analyse with binomial GLM as it is the proportion of days in a week someone exercises. However, when modelled with a Poisson GLM it is much less overdispersed. Is this a sign I am using the wrong distribution.


Here's my latex project on Overleaf.com and errors and logs:  I created a .cls by loading the class file  \LoadClass[12pt, a4paper]{book}   And then I add some packages essential  \RequirePackage[utf8]{inputenc} \RequirePackage[minted,skins,breakable,listings,many]{tcolorbox} \RequirePackage{xcolor} \RequirePackage[left=2cm,right=2cm,top=2cm,bottom=2cm]{geometry}   Use \newtcblisting to create new tcoloredbox of code:  \newtcblisting{codecsharp}[1][]{   title=This is source code in another language (C\#),   colframe=yellow!50!black,   width=\linewidth,   enhanced,   breakable,   boxrule=0.4pt,   colback=light-gray,   listing only,   listing engine=minted,   minted language=csharp,   after={\par\vspace{\baselineskip}\noindent} }   Then, I use the .cls in .tex and write this code in document environment:  \begin{codecsharp} using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks;  namespace CSharpTutorials {     class Program     {         static void Main(string[] args)         {             string message = "Hello World!!";              Console.WriteLine(message);         }     } } \end{codecsharp}   But there's error occurs:    And the pdf file looks like:    By the way, the line 36 in the error log is  \end{codecsharp}   And it saids     Package minted Error: Missing Pygment out; \inputminted was   I know that sentence is not finished, grammatical speaking, but that is all.

The code it's not working on Overleaf when it comes to minted environment (or mint command) used in a file placed in a subdirectory. Note that the very same code works if placed in main directory. Tested on Chrome with LaTex,PdfLaTex,XeLaTex and LuaLaTex  You can test the example on  but for your convenience I can add a MWE:  \documentclass{article} \usepackage{minted}  \begin{document} test \begin{minted}{python} import numpy as np  def incmatrix(genl1,genl2):     m = len(genl1)  \end{minted}  \mint{html}|
Something here
|  \end{document}   This will produce only the line "test".  Please note that \inputminted works as a charm; I adopted this as a workaround but there are cases in which it is really a nuisance.  Obviously with non trivial projects it is almost impossible for me to keep every file in the same (overleaf) folder.  The log says:(twice, another almost identical is for \mint)  Package minted Error: Missing Pygments output; \inputminted was  probably given a file that does not exist--otherwise, you may need  the outputdir package option, or may be using an incompatible build tool, or may be using frozencache with a missing file.  See the minted package documentation for explanation. Type  H <return>  for immediate help.  ...                                                l.12 \end{minted}  This could be caused by using -output-directory or -aux-directory  without setting minted's outputdir, or by using a build tool that  changes paths in ways minted cannot detect,  or using frozencache with a missing file.


Let  $$f(x)= \begin{cases} e^{-1/x}\quad &\text{for } x>0 \\ 0\quad &\text{for } x\leq 0. \end{cases} $$  Show that $f$ is smooth and $f^{(n)}(0)$ = $0$ for all $n\in \mathbb{N}.$  My professor gave us a hint, which was to show that $f^{(n)}(x)$ = $P_n(1/x)e^{-1/x}$ for $x>0$, and some polynomial $P_n$. However, I've been trying to find the actual formula for the polynomial and can see the form it should take, but cannot figure out the polynomial itself. Is it necessary to actually define the polynomial, or just to prove that such a polynomial exists?  If the latter is the case, how would I go about proving this?

This is Spivak's Calculus on Manifolds ex. 2-25, he says     Define $f:\mathbb{R}\to \mathbb{R}$ by $f(x) =  \left\lbrace   \begin{array}{l}      e^{-x^{-2}} &\text{ if } x \neq 0\\      0 &\text{ otherwise } \\   \end{array}   \right.$. Show that $f$ is $C^{\infty}$ anf $f^{(i)}(0)=0\; \forall i$.   I haven't found a way to get a general solution. I only managed to prove:  $(1)$ $f$ is continuous at $0$.  This follows from $f(0)=0$ and $\lim_{x\to0} f(x)=\lim_{x\to 0}e^{-x^{-2}}=\lim_{x\to 0}\displaystyle\frac{1}{e^{1/x^2}}=0$ since $\displaystyle\frac{1}{x^2}\to+\infty$ if $x\to 0$ then $e^{1/x^2}\to+\infty$ if $x\to 0$, which means that $\displaystyle\frac{1}{e^{1/x^2}}\to 0$ if $x\to 0$ .  $(2)$$f'(0)=0$.  I got this by calculating the limit $f'(0)=\lim_{h\to 0}\displaystyle\frac{f(0+h)-f(0)}{h}=\lim_{h\to 0}\displaystyle\frac{f(h)}{h}=\lim_{h\to 0}\displaystyle\frac{e^{-h^{-2}}}{h}=\lim_{h\to 0}\displaystyle\frac{1/h}{e^{h^{-2}}}$.  The last one follows from L'Hôpital: $\lim_{h\to 0}\displaystyle\frac{\frac{d}{dh}(1/h)}{\frac{d}{dh}(e^{h^{-2}})}=\lim_{h\to 0}\displaystyle\frac{(-1/h^2)}{(e^{h^{-2}})(-2h^{-3})}=\lim_{h\to 0}\displaystyle\frac{h}{2e^{h^{-2}}}=\displaystyle\frac{1}{2}\left(\lim_{h\to 0}\displaystyle\frac{1}{e^{h^{-2}}}\right)\left(\lim_{h\to 0} h\right) = 0$.  $(3)$ $f''(0)=0$  I found that $\displaystyle\frac{df}{dx} =  \left\lbrace   \begin{array}{l}      2x^{-3}e^{-x^{-2}} &\text{ if } x \neq 0\\      0 &\text{ otherwise } \\   \end{array}   \right.$, then  I can get $f''(0)$ computing the limit $\lim_{h\to 0}\displaystyle\frac{f'(0+h)-f'(0)}{h} = \lim_{h\to 0}\displaystyle\frac{f'(h)}{h} = \lim_{h\to 0}\displaystyle\frac{2e^{-h^{-2}}}{h^4}= 2\lim_{h\to 0}\displaystyle\frac{1/h^4}{e^{h^{-2}}}=-2\lim_{h\to 0}\displaystyle\frac{-4h^{-5}}{-2h^{-3}e^{h^{-2}}}\\=4\lim_{h\to 0}\displaystyle\frac{1}{h^2e^{h^{-2}}}=4\lim_{h\to 0}\displaystyle\frac{h^{-2}}{e^{h^{-2}}})=-4\lim_{h\to 0}\displaystyle\frac{-2h^{-3}}{e^{h^{-2}}(-2h^{-3})}=-4\lim_{h\to 0}\displaystyle\frac{1}{e^{h^{-2}}}=0$, after using L'Hôpital twice.  But still I don't have a clue to prove that $f^{(i)}(0)=0$ for every $i$. One of the ideas I managed was to find a general form for $f^{(i)}$ but after I got $f'$ doesn't seem possible to do so considering that I would have to apply the product rule each time.


I understand that in PostgreSQL if there is a multi-column FK from table B to table A and one or more of the FK columns in table B are nullable then the FK is still considered as "honored" for the rows in B where the value of such columns is indeed NULL with no check for the presence of a corresponding row in table A (as primary key columns cannot be nullable):    However, is this PostgreSQL-specific or is it in the SQL standard? (experimenting with SQL Fiddle it seems that both MS SQL Server and MySQL behave in the same way).

I've noticed a MATCH SIMPLE and MATCH FULL, but I don't understand what they do. I see default is MATCH SIMPLE; but, how do the other MATCH clauses to the FOREIGN KEY constraint function?


I am very interested in Quantum Mechanics, and I want to start learning some of the mathematics behind it - the simplification first, of course. What kind of mathematical ideas do I need to know and understand to follow along (e.g. Calculus, etc...). I'm sure that there is a huge list, but what are the main ones?

I'm really interested in quantum physics and would like to learn more. However, I don't know where to start and in what order I should learn things. So, ideally I'm looking for some sort of roadmap of what to learn. What physics topics do I need to know to start learning about quantum mechanics? (In addition to the mathematical topics mentioned at )  My current knowledge is mostly popular science stuff, like tv shows on Discovery Science and National Geographic Channel. So I have a basic understanding of some basic principals. There's also a recent lecture from Brian Cox that I have watched which gave a bit more in-depth information.


I'm using a   I've converted the .tex file to a minimal example:  \documentclass[fleqn,10pt]{SelfArx}  \begin{document}  \subsection*{Results}  \end{document}   The file   When I compile the LaTeX code above, I get these errors:    How can I resolve this problem?

I'm trying to compile a document that only works with an up-to-date distribution, so I'd like to know: how do I update my distribution? Please provide screenshots where appropriate.  List of answers           To keep an eye on what’s going on at CTAN you may subscribe to the  or the RSS feed feed://www.mail-archive.com/ctan-ann@dante.de/maillist.xml


1.Let it be $a_n$ the number of bitstrings which contain 000 How would I prove that for $n\ge4$: $$a_n = a_{(n-1)} + a_{(n-2)} + a_{(n-3)} + 2^{n-3}$$

I have $F_n$ number of bitstrings that have $000$, How would I prove that for $n \ge 4$ , $a_n = a_{n-1} +a_{n-2}+a_{n-3}+ 2^{n-3}$?  Now there are many  ways to go about this but if I choose starting a $n-3$ bit string and append it with $000$ how would I show that?


Show the last 10 question that I had read, answered recently....  Comments no, because there's already the "notifier"...  There are times when I read the question, it looks interesting and I want to be notified if it was answered. Mark the question as favorite it's ok, but it's difficult to "reach" the tab favorite since it is in the users profile....  I don't know, something in the sidebar or in the "notifier", keeping me updated about the answers of a question, not just the comments....  Thanks  EDIT*** after @Arjan Comments...  In the sidebar show the last 10 questions viewed and in the box that appears in the top menu when you hover your name the activity of the last 10 questions I viewed.

On your user profile page there are six (6) tabs; stats, activity, reputation, favorites, prefs and accounts.  I would like to see in a new tab, maybe named 50 latest viewed questions, which would contain the 50 latest viewed questions.  This would help when I want to follow a question but don't want to bookmark it or add it to my favorites list.   Sometimes, or a few hours later, I can't even find it again. I think this would be good for when you're viewing questions at work and want to check it up at home but can't because it's not in the same browser history.


Suppose if I buy some game like Middle Earth Shadow of Mordor on Steam. Can I play the game on both Linux and Windows?

I want to buy Rome Total War 2 before it's released because it's currently 50% off.  However, at the screen, it only shows a Windows symbol for the OS.  If I buy it now, will it only be for Windows?  Or can I purchase the game once and use it on multiple operating systems?  Please provide a link that describes this policy.    Here is the  that it's coming to linux.  Does that help?


I need to extract the last line from a number of very large (several hundred megabyte) text files to get certain data.  Currently, I am using python to cycle through all the lines until the file is empty and then I process the last line returned, but I am certain there is a more efficient way to do this.    What is the best way to retrieve just the last line of a text file using python?

I'm writing a log file viewer for a web application and for that I want to paginate through the lines of the log file.  The items in the file are line based with the newest item at the bottom. So I need a tail() method that can read n lines from the bottom and support an offset.  This is hat I came up with: def tail(f, n, offset=0):     """Reads a n lines from f with an offset of offset lines."""     avg_line_length = 74     to_read = n + offset     while 1:         try:             f.seek(-(avg_line_length * to_read), 2)         except IOError:             # woops.  apparently file is smaller than what we want             # to step back, go to the beginning instead             f.seek(0)         pos = f.tell()         lines = f.read().splitlines()         if len(lines) >= to_read or pos == 0:             return lines[-to_read:offset and -offset or None]         avg_line_length *= 1.3  Is this a reasonable approach?  What is the recommended way to tail log files with offsets?


I'm having a problem passing parameters through \iftoggle to a \newcommand using \notblank inside; it's much easier to explain by showing a small example:  \documentclass{article} \usepackage{etoolbox}  \newcommand\mycommand[1]{   \notblank{#1}{Value: '#1'}{EMPTY OR BLANK} }  \begin{document}  \newtoggle{flag} \togglefalse{flag}  \begin{enumerate}   \item \mycommand{A}   \item \mycommand{}   \item \mycommand{ }   \item \mycommand{\iftoggle{flag}{X}{}}   \item \mycommand{\iftoggle{flag}{X}{ }} \end{enumerate}  \end{document}   This prints:    while I expected EMPTY OR BLANK string also for list items 4 and 5.  What's wrong with my approach?    EDIT:  It's already been answered in another , anyway here's a solution for this specific case.  We should change mycommand as follows:  \makeatletter \newcommand\mycommand[1]{   \protected@edef\@tmpa{#1}%   \expandafter\notblank\expandafter{\@tmpa}{Value: '#1'}{EMPTY OR BLANK} } \makeatother

I am trying to use the etoolbox \ifblank (and its cousin \notblank), but I want to expand any macros in its test statement.  For example:  \documentclass{article} \usepackage{etoolbox}  \begin{document}  \newtoggle{longformt} \newcommand{\longform}{\toggletrue{longformt}} \newcommand{\iflong}[2]{\iftoggle{longformt}{#1}{#2}}  \newcommand{\quoteifnotblank}[1]{%     \notblank{#1}{``#1''}{}% }  % Try commenting this line. \longform  This should be completely blank if the form is short: \quoteifnotblank{\iflong{Some long quoted text}{}}  \end{document}   The problem here is that \notblank sees its argument of \iflong{Some long quoted text}{} as a string, not as code to be expanded, so the quotes always appear.  How do I expand arguments before they are passed to \notblank?


one thing that make me confused is how the microcontroller notice the errors and restart by itself let me give an example we have cooler system with Esp 32 and temperature sensor,when temperature be Above 25 centigrade degrees cooler will work until temperature reduce to 25 degree . all the thing will work in the loop . for example after 1 week of work errors come to esp , how is possible that Esp notice the error and restart automatically for fixing the error . i don't want restart the board manually

I have read that watchdog timer pushes microprocessor/controller into reset state whenever it experiences any software anomaly like executing in infinite loop. and after some time a very senior prof told us that after reset the processor resumes operation from the next instruction to the erroneous one.  when watchdog timer resets the processor, from where does the processor start its next execution?  I just wanted to know what is correct or if some other concept is employed?


I got a problem while transferring data from client side to back-end. If transfer data is more then its taking more time to send the request to back-end. So, I thought if i can compress the data, then it will take less time.   Is there any compression technique or method is available in the front end side using javascript or jquery.

I'm writing a Web application that needs to store JSON data in a small, fixed-size server-side cache via AJAX (think: ). I do not have control over the server.  I need to reduce the size of the stored data to stay within a server-side quota, and was hoping to be able to gzip the stringified JSON in the browser before sending it up to the server.  However, I cannot find much in the way of JavaScript implementations of Gzip. Any suggestions for how I can compress the data on the client side before sending it up?