Run Tests not available in Force.com menu in force.com IDE

I installed a new version of Force.com IDE to (Eclipse Kepler for Java Developers) and switched to Force.com perspective. I do not see "run tests" as an option anymore.  I tried  and it broke my Eclipse. Please let me know how I can fix this so I can run tests on my test classes in Eclipse. I know I can run tests in developer console as well but I want to have the option here as well.


Problem: Find the centroid of the part of the large loop of the limacon $r=1+2\cos(\theta)$ that does not include the small loop.   I know that in order to compute the centroid one needs to use following equations $$x=\frac{\iint_D xdydx}{m}$$ and $$y=\frac{\iint_D ydydx}{m},$$ where $$m=\iint_D dydx.$$ Note that we are assuming $\rho=1,$ which should work for this problem since I got the correct answer for a similar problem. The real issue that I am facing is that I am unable to set up the bounds on the integral because I do not what values of $r,\theta$ do I have to exclude in order to avoid the loop. Any help in this regard would be much appreciated.


If there is a file and the filename starts with a dot, does that mean you created the file and you are hiding stuff in it, or can the files get created on their own without you creating the filename?


Let $f$ be a real valued measurable function on $\mathbb R^2$ such that each section $f_x$ is Borel measurable and each section $f^y$ is continuous, where $f_x(y)=f(x,y)$ and $f^y(x)=f(x,y)$.  We need to show that $f$ is Borel measurable.  I am not getting how to approach for it.   Any suggestion would be appreciated. Thanks in advance.


Cancelling my current valid visa to apply for a new Schengen visa as my current one expires mid-trip

I have a current Schengen visa until the 8th of September, however I'm planning to go to Greece until the 11th. It's literally a matter of days, but I still need a new visa.   The Greek Consulate has advised me that I cannot apply for a new one while I still hold a valid one. The Swiss Embassy (who issued my current one) has informed me the same, and said that I can 'repeal' my current one. (Not sure if this is the same as "cancelling" or 'revoking' my visa). The Greek Consulate however, has said that this would look bad for me in future applications (apparently it will not mention WHY my visa was cancelled) and have suggested that I overstay my visa rather and just pay the fine. That, however, is not an option for me, as I travel to Europe often and would rather not stay in a country illegally and risk being blacklisted for future trips.   Does anyone have any advice? I really feel like I am being forced to illegally overstay my welcome or change my flights. All I want to do is apply for a new one in the correct and legal manner.


Difference between focal point and distance away from object?

I have a macro lens for the camera on my phone. I want to calculate the magnification of the lens because the one i purchased does not state it.  I've found this guide which states the mathematical relationships -   The only thing that i don't understand is the difference between the focal length and the distance between the object and the lens? I thought the focal length was the distance between object and lens.  Thanks Bobby


Value of $\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$

I remember that a couple of years ago a friend showed me and some other people the following expression:  $$\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}.$$  As shown below, I can prove that this limit exists by the monotone convergence theorem. I also remember that my friend gave a very dubious "proof" that the value of the limit is $\frac{1}{e-1}$. I cannot remember the details of the proof, but I am fairly certain that it made the common error of treating $n$ as a variable in some places at some times and as a constant in other places at other times. Nevertheless, numerical analysis suggests that the value my friend gave was correct, even if his methods were flawed. My question is then:  What is the value of this limit and how do we prove it rigorously?  (Also, for bonus points, What might my friend's original proof have been and what exactly was his error, if any?)  I give my convergence proof below in two parts. In both parts, I define the sequence $a_n$ by $a_n=\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$ for all integers $n\ge 2$. First, I prove that $a_n$ is bounded above by $1$. Second, I prove that $a_n$ is increasing.   (1) The sequence $a_n$ satisfies $a_n<1$ for all $n\ge 2$.  Note that $a_n<1$ is equivalent to $1^n+2^n+\cdots+(n-1)^n<n^n$. I prove this second statement by induction. Observe that $1^2=1<4=2^2$. Now suppose that $1^n+2^n+\cdots+(n-1)^n<n^n$ for some integer $n\ge 2$. Then  $$1^{n+1}+2^{n+1}+\cdots+(n-1)^{n+1}+n^{n+1}\le(n-1)(1^n+2^n+\cdots+(n-1)^n)+n^{n+1}<(n-1)n^n+n^{n+1}<(n+1)n^n+n^{n+1}\le n^{n+1}+(n+1)n^n+\binom{n+1}{2}n^{n-1}+\cdots+1=(n+1)^{n+1}.$$  (2) The sequence $a_n$ is increasing for all $n\ge 2$.  We must first prove the following preliminary proposition. (I'm not sure if "lemma" is appropriate for this.)  (2a) For all integers $n\ge 2$ and $2\le k\le n$, $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We observe that $k^2-1\le kn$, so upon division by $k(k^2-1)$, we get $\frac{1}{k}\le\frac{n}{k^2-1}$. By , we may find:  $$\frac{k+1}{k}\le 1+\frac{n}{k^2-1}\le\left(1+\frac{1}{k^2-1}\right)^n=\left(\frac{k^2}{k^2-1}\right)^n.$$  A little multiplication and we arrive at $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We may now first apply this to see that $\left(\frac{n-1}{n}\right)^n\le\left(\frac{n}{n+1}\right)^{n+1}$. Then we suppose that for some integer $2\le k\le n$, we have $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$. Then:  $$\left(\frac{k-1}{n}\right)^n=\left(\frac{k}{n}\right)^n\left(\frac{k-1}{k}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}\left(\frac{k}{k+1}\right)^{n+1}=\left(\frac{k}{n+1}\right)^{n+1}.$$  By backwards (finite) induction from $n$, we have that $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$ for all integers $1\le k\le n$, so:  $$a_n=\left(\frac{1}{n}\right)^n+\left(\frac{2}{n}\right)^n+\cdots+\left(\frac{n-1}{n}\right)^n\le\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}<\left(\frac{1}{n+1}\right)^{n+1}+\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}=a_{n+1}.$$  (In fact, this proves that $a_n$ is strictly increasing.) By the monotone convergence theorem, $a_n$ converges.  I should note that I am not especially well-practiced in proving these sorts of inequalities, so I may have given a significantly more complicated proof than necessary. If this is the case, feel free to explain in a comment or in your answer. I'd love to get a better grip on these inequalities in addition to finding out what the limit is.  Thanks!


Get dates of the MSSQL Database Transaction Log records

I am wondering if there is a way not just to get the transaction log (e.g. using fn_dblog), but also get the date for the start of execution for each of the transactions recorded?  It's okay to get any amount of extra uninteresting data as long as I get the date or timestamp of the transaction execution.


How to convert Bulk Leads by executing Apex Code in anonymous Window

Business requirement is to convert 1000 leads which are owned by a user,  I heard that we can right a adhoc Apex code in anonymous Window and execute it to convert.  Can any one help me in providing the code, which convert leads owned by a particular user.


Java how to verify hebrew text from the letter

I need to verify hebrew text from the letter the letter's body like:     שלום,      תואם ייעוץ וידאו עם המטופל John Salivan.  מועד הייעוץ נקבע לתאריך   23/02/2019 בשעה 20:45.      לביצוע הייעוץ יש להכנס   but my regex doesn't match text      public static void findBadLines(String fileName) {      Pattern regexp =  Pattern.compile(".*שלום,.*תואם ייעוץ וידאו עם המטופל John Salivan. .*מועד הייעוץ נקבע לתאריך .* בשעה.*..*לביצוע הייעוץ יש להכנס .*");     Matcher matcher = regexp.matcher("");      Path path = Paths.get(fileName);     //another way of getting all the lines:     //Files.readAllLines(path, ENCODING);     try (             BufferedReader reader = Files.newBufferedReader(path, ENCODING);             LineNumberReader lineReader = new LineNumberReader(reader);     ){         String line = null;         while ((line = lineReader.readLine()) != null) {             matcher.reset(line); //reset the input             if (!matcher.find()) {                 String msg = "Line " + lineReader.getLineNumber() + " is bad: " + line;                 throw new IllegalStateException(msg);             }         }     }     catch (IOException ex){         ex.printStackTrace();     } }  final static Charset ENCODING = StandardCharsets.UTF_8;   }


Prove That  $\lim_{n\to\infty}\left(\sum_{k=1}^{n}\frac{1}{2k-1}-\sum_{k=1}^{n}\frac{1}{2k}\right).$   My Approach I was solving:  $$\sum_{n=1}^{\infty}\frac{\left(-1\right)^{n-1}}{n}= \left(1+\frac 1 3 + \frac 1 5 +\ldots \right)-\left(\frac 1 2 + \frac 1 4 +\ldots  \right)  =\sum_{n=1}^{\infty}\frac{1}{2n-1}- \sum_{n=1}^{\infty}\frac{1}{2n}$$ Searching On Mathstack i found   I know that $ \sum_{n=1}^{\infty}\frac{\left(-1\right)^{n-1}}{n}$ = $\ln2$ But i don't know how to prove it using this method.


In Prototype I can show a "loading..." image with this code:  var myAjax = new Ajax.Request( url, {method: 'get', parameters: pars,  onLoading: showLoad, onComplete: showResponse} );  function showLoad () {     ... }   In jQuery, I can load a server page into an element with this:  $('#message').load('index.php?pg=ajaxFlashcard');   but how do I attach a loading spinner to this command as I did in Prototype?


I am currently working on a model which takes two parameters and produces a measurement statistic. Think of it as Z = f(X,Y).   Z is a matrix of my statistics and I am creating a surface plot of it in matlab. Basically, I am looking for a mathematical/analytical way of determining if the surface is smooth, or if it is jagged. Do large values tend to be clustered together or are they dispersed throughout the matrix? - that is my question. Basically, how mixed up are the values of my matrix?  I need to run the model over different parameter sets and I want to be able to analytically determine which one of my surfaces is the smoothest, has the greatest clustering of large values, and ideally, has no negative values.   Any help will be greatly appreciated and please let me know if you need any further information.   Cheers


In general getting the address of a given value in a std::vector<valuetype> isn't safe because if the vector gets reallocated (.resize() or .push_back() expands the size), the addresses of all the objects in the vector may change.  dangerous:  vector<int> vals ; vals.push_back( 0 ) ; int *badP = &vals[0]; vals.push_back( 1 ) ; // badP could be invalid, if 2nd push_back resulted in realloc   I'm wondering about the safety of value types on the right side of a map, however.  Is this safe?  dangerous?  map<int,int> vals ; vals.insert( make_pair(1,1) ) ; int *p1 = &vals[1]; // is p1 guaranteed to be valid, as long as the vals[1]  // is not removed, deleted, or changed?   Under what conditions is p1 a bad pointer?


I am searching for a fascinating story I once read about a member of an social insectoid race. He is sent by his queen to make first contact with the strange humans and serve as liason. He learns to see and understand beyond his race's limits. He tries to warn his queen about the dangers, but before he can deliver the message he gets killed because he is seen as invested/impure and served its purpose.  The humans in the story, a man and a woman are not hostile towards their comrade. They seek their advantage but try to understand their guest. In the end it is humanity's adaptability and competitiveness that is the threat and not any violent behaviour.  As far as I remember it was a paper back from the 80s or the early 90s.


Find the units in $\mathbb Z_4[x]$.  I saw something online about this possibly having an infinite amount of units, but am not sure.  Any help someone can give would be greatly appreciated. Thank you.


High performance impact of assigning an iterator's return value in Java?

I have an implementation of Iterable<T> (a variation of a quadtree structure), which I plan to use in a setting where performance with large data sets is critical, so I have been conducting a few tests, with a couple million random entries, running them repeatedly. I experienced an oddity with the following code segment:   long start = System.currentTimeMillis();  for (int i = 0; i < 100; i++) {      Iterator<A> iter = it.iterator();      while (iter.hasNext()) {          iter.next();      }  }  long end = System.currentTimeMillis();  System.out.println("Total time: " + (end - start));   I always got a time between 4000 and 5000 milliseconds. However, when I changed the while loop to this:  A a = null; while (iter.hasNext()) {     a = iter.next(); }   the time jumps up -- not just slightly, but all the way up to 15 to 16 seconds, with complete consistency. Now this already does not seem dependent on the implementation of next(), but upon further investigation, I found that it even happens with a simple ArrayList, so I'll post compilable code for that instead:  import java.util.ArrayList; import java.util.Iterator; import java.util.List;  public class Test {     static class A {}      public static void main(String[] args) {         List<A> list = new ArrayList<>();         // Add a lot of entries         for (int i = 0; i < 10000000; i++) {             list.add(new A());         }         // Test it         A a = null;         Iterator<A> iter = null;         long start = System.currentTimeMillis();         for (int i = 0; i < 100; i++) {             iter = list.iterator();             while (iter.hasNext()) {                 iter.next();                 // Or:                 // a = iter.next();             }         }         long end = System.currentTimeMillis();         System.out.println("Total time: " + (end - start));     } }   The result: an even more unbelievable 30-fold difference. And it happens deterministically, every time.  What possible reason could there be for this? I don't see how a single assignment to an already allocated variable could be anything other than negligible, especially considering that so much else is happening inside iter.next(). My only guess is that the System.currentTimeMillis() calls are somehow not executed at the proper time, but as for how this is affected by the change, I have no idea.  But even that doesn't quite fit, because the time it takes is noticably much, much longer, especially if I further increase the number of times the for loop runs. The garbage collector also should not have anything more to do, as far as I see, since no wasteful, temporary allocations should be happening. It also apparently is the assignment of the return value that's critical, since just doing something else in addition to iter.next(), like increasing an int variable each time, does not have the same adverse effect on execution time.  EDIT: It has been brought to my attention by multiple people that the particular benchmark in my post suffers from many issues that can compromise its results' trustworthiness. I will leave it here for posterity though, or possibly update it later to make it better. That having been said, the phenomenon's most likely cause has been identified in the accepted answer, and I confirmed that eliminating the typecast solved the issue, so despite the benchmark's shortcomings the observation above appears to not have been just a side-effect of those.


I am reviewing the proof of the Chinese Remainder Theorem and I am confused at one of the concluding sentences in my textbook.  I understand why there is a solution for relatively prime $m,n$ such that for arbitrary integers $s,t$ that $ x \equiv s$ (mod m) and $x \equiv t$ (mod n) but the concluding sentence says that now the solution is  $ x$  mod(mn) . I do not understand this last statement.


Let $\theta$ be any fixed constant in $(0,\pi/2)$. Then the seires $$\sum_{n=1}^∞ \frac{|\sin(n\theta)|}{n}$$ diverges.   I don't have any idea how to prove it. Maybe equidistribution theorem is related?


I have been trying to split a large flac file using the cue file and shntool. I am getting the error "error: m:ss.ff format can only be used with CD-quality files".  I have tried everything I have read on google to solve this with no joy. I have quite a few of these album length files that come in a large flac file with cue file and can't split them. I would like to do this without having to resort to wine or virtualbox. Also I have seen mention of cuetools for linux but have been unable to find it except for ubuntu and I don't use ubuntu, any help there would be appreciated too. thanks


I'd like \span to be a math operator (for the  of a set of vectors), but apparently it's already a TeX command. What do you guys recommend I do instead? (I don't really want a strange capital \Span, or some other odd variant... but I'm guessing it's a bad idea to redefine \span?)


The first sentence of each row is direct speech. The second one is reported speech. The modals will and can change in the reported speech. But I am not sure what to do with should.  "I will go to Europe." — He said he would go to Europe. "I can play the guitar." — He said he could play the guitar. "I should go to college." — He said he [should] go to college.


I am using the float package to create my own floats.  Now I also want to add an image with its own caption inside, but the caption belongs to the outer float.  Is it possible to create something like a figure environment inside my float?  I that already but it does not work inside the float.  \documentclass{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{graphicx}  \usepackage{blindtext} \usepackage{float} \usepackage{framed}  \newfloat{infobox}{tbp}{ext}  \begin{document}  \begin{infobox}   \begin{framed}     \blindtext           \includegraphics[width=0.85\textwidth]{dummy}     \caption{Caption for the image}   \end{framed} \end{infobox}  \end{document}


What is the question tag for sentences whose subjects are "none...is" and "each...is"?

I know that  indefinite pronouns like none and each take singular verbs, but what about their question tags?   None of the boys has passed the test, ________?  Each of the girls was given a prize, _______?    What are the question tags for these two sentences? Should the question tag’s verb be in the singular like the subject or plural because we’re talking about all of them? What about that question tag’s pronoun? Would gender come into consideration?


I regularly grab an archive of my tweets from Twitter because I'm a little paranoid that I'll be kicked off the platform at some point. However, the regular archive does not include images I have uploaded to Twitter. How can I get an archive that includes the images along with the tweets?


SQL query that concatenates values from duplicate rows in a single table

Let's say I have a table of employees, like this:  Name     Sex     Role  Bob      M       Developer Joe      M       QA   Now, I have a problem with duplicated rows in this table. I will fix it sometime but it's not the issue. What I currently need is something that queries such a table:  Name     Sex     Role  Bob      M       Developer Bob      M       Janitor Joe      M       QA Joe      M       CEO   And will output the following rows:  Name     Role  Bob      Developer, Janitor Joe      QA, CEO   It doesn't matter to me if the "Role" will be split to separate columns or be a single column with multiple values.  Using SQL Server 2008 if it matters.


I was having problems on my Macbook, getting my VPN service to start properly, and was they suggested that I create new Keychain and import settings into new Keychain. I did that, and now I am getting this constant pop-up message, saying autosd needs me to input my Keychain password.   Any ideas what is happening, how to fix this issue and stop the messages?


How to get dual boot (Ubuntu/Windows) option enabled?

My first disk has windows and second disk (not partition) has Ubuntu.   But the first disk was removed during ubuntu installation and plugged back after installation.   Now my system boots with only one OS depending on the disk with higher priority in the boot list.   One of the attached question talks about boot repair or about reinstalling grub-efi. Which is not the case here. My system boots perfectly but based on the drive selected.   The other attached question is valid with the given assumptions being true, which are false in my case.   Is there any way to get OS selection list at boot time?


Android JSONObject.optString value returned doesn't match string in if statement

I am trying to retreive a value from a JSONObject using optString and match it with a string value, but it never matches, though the values are the same. What am I doing wrong? if (jsonServerOP.optString("Code", "") == "0") {  // condition is successfull     // This never runs, even if the server returns the Code '0' }  Server returns this JSON: { "Code":"0", "A":"LBEN", "LBEID":"3", "LBEIDI":"23" }


Everyday we see ourselves in mirror and this is due to light which forms our image after reflection ( may be refraction sometimes) . But I wonder how can light carry the image. How is it possible that massless particles (or waves maybe, which is not an issue now ) can carry the image of the source from which they come or object by which they got reflected bat a tremendous speed ?   I know that things we perceive as they are because of our eyes but the point of that our eye must also perceive things which really occur. Like if the light rays are coming from an object  at infinity and incident on a concave mirror, then they get converged to points in the focal plane and we say that a real image has been formed there. Then the question is how light made that image  (which may be perceived by our eyes) ?


Surviving nether world's Zombie pigmen in minecraft

The first time I entered nether I killed a zombie pig man and ever since they have been trying to kill me every time I step into the nether. I am not able to consolidate my position in the nether. Any general tips or ideas to tackle them


how do I use if and else in html, is it possible?

let's say if I don't have  I want to display  is this possible to do it?  Edit:  sorry if the question is confusing... The problem is this:when user inserts url and if that url is a link to youtube, then youtube thumbnail needs to be displayed. if that url isn't a link to youtube video, post.image(default image) needs to be displayed. But post.image is not getting displayed!    //display post.image  the above two displays images fine. But if {{post.thumbnail}} is none I want to display {{post.image}}... how do I do this?  this is why I need it,,please see the below code     {% if post.main_image %} //if post has main_image     //display that image   {% elif post.url %}//if post has url     {% video post.url as my_video %} //setting post.url as my_video(problem starts here I think)       {% if my_video %} //if my_video is there          //display the video thumbnail       {% else %} //if my_video isn't there and post.url isn't a link to youtube          //display post.image       {% endif %}     {% endvideo %}   {% else %}         {% endif %} 	 so main thing to look at it is for post.url if I don't have   I want   //display post.image


looking to download the Eclipse CDT (IDE for C/C++) but seems its currently unavailable for Ubuntu 20.04 in the apt package manager looked for snaps and flatpaks , could not find any solutions there (they have only the Java IDE) thinking about downloading the 'tar.gz' file but afraid that there would be dependencies issues, and the uninstallion would be hard any help on how to go about this?


Cycles is using Path-tracing-Tile instead of Sample

I know this question as been asked many times before, but the solution, that usually helped doesn´t work for me. So I would be very happy about some assistance!  I built a scene, and when I try to render it is always using Path Tracing Tile....instead of Samples.  I have NOT checked the Square Sample Box! But it is still rendering in Pathes...why could that be?


I keep getting this crash report on Minecraft 1.13 whenever I load a world. Any ideas on how I could fix this?

---- Minecraft Crash Report ---- // I let you down. Sorry :(  Time: 6/08/18 5:18 PM Description: mouseClicked event handler  java.lang.OutOfMemoryError: Java heap space   A detailed walkthrough of the error, its code path and all known details is as follows: ---------------------------------------------------------------------------------------  -- Head -- Thread: Client thread Stacktrace:     at cjs.a(SourceFile:433)  -- Affected screen -- Details:     Screen name: cmn Stacktrace:     at cjs.a(SourceFile:433)     at cfk.a(SourceFile:83)     at cfk$$Lambda$774/849031967.invoke(Unknown Source)     at org.lwjgl.glfw.GLFWMouseButtonCallbackI.callback(GLFWMouseButtonCallbackI.java:36)     at org.lwjgl.system.JNI.invokeV(Native Method)     at org.lwjgl.glfw.GLFW.glfwWaitEventsTimeout(GLFW.java:3108)     at cfs.a(SourceFile:320)     at cfi.c(SourceFile:872)     at cfi.a(SourceFile:392)     at net.minecraft.client.main.Main.main(SourceFile:144)  -- System Details -- Details:     Minecraft Version: 1.13     Operating System: Windows 8.1 (amd64) version 6.3     Java Version: 1.8.0_51, Oracle Corporation     Java VM Version: Java HotSpot(TM) 64-Bit Server VM (mixed mode), Oracle Corporation     Memory: 15300784 bytes (14 MB) / 268435456 bytes (256 MB) up to 268435456 bytes (256 MB)     JVM Flags: 10 total; -XX:HeapDumpPath=MojangTricksIntelDriversForPerformance_javaw.exe_minecraft.exe.heapdump -Xss1M -Xmx1G -XX:+UnlockExperimentalVMOptions -XX:+UseG1GC -XX:G1NewSizePercent=20 -XX:G1ReservePercent=20 -XX:MaxGCPauseMillis=50 -XX:G1HeapRegionSize=16M -Xmx256M     Launched Version: 1.13     LWJGL: 3.1.6 build 14     OpenGL: Intel(R) HD Graphics GL version 4.0.0 - Build 10.18.10.3574, Intel     GL Caps: Using GL 1.3 multitexturing. Using GL 1.3 texture combiners. Using framebuffer objects because OpenGL 3.0 is supported and separate blending is supported. Shaders are available because OpenGL 2.1 is supported. VBOs are available because OpenGL 1.5 is supported.      Using VBOs: Yes     Is Modded: Probably not. Jar signature remains and client brand is untouched.     Type: Client (map_client.txt)     Resource Packs:      Current Language: English (US)     Profiler Position: N/A (disabled)     CPU: 2x Intel(R) Celeron(R) CPU N2840 @ 2.16GHz


Gilles :     character 27 = 033 = 0x1b = ^[ = \e   Demizey :     ^[ is just a representation of ESCAPE and \e is interpreted as an actual ESCAPE character   Then I also found this line from a      Make sure you write the key sequence as \e[24~ rather than ^[[24~. This is because the ^[ sequence is equivalent to the [Esc] key, which is represented by \e in the shell. So, for instance, if the key sequence was ^[[OP the resulting bind code to use would be \e[OP.   But I have been using mappings that use ^[ instead of \e.  So are they interchangeable? When do I need use one instead of the other?


How can I serialize an object to JSON in JavaScript?


How do I prevent this bath faucet from leaking while the shower is running?

Here's a photo of my setup:    The hose and nozzle hanging down in the picture make up the shower head assembly (it is a hand shower that can hang up on the wall or be removed for directed use). You'll note that the shower is running, but a good portion of the water flow is still leaking through the faucet (with a corresponding loss in pressure at the shower outlet) even though I have the diverter set as forcefully as possible to direct water to the shower head.   I'm assuming that there is some component inside the faucet that needs to be replaced, but I'm not sure which and/or how to go about it. Any suggestions?


Is there any way to mirror an already rigged mesh and skeleton in Blender?

While working on my project, I completely rigged only one half of a mesh without the mirror modifier applied. I obviously want the whole thing rigged - Am Ia forced to redo the whole thing to get the other side? (Is there a way to just mirror the whole thing with the rig data?)


Will I be fined or arrested transferring through Finland with expired Schengen visa?

I'm a Chinese student studying in Sweden. My visa extension was rejected by the Swedish migration office, and because of this I will leave for China within a month. However, I had no idea about a potential transfer problem in Finland, as my visa has been expired for half a year.    Is there any possibility that I will be arrested while in the transfer in Helsinki?


At my organization, we have a number of queue consuming worker processes. We're currently using SupervisorD to manage them, but would like to use SystemD if possible for certain advantages therein. I'm fairly experienced with writing custom units, but I don't immediately have an analog in SystemD land for this.  In the  a parameter called numprocs is detailed which allows one to set the number of processes they'd like to be started with the service. If I want 30 processes started, it's a one-line change.  Is there a setting in SystemD units that will allow me to specify how many of these processes I'd like started?


NO_APPLICABLE_PROCESS :No applicable process found!

// Insert an account  Account a = new Account(Name='Test',                      annualRevenue=100.0);  insert a;  // Create an approval request for the account Approval.ProcessSubmitRequest req1 =        new Approval.ProcessSubmitRequest(); req1.setObjectId(a.id); req1.setNextApproverIds(new Id[] {'***************'}); // Submit the approval request for the account Approval.ProcessResult result =                     Approval.process(req1);   Am trying to execute this code in anonymous block. How ever when tried in trigger i got same error all the time. Hard coded next approvers ID. No luck.  Any suggestions on what am I doing wrong ? Please help!!


There are no semisimple Lie algebras of dimension $4$, $5$, or $7$

I came across the claim  which states that there are no complex semisimple Lie algebras of dimension $4$, $5$, or $7$. As the problem suggests, we can take a Cartan subalgebra $H$ and root system $\Phi$ so that $L=H\oplus(\oplus_{\alpha\in\Phi}L_\alpha)$ where $$L_\alpha=\{x\in L:(\forall h\in H)\ [h,x]=\alpha(h)x\}$$  As shown in Humphreys' Introduction to Lie Algebras, every $L_\alpha$ has dimension $1$, so $\dim(L)=\dim(H)+\vert\Phi\vert$. I know $\Phi$ spans $H^*$, so $\dim(H)\leq\vert\Phi\vert$. Furthermore, I know that for any $\alpha\in\Phi$, the only multiples of $\alpha$ in $\Phi$ are $\alpha$ and $-\alpha$. Since $\mathbb{C}$ has characteristic $0$, this implies $\vert\Phi\vert$ is even.  Finally, another fact which may be useful is that given nonzero vectors $x_\alpha\in L_\alpha$ and $y_\alpha\in L_{-\alpha}$, if we take $h_\alpha=[x_\alpha,y_\alpha]\in H$, then $x_\alpha$, $y_\alpha$, and $h_\alpha$ span a three-dimensional subspace of $L$ isomorphic to $\mathfrak{sl}(2,\mathbb{C})$. However, I am not sure how to connect these pieces to give the desired conclusion.  As a follow-up question, would the claim still be true if I replaced the field with an arbitrary field of characteristic $0$, or is it also necessary for the field to be algebraically closed?


As a new user, I've just installed Lubuntu 20.10 64bit alongside Windows7 on a Intel Core 2 laptop. I've managed to change the default boot to W7 by editing and updating the GRUB file. The displayed boot order is now Lubuntu, then a few options for mem test etc and then Windows 7 at the bottom. I'd like to have LU and W7 adjacent in the menu, with the options below - I'm probably not going to use them anyway.


Using QGIS GUI predefined colorramps in Python console / PyQGIS?

When using the QGIS Gui, there are plenty of predefined colorramps to choose from when styling a layer with e.g. categorized symbology.    When using the Python console for PyQGIS scripting,  describes how to create your own colorramp that you can then apply to a renderer object, for example:  # create a new colorramp colorRamp = QgsVectorGradientColorRampV2.create({'color1' : '0,255,0,255',                                                      'color2' : '255,0,0,255',                                                      'stops' : '0.5;255,255,0,255'})  # set up an empty categorized renderer and assign the colorramp renderer = QgsCategorizedSymbolRendererV2(field, []) renderer.setSourceColorRamp(colorRamp)   Is there a way to access the predefined colorramps that are accessible from the GUI and assign them to a renderer instead of creating my own?


How do you peer-review other people's edits?

Whenever I try to edit a post on a SE website, it tells me it will be peer-reviewed. How can I peer-review other people's edits?


I am new to C++ and I had a few general questions about code separation. I have currently built a small application, all in one file.  What I want to do now is convert this into separate files such that they contain similar code or whatnot.  My real question right now is, how do I know how to separate things? What is the invisible margin that code should be separated at?    Also, what's the point of header files? Is it to forward declare methods and classes so I can use them in my code before they are included by the linker during compilation?    Any insight into methods or best practises would be great, thanks!


Formula to obtain sum of $ 1^k+2^k+3^k+\cdots+(n-1)^k+n^k$

How would one systematically obtain the formula for $$ 1^k+2^k+3^k+\cdots+(n-1)^k+n^k$$ for a fixed positive integer exponent k? I am aware of the formulas $$\sum_{i=0}^n i^2 = \frac{(n^2+n)(2n+1)}{6}\quad ,\quad\sum_{i=0}^n i = \frac{n(n+1)}{2}\quad,\quad\sum_{i=0}^n i^3 = \left(\frac{n(n+1)}{2}\right)^2$$ i.e. when values of k are 1, 2 and 3. Using these can I use induction to proceed with the original sum?


Let $X,X_n$ be random variables with $X_n\to X$ is distribution.     Show      $$ E(|X|)\leqslant\liminf_{n\to\infty} E(|X_n|). $$      I call the probability space on which $X$ and $X_n$ are defined $(X,A,P)$. Then $X_n\to X$ in distribution means $$ \lim_n \int f\, dP_{X_n}=\int f\, dP_X $$ for all bounded and continious functions $f\colon\mathbb{R}\to\mathbb{R}$, right?  Do not know how continue...


Why are there more Irrationals than Rationals given the density of $Q$ in $R$?

I'm reading "Understanding Analysis" by Abbott, and I'm confused about the density of $Q$ in $R$ and how that ties to the cardinality of rational vs irrational numbers.  First, on page 20, Theorem 1.4.3 "Density of $Q$ in $R$" Abbot states:     For every two real numbers a and b   with a < b, there exists a rational number r satisfying a < r < b.   For which he provides a proof.  Later, on page 22, in the section titled "Countable and Uncountable Sets" he states:     Mentally, there is a temptation to think of $Q$ and $I$ as being intricately mixed together in equal proportions, but this turns out not to be the case...the irrational numbers far outnumber the rational numbers in making   up the real line.   My question is: how are these two statements not in direct contradiction? Given any closed interval of irrational numbers of cardinality $X$, $A$, shouldn't be the case that we would have corresponding set of $X-1$ rational numbers, $B$, where each rational in $B$ falls "between" two other irrationals in $A$?  If this is not the case, how do we have so many more irrationals than rationals while still satisfying our theorem that between every two reals there is a rational number?  I know there are other questions similar to this, but I haven't found an answer that explains this very well, and none that address this (perceived) contradiction.


In this example:  import java.util.*;  public class Example {     static void doesntCompile(Map<Integer, List<? extends Number>> map) {}     static <T extends Number> void compiles(Map<Integer, List<T>> map) {}      static void function(List<? extends Number> outer)     {         doesntCompile(new HashMap<Integer, List<Integer>>());         compiles(new HashMap<Integer, List<Integer>>());     } }   doesntCompile() fails to compile with:  Example.java:9: error: incompatible types: HashMap<Integer,List<Integer>> cannot be converted to Map<Integer,List<? extends Number>>         doesntCompile(new HashMap<Integer, List<Integer>>());                       ^   while compiles() is accepted by the compiler.   explains that the only difference is that unlike <? ...>, <T ...> lets you reference the type later, which doesn't seem to be the case.  What is the difference between <? extends Number> and <T extends Number> in this case and why doesn't the first compile?


Whenever I open a website and click a link inside it, it redirects me to some URLs and then finally it reaches to the link "offer.alibaba.com" and showing me some offer. I just googled it but the results are offering virus scan software for download and other stuff like that. I want to know what is that and from where it came into my laptop?


Hi, I am new to Texmaker, and Latex generally. Can anybody please tell me how to solve this problem. It happens when I Quickbuild to see the pdf version. I am running Mac OS X El Capitan (perhaps this is important)  Thanks!


This is slightly different than all the other questions asking just for an algorithm. I would like to know whether there is an O(1) algorithm that does this in C++. It seems that since C++ is such a low-level language that works closely with bits, there would be a quick O(1) function that would return the highest bit, to which we could just do << 1 to get the answer.


Let G be an abelian group and let H and K be finite cyclic subgroups with |H| = r and |K| = s. Show that G contains a cyclic group of order lcm(r, s).  I already try many times.  I don't know how to complete proof.  When I prove this problem, i find error.....  help me.


Can't boot into Windows 8 after boot repair

I have a Lenovo Y510P laptop and managed to get Windows 8 and Ubuntu 13.10 dual booting. But then after grub was updated, I had to run boot-repair and now I can't boot into Windows.  When the computer starts and grub shows, I can boot into Ubuntu without a problem, but if I choose Windows from the boot menu, it just goes back to the menu.  I don't really know what kind of information I should provide, so please let me know if anything else besides what I posted bellow is needed.  My bios boot configuration is the following:   Boot type: UEFI  Secure boot: Disabled   Here is my grub.cfg file:   Here is my boot info from boot-repair:


colorize hostname in command line prompt

I wish to set a custom color for the hostname portion of my command line prompt (in bash).  In my .bashrc file, the default command line prompt is:  PS1='[\u@\h \W]\$ '   To colorize the hostname only, I came up with this prompt:  PS1='[\u@\e[40;36m\h\e[0m \W]\$ '   I used different colors for each host I work on. The colorizing part seems to be working as expected. However, with the prompt above, navigation on the command line becomes dysfunctional. For example, at times I cannot move the cursor to the beginning or end of the line. If I switch back to the default prompt, everything works correctly again.  What's wrong with my colorized prompt? How can I properly specify a color for the hostname only?  It should not matter for this question, but I'm running Arch Linux KDE and I work in Konsole.


Handoff renders two-factor authencation worthless?

I noticed that when I enabled two-factor authentication for my Apple ID and have handoff turned on, the code pops up on the mac where I'm seeking the two factor. Seems like it renders the two-factor worthless. Isn't the point it have it go to another device, separate from the login device?  I guess the obvious solution is to not have handoff on the mac?


I'm new to calculus and I find it really confusing why we just ignore the dx at the end.  For example, when working on derivation of $x^2$, at the last step, we're left with  $f'(x)= 2x + dx$  But I've heard people in videos say: "Since $dx$ is super super super small, we can safely ignore it. But just ignoring it bugs me. If we choose to ignore it, should it not actually look like this:  $f'(x) \approx 2x $  Thanks for your time. Cheers :)


Left arrow key not working after spill, even with Karabiner?

I'm on a Macbook Pro 13 (mid-12, not retina), macOS High Sierra. I spilled a few droplets of water (actual water) and my left arrow key decided to stop working. That's fair. Then I thought i don't use the right-alt key, so I tried to remap it using Karabiner-Elements. It didn't work (it was still registering as alt). BUT when I remap it to the right arrow key, it works!! I honestly don't know why that's the case. So I thought it could be a software issue, restarting the computer, and going into another user account (that's newly made) didn't help.   Oh and trying other keys also doesn't work. And I also tried an hidutil command and that didn't work. So I don't think the problem is from Karabiner.  So is there a reason why "softwarely" remapping the key wouldn't work?


How to find the limit of a sum of reciprocals $\lim_{n\to\infty}(1 + \frac{1}{2} + \frac{1}{3} + \cdots+ \frac{1}{n})$?

There's a limit that I am unable to solve. I think it should be equal to $\infty$. $$\lim_{n\to\infty}\left(1 + \frac{1}{2} + \frac{1}{3} + \cdots+ \frac{1}{n}\right)$$


Not sure where else to ask. There is no help or support forum? Anyways, is it possible to upload an audio file, or how can I create a link to my machine, or is there a website to upload it to and then link it?


The plural "guys" definitely is, at least here in San Francisco — I'm often hearing all-girl companies here being greeted with 'Hi guys, how are you doing?'.  How about the singular guy? Is it universally assumed that 'the guy who will be doing this' can be either guy or gal?


Is there a way of transferring iPhone voice memos to a Windows computer without linking it to the computer by iTunes or sending them via mail? Thank you.


I am trying to boot Ubuntu 13.10 from a USB Drive. I was expecting a regulation procedure: BIOS>BOOT-order-tweak>boot-from-USB. But it didn't work. I recently upgraded from a 7 year old laptop, and am not familiar with either UEFI or SecureBoot or how these change anything. From first impressions of what research i could do, the combination of said unfamiliar standards help avoid malware from doing there thing, help Windows to boot super fast and are compatible with newer versions of popular Linux distributions. So ideally one should be able to boot into described Linux distro from USB w/o disabling SecureBoot or enabling Legacy anything. The problem seems quite trivial, as it is not being discussed at all. What am I doing wrong? This also worries me a bit, because I was thinking of moving windows recovery to an external drive and freeing up the valuable space from my tiny SSD (and hopefully installing another OS there), and if I can't boot from USB...!! About Linux, can anyone also let me know if installing software not provided by HP voids my warranty?


Understanding the Proof of L'Hopital's Rule

The following is an excerpt from Bartle and Sherbert's Introduction to Real Analysis:        Okay. I am having a little trouble following this proof. What is $c$ and why is it in $(a,b)$? What confuses me is that there is no reference to any $\delta$ nor any reference $x$ such that $0 < x - a < \delta$. They just simply write $L - \epsilon \le \frac{f(\beta)}{g(\beta)} \le L + \epsilon$ and claim that the conclusion follows. I suspect they are using $\beta$ in place of $x$, but this still doesn't account for the absence of a $\delta$ and why $\beta$ wouldn't satisfy $0 < \beta - a < \delta$.   On second thought, perhaps $\beta$ and $c$ are intended to stand for the typically used $x$ and $\delta$, respectively. It seems that what the authors have shown is that for every $\epsilon> 0$, there exists a $c > 0$ such that if $\beta$ satisfies $a < \beta \le c$, then $|\frac{f(\beta)}{g(\beta)} - L| \le \epsilon$. Even on that interpretation, why is $c$ (i.e., $\delta$) in $(a,b)$? In fact, if $a$ and $b$ are negative, this doesn't make much sense...  EDIT:  Okay. I think I follow what you, @Jack, are saying. However, there is one last thing giving me trouble. Just before equation (2), the authors claim that there exists a specific $u \in (\alpha, \beta)$ by the Cauchy Mean Value theorem such that equation (2) holds. Now, in order to validly substitute this in the inequality below (2) to obtain inequality (3), we need that that specific $u$ is in $(a,c)$, but this has not been demonstrated. All that we have is that if $u \in (a,c)$, then $L - \epsilon < \frac{f'(u)}{g'(u)} < L + \epsilon$, but how do we know that the specific $u$, guaranteed to exist by the Cauchy Mean Value theorem, falls in the interval $(a,c)$?  Also, it doesn't seem that we merely want to assume that $\beta \in (a,b)$ but that $\beta$ is arbitrary in $(a,c)$, right? Or may be it doesn't matter, since if we have "$\beta \in (a,b) \implies |\frac{f(\beta)}{g(\beta)} - L | <\epsilon$", then we would clearly have "$\beta \in (a,c) \subseteq (a,b) \implies |\frac{f(\beta)}{g(\beta)} - L | < \epsilon$". Am I thinking about this correctly?


Is there a way to set up "focus follows mouse" behavior in Unity?


$$\lim_{x\to0} |x|^{\frac{3}{2}}\ln|x|$$  I don't understand why this limit is equal to 0. What can I use on this limit to get rid of the $0\cdot-\infty$ form?


$\varnothing\neq A \in 2^\mathbb R$, $A^s$ is isolated points of $A$. Is $A^s$ closed set?  notation: x is isolated point means $\exists r>0 [N(x;r)\cap A=\{x\}]$  I would like to prove but I have no idea. I'm a uni student studying the very beginning of topology. Could you help me.


Let $f:\mathbb{R}\rightarrow\bar{\mathbb{R}}$. Prove for $C(f)=\{x\in\mathbb{R} :f \text{ is continuous in }x\}$ is a $G_\delta$  Definition: $A\subset X$ is a set $G_\delta$ iff $A=\bigcap_{n=1}^\infty G_n$ where $G_n$ is a open set for all $n$.  My attempt:  We need prove $C(f)=\bigcap_{n=1}^\infty G_n$ where $G_n$ is a open set for all $n$.$  Let $x\in C(f)$ then $f$ is continuous in $x$. This implies for all neighbourhood $  V \in (\bar{\mathbb{R}},\tau_\bar{\mathbb{R}}) $ then $f^{-1}(V)$ is open.  here i'm stuck. can someone help me?


How to get printf using {1..$VAR} to work properly

When I do this, I get what I expect:  $ printf "https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=%d\n" {1..10} https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=1 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=2 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=3 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=4 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=5 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=6 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=7 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=8 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=9 https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=10   But when I do this, it seems to treat it as 1 arg:  cbongiorno at wa-christianb-mbp in ~/dev/mystuff/bashful on master [!?] $ count=10  cbongiorno at wa-christianb-mbp in ~/dev/mystuff/bashful on master [!?] $ printf  "https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=%d\n" {1..${count}} bash: printf: {1..10}: invalid number https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=0  cbongiorno at wa-christianb-mbp in ~/dev/mystuff/bashful on master [!?] $ printf  "https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=%d\n" "{1..${count}}" bash: printf: {1..10}: invalid number https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=0  cbongiorno at wa-christianb-mbp in ~/dev/mystuff/bashful on master [!?] $ printf  "https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=%d\n" {1.."${count}"} bash: printf: {1..10}: invalid number https://api.bitbucket.org/2.0/repositories/twengg?pagelen=0&page=0   How to I get bash to expand this arg like it does when I hard-code the number?


Find the amount of squares in the given picture

How many squares are in the above figure?


How does money vanish in the financial system?

From time to time I hear X dollars in value was erased in the stock market etc. But can money really vanish when, for instance stocks lose value?  For example, Joe buys a stock from Ben for 100 dollars, then the price crashes to 20 dollars. Well Ben still has the 100 dollars, and it is only Joe who lost 80.


Getting shared pointer of reference argument

I am currently struggling with references and smart pointers with c++,  this is my class layout (Everything is child of abstract A)  A +-B +-C +-D   What i want is when I call B().foo(C()) is to add shared pointer of C() to vector> inside of B. and the same for B().foo(D()) however when I call   void foo(const A& item){     container.push_back(make_shared<A>(item); }   it seems to strip all non A attributes from item (although function item.bar() still calls overloaded function in item)  it might be that I completely miss the point here, but that is where I am stuck right now


Every countably generated sigma algebra is generated by a random variable

Suppose I have a sigma algebra which is countably generated. I want to find a random variable such that it is generated by that random variable. If the countable class is just a single set then my random variable is indicator function. But, how to do in this case ? If we sum up all the indicators to define our random variable then the sum may diverge. How to make sure it converge ?


Drawing Tikz function domain/codomain on selected set of nodes

I am trying to draw a flow-chart like diagram to conceptualize a decision process by which 1) an initiator first chooses whom to team up with and 2) what task(s) to do with this or that person.  I found this previous  that addresses what I am up to but its \.fit function applies to all three sets of nodes, while I only intend to define block environments on set B and C (since my set A contains only one node). Also, I have rather long names/texts for some of the tasks listed in set C, the block environment created by \.fit will not grow to the length of those long texts. The end result being that the block cut through those long texts.  To get the sense of the idea, here's an example Tex code I modified from that earlier topic:          \documentclass{article}         \usepackage{tikz}         \usetikzlibrary{arrows,positioning,shapes,fit,calc}         \pgfdeclarelayer{background}         \pgfsetlayers{background,main}         \begin{document}         \begin{tikzpicture}[         every node/.style={on grid},         setA/.style={fill=black, circle, inner sep=1.2pt},         setC/.style={fill=red, rectangle,inner sep=2pt},         every fit/.style={draw, fill=white,rectangle,rounded corners=5pt, text width=80pt},>=latex]           % set A         \node [setA, label=left:a] (a) {};         \node[above=of a,anchor=south] {};          % set B         \node[inner sep=0pt,right=5cm of a] (x) {Person x};         \node[below = of x] (y) {Person y};         \node[inner sep=0pt,below = of y] (z) {Person z};         \node[above=of x,anchor=south] {$B$};          % set C         \node[setC,label=right:$m$,right = 6cm of x] (m) {Task a: xxxxxx};         \node[setC,label=right:$n$,below = of m] (n) {Task b: yyyyy};         \node[setC,label=right:$p$,below = of n] (p) {Task c: zzzzz};         \node[above=of m,anchor=south] {$C$};         % the arrows        \draw[->,shorten >= 3pt] (a) -- node[label=above:$f$] {} (x);        \draw[->,shorten >= 3pt] (b) -- node[label=above:$f$] {} (x);        \draw[->] (c) -- node[label=above:$g$] {} (y);        \draw[->,shorten <= 3pt] (x) -- node[label=above:$h$] {} (m);        \draw[->] (n) -- node[label=above:$u$] {} (y);         % the boxes around the sets       \begin{pgfonlayer}{background}       \node[fit= (a)  (c) ] {};       \node[fit= (x) (z) ] {};       \node[fit= (m) (p)] {};       \end{pgfonlayer}       \end{tikzpicture}       \end{document}   which produced the following    While my desired output should look something like this    But the difficulty is that I do not know how to turn off the block environment on set A and expand the width of the block on set C to accommodate the extra length of the texts. (# remove draw on every fit\.style will turn off block environment on all sets, is there any way to only include set B and C in the block environment?)  I have referenced this other  on overleaf but the complexity of his code is beyond me.  Would anyone care to take a look at and enlighten me on how to work on my existing code to produce the desired output?  Thanks.


Prove $(n^5-n)$ is divisible by 5 by induction.

So I started with a base case $n = 1$. This yields $5|0$, which is true since zero is divisible by any non zero number. I let $n = k >= 1$ and let $5|A = (k^5-k)$. Now I want to show $5|B = [(k+1)^5-(k+1)]$ is true....  After that I get lost.   I was given a supplement that provides a similar example, but that confuses me as well.   Here it is if anyone wants to take a look at it:  Prove that for all n elements of N, $27|(10n + 18n - 1)$.  Proof:  We use the method of mathematical induction. For $n = 1$, $10^1+18*1-1 = 27$.  Since $27|27$, the statement is correct in this case.  Let $n = k = 1$ and let $27|A = 10k + 18k - 1$.  We wish to show that $27|B = 10k+1 + 18(k + 1) - 1 = 10k+1 + 18k + 17$.  Consider $C = B - 10A$ ***I don't understand why A is multiplied by 10. $= (10k+1 + 18k + 17) - (10k+1 + 180k - 10)$    $= -162k + 27 = 27(-6k + 1)$.  Then $27|C$, and $B = 10A+C$. Since $27|A$ (inductive hypothesis) and $27|C$, then $B$ is the sum of two addends each divisible by $27$. By Theorem 1 (iii), $27|B$, and the proof is complete.


There have been a  of  here on meta asking about changing questions to fit existing answers.  However, this presupposes the existence of a question for which there exists a question/answer mismatch.  I am wondering if it is ever okay to go somewhat beyond this and contrive a question to which a known answer will be given.    For example, I was recently  and although I could unit test my small piece, I could not end-to-end test the solution because I was missing some of their precursor code.  They then .  It occurred to me that since that bit of information is useful to me, and is useful to them, and seems a priori to possibly be useful to others, then as an answer to an implied question in the comment thread, namely "how to transform a square-pixel image into a hex-pixel image?", that such a question might deserve to be asked.  Presumably, the other user in the comment thread would then provide an essentially ready-made answer to that question.  So, how does the meta community feel about this type of behavior?  Are there any psychological pitfalls I might fall into by practicing this sort of thing?  Are there any sociological pitfalls that might emerge by encouraging this sort of thing?


I need to request leave for one day and for more than one day.  What's the correct way of using the word day?  Which is correct for a single day of leave?        1 day's leave   1 day leave      What about more than one day?        2 day's leave   2 days' leave      Please clarify with explanation.


Is it possible to run os x 10.8 on a modern mac?

I would like to get a new computer, but I have a lot of software that I use which is discontinued and requires OS X 10.8.  Is there a way on a modern mac to have a dual-boot situation so that I can have the latest OS, but also have the option to boot into 10.8 without any performance issues?


Why should an equation () in which first time derivative is related to second space derivative have a solution that contains $i$?The wave function is supposed to be complex, but I am unable to understand why it can also be assumed to be complex directly from my previous statement as stated in Quantum Physics by . Can anyone help me develop an intuition?


Disk Space required for installation of Ubuntu

What is the maximum disk space required for the complete installation of Ubuntu 14.04 ?  And what are the minimum system requirements for butter smooth working of the OS ?


I want to show that the Cardinalities of $\mathbb{R}[X]$ and $\mathbb{R}$ are equal.  For starters, I tried mapping each polynomial to $\mathbb{R}^n$ by mapping it to its coordinates vector, but its not correct (I am limiting my polynomials here)  I can use cardinalities arithmetic and Cantor - Bernstein theorem.  Would love to get some insight.


getting error 'double Employee::taxRate' is private

this is a program about payroll but when compile the program it display error message. getting error while compiling the program dev c++. 7   9   [Error] 'double Employee::taxRate' is private. [Error] no matching function for call to 'HourlyEmp::HourlyEmp(const char [8], double, int, int)' may any one please help me? #include <iostream> using namespace std;  class Employee {     private:         string name;         double taxRate;     public:         Employee( string&, double );         string getName();         virtual double calcSalary() = 0; };  Employee::Employee( string& n, double tr ): name(n){     taxRate = tr; }   string Employee::getName() {     return name; }  class SalariedEmp : public Employee {     private:         double salary;     public:         SalariedEmp(string&,double,double);         virtual double calcSalary(); };  SalariedEmp::SalariedEmp(string& n, double tr, double sal) : Employee( n, tr ) {     salary = sal; }  double SalariedEmp::calcSalary() {     double tax = salary * taxRate;     return salary - tax; }   class HourlyEmp : public Employee {     private:         int hours;         double hourlyRate;     public:         HourlyEmp(string&,double,int,double);         virtual double calcSalary(); };  HourlyEmp ::HourlyEmp( string& n, double tr, int h, double hr ) : Employee( n, tr) {     hours = h;     hourlyRate = hr; } double HourlyEmp::calcSalary() {     double grossPay, tax;     grossPay = hours * hourlyRate;     tax = grossPay * taxRate;     return grossPay - tax; }   class CommEmp : public Employee {     private:         double sales;         double commRate;     public:         CommEmp( string&, double, double, double );         virtual double calcSalary(); };  CommEmp::CommEmp( string& n, double tr, double s, double cr ) : Employee(n, tr ) {     sales = s;     commRate = cr; }  double CommEmp::calcSalary() {     double grossPay = sales * commRate;     double tax = grossPay * taxRate;     return grossPay - tax; }   int main() {     Employee* emp[10];     emp[0] = new SalariedEmp( "Aamir", 0.05, 15000 );     emp[1] = new HourlyEmp( "Faakhir", 0.06, 160, 50 );     emp[2] = new CommEmp( "Fuaad", 0.04, 150000, 10 );     generatePayroll( emp, 10 );     return 0; }  void generatePayroll(Employee* emp[], int size) {     cout << "Name\tNet Salary\n\n";     for (int i = 0; i < size; i++) {         cout << emp[i]->getName() << "\t" << emp[i]->calcSalary() << "\n";     } }


Can two fields that have monomorphism to each other not be isomorphic?

More precisely, let $F_1, F_2$ be fields, and we have none zero homomorphisms $f: F_1 \to F_2$ and $g: F_2 \to F_1$ (actually both are monomorphism since $F_1, F_2$ are fields), is there a possibility that $F_1$ is not isomorphic to $F_2$?


Can a particle pass through a nodal point where its wave function is zero?

Let's consider an infinite square well. In the first exited state there is a node at the middle of the well (i.e. wave function and thus probability of finding the particle is zero there). If I measure the position right now, I may find the particle on the left side of the node, and if I measure the particle after some time, I may find the particle on the right side of the node. But must  a particle on the left side to go to right side not pass through the node point? Thus the particle will spend some time at that point, so there should be some probability of finding the particle there, but the wave function is zero there, so what's wrong with the arguement? Does the particle move here to there, without passing through the space in between? But that will just violate continuity equation?


I am watching , and at 3:45 Justice Scalia says he gets upset when he hear "infer" used to mean "imply"  Is there any real world example of "infer" used to mean "imply"? Why "infer" cannot be used to mean "imply"? What's the correct usage of "infer"?


Meaning of undergraduate, graduate or post-graduate in US

Trying to figure out the difference between these. I've lost completely as different source/answers interpret it differently. Does anyone have clear understanding about what does undergraduate/graduate/post-graduate student mean in USA?  I've seen this nice timeline in  however answers are still controversial.  As well, trying to figure out who the hell am I - I have a Bachelor in Computer Science, Master in Computer Science and another Master in Business Information Systems. Is that graduate or post-graduate? Also, I'm not a student anymore.


How to understand the sentence and who is the pianist here?

I come up with the sentence "I don't like him as a pianist, but as a judge" when considering "him" as a pianist. But can this sentence have two meanings when "as a pianist" refer to both "I" and "him"? Or can it only refer to the closer "him"?


How to create script with auto-complete?

When I use program like svn and I type in Gnome Terminal:  svn upd   and hit Tab it's autocompleted to:  svn update   Is it possible to do something like that in my custom bash script?


The velocity of body and the increase in relativistic mass

When a spaceship moving in a space at a high speed its mass will be increase due to it's high velocity. If there's an astronaut inside this ship does his  mass also increase or the spaceship protect the astronaut from this increase in mass.


extract value between two search patterns on same line

I have the following in a file Output.dat. I need to extract the value between dn: uid= and ,ou=  dn: uid=user1,ou=Active,ou=Member,dc=domain,dc=org  dn: uid=user2@abc.com,ou=Active,ou=Member,dc=domain,dc=org  dn: uid=usertest,ou=Active,ou=Member,dc=domain,dc=org  dn: uid=abc1,ou=Active,ou=Member,dc=domain,dc=org   I tried using sed -e '/dn: uid=/,/,ou=/p' output.dat but  it returns complete line instead of value. When tried to use sed -e '/dn: uid=/,/,ou=/\1/p' output.dat  then got the following error: sed: -e expression #1, char 18: unknown command: `\'


byte z[] = new byte[5]; - What does this mean?

I'm currently trying to get my head around a piece of code that I found. Firstly, I'm not sure why the code appears like:  byte z[] = new byte[5];  instead of:  byte[] z = new byte[5];  I mean, is byte z[] not there to declare an array of bytes? Or is this code doing something else?  Secondly, why would someone choose bytes over doubles or ints. It seems that a byte is any number from -128 to 127. What's the point in choosing that over a double?


Advantages of using centroids vs component-wise medians during clustering

During clustering, what are the advantages of using either the component-wise median or the component-wise mean (centroid).  One of the possible advantages of the component-wise median over the mean may be the robustness to outliers, even if, with a good number of samples, outlier effects don't affect the central point of the cluster.  Are there other advantages for either one or the other alternative?


Trigger agreement page automatically when connecting to Captive Portal

I have a WiFi hotspot setup using Hostapd and Dnsmasq. Everything works great, but I'm trying to trigger the sort of Terms and Conditions page you might see at a hotel or coffee shop after you connect to their captive portal. Most modern devices will automatically bring up this Terms and Conditions page immediately after connecting to one of these captive portal networks, which is what I'd like to happen after connecting to my hotspot.  As I understand it this is usually detected by the device by checking to see if a specific website returns a predictable response. For instance Google seems to test a connection to http://clients1.google.com and if it gets any response other than "generate204" it should trigger the captive portal agreement page. I've found two ways to redirect all traffic (and presumably these specific domains) to a web server running on my device...  One by adding the following line to /etc/dnsmasq.conf:  address=/#/10.0.0.1   and the other by using iptables. This triggers from a script on boot:  iptables -t nat -A PREROUTING -d 0/0 -p tcp --dport 80 -j DNAT --to-destination 10.0.0.1   Both succeed in redirecting all traffic to 10.0.0.1 (which is the correct address for the local web server) when manually entering a url into the browser, but the page doesn't open automatically upon connecting to the access point.  I've also tried manually adding entries for specific google URL's like:  address=/clients1.google.com/10.0.0.1   into the /etc/dnsmasq.conf with no luck. I've run out of ideas, any suggestions.


Why is the list of all sites in the Stack Exchange dropdown not sorted?

I am not sure it's the right place to post this as it's common to all Stack Overflow sites. I suggest sorting sites by user reputation and then alphabetically in the all-sites list of the Stack Overflow button.


Use RegEx to determine number of function calls

I am trying to find abstract all occurrences of a function call in a full project in Webstorm. The issue is that the function call may be broken into multiple lines for readability, hence I am trying to use regex for this. foobar(a,b c,d);  foobar(e,f,g,h);  I am trying to use regex foobar[\S\s]*\);? to get both the calls as separate occurrences but I keep getting one match only with the entire text highlighted(greedy result). What am I doing wrong with respect to the non greedy reg ex?


I'm trying to wrap my head around how different padding methods affect the strength of CBC-MAC's. Suppose a message is split into different blocks, m1, m2, m3 etc. and the last block is padded with 0's to fill it if needed.  If the message is intercepted, why can an attacker easily create another message with the same MAC tag for the same key as the message that was intercepted?  If another message is intercepted that does not contain any padding (so it completely fills the last block), how does this make it more difficult for the attacker to create a tag that matches? Does the message need to meet any conditions for the attack to work?  If this padding method is not secure, what is a better method to secure against these attacks? Would it be more secure if the padding was just random? Not sure how that would work.


natbib and hyperref for (Author, Year) style produces two links

I am using the bioinfo style with natbib and hyperref, using the (Author, Year) style citations.  pdflatex produces two link boxes for each citation: one for the Author and one of the Year.  I would prefer to get a single link for the entire [(Author, Year)] rather than ([Author], [Year]).  I can turn off PDF link boxes and uses colors instead to somewhat improve the appearance of this, but I'd still prefer to just have a single link.  Thanks in advance for any suggestions on how to fix this.  Here is a minimal example:  \documentclass{article}  \usepackage{natbib} \usepackage{hyperref} \begin{filecontents}{\jobname.bib} @book{adams80,   title = {The Restaurant at the End of the Universe},   author = {Douglas Adams},   series = {The Hitchhiker's Guide to the Galaxy},   publisher = {Pan Macmillan},   year = {1980} } \end{filecontents} \begin{document}  A theory about the inexplicability of the Universe has been proposed by \citet{adams80}.  \bibliographystyle{plainnat} \bibliography{\jobname}  \end{document}


How to loop over subdirectories and perform action while ignoring spaces in file names

I have the below folder structure in Linux env: |-- Fixed_Zip |   |-- ipython_notebooks |   |   |-- notebook editor for compute_0anXhGEj.ipynb |   |   |-- notebook editor for compute_aucScores.ipynb |   |   |-- notebook editor for compute_nG27bM3w.ipynb |   |   |-- notebook editor for compute_test_scored_scikit1.ipynb  as you can see, I have file names with spaces. How can I loop thought all the subdirectories in Fixed_Zip folder, and perform the command: jupytext --to py {file} ? One more thing, I'm doing the command from groovy file, so I guess there are some syntax to adjust. I was able to run the below in my private env and it's working: SAVEIFS=$IFS IFS=$(echo -en "\n\b") for i in `find . -name '*.ipynb' -type f`; do                 jupytext --to py "$i"             done IFS=$SAVEIFS  However, when I did the same in the groovy file: sh '''     SAVEIFS=$IFS     IFS=$(echo -en "\\n\\b")     for i in `find . -name '*.ipynb' -type f`; do         jupytext --to py "$i"     done     IFS=$SAVEIFS '''  I got the below error:     raise InconsistentPath( jupytext.paired_paths.InconsistentPath: './ipytho' is not a notebook.


I just got a new laptop without any OS (it had FreeDOS, but not anymore). When I go to Windows Installer and try to create a new partition from un-allocated space, I don't get any Error message but the installer is unable to create the partition. At the bottom of the installer window, there's a warning which says something like,     Windows cannot install on MBR *partition. On EFI systems, Windows can only install on GPT *partition   How can I convert MBR to GPT *partition without any OS?  *I am not sure if it was partition or not


After Windows 10 Fall Creators Update, a svchost.exe instance is constantly using CPU time

Since installing the Windows 10 Fall Creators Update, I have a svchost.exe process that is constantly using about 14 % of CPU time:    This svchost.exe instance is responsible for hosting three services:    The CPU time is consumed by a thread inside that process that  cannot attribute to any of these three services:    Given that these three services are considered critical system services, it's hard to do anything about them. These services cannot be stopped or disabled by services.msc, and terminating the process triggers a bugcheck (CRITICAL_PROCESS_DIED). Disabling the Windows Defender Firewall through the settings UI does not reduce CPU usage.  I'm out of ideas. What could be causing this? How can I debug this further? Is there a workaround to stop these services?    Update: After some debugging with , we've isolated this to the Windows Defender Firewall service. Process Monitor shows that it's constantly accessing the registry:    A CSV export of a Process Monitor capture, filtered to that process, is available .  I’m still looking for a way to stop that behavior.    Update 2: Analysis with the Windows Performance Analyzer shows that most CPU time is consumed by code from rpcrt4.dll:


how to implement shortcut key combination of CTRL or SHIFT +  through javascript?

ASP.NET 2.0 web application, how to implement shortcut key combination of CTRL + Letter, preferably through JavaScript, to make web application ergonomically better? How to capture multiple-key keyboard events through JavaScript?


I have the following string expression which am trying to run ,But am getting error saying string format is not correct   for (i = diffvol; i < result.count; i++) {     B1Volume = Convert.ToDecimal(String.Format("result.Data[0].B{0}Volume", i));     B2Volume = Convert.ToDecimal(String.Format("result.Data[0].B{0}Volume", i)); }


Ubuntu software not showing any software

After installing 16.04, Ubuntu Software is always empty as shown in the screenshot. How can I fix this?


Can not install any media package/software

I've had vlc, audacious working very well on my ubuntu 14.04. All of a sudden today I noticed that they're both gone. Also my default Ubuntu video player has stopped playing because of missing dependencies. But when it prompts me to install the dependencies, I get this message:      The following packages have unmet dependencies:  gstreamer1.0-libav: Depends: libavcodec-extra-54 (>= 6:9.13) but 6:9.16-0ubuntu0.14.04.1 is to be installed                     Depends: libavformat54 (>= 6:9.1-1) but 6:9.16-0ubuntu0.14.04.1 is to be installed                     Depends: libavutil52 (>= 6:9.1-1) but 6:9.16-0ubuntu0.14.04.1 is to be installed                     Depends: libc6 (>= 2.14) but 2.19-0ubuntu6.5 is to be installed                     Depends: libglib2.0-0 (>= 2.37.3) but 2.40.2-0ubuntu1 is to be installed   I tried to sudo apt-get install vlc  I also get:  The following packages have unmet dependencies:  vlc : Depends: vlc-nox (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed        Recommends: vlc-plugin-notify (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed        Recommends: vlc-plugin-pulse (= 2.1.4-0ubuntu14.04.1) but it is not going to be installed E: Unable to correct problems, you have held broken packages.   I've tried all these commands but couldn't work :  sudo apt-get update && sudo apt-get -f install sudo apt-get install --fix-broken sudo apt-get autoclean sudo apt-get autoremove   I don't know what exactly I did that caused this issues. Please I need help I cant play any video.


How to backup and restore to different hardware in Linux?

I am running Fedora 22 on a Dell Laptop. I plan on migrating to a desktop soon which will also run Fedora 22. What is the best way to go about backing up and restoring my laptop configuration to the new system? I do not have any 3rd party backup/restore software on this system. Would dd be able to work for me? Would a system level backup work or would I need to limit dd to partitions that are not "hardware or device" specific. I am also open to any other suggestions or ideas.


Neural network to regress peaks in an image does not converge

I am trying to predict the position (x,y)-coordinates of 16 peaks in an image. The images look like the following:      The green dots are the true peak locations and the red crosses represent a prediction of this network:      I have tried out many configurations of differnt Kernel sizes, number of layers, less/ more dense/ convolutional layers and so on.  I use Adam (lr=e-3) and a dropout of 20% here but I also have tried different configurations in this parameters. I train on a batch size of 64 and aim to regress the relative coordinates (also tried with absolute coordinates).  It seems that the network is not able to train the ability of recognising a peak; instead it regresses always a kind of average.  At the moment I lack of further ideas. So I hope someone can give me a hint of what I am doing so wrong.  Can you imagine of a reason for my problems?


Junit testing assert output not being displayed on console

I am trying to implement Junit test using Spring boot I have written some simple test when I am running the ApplicationTests.groovy as junit test it showing green color bar when the test is successful and red upon errors but it is not displaying any output I am getting empty stack trace upon successful test methods though I am using assert.  import org.junit.Test import org.junit.runner.RunWith import org.springframework.beans.factory.annotation.Autowired import org.springframework.boot.test.SpringApplicationConfiguration import org.springframework.test.context.junit4.SpringJUnit4ClassRunner import org.springframework.test.context.web.WebAppConfiguration import org.junit.Assert.*; @RunWith(SpringJUnit4ClassRunner) @SpringApplicationConfiguration(classes = Application) @WebAppConfiguration class ApplicationTests {      @Test     void testAssertions() {         assertTrue(1 == 1)         assertEquals("test", "test")          def x = "42"         assertNotNull "x must not be null", x         assertNull null          assertSame x, x     }   }


Does every non-compact Tychonoff space admit an unbounded continuous function?

Let $X$ be a completely regular Hausdorff space. Such a space is also known as , or a $T_{3.5}$-space. Furthermore, let's assume that $X$ is not compact. Question. Does $X$ admit a continuous function $f: X\to \mathbb{R}$ with unbounded image? Context. It is known that if $X$ is a non-compact metric space, then $X$ admits an unbounded continuous real-valued function. This was discussed thoroughly in . Note that the same conclusion holds if $X$ is a non-compact normal space (also known as $T_4$-space).  This is because the proof using Tietze extension theorem (see the answer in the linked MSE thread by the user Espace' etale) still works. This is the motivation for asking the current question. In general, Tietze extension theorem fails for $T_{3.5}$-spaces (for example, consider ), so one cannot apply the trick above; of course, it is possible that the question has a negative answer, in which case I'd love to see a counter-example.


Symbolic link permissions don't change with chmod

I have access to a remote Linux machine where every time I create a symbolic link, it is created by default with the following permissions: lrwxrwxrwx  If I try to change the permissions of the symbolic link (i.e. not the path that it points to) using for example:  chmod g-w my_symbolic_link   chmod runs correctly (no error message is printed) but when I check the permissions again, they are still the same (lrwxrwxrwx).  I am waiting to hear from the machine administrator, but I was wondering if this is normal behavior, or if it is something specific to the box.


Hovering over the favourite button on a question gives you a tooltip with the text:     This is a favorite question (click again to undo)   Even if you haven't favourited the question.  Shouldn't it be something like Click to favorite this question?


Matrix inequality proof from Munkres' analysis text

Why is this theorem true?  If matrix $A$ has size $n$ by $m$ and matrix $B$ has size $m$ by $p$ then $$|A\cdot B|\leq m|A||B|$$  I found that somebody already provided this proof at the link below so don't bother writing an answer here.


Is there any way to merge documents together?

I'm working with a policy committee that's transitioning from a centrally-managed document to distributed management (that is, they plan to split IT responsibilities off to a separate working group, plant services responsibilities to another, etc).  I've been asked to come up with a way to merge their documents together into one large work product. Is there any way to do this in SharePoint 2013? I'm skimming over some technical details they'd have to supply, because my research suggests that this isn't possible.


I made my own .bashrc (part of code below) and in test by pressed arrows up/down: i found that  history of commands override static text of line or leaves last command and print new over it. How to fix that?  function parse_git_branch {   git branch --no-color 2> /dev/null | sed -e '/^[^*]/d' -e 's/* \(.*\)/(\1)/' }  RESTORE=$(echo -en '\033[0m') RKNAME=$(echo -en '\033[38;5;106m') RKPATH=$(echo -en '\033[38;5;229m') RKBRANCH=$(echo -en '\033[38;5;44m') RKGIT=$(echo -en '\033[38;5;250m')  pathToFolder=$PWD;  if [[ $pathToFolder =~ .*_GitRepo.* ]] then     PS1='${RKNAME}\u@\h${RESTORE} ${RKGIT}Git ${RKPATH}\W\ ${RKBRANCH}$(parse_git_branch) \n ${RKGIT}-- $ ${RESTORE} '     fi


Why does a container with fluid make different sounds at different fluid levels?

Have you ever noticed that when you are filling a container with fluid. As it approaches the top, it makes a different sound? You can tell by listening when your about to reach the top. Why is this?


Why is a conservative force defined as the negative gradient of a potential?

I'm learning about work in my dynamics class right now. We have defined the work on a particle due to the force field from point A to point B as the curve Integral over the force field from point A to B. From math I know that if a vector field has a potential, we only need to evaluate the potential at point B minus the potential at point A to get the result of the curve Integral. In the text that I'm reading, it's explained that if the integral over a force-field is path-independent, then the force field $F = -{\rm grad}(V)$, where $V$ is the potential. Why is it defined as the negative gradient? Doesn't one determine the potential from $F$ mathematically. Why do we impose the sign on the potential?


Need another phrase for fit in (as in a group)

What other word or words can be used to replace "fit in"? E.g. "I believe I will fit in with your organization."


Increase space between numbers and text in List of Figures

The template I am using for my thesis doesn't have sufficient space between the numbering of the table of figures and the wording. This results in a table that looks like:  3.17Answer presenter editor prototype. . . . . . . . . . . . . . . . . . . . . . 120  I've had a look at multiple sources but can't seem to find a solution for increasing the space between the figure number and the first letter, for instance in the example above I'd like more space between the 3.17 and the first letter 'A'.  Is there a way to add some space in?  Thanks!


I noticed what seemed to be a bug in the way the stackoverflow editor handles numbered lists. I did a search on meta for this and it didn't come up, but if it is a duplicate, I'll delete the question.  Consider the following code:  Here are some points:  1. One 2. Two 3. Three  Here are some more points which continue the theme:  4. Four 5. Five   When you actually type this into the text editor, this is the result:  Here are some points:   One Two Three   Here are some more points which continue the theme:   Four Five   In this case, the ordered list resets after the break. This is probably just an edge case (and not necessarily worth fixing), but I ran into the problem today and figured this would be a good place to raise the topic! My workaround was to use back-ticks around the numeral, but then you lose the hanging indent. (ie, 1. One)  Might this be worth fixing? Is it expected behavior? Or am I doing it wrong?


What is the max possible level in Rogue Legacy? I don't see any sort of experience bar, is level gain based on your generation or the number of monsters slain?


If the edges of the complete graph $K_{17}$ (on 17 vertices with no three collinear) are each colored one of three colours can it be proven to have two or more monochromatic triangles?


Asked to design a large banner.How should I start?

I'm asked to design a large banner 10m * 4m. I'm not sure how should I start with Photoshop. Should I create one with small size and high resolution? What is the number of PPI suitable for this size?  OR should I work with the actual size? If yes , Will Photoshop crash ? What is the number of PPI at actual size?  Thanks in advance :)


It's a bit confusing due to the nature of thinking. If I was thinking something and it turned out to be false: I have been thinking that I'm getting sufficient sleep, but it turns out I wasn't. Or should it be had since I just thought that I'm not getting sufficient sleep? I had been thinking that I was getting sufficient sleep, but it turns out I wasn't. What if I realized a few hours before the conversation that I wasn't getting sufficient sleep? I feel that "I have been thinking a lot, so my head hurts" is better off with have been. Also, "I have/had been thinking of calling you" seems to be fine with both. If we take a different example, I think if you were running for a few hours and are now walking, should you say I have been running..? But if you were doing sprints everyday and decided to jog today, I had been doing sprints... is better?


Is there a term for when a character is named after a trait they possess?  Some examples are Hiro (from Heroes or Snow Crash); a person who is constantly talking named Gabby; or a teacher named Mr. Pencil.


I am modeling a phillips head screw. What would be the best way to do this? I need to make the top look realistic. Are there any good textures for this? My current design:


Using Javascript to convert 15 char SF IDs to 18 char IDs

I'd like to create a macro for Keyboard Maestro that will take a highlighted 15 char ID and use javascript to convert it to a an 18 char ID. I understand how that conversion takes place but am a beginner at Javascript. Could anyone help in the creation of the javascript that I can use in my macro?  Thanks!


can i use 1600 MHz and 1333 MHz RAM together?

I have a Gigabyte Q2550M laptop with 2GB (1333 Mhz) and now i want to add another 4GB (1600 Mhz) ram to have a total of 6Gb RAM, but now the laptop wont boot. However, when i add the Original 2GB (1333 Mhz) to the second RAM slot, the laptop doesn't want to boot as well. What could be the problem?


I was not familiar with the term of "anecdote" in english. According to the wikipedia, anecdote is a some sort of short story with some point in it. Although in Russian language, for example, anecdote does not necessarily have to convey some wise point, it should be just funny. I quite confused about this term. So could you guys explain what is a purpose of anecdotes and where they are used ?


Photoshop CS6 Resize Rectangle with Rounded Corners

This question is about Photoshop CS6. Hopefully the feature was added in this version. Before posting I looked up Google and  and  but didn't find an answer for CS6.  So the question is: Is there a feature within CS6 or a script that allows to resize a vector element with rounded corners without using the Direct Selection Tool (white arrow tool) and not changing the border radius? What would be great would be something like simply using the transform tool or something like a grid resize tool.


Set the max width of the image and does not stretch if smaller

Hi Is there any option in includegraphics in a way that I can specify the maximum width of the figure. If the image is larger than the specified width, it should be resized to its maximum width. Otherwise, it should retain its original size (not stretching!)  All the options I have tried stretched the smaller image to its specified max size :(


I am following some tutorial and when I run this line:  sed 's/|/\/g' missing_haps_1E7.txt > missing_haps_1E7_final.txt sed: -e expression #1, char 7: unterminated `s' command  head missing_haps_1E7.txt 1:3925928:G:A|1:3929593:T:C 1:4359549:T:C|1:4360122:C:T 1:4359563:C:T|1:4360565:T:C 1:4459761:T:C|1:4461905:C:T 1:4845341:A:C|1:4858799:A:G 1:5092563:C:A|1:5092886:A:G ...   is sed here as written suppose to replace "|" with "\" or?  Thanks


How to prove that path of a charged particle in a uniform magnetic field is circular or helical?

I know that Lorentz force acts perpendicularly with the motion of the charged particle and curves the path into a circular one ,but how to show it mathematically?


How does one get started with web test automation using Selenium?

So I've been testing web based analytical software now for the past 4 years or so with mostly manual techniques. But for 2015, I've set myself the goal of getting setup and start writing automated tests and to introduce automated testing into my company.  I've done a little research and it seems that Selenium is quite big when it comes to writing automated tests, but most of the tutorials I've come across reference the Java language.  Some questions:   Is Java the primary language used for Selenium tests?  Do you recommend it over C# ?  Wat is the process of writing test scripts?  Are there Frameworks that I should use that can make the process even easier?


Yeah... um,  needs to go.    I can't find any way to edit the avatar, but I'm not sure that deleting the user is necessarily the next step.  Any ideas?  Link isn't very illustrative any longer - user had posted an offensive political/religious profile icon.  SU and SO mods - FYI      lock edit:  Sorry if this bruises some folks, but avatars aren't priority #1 in my mind. If an avatar generates a big administrative overhead (i.e. many complaints from many users) it'll be changed.  This isn't because anybody gets their rocks off changing avatars, it's because I'd like my Trilogy-time to result in something that enhances it, not strugging with issues that have nothing to do with the stated purpose.


How to remove unwanted attributes from a JSON

I have deserialized a JSON but the values are null. I suppose the issue here is the "Configurations". How can i remove/modify this so as the deserialization gets the proper values? JSON {"configurations":[{"guid":"xxxxxxxxxx","Type":"AutoCalculation","Amount":"50","In Advance Amount":""}]}  Apex class public class el_GuaranteeJSON {      public String Type;     public String Amount;     public String InAdvanceAmount;  }   Thank you.


Given $f_n \rightarrow f$ a.e. Does $||f_n||_p \rightarrow ||f||_p$ imply $f_n\rightarrow f$ in $L^p$?   Clearly this does not hold for $p = \infty$, since given functions with same hight, pointwise convergence does not imply uniform convergence.  And when $p=1$, it becomes Scheffe's lemma.  For $ 1< p <\infty$,  we have   $$\int |f_n - f|^p dm \leq 2^{p-1}\bigg(\int  |f_n|^p + |f|^p dm\bigg). $$ Using General Lebesgue Dominated Convergent theorem, we have  $$\lim_n \int |f_n - f|^p dm = \int \lim_n |f_n - f|^p dm,$$ if and only if  $$\lim_n \int |f_n|^p + |f|^p dm = \int \lim_n |f_n|^p + |f|^p dm$$ which holds from the assumption that $||f_n||_p \rightarrow ||f||_p$.   Is my argument correct? Thanks!


What is a suitable dual boot partitioning scheme (Debian and openSUSE Leap)

I have been a Debian user since several years but now would like to try openSUSE as well in a dual boot environment. Here are some thoughts:   Two root partitions.To avoid the two installations from stepping on each other I am thinking of keeping two root partitions of 50 GB each. Two home partitions, again about 50 GB each. Since application releases from the two distros are going to be different (KDE 4 versus 5) it makes sense to have separate home directories. I don't know if all applications from the two distros are compatible with one another. I would like to be cautious than sorry. One big user data partition. My concern is more around user data, which in a single boot setup resides in the /home directory. It seems eminent that a separate partition has to be created. However, it would be convenient if my personal data that is not affected by KDE release continues to remains accessible from /home. Say the mount-point for the data partition is /mnt/data, then I would create symlinks like my-docs in both the home directories. This scheme has the obvious problem of creating a symlink every time I wanted to work in a new directory in the /home directory.   Any ideas from the good folks here will be appreciated.  EDIT: The  issue clearly does not answer the question here. There are plenty of resources available on how-to-partition and how-to-dual boot. The query here is on the partitioning scheme (number of partitions, their size, role) given some specific ideas. The quick marking as duplicate is giving an impression that the question has not been properly read.


HttpsURLConnection.getResponseCode() throwing a null pointer exception

I'm currently running into an issue. I'm currently making use of javax.net.ssl.HttpsURLConnection in the code below.  I try to establish a connection but am getting an HTTP 407 proxy authentication required (as expected in this scenario) and as a result, when I try to write the payload to the connection I'm getting an IOException which I am catching. In this catch, I am trying to get the response code (which may I add works for all other HTTP responses that I have tested so far). In this instance though I'm getting a null pointer when it tries to get the response code.  java.lang.RuntimeException: java.lang.NullPointerException     at sun.net.www.protocol.http.HttpURLConnection.getInputStream(HttpURLConnection.java:1256)     at sun.net.www.protocol.http.HttpURLConnection.getHeaderField(HttpURLConnection.java:2740)     at java.net.HttpURLConnection.getResponseCode(HttpURLConnection.java:489)     at com.ibm.net.ssl.www2.protocol.https.b.getResponseCode(b.java:43)      conn = (HttpsURLConnection) url.openConnection(proxy);     ......     ......     ......     catch (IOException ioException)         {             try             {                int connRespCode = conn != null ? conn.getResponseCode() : 0;    Does anyone know why this would be occurring?


Drawing distance lines between two points

I want to be able to generate a distance line between two points on the map, which also has the distance as a label (similar to the second image seen on Google maps or in the first image from the red point to Aberdeen).I have used the measure line tool and it has provided myself with a distance, however I am yet to figure out how to produce a line with the classified distance labeled on it. does anyone know how to solve this issue. I am using QGIS versions 3.2


What evidence is there of the existence of quarks?

What is the experimental evidence that suggests the existence of quarks? How were they discovered? I'm going to assume a particle collider is involved, as it tends to be the case with most subatomic discoveries these days.  How are we able to study something so small with any type of instrument? It seems like at some point, we wouldn't be able to build an instrument on the scale required to detect something so small.  (Would be nice if this could be explained in such a way that a College Physics 1 / 2 could understand it.)


lets assume we have an iron man pointing his hand to a target and shooting few frames later as shown in the picture below:    frame 0 to 10 he will point frame 11 to 15 he will shoot, which is just a long cube with one larger face to give idea or a laser projectile   how can I add the projectile cube only on frame 11? I don't what it to exist before that  thanks


Gravity bends space, so how can space have only 3 dimensions?

Due to the laws of gravity and electromagnetic attraction (decreases with $\frac{1}{r^2}$) we know that space should be limited to 3 dimensions. At the same time we know that gravity bends space. All visualization of that are basically elastic 2D membranes where heavy balls are placed to create "gravity wells" of various sizes. The watcher is left to imagine all that happening with one more dimension and then you've got the way how gravity bends space. However, the membrane visualization works by distorting the 2D plane into the 3rd dimension. If I go 1 dimension higher, logically 3D space should be distorted into the 4th dimension. Basically, gravity distorts space into a dimension that shouldn't exist according to the laws of gravity? Question: where does this logical chain of arguments have a hole? (Assume I have a lot of popular science knowledge and a background in Mathematics and computer science, but no physics)


Using a pgfplots-style legend in a plain-old tikzpicture

I am using a plain-old tikzpicture to produce a pie-chart-like plot. Now, all other plots in my paper are handled using pgfplots (which doesn't do pie charts) and have their legend typeset by pgfplots.  It would thus be great if it were possible to create, re-using as many keys like /pgfplots/area legend as possible, to create a pgfplots-style legend in TiKZ. Has anyone done anything like this before?


Are the two strands of the double helix collectively called the DNA molecule, or is each individual strand the DNA molecule?


I am having difficulty understanding $\sqrt -i$ from other sources (such as Wolfram Alpha) I have found it to equal $-(-1)^\frac{3}{4}$ but do not understand the steps in to reach this conclusion. I know it may be trivial but any assistance would be greatly appreciated.


What Force Power did Kylo Ren used to stop blaster shots?

At the start of the movie, Poe (is that his name?) shot at Kylo Ren, who then stopped the shot and held it in midair.  What Force Power is it? Is it a uniquely different power we haven't seen before or did Kylo merely used a standard power creatively? Are there any constraints on its effectiveness that prevented the same being done against Chewbacca's attack on Kylo?


Let $\tau$ be the sets $U \subset \Bbb R$ for which $U = \emptyset$ or $\Bbb R \setminus U$ is countable. Show that $\tau$ is a topology for $\Bbb R$.

Let $\tau$ be the collection of sets $U \subset \Bbb R$ for which $U = \emptyset$ or $\Bbb R \setminus U$ is countable. Show that $\tau$ is a topology for $\Bbb R$.  Firstly I need to make sure that $\emptyset \in \tau$ and $\Bbb R \in \tau$. The first case is given in the problem statement, but I'm not sure if $\Bbb R \in \tau$ since I only have $\Bbb R$ with $U_i$'s subtracted? Also I would need to show that the arbitary unions of $U_i$, $i=1, \dots, n$ where $\Bbb R \setminus U_i$ is countable is in $\tau$. So in essnece $\bigcup_i(\Bbb R \setminus U_i)$ would have to be in $\tau$? How can I show this? I know that the unions of countable sets are countable so wouldn't that tell me immediately that $\bigcup_i(\Bbb R \setminus U_i)$ is countable? $\Bbb R$ clearly isn't, but is the difference?


How to calculate $I=\int_0^{\infty} \frac{dx}{x^4+a^4}$

I understand it is an even function, which indicates $I=\frac{1}{2}\int_{-\infty}^{\infty} \frac{dx}{x^4+a^4}$  What should I do in the next step?


Need to proof by induction (calculus1 n and n+1)

I need to prove that for every natural n that happens and the prove needs to be by induction, I wont prove for n=1 because its obvious,so lets move to n and n+1 $$ \frac{(2n!)}{(n!)^2} ≥ \frac{(4^n)}{(2n+1)} $$ the assumption for n+1 $$ \frac{(2n+2)!}{(n+1)!^2} ≥ \frac{(4^{n+1})}{2n+3} $$ now I dont now how to progress,I tried this for n+1 $$ \frac{(2n+2)(2n+1)(2n!)}{(n+1)!^2} ≥ \frac{(4^{n}4^1)}{(2n+1)+2)} $$ and had a suggestion to use $ 2n! = (n!) \prod _{n=n}^{2n}\:n\cdot )! $ but cant see how it helps,ty.


Does the order of variables matter for a quantum Lagrangian in the path integral formula for quantum mechanics?

For a single particle or field, I can't see how the  depends on the order of terms in the Lagrangian. It seems that you integrate the classical Lagrangian to get the action on a path, then integrate over all paths.  Since we use the classical Lagrangian (I presume?), does this mean that the order of terms does not matter?


What novel had a boy who did backward every motion he'd made all day?

For example, the boy had to walk his whole day backwards as a way to untwist himself.  His need to repeat all his daily actions in reverse was almost like watching a movie in reverse.  The boy was the ONLY  person in the novel who had to do this.   I want to cite this behavior and author in an essay I am writing. I believe the novel was published before 1990.