Well I do not remember my id and password as I never used it and all of sudden the activation lock pops up I have an I phone 6 plus i searched every where now I need some help.


Proving that Order for N is Anti-symmetric

I'm having trouble deriving the following fact from the basic properties of $+_{\mathbb{N}}$ and the definition:  Definition. $\forall n, m \in \mathbb{N}: (n \geq m) \leftrightarrow (\exists a \in \mathbb{N}): n = m + a$. Fact. $\forall a, b \in \mathbb{N}: (a \geq b ~\land~ b \geq a) \rightarrow a = b$.  I've tried several different strategies, but none works. I think the fact that 0 isn't the successor of any natural number is the key both in the base case and the inductive step, but I keep going in circles trying to make use of that (and other basic facts about addition on $\mathbb{N}$). I would show you my notes, but there is really nothing of substance in them. I've made almost no progress since yesterday.


How can I integrate this by parts? It seems to become recursive. I'm familiar with the classical solution, and cannot use that here due to the constraints of this class.  Here's the integral (to infinity).   $$\int_0^\infty{e^{-x^2}} dx$$  I'm having trouble finding the indefinite integral first.  Thanks!


concatenate strings with backslash in Python 2.7

When passing the input      A = 'hello' B = 'by' sum = A + '\\' + B   I get  'hello\\bye'   I WOULD like to get  'hello\bye'   What do I have to change?


Find all positive integer triples $(a, b, c)$ such that $(1+ \frac{1}{a})×(1+\frac{1}{b})×(1+\frac{1}{c})=2$?

I was thinking about removing the brackets and denominators but i am not sure how I would follow. How can I do this?


Is it correct to have 2 posessions following each other in in one statement


Is there an application/way to fix or confine bad sectors with Ubuntu?

My hardisk has 1880 bad sectors and I am beginning to realize that it about to fail.  Is there a way using my Ubuntu OS to fix or at least partition off the part of my HD where most of these sectors are?


Suppose I want to say that the (base 10) representation of a million contains 6 zeros, but for whatever reason, I want to use the symbol 0 rather than the word. Is there any rule on how to attach the "s" to make 0 plural? I have seen "0-s", "0's" and "0s" in various papers, but, sadly, it is not the case that these are always written in perfect English).  Of course, this issue is not unique to zeros. I might want to talk about how many times the number 42 appears in a book by Douglas Adams, or how many times the variable x appears in an equation. In general - how does one attach the suffix "s" to make a plural of something which is not a word?  Note: I am not sure if there is any rule about this, but nonexistence of such rule would also be useful to know about. Likewise, if making non-words plural is bad English, then that would be good to know too.


I am in the process of writing string split functionality and realized that split() method can take regular expression. I should split it by whitespace.  I had found following regular expression construct can do that.  \p{Space}   How do I incorporate this in my String split() method.


EDIT: tl;dr; How to turn off Snap Assist (that is the word I was looking for)  Since Windows 10 there is this annoying behaviour from which I cant find the name off.  Previously, when I press the Windows-key + (left or right), one and only one window would move to the designated position. When I do this now, all other windows that I have will move to the opposite site and I need to select one of them in order to continue.  I don't want to have this effect anymore, but I don't know how this procedure is called. Can anyone here help me?  Below you can see what I was trying to explain. Hope this helps


Some Background and Motivation: In , it is shown that an integral domain $D$ such that $F \subset D \subset E$, $E$ and $F$ fields with $[E:F]$ finite, is itself a field.  However, a significantly more general result holds and seems worthy, of independent address; hence, Let $F \subset E \tag 1$ be fields with $[E:F] < \infty; \tag 2$ if $R$ is a ring such that $F \subset R \subset E, \tag 3$ show that $R$ is in fact a field.


I am not talking about contacting a user about a question/answer on a site. It's just for other information or asking for some personal advice, or just commenting a user on his/her 'about' profile! How can I leave a message for a user?


DirectX 11 is installed but programs say DirectX 9.0c is needed

I'm running Windows 8.1. I'm trying to run  (and several other similar programs) but they all fail to open because they don't recognize my version of DirectX.  I get the following error when I try to run 3D_Model_Viewer:     DirectX 9.0 installed (589824). Requires DirecX 9.0c (December 2005) or later.   and this error when I run AssimpViewer:     Failed to initialize Direct3D 9 (2)   I've run dxdiag.exe and confirmed that, in fact, DirectX 11 is the installed version, not 9.0 like the programs are saying.  What might be happening here? Can I get these programs to run under DirectX 11?


Null pointer exception while trying to read file from Google cloud storage using Spring Boot

I am trying to use Spring Boot to read a file stored in GCS using this tutorial:  My code as follows: Resource gcsFile = resourceLoader.getResource(gcsPath);             //InputStream inputStream = gcsFile.getInputStream();             return StreamUtils.copyToString(                     gcsFile.getInputStream(),                     StandardCharsets.UTF_8);  resourceLoader is injected as a dependency using @Autowired annotation. The gcsPath variable is a String to the gcs file location (example: gs://REPLACE_WITH_YOUR_BUCKET/my-file.txt). I get the below exception: java.lang.NullPointerException: null         at com.google.common.base.Preconditions.checkNotNull(Preconditions.java:878)         at com.google.cloud.storage.BlobId.of(BlobId.java:109)         at org.springframework.cloud.gcp.storage.GoogleStorageResource.getBlobId(GoogleStorageResource.java:108)         at org.springframework.cloud.gcp.storage.GoogleStorageResource.resolve(GoogleStorageResource.java:113)         at org.springframework.cloud.gcp.storage.GoogleStorageResource.getInputStream(GoogleStorageResource.java:167)   During debugging, I found that the following line is what triggers this exception: InputStream inputStream = gcsFile.getInputStream(); I have not been able to figure out how and why this is happening. Can someone please help?


alias g='git' and have bash completion still work

For an alias to git itself, eg. alias g=git, you'll find your answer more easily here.  For git subcommand aliases, eg. alias gco = "git checkout", look .    I type git far too often, so I've aliased it:  alias g='git'   However, now I can't do:  g comtab  and have the completion present me with:  g commit  How do I get completion running again?    Duplicate differentiation  This  suggests keeping the specific case with a with a link to the more generic question. I've added the link to the more generic case in this edit.  The asserted duplicate question is more generic - but mostly about aliases to git subcommands, rather than an alias to git itself.  This question is about the specific case where the alias is to git itself.  In the marked duplicate, the git-itself case is only answered in the 4th shown answer, and in a comment to the first listed answer. Reading another comment is required for the second piece of the puzzle (source /usr/share/bash-completion/completions/git) to get it working via that method.  Addressing the links in the comments below:   @ewcz's link is the marked duplicate and has already been addressed Remy J's links   This is question as asked (and answered) is also about git subcommands This is an even more generic question about non-git aliases, which doesn't isn't near to the best solution in this case This is the same as @ewcz's link (already addressed)


Tried using Katoolin without knowing what it did, Ubuntu is broken now

Some background info  I'm running a dual boot with Windows 10 and Ubuntu 20.04 I did something stupid like this because I've used Windows my whole life so I didn't realize what apt can do if I'm not careful (I guess sudo is needed for a reason) No, I did not read the documentation, yes it wasn't a good idea, no I will not do it again. Why I would want to use Kali is because I was asked by a teacher to install Kali, so I thought about just using Katoolin to install Kali tools on Ubuntu  What happened:  I ran Katoolin 3 and told it to install everything I ran sudo apt-get update and sudo apt-get dist-upgrade It began to throw a bunch of errors, so I used sudo apt --fix-broken install, then used sudo apt-get dist-upgrade again Repeated this process until I got tired of the errors, so I tried restarting my laptop, only to be greeted with "Kali GNU/Linux" instead of the usual "Ubuntu" on the Grub menu After selecting "Kali GNU/Linux", it showed the following messages:  [FAILED] Failed to start Anonymizing overlay network for TCP [FAILED] Failed to start Anonymizing overlay network for TCP [FAILED] Failed to start Anonymizing overlay network for TCP [FAILED] Failed to start Service for snap application canonical-livepatch.canonical-livepatchd   I selected the Ubuntu recovery option and told it to resume normally, this time it didn't show anything at all, just a blinking white rectangle. Pressing the power button shows a log though.  What I need help with:  All I want is to at least get my Ubuntu partition working, I have no important data there so I'm okay with doing a reset, but I'm not sure how to do that while making sure my Windows install stays safe. I've seen some threads explaining it but I'm not sure if the presence of Katoolin will mess things up.  If there is any other information you need, please let me know. Thanks in advance.


How to find files which have been modified in the last 50 days?

How can I find all the files which have been modified 50 days before?  I'm trying this:  find -maxdepth 1 -mtime -50   is it the right command to find files that have been modified in the last 50 days?


could not install git via apt-get in debian 10

/tried commands with sudo/ apt-get update & upgrade apt-get install git apt-get -f install git bash: aptitude: command not found


Proving if $(a, b)=1$, then $\gcd(\frac{a^n-b^n}{a-b}, a-b) = \gcd(n, a-b)$

If $(a, b)=1$, prove that$$\gcd\left(\frac{a^n-b^n}{a-b}, a-b\right) = \gcd(n, a-b).$$   So since $a$ and $b$ are relatively prime that means $\gcd(a,b)=1$. Now, my question is, what theorems would I use to prove this statement? I was thinking something along the lines of using Euclidean algorithm but I wasn't quite sure how I would use it to prove this.


How to compute $\prod\limits^{\infty}_{n=2} \frac{n^3-1}{n^3+1}$


Is it possible to debounce a MacBBook keyboard via a script? I have the  problem wherein my keyboard inserts two "b" characters abbout half the time (also occasionally the r and i characters, but less often). The keyboard is bbuilt into the case, which makes the replacement a cool $1015 ($680 for parts, and $335 for labor). Hence, I'm hoping for a software solution.


Can a referee request a paper referenced in the reviewed paper?

If you review a paper which relies on results some other paper and you do not have access to that paper, is it acceptable to contact the editor and ask whether the author can provide a copy of the referenced paper? Are requests like this reasonably common?  Or should the referee simply take the word of authors that their conclusions based on the referenced paper are correct, even without seeing that paper?


Running two MySQL servers that use the same data directory

The situation  I have two MySQL instances, deployed on two different remote machines. Both MySQL instances access the same data directory, which is stored on a persistent volume (this volume is provided by Gluster, but that's not really relevant, I'm only saying this for the sake of completeness).    I'm aware that it is strongly discouraged to run two MySQL servers using the same data directory, but it's not an impossible thing to do, as long as one takes the right precautions. In order to do this, I followed the steps suggested by the official documentation (  ), more specifically in the paragraph named Warning. To sum it up:   I'm using MySQL 5.6. I'm using MyISAM as default engine, as required. I specified log file names that are unique to each server. One server is going to be read-write, while the other server is going to be read-only.     So, I set everything up, I imported a test database and everything worked flawlessly. Both servers could read data from the same data directory.  The problem  Now comes the problem. As soon as one server performs a write (by inserting a row into a table), the other server marks the table as corrupted for itself. After looking into the problem for a while, I found out why this happened. Basically each server holds its own metadata describing each table. So, as soon as the first server updated a table, it also updated its own metadata, but it didn't update the metadata of the second server. As the second server checked the table, it noticed a mismatch between the current number of rows in the table and the number of rows it had previously saved in its metadata, therefore it marked the table as corrupted. After some research, it turns out that the metadata is saved inside a default database named information_schema. At first, I thought of making the two server share the same information_schema, but this was nowhere to be found. As I later discovered, it's saved inside the memory of the program and there's no way you can manually update or access it.  The questions   Since the documentation tells you exactly what precautions to take, I was expecting this to actually work...or else, what's the point of that guide in the official documentation? If this couldn't be done, why would it tell you how to do it in the first place? Most importantly, do you know how to make this work, using MySQL? If not, do you know of any other DBMSs that allow you to obtain this result (that is, running two servers that use the same data directory)?   Just keep in mind that I don't want to set up master-slave replication. All other suggestions are welcome, thanks everyone for the help.  EDIT: I ended up not doing it, as everyone discouraged me from doing it. Thanks everyone for your input!


Please explain how to use "only" in this sentence

In the BBC website  a person gives some examples of the phrase "clean up one's act" and one example is:     I used to drink a lot of alcohol but when I got ill, I decided to clean up my act and now I only drink cola!   My question is: is it correct to use only before the verb it modifies?  Generally we should place “only" next to the noun, subject, verb, or phrase we're trying to modify.  So, I think it should be like I drink only cola. Am I right?  And is the sentence I drink cola only right grammatically?  I saw in many shopping malls the price was written as 1000₹ only etc. Is it right to say like this? Please explain to me the grammar relative to this.


Photoshop makes images blurry when transforming

I made a video to explain whats happening:   The image looks good until I press enter, then it gets really blurred. Is there any way to stop this?


How can I detect the model of my graphics card?

I know of many ways to get a rough idea of my graphics card model. Here are two examples (instructions for Windows 7):  Method 1  1) Click start  2) Type dxdiag and press enter  3) Go to the Display tab and check the Name property.  Method 2  1) Click start  2) Right click on Computer and select Properties  3) Click on Device Manager  4) Expand the Display adapters to get a list of video cards  Problems  Unfortunately both these methods suffer from problems:  1) This is a very inaccurate measure. For example, if I have an ATI Radeon 4830, both methods will show that I have an ATI Radeon 4800 series i.e. there is no way to distinguish between different models within the 4800 series or any other series for that matter.  2) This is dependent on having the correct driver installed. If I have an incorrect driver installed, there is no way for me to find out what the correct driver should be.  Question  Is there any way for me to be able to determine the exact model of a graphics card without relying on having the correct driver installed. I realise there are ways to do this such as checking the documentation that comes with the computer or perhaps opening it up but I am interested in seeing if there is way of doing this with software.  Edit: Please note the requirements carefully. If the method relies on reading from the driver then it is ineligible.  If there is no program that can do this, is there a manual method? Some kind of website database etc?  Thanks!


What is the probability that the shooters will hit the target at least once

Three shooters shoot at the same target, each of them shoots just once. The first one hits the target with a probability of $70\%$, the second one with a probability of $80\%$, and the third one with a probability of $90\%$. What is the probability that the shooters will hit the target  a) at least once?  b) at least twice?  I don't understand well this problem. If each shooter shoots at the target once, how can each of them shoot at it twice?  Do you know how to solve this problem?


UV Mapping External Texture Changes to a Black Diffuse in Texture Paint mode

Okay, so I've seen the other answers to this here in Blender Exchange. However, as far as I can figure out those textures were not saved when created in texture paint mode. I added an external texture to my object:   ...then I switched to texture paint mode and the texture changes to a complete black texture:   However if I switch back the texture while in texture paint mode it still keeps my object black:     Is this a lighting problem? Or am I not importing the external image correctly? I have tried packing/saving the image after importing it and putting it on my UV Map and then switching to texture paint mode, but it still occurs.


Emission Material should not emit light (Cycles)

I have a scene where I want to use Objects with a nice Neon glare, but without actually emitting Light.  Is there a way in cycles to do that?   I use an Emissive Shader and put in the glare with the compositor. This is actually working fine already, but as I mentioned my scene gets lighten up by the emissive objects too. How can I change that     ((In Eevee it is already working, but I want cycles))


How has no one else ever survived the Killing Curse before Harry?

In the Harry Potter books, we learn that Harry survives the Killing Curse thanks to his mother's willingness to sacrifice herself for him. This causes the curse to backfire on Voldemort, and leaves Harry with a scar on his forehead.  Has anyone else ever survived a Killing Curse in the Potter-verse? I find it hard to believe that no other witch or wizard have ever put themselves in harms way for someone they love before by choice. As such, was there some mitigating or special circumstances about the event in question?


I Would like someone to verify this proof, since I could not find it in my professors notes on properties of isomorphic groups.  Again, the statement: is $G\cong H$. $G$ is cyclic if and only if $H$ is cyclic. I will only demonstrate ($\Rightarrow$)  Proof. $G\cong H$. Suppose $G$ is cyclic. Then $G=\langle a\rangle $ for some $a\in G$, i.e. $c\in G\Rightarrow c=a^{s}$, for some $s\in \mathbb{Z}$. We want to show that $H=\langle b\rangle$ for some $b\in H$.  Pick any $h\in H$. Then $h=\phi (g)$ where $g\in G=\langle a\rangle$, i.e. $g=a^{k}$ for some $k\in \mathbb{Z}$.   Now, since $G\cong H$ we have that $h=\phi (g)=\phi (a^{k})=\phi (a\cdot a\cdots a)=\phi (a)\phi (a)\cdots\phi (a)=\bigl(\phi (a)\bigr)^{k}$. Furthermore $\phi (a)\in H$ since $a\in G$ and $\phi \colon G\rightarrow H$. Put $b=\phi (a)$ and we finally have that $h=\bigl(\phi (a)\bigr)^{k}=b^{k}$ for some $k\in \mathbb{Z}$. Thus $H=\langle b\rangle$, meaning $H$ is cyclic.


Simplify $\arctan (\frac{1}{2}\tan (2A)) + \arctan (\cot (A)) + \arctan (\cot ^{3}(A)) $

How to simplify $$\arctan \left(\frac{1}{2}\tan (2A)\right) +  \arctan (\cot (A)) + \arctan (\cot ^{3}(A)) $$ for  $0< A< \pi /4$?  This is one of the problems in a book I'm using. It is actually an objective question , with 4 options given , so i just put $A=\pi /4$ (even though technically its disallowed as $0< A< \pi /4$) and got the answer as $\pi $ which was one of the options , so that must be the answer (and it is weirdly written in options as $4 \arctan (1) $ ).  Still , I'm not able to actually solve this problem. I know the formula for sum of three arctans , but it gets just too messy and looks hard to simplify and it is not obvious that the answer will be constant for all $0< A< \pi /4$. And I don't know of any other way to approach such problems.


I'm trying to 'deep copy' a string so that I can perform operations on one copy, while retaining the original copy. This is the base example that I've got and for some reason the strncpy call causes a segfault. Please help #include <stdio.h> #include <string.h> #include <ctype.h> #include <stdlib.h>  int main() {     char* stringA = "someVeryinTeresTingString";     char* stringB = malloc(sizeof(char) * strlen(stringA));          printf("A: %s, B: %s\n", stringA, stringB);          for (int i = 0; i < strlen(stringA); i++) {         stringB[i] = tolower(stringA[i]);     }          printf("A: %s, B: %s\n", stringA, stringB);          strncpy(stringA, stringB, strlen(stringA) - 1);          printf("A: %s, B: %s\n", stringA, stringB); }


If $f_1, f_2, f_3,\ldots$ is the Fibonacci sequence proof $f_1^2 + f_2^ 2 + \cdots + f_n^2 = f_n f_{n+1}$.

I'm assuming this is using strong induction/ regular induction. However, besides the "base case" I'm really confused with the inductive steps in my notes.  The inductive steps in my notes use the alpha (golden ratio) but I'm confused on how that connects with the proof and how the it's used.


How to get core temperature of haswell i7 cores in i3status

I want to use  to display my CPU-Core temperatures (haswell i7). However the setting:  order += "cpu_temperature 1" #... cpu_temperature 1{         format = "T: %degree °C" } #   doesn't display the correct core temperature. The numbers it shows seem to correspond to the value xsensors shows for temp1, if I change the 1 to 2 above it corresponds to xsensors temp2. Trying 3 or 4 doesn't have any effect. However I want to get the true core temperatures of all 4 cores with i3 status. How can I do this?


How do i add a string to the List on the start of the List?

I have this code:  for (int i = 0; i < Maps.Count; i++) {      string startTag = FirstTags[i];     string endTag = LastTags[i];     startIndex = Maps[i].IndexOf(startTag);     while (startIndex > 0)     {          endIndex = Maps[i].IndexOf(endTag, startIndex);         if (endIndex == -1)         {             break;         }         string t = Maps[i].Substring(startIndex, endIndex - startIndex + endTag.Length);         if (i == 0)         {             imagesSatelliteUrls.Add(t);         }          position = endIndex + endTag.Length;         startIndex = Maps[i].IndexOf(startTag, position);      }      imagesSatelliteUrls = imagesSatelliteUrls.OrderBy(q => q).ToList();   So the first itertion/loop i = 0 Then its getting into a while loop. Then i did:  if (i == 0) {     imagesSatelliteUrls.Add(t); }   So in the end imagesSatelliteUrls contain 9 files. I want to add another index to the beginning of the imagesSatelliteUrls List. A string so index 0 will be for example: "Group 1" And then the rest 9 index will be the files.  But how do i add only once and to the beginning of the List the string: "Group 1" ? So in the end the List should look like:  index[0] "Group 1" index[1] file 1 index[2] file 2 . . . . index[9] file 9   So i know that "Group 1" is from 1 to 9.


What is the distribution of order statistic of Uniform distribution?

I know from a theory that if $X_1,X_2,...,X_n$ be iid from continuous Uniform(0,1), then k-th order statistic $X_{(k)}$ is Beta$(k,n-k+1)$.  Now, $X_1,X_2,...,X_n$ be iid from continuous Uniform$(a,b)$, where $a=\mu-\sqrt{3}\sigma$ and $b=\mu+\sqrt{3}\sigma$. I would like to know that what is the distribution of $X_{(k)}$? Can I apply the theorem?


this is similar to some other Qs here, but I'd not been able to get any of those to work, even just to mount the drive, let alone mount it every time.  I have had some success with this guide - I have the exact same drive   It works pretty well for me at least in terms of mounting a drive by running a command at terminal. I ended up with this slightly modified command:  sudo mount -o soft,intr,rsize=8192,wsize=8192 192.168.1.5:/nfs /media/nfs/   However, I can't get this to connect automatically on startup  I've basically stuck the command in a file ConnectNAS.conf that i've saved in /etc/init/  script looks like this  script sleep 10 sudo mount -o soft,intr,rsize=8192,wsize=8192 192.168.1.5:/nfs /media/nfs/ script   So far as I can tell, that script does absolutely nothing. Any suggestions?


I'm late to the Borderlands 2 party, but I picked up the Season Pass for a steal.  I'm still only in the teens as far as my level is concerned.  However, there are now 3 DLC packs out and I've got them all installed.  Sometimes it's tempting to go away from the main quest and just jump into something new and potentially interesting.  In BL1, I played through the DLC between playthroughs of the game, treating the add-ons like continuations of the game post-final-boss.  I'm not sure if this is a good idea in BL2 (or even if it was smart in BL1, honestly...)  Is there a recommended level for starting the DLCs?  Will I encounter enemies that are too hard if I go early, or too easy if I go late?  Are there some weapons or quest rewards that I really can't get the most of until after I'm a certain level?


Consider the following sequence, where the two consecutive terms are positive and the next two are negative, and so on:  $$ a_n = 1 , 1, -1 , -1 , 1 , 1 , -1 , -1 , 1 ...$$  I've managed to think up some way of writing the sequence:  $$a_n = (-1)^\left \lfloor{\frac{n}{2}}\right \rfloor$$  $$ a_n = \sqrt2 \cdot\frac{d^n}{dx^n} (\sin x) ,  \text{at }x=\frac{\pi}{4}$$  Are there other ways that this sequence be written as? I would imagine there is a way to write it implicitly but I can't think of it.  Edit: Also adding this ugly one I forgot to initially:  $$a_n=\begin{cases} 1 & \text{ if } n \text{ is divisible by 4};\\1 & \text{ if } n-1 \text{ is divisible by 4};\\-1 & \text{ if } n-2 \text{ is divisible by 4};\\-1 & \text{ if } n-3 \text{ is divisible by 4}\end{cases}$$


I'm not a Windows guy. And all my working life was managing Mac and Linux. Why should I have a Windows domain controller?  I know what  is, but I'm not a Microsoft expert. And on paper everything is beautiful, but the reality that I have, is that it does't work, and it is not helping me doing my job. That's why I am thinking, or not, to shutdown the domain controller.  I only see disadvantages.  What I have:   90 computers to 90 people. Five printers, login is different and not centralized, because it's difficult to use a strong password in a printer. 1/3 uses  and the other use a Linux mail server. All our business applications run on Linux server. Our files are in a Linux . All the computes are different (it's a nightmare) Some have laptops and are always moving (inside and outside the company) We are behind a Cisco Adaptive Security Appliance (ASA) firewall  is on a Cisco router and I'm planning to move  to a switch (I'm not authorized to manage the router)   In my point of view:   It's just another thing to go wrong. A machine in a domain is slower to login. Less stuff is better. And less work too. We have a  licence, but it's not a very good machine and I'm removing all the applications from the Windows servers. I'm planning to buy new laptops and they have Windows 8 and in a few days Windows 8.1, and I don't know if Windows 8 behaves well with older servers! I don't like to spend money on Windows licences and servers.   For me is just a extra server consuming 400 watts... Am I wrong?


Limit of an integral $\lim_{n\to \infty}\int_{1385}^{2017}f(nx)\,dx $

Suppose $f(x)$ is continuous function $$f:[0,+\infty)\mapsto\mathbb{R}$$ and $$\lim_{x\to \infty}f(x)=1$$ how to find $$\lim_{n\to \infty}\int_{1385}^{2017}f(nx)\,dx $$  Honestly, I have no idea for a start. can someone help me? thanks in advance.


In subshell how do you get its process id?

I know I can get process id of the main shell by $$, but how do you get PID of subshell created by e.g. ( ... ) from within the block?


I wanted to convert text in a JTextArea into voice but I seem to keep getting an error at the same line.  Voice voice;     VoiceManager vm = VoiceManager.getInstance();     voice = vm.getVoice(VOICENAME);      voice.allocate();     try{         voice.speak(voice_txt.getText());     }     catch (Exception e){     JOptionPane.showMessageDialog(rootPane, e);}   This is the error I keep getting  Exception in thread "AWT-EventQueue-0" java.lang.NullPointerException     at FrameTextToSpeech.jButton1ActionPerformed(FrameTextToSpeech.java:75)   The error points to this line  voice.allocate();


Find function not working with vector of strings

I have an assignment where I need to go through a vector of strings.  However my function is not working correctly.  When I am trying to compile it, I am getting an error "no member named 'find' in"std::__vector........  I'll include my header file as well as this function from my implementation file.  Can someone help me track down the issue? Not sure why this won't compile with these find functions...   #include <iostream> #include <fstream> #include <string> #include <ctype.h> #include <sstream> #include "DictionarySet.h" #include <cstdlib> #include <vector> using namespace std;   bool DictionarySet::Contains(string word){    if(Standard.find(word) != Standard.end())     return true;   if(User.find(word) != User.end())     return true;   if(Temporary.find(word) != Temporary.end())     return true;    if(isupper(word[0]))   {     word[0] = tolower(word[0]);      if(Standard.find(word) != Standard.end())         return true;     if(User.find(word) != User.end())         return true;     if(Temporary.find(word) != Temporary.end())         return true;    }      return false; }   here is the header file if you need it  #ifndef _DICTIONARYSET_H #define _DICTIONARYSET_H #include <vector> #include <string> //*** include suitable STL container using namespace std; //*** Deal with namespace    class DictionarySet {     const char * const StandardDictionary;     char * UserDictionary;     string DictionaryPath;      void ReadDictionary(const char * const DictionaryName, vector<string> &Set);  public:     /*** STL container ***/ std::vector<std::string> Standard;     /*** STL container ***/ std::vector<std::string> User;     /*** STL container ***/ std::vector<std::string> Temporary;      bool Contains(string word);     void Add(string word);     void Ignore(string word);     void Initialize();      DictionarySet(const char * const SD = "/usr/share/dict/words", const char * const UD =     "_Dictionary");     ~DictionarySet(); };   #endif


I made a small kernel module called hello.ko, and inserted it via insmod command and removed it via rmmod command.   Now I want to insert this module via the modprobe command.  I copied the hello.ko file to /lib/modules/4.13.0-31-generic/ directory and the keyed in the command sudo modprobe hello.ko in the linux terminal and got the following error :  modprobe: FATAL: Module hello.ko not found in directory /lib/modules/4.13.0-31-generic   Kindly let me know where I am going wrong and how to insert a kernel module via the modprobe command.


I've got my mom's computer running Ubuntu 12.04 LTS. It's been working just fine but all of the sudden syslog has been filling up. And by filling up I mean I just deleted a /var/log/syslog that was 400GB in size. Yes - Gigabytes.  While I'm sure there was some useful information in there, I'm not sure that 400GB is any kind of information to sift through. And what's really amazing about it is that it happened within a period of 8 hours - I had ran df around noon, and between then and now her drive filled up 30% (from just under 70% to 100%).  What could be causing this and how could I fix it?`  EDIT Looks like the usb is the offender:  Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157829] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157836] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157842] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157849] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157857] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157863] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157870] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157877] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157884] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use Sep  8 08:52:10 pamela-desktop kernel: [ 6198.157891] usb 1-3: usbfs: process 1500 (demond_nscan) did not claim interface 3 before use


What would I prefer - an over-fitted model or a less accurate model?

Let's say we have two models trained. And let's say we are looking for good accuracy.  The first has an accuracy of 100% on training set and 84% on test set. Clearly over-fitted. The second has an accuracy of 83% on training set and 83% on test set.   On the one hand, model #1 is over-fitted but on the other hand it still yields better performance on an unseen test set than the good general model in #2.   Which model would you choose to use in production? The First or the Second and why?


Select values that have different rows matching different conditions?

This is a canonical question on how to perform a  using a RDBMS as a result of  on Meta. If you need to add more informations, please do not post new answer, but instead edit the community wiki answer.     Consider this table:  | student | course  | +---------+---------+ |  Adam   | Math    | |  Adam   | Science | |  John   | Math    | |  John   | Science | |  Jane   | Math    | |  Jane   | Physics |   I want to pull all students who are taking both math and science. This means Adam and John should be returned.


agsm bibliography style displaying all authors in text without using \citep*

Evening,  I have two references in my bibliography file that display all the authors instead of (Author et al., year)  I have this at the start of my file:  \documentclass[12pt]{article} \usepackage[round]{natbib} \begin{document}  \citep{Lloyd2009, Mainprice2014a, Mainprice2014}  \bibliographystyle{agsm} \bibliography{transfer}  \end{document}     (Lloyd et al. 2009; Mainprice et al., 2014a, 2014b)  I do not want to force single authors throughout my document as I also have a lot of two author papers that correctly display as (Author1 and Author2, year).  The Mainprice paper displays all authors and from what I can see is no difference to the Lloyd paper that displays as (Lloyd et al., 2009).  @article{Lloyd2009, author = {Lloyd, Geoffrey E. and Butler, Robert W.H. and Casey, Martin and Mainprice, David}, journal = {Earth and Planetary Science Letters}, number = {1-2}, pages = {320--328}, title = {{Mica, deformation fabrics and the seismic properties of the continental crust}}, volume = {288}, year = {2009}}  @article{Mainprice2014, author = {Mainprice, D. and Bachmann, F. and Hielscher, R. and Schaeben, H.}, doi = {10.1144/SP409.8}, journal = {Geological Society, London, Special Publications}, pages = {1--21}, title = {{Descriptive tools for the analysis of texture projects with large datasets using MTEX: strength, symmetry and components}}, volume = {409}, year = {2014}}  @article{Mainprice2014a, author = {Mainprice, D. and Bachmann, F. and Hielscher, R. and Schaeben, H. and Lloyd, G. E.}, journal = {Geological Society, London, Special Publications}, pages = {1--48}, title = {{Calculating anisotropic piezoelectric properties from texture data using the MTEX open source package}}, volume = {409}, year = {2014}}   My question is similar to this unanswered question, but due to being new to StackExchange, I do not have the sufficient reputation to ask if she found a way to fix it.   I also have other references where the first author and year are the same, but they come up as (Author et al., 2016a, 2016b)  Thanks in advance, Amicia


It's showing this every time. (i.e., without -a or -p options)    fsck exited with status code 4   The root filesystem on /dev/sda5 requires a manual fsck.


Is it possible to import users by using CSV file? or something like a LDAP connection to import all users?


Computing $ \int_0^\infty \frac{\log x}{\exp x} \ dx $

I know that $$ \int_0^\infty \frac{\log x}{\exp x} = -\gamma $$ where $ \gamma $ is the Euler-Mascheroni constant, but I have no idea how to prove this.  The series definition of $ \gamma $ leads me to believe that I should break the integrand into a series and interchange the summation and integration, but I can't think of a good series. The Maclaurin series of $ \ln x $ isn't applicable as the domain of $ x $ is not correct and I can't seem to manipulate the integrand so that such a Maclaurin series will work.   Another thing I thought of was using $ x \mapsto \log u $ to get $ \int\limits_{-\infty}^\infty \frac{\log \log u}{u^2} \ du $ and use some sort of contour integration, but I can't see how that would work out either.


Let $M$ be a $2$-manifold (the setting I am wanted to apply this is $M=S^2$) and $g,h$ be conformally related metrics (ie $h=e^{2w}g$ for some $w\in C^\infty$). I would like to show that  $$ K_h=e^{-2w}(K_g-\Delta_g w) $$ where $K$ is the Gauss curvature. I have tried using the definition of Gauss curvature $$ K_g=\frac{\langle (\nabla_2 \nabla_1-\nabla_1 \nabla_2)e_1, e_2\rangle}{\text{det} g} $$ which introduces the factor $e^{-2w}$ (a factor of $e^{-4w}$ from the determinate and a factor of $e^{2w}$ from the inner product) but I do not see how the $-\Delta_g w$ term will appear. I also tried using normal coordinates but I still could not see how to get the $-\Delta_g w$ term. I was also reading  similar post but there was no answer to the question and I did not really understand what the comments were hinting at. I would really appreciate just a hint to get me started in the right direction.


how to render a radiation pattern like following with blender?    Here a short video:   Thanks for your support.  LS


In Minecraft, you can only build up to a certain height limit (which is something around 256). However, if a player uses mods/hacks to go above the limit (Or simply goes into Creative Mode), then they can go above the height limit.  How high is the player height limit in Minecraft? Is there even a limit to it? I've tried testing this myself, but my thumb started hurting when I reached Y= 1000.


This particular blend file is messed up. I'm not sure what I did or pressed. If I open a new blend file everything works fine but in this one the materials tab is missing and the render properties is also missing some things. I don't want to start over my project. I have tried a day and a half to figure this out.


Can't access my user account Ubuntu 12.04

I have no idea why but it just sends me back to the login screen whenever I try to login my main account. So I made a second account from guest account and used nautilus as sudo(root) and checked my home main user files and all that is there is:  Access-Your-Private-Data.desktop and README.txt   But I don't understand I haven't encrypted my drive so what do I do to get my data back, I would really like to get it back I can't understand what has happened.


An alternative hashing method, how does it compare?

Say that I have good, collision resistant hash function H. Given a message M, the typical usage is h=H(M) to get it's hash.  Now, I want to propose two alternative methods of using this hash function, and compare them to the original function. First, I split my message M into equally sized chunks M1, M2, ..., Mn.  First method: the hash would be h=H(M1)⊕h(M2)⊕...⊕h(Mn) (⊕ is XOR).  Second method: the hash would be h=H(M1,1)⊕h(M2,2)⊕...⊕h(Mn,n), where comma means concatenation.  Now, it's obvious that the first hashing method is poor - I can shuffle the chunks around, and add two equal chunks without changing the resulting hash. But what about the second method? Are there any attack vectors? How does it compare to the original hash function?


Why is it that Photoshop always shows a nice, clean picture when I transform it but when I exit out of transform mode it turns to crap?

I try to edit a photo in Photoshop by just dragging it in, the image is too small so I transform it to make it large enough to fit the screen. It shows a nice picture but whenever I deselect, it looks awful and sharpening tools don't work. I need help.


An example of neither open nor closed set

I need a very simple example of a set of real numbers (if there is any) that is neither closed nor open, along with an explanation of why it is so.


is there a formula you have to keep in mind and how much does it affect SERPs? Also is there an efficient way calculating that ratio?


cartoon or anime where there was a kid with a magic stone that could summon a magical creature

in Canada, I don't remember specifics but what I remember was that the show had a boy that could summon a magical creature from a stone and I think I watched it before 2010. It was in English and I think it may have been 2008 or close to when I first saw it. Also I think the creature was some kind of tiger or elephant like thing, I don't entirely remember. Cant remember what the boy looked like though. The boy was young though. the stone also was about the size of his hand and had a symbol of some kind, he could also get more than 1. the style of the show was also a bit old. The only two things I remember is near the beginning he is in a jungle or forest and later in a snowy rock area.


Here's an easy-looking probability theory problem that so far has defied my attempts at solving it:  Let $X$ and $Y$ be two real independent identically distributed random variables. Prove that  $$ Pr(|X-Y| \le 2) \leq 3Pr(|X-Y| \le 1) $$


Which integer type can be safely and portably used to always hold a pointer value

Which integer type can be safely be used to always hold a pointer value? Would it be std::intptr_t?  But I thought int would also always hold a pointer value and is present in every build, and stuff like int32_t or int64_t would be changed if the input size is not exact


i have a service that return for me true in the node (article) successfully create and false if something wrong ,  but in the controller i am getting this error 'LogicException : The controller must return a response (success ! given). dans Symfony\Component\HttpKernel\HttpKernel->handleRaw() (ligne 169 de /var/www/html/vendor/symfony/http-kernel/HttpKernel.php).' can anyone tell me where is the problem in the controller return of my code please ?  service   public function createArticle()   {     $node = Node::create(array(       'type' => 'article custom',       'title' => 'article custom',       'langcode' => 'fr',       'uid' => '1',       'status' => 1,       'field_fields' => array(),     ));     $node->save();     if($node)       return true;     else       return false;   }   the controller methode   public function myPageCreate()   {     $service = \Drupal::service('mymodule.ran');     $createnode = $service->createArticle();     if($createnode)       return 'success !';     else       return 'somthing wrong !';   }


I need to test the CheckWarehouseAvailability private method in an abstract class.  public abstract class BaseAPI {     private void CheckWarehouseAvailability(Order order)     {         //codes here     } }  public class Processor : BaseAPI {  }   Here is my TestMethod  Processor pro = new Processor(); PrivateObject privBase = new PrivateObject(pro, new PrivateType(typeof(BaseAPI))); var retVal = privBase.Invoke("CheckWarehouseAvailability(order)"); Assert.AreEqual(true, retVal);   When I run the test method, I got this error: An exception of type 'System.MissingMethodException' occured in mscorlib.dll but was not handled in user code


Reinstall Ubuntu on other disk with Windows dual boot

I am new to Linux and I have just installed a dual boot with Ubuntu 20.04 and Windows. Unfortunately Ubuntu was installed on the hard disk and not on my SSD. Can I just boot with the Live-USB and remove the Ubuntu partitions with Gparted? Next, I would simply install Ubuntu on the SSD. Do I still need to repair the Windows boot loader (which you would have to do if Ubuntu were removed)? Are there other things I should consider?


I wrote a simple program in Cpp but I have no idea what is the best approach to test this? Is there a certain format for unit testing like in Java?   #include <iostream> #include <sstream> #include <string> #include <algorithm> #include <vector>  using namespace std; static vector<int> getAllFlipLocations(         vector<int> & pancakesRepresentedByDiameter);  /**  * Problem statement can be viewed at:  * http://www.programming-challenges.com/pg.php?page=downloadproblem&probid=110402&format=html  *  * The following is a solution for the above problem.  *  * @author Quinn Liu (quinnliu@vt.edu)  */ int main(void) {     string stackOfPancakes;      while (getline(cin, stackOfPancakes)) {         istringstream is(stackOfPancakes);          vector<int> pancakesRepresentedByDiameter;          int diameterOfPancake;         while (is >> diameterOfPancake) {             pancakesRepresentedByDiameter.push_back(diameterOfPancake);         }         reverse(pancakesRepresentedByDiameter.begin(),                 pancakesRepresentedByDiameter.end());          vector<int> orderOfFlipLocations = getAllFlipLocations(                 pancakesRepresentedByDiameter);          // first print original stack of pancakes         cout << stackOfPancakes << endl;          // now print location within stack to flip pancakes to get a stack         // of pancakes where the pancake diameters decrease as they move         // from the bottom to the top         for (int i = 0; i < orderOfFlipLocations.size(); i++) {             if (i != 0) {                 cout << ' ';             }             cout << orderOfFlipLocations[i];         }         cout << endl;     } }  /**  * Return the order of the locations to flip pancakes in the pancake stack.  */ vector<int> getAllFlipLocations(vector<int> &pancakesRepresentedByDiameter) {     vector<int> orderOfFlipLocations;      vector<int>::iterator beginIndex = pancakesRepresentedByDiameter.begin();     vector<int>::iterator endIndex = pancakesRepresentedByDiameter.end();      for (int i = 0; i < pancakesRepresentedByDiameter.size(); i++) {         vector<int>::iterator currentIndex = beginIndex + i;         vector<int>::iterator maximumIndex = max_element(currentIndex,                 endIndex);          // iterate through the stack of pancakes         if (currentIndex != maximumIndex) {              if (maximumIndex + 1 != endIndex) {                 // adds value of (maximumIndex - beginIndex + 1) to the end of the vector                 orderOfFlipLocations.push_back(maximumIndex - beginIndex + 1);                 reverse(maximumIndex, endIndex);             }             orderOfFlipLocations.push_back(i + 1);             reverse(currentIndex, endIndex);         }     }     orderOfFlipLocations.push_back(0);     return orderOfFlipLocations; }


Using Lan and Wlan at the same time (Concurrently)?

There are two internet account. One is connected to a pc with ethernet cable. The other one is connected to same pc with wireless.  Is it possible to use them concurrently?  Example:   acc 1 : 8 mbit acc 2 : 16 mbit   acc 1 + acc 2 = 24 mbit.  cable and wireless connected directly to motherboard.  If this is not possible, can I force an application to use wlan ?  OS: Windows 7


How to use operating system ability of copy and paste using C#

I am developing a winform application. I have menu like Edit -> Copy and Edit -> Paste.  Instead of using     Clipboard class to do copying and pasting can I use Operating System's ability to Copy and Paste text, image, link, etc...


I'm looking for a  way to convert numbers to string format, dropping any redundant '.0'   The input data is a mix of floats and strings. Desired output:  0   --> '0'  0.0 --> '0'  0.1 --> '0.1'  1.0 --> '1'  I've come up with the following generator expression, but I wonder if there's a faster way:  (str(i).rstrip('.0') if i else '0' for i in lst)   The truth check is there to prevent 0 from becoming an empty string.  EDIT: The more or less acceptable solution I have for now is this:  ('%d'%i if i == int(i) else '%s'%i for i in lst)   It just seems strange that there is no elegant way to handle this (fairly straightforward) case in python.


What at the chances of getting 20 heads on a row if tossed 100 million times?

I understand that each toss has a 50% chance if it is a fair coin, but I have hard time grasping the law of great numbers and I would like to know how likely it is that I get 20 heads in a row in such a large number of tosses.  Btw, is there really any difference if the coin IS NOT fair?  Lets say that I only have a 47.5% chance of winning, does that increase the probability of getting 20 heads in a row?  Regards,


Let $A,B,C$ be sets. Show that $A\subseteq C$ and $B\subseteq C$ if and only if $A\cup B \subseteq C$.  MY ATTEMPT  We shall prove that $A\cup B\subseteq C$ iff $A\subseteq C$ and $B\subseteq C$. Let us consider the implication ($\Rightarrow$) first. If $x\in A\cup B$, then $x\in A$ or $x\in B$. In both cases, $x\in C$, once $A\cup B \subseteq C$. Thus we conclude that $x\in C$ implies that $x\in A$ as well as $x\in C$ implies that $x\in B$. Therefore $A\subseteq C$ and $B\subseteq C$, as desired.  Conversely ($\Leftarrow$), if $x\in A\subseteq C$, then $x\in C$. Similarly, if $x\in B\subseteq C$, then $x\in C$. In other words, if $x\in A\cup B$, then $x\in C$, which means that $A\cup B\subseteq C$, as desired.  Could someone check if I am solving it correctly?


How to visualize a fitted multiple regression model?

I am currently writing a paper with several multiple regression analyses. While visualizing univariate linear regression is easy via scatter plots, I was wondering whether there is any good way to visualize multiple linear regressions?   I am currently just plotting scatter plots like dependent variable vs. 1st independent variable, then vs. 2nd independent variable, etc. I would really appreciate any suggestions.


How would you categorize email subjects to find similar emails?

I have a list of email subjects like:  <XYZ> commented on <ABC> Weekly review for <Company> Your account is ready    And I want to find patterns in them so I can group them.  Is there a well known algorithm I can use?    Preferably with wide language implementations or easy re-implementation. The algorithm should be unsupervised. The number of different emails is not known.   Update:  I think I can break this down into two problems:   Group subjects by the similar words they use, resulting in the following. Each group should be very distinct from the rest (they should be almost perfectly exclusive) and the algorithm should give relatively small number of groups with good length of the common words.  [commented, on] [weekly, review] [your, account, is, ready]  Once grouped, it should be easy to find a state automaton that accepts only the group's subject and thus eliminates variable Then I can go back and check if there are any intersections and tweak the variables.   Having said that, is it better to use a completley different approach like neural nets maybe? I have zero experience with those, but if it makes more sense, I am open to learning.


List of all homebrew package names (not a count)

Is it possible to get a complete list of all homebrew package names that are able to install using brew install PACKAGE_NAME? (not just a count of all packages)  There is a complete list of available Homebrew packages , but I would like a script if available


How did Hiruzen Sarutobi summon Enma when he was a reanimation?

In the Fourth Great Ninja War, when Obito makes the Ten-Tails transform the into God Tree that devoured the chakra of all the shinobi it touched (or its branches), where you will see Sarutobi Hiruzen cutting/destroying the branches of the Ten-Tails' tree form, and he does that with the help of Enma's transformation - Adamantine Staff. When Sandaime Hokage is summoned using the  "Impure World Reincarnation", you aren't supposed to have any blood in you to summon Enma.  So, now if you check the naruto wiki, to summon a contract animal, first of all we would need to have a blood contract with the summoning animal, Afterwards they only need to offer an additional donation of blood on the hand they signed the contract with, mould their chakra with hand seals and then plant the hand they signed the contract with at the location they wish to summon the creature.  So, was it a flaw to show Sandaime Hokage with Adamantine Staff or is there any other technique this is used to summon a contract animal. Or was this explained in Manga..


How to split a layer by attributes in Qgis?

I have one layer with multiples Classes (Casa[550], Stock[10], Estrada[20], etc) and I´d like to have those classes as layers.     E.g: Layer Casa[550], Layer Stock[10], Layer Estrada[20].  Any ideas for a specific plug-in or another solution?  Qgis 2.18


Can the Garbage Collection in C# find and remove internal linked classes only?

I have a class (lets call it class a) that contains a "reference class" (lets call it reference class b) which points to "class a".  This create a loop connection, if all other references to "class a" and "reference class b" would be dropped they would still have classes referring to them. Is the Garbage Collection in C# strong enough to detect this internal loop only, or would I need to break that link somehow before they can be collected (once all external links are broken this would be impossible)  See following example code of how the two keeps referencing each other.  Public Class ClassA {     Private ReferenceClassB reference;     Public ClassA()     {         reference = new ReferenceClassB(this);     }  }  Public Class ReferenceClassB {     Private ClassA referencedClass;     Public ReferenceClassB(ClassA reference)     {         referencedClass = reference;     } }   Using the above 2 classes if a version of ClassA is made external, and then set to null, there is still a reference to that Object, and likewise with the created ReferenceClassB object. But these objects would not be connected to the "main program", so in theory they are safe for the Garbage Collector to clean, but is the actual implementation smart enough to get rid of them?


Hi I am given this problem and I am supposed to use fermat's theorem. Here is it is: Prove that $$24^{31} \equiv 23^{32} \pmod{19}$$  We are supposed to solve it by setting up the congruence like this:  $$24^{31} \equiv x \pmod{19}$$  $$23^{32} \equiv x \pmod{19}$$  I am just confused how to break it down.  I was hoping someone can guide me through this question


I can never remember which is hot. NOw i have a medium enchilada sauce in my recipe and need to cool the heat way down... help! How do I make my meal so that my child will be able to eat it. She does not like spicy.


Is there any automation thats downvotes every answer I gave? Or could it be that somebody doesn't like me? What could I do against it?


If $\sum x_n^2$ diverges, does there always exist $y_n$ such that $\sum y_n^2$ converges but $\sum x_ny_n$ does not?

All sequences here are sequences of positive reals. If $\sum x_n^2$ diverges, does there always exist a sequence $y_n$ such that $\sum y_n^2$ converges but $\sum x_ny_n$ does not?  My attempt is as follows:  Suppose not. Then choose $x_n$ with $\sum x_n^2$ divergent such that $\sum y_n^2 < \infty \implies \sum s_ny_n < \infty$. Then there exists $K$ such that  $Ky_n^2>x_ny_n$. So $K^2y_n^2>x_n^2$ (??). So $\sum y_n^2$ diverges. Contradiction.  Although I am not overly convinced by this. Is the statement even true?


I have a script that looks like the following:  ssh host command1 scp file1 host:/tmp ssh host command2   Is there a way to combine them all in one ssh/scp call? The problem I have is combining copying files with executing commands, which has to be done interleaved. Was hoping for something like:   ssh_sometool host -c command1 -cp file1 /tmp -c command2   It's not about the syntax ( I could write a function like that), it's about everything happening within the same ssh session


... and if so, what criteria must you meet? I keep hearing conflicted info, like    "Only through inactivity." "Only from challenger." "You can never drop Tiers." "Yes."   Does anyone know definitively?


Enter sudo password prompted in terminal

In order to install hplip to get my printer working again since the update from Ubuntu 14.04 to 16.04 broke it, I opened a terminal according to the instructions of HP, and during the process I was asked to enter the sudo password, but I cannot enter it; the keyboard is no longer responding to any key. What can I do to continue installing this program?


Rotation and translation of a conic-section

I tried to solve the following exercises, so I want to ask you if my answers are correct.     1) Given the coordinates system $(O'; X'' Y'')$ asociated to the    basis $B=[{b_1=\frac{1}{\sqrt{2}}; \frac{1}{\sqrt{2}};  > b_2=\frac{-1}{\sqrt{2}}; \frac{1}{\sqrt{2}}}]$ with origin in    $O'=(2;5)$ and the system $(O;XY)$ asociated to the standar basis, find the intersection between $Q: y''^2=-4 \sqrt{2} x''$    and the straight line in $(O,XY)$ $V=(0;5)+t(-1;1) t\epsilon R$    Well, first I tried to write $Q$ in terms of $X$ and $Y$, and not in terms of $X''$ and $Y''$. I used the formula:  $(\begin{matrix}  X''\\  Y'' \\  \end{matrix})$ =$(C)_B$ × $(\begin{matrix}  X-2\\  Y-5 \\  \end{matrix})$   Then I replaced those values in the equation of $Q$ and I got $Q: \frac{(-x+y-3)^2}{2}=-4 \sqrt{2} \frac{(x+y-7)}{\sqrt{2}}$   After that, I found the intersection between $Q$ and $V$ using equations and I got that the intersection points in $(O;XY)$ are $P_1(3;2)$ and $P_2(-1;6)$      2)Given the coordinates system $(O,X'Y')$ asociated to the basis    $B=[{b_1=\frac{1}{\sqrt{2}}; \frac{1}{\sqrt{2}};  > b_2=\frac{-1}{\sqrt{2}}; \frac{1}{\sqrt{2}}}]$ with origin in    $O=(0;0)$ and the ellipse $9X'^2+5Y'^2-3X'+2Y'-10=0$ find the    coordinates of the centre of the ellipse in $(O,XY)$    So, here I found the centre of the ellipse in $(O,X'Y')$ and it was $(\frac{1}{6}; - \frac{1}{5})$, then, doing something similar to what I've done before I found out that the centre in $(O,XY)$ was $( \frac{11}{30 \sqrt{2}};$ $\frac{-1}{30 \sqrt{2}}$)


When a planet is heated through gravitational pull, where is the energy taken from?

Jupiters moon Io is heated through the gravitational pull of Jupiter, but when Io is heated because of this, where does that energy come from? How does conservation of energy work for this effect, where is energy "lost"?


Calculate the sum of the infinite series $\sum_{n=0}^{\infty} \frac{n}{4^n}$

A previous problem had us solving $\sum_{n=0}^{\infty} \frac{1}{4^n}$ which I calculated to be $\frac{4}{3}$ using a bit of mathematical manipulation.   Wonderful. Thank you for all the prompt responses.  Could anyone suggest an alternate technique that does not involve differentiation?


I am trying to write &amp; in my answer but it is showing &. How to solve this? I want to give answer of one question and I required to write &amp; as it is.


What and How to Prepare In Advance For the Next Session?

So I'm starting a new campaign with a group this week, I'm the DM with 4 PC's (2 are long-time RPers and 2 are fairly new to D&D).  I've got notes made for the first session, how the party meets, a structure of sorts, encounters, etc, but I'm not really sure how to follow it up from there.  It's a sandbox style game, so I know it does depend on the players' actions, but I'm just wondering how to lead one session in to the next. What do I need to prepare, how much should I have planned out, how do I build up the story in the first few sessions?  Thanks!


Testing for SQL injection but resulting in error?

Hi i know parameterized statements and escaping data is good practice for preventing SQL injection. But i was curious to see it in action so i set up a database to see . The problem is i keep getting a error or its not injecting correctly.  $ans = $_POST['answer']; $query = "SELECT username from `members` where password = '$ans'"; $c = $db ->query($query); $c=$c->fetch(PDO::FETCH_ASSOC); echo $c['username'];   I tried the typical 'Or 1=1' injections and its variations and i keep coming up with errors on the fetch or it not working at all.


How to limit resource usage for a given process?

I have a process for an application which needs to run, but ends up using far too much IO usage for what it does. And really crashes my computer, making it impossible to do anything else whilst it is running.  So I was wondering if there is a way to limit IO usage, RAM and CPU for a given process? And its sub-processes of course.  This is on my Ubuntu 18.04 LTS system.


I am running Fedora 17 64-bit and the rsync --exclude=/home/ben/<dir> is not working as expected.  I am trying to rsync my home directory to a thumb drive, but I want to exclude certainly directories that hold cache files and build files.  This is the command I'm using:  rsync --exclude=/home/ben/build/ --exclude=/home/ben/.ccache -arv /home/ben home-ben/   However, content from the ~/build and ~/.ccache is being copied by rsync.  What am I doing wrong?


EDIT: While there are similarities with  (and please note that there are no answers to that question btw), I'm suggesting a different design and user journey.    I'm not a UX expert but this doesn't look right to me:    The red dot usually is convention for "new items since your last visit". However when you click, the message is rather confusing; it's not immediately clear that you have been banned from reviewing.  Initially I thought it was a bug but eventually I worked out (via the meta site) that I've been user-review banned. (I've been told why and I agree with the decision.)  I think the UI could be something like this instead:    When the user hovers the icon, a tooltip could say:     You have been banned from reviews until 31st of March. Click to understand why   And the click would redirect the user to  (or the appropriate review page for the network)


How to reduce the number of hyphenation?

Sometimes, assume our document contain many long words, TeX may generate some hyphenation at the end of line. But it really hinder our smooth reading. Although I know we can add the hyphenation rule at the preamble. It can't reduce hyphenation number but effect the hyphenation position. It is said that microtype package can give us more compact output. But it require expert level to tuning the parameter.


I have added document library template using VS 2012. and then added custom content types to this library. the content types includes 3 managed metadata fields. After deploying the project when I add terms to taxonomy fields in document library, I got following error:  "The SPListItem being updated was not retrieved with all taxonomy fields"    I could not find any solution. Any body have an idea whats wrong ?


How type 'E' rotated counterclockwisely by 90 degree?

I guess it is a greek letter but couldn't find out how to use latex to type it out.


The question is short but it may be a little bit tricky:  Suppose we have a deck that contains n cards with n different rank (let's say ranks are 1, 2, ... , n), and then we randomly shuffle the deck, what's the probability that all cards' orders are different from their ranks?  Such as:  $1^{st}$ card cannot be the card with rank 1, and  $2^{nd}$ card cannot be the card with rank 2, and   ... and  $n^{th}$ card cannot be the card with rank n.  I have done some simulations for a specific n (n=7), feel free to use the sample probability distribution to test against your thoughts:   > n <- rep(-1, 1000000) > for (i in 1:length(n)) { +   deck <- sample(1:7) +   n[i] <- sum(sample(1:7) == 1:7) + } > table(n) / length(n) n        0        1        2        3        4        5        7  0.367319 0.368180 0.183299 0.062795 0.014050 0.004150 0.000207


How can I access a server on local network using its public name?

I have a problem in which I cannot access a server using its public name from the same network as the server. Access to the server works fine from the internet.  Reading up on this problem, I've ran across such things as hairpin NAT, loopback NAT, split DNS, editing hosts files, etc.  My network has a SMC 8013WG-CCR (Comcast) cable modem connected to a Linksys WRT54G2. As I understand, the router is supposed to handle this sort of loopback (by leaving the security option "Filter Internet NAT Redirection" disabled), but the connection between these two devices is a secondary LAN, so I don't think the router "knows" what the proper public IP address is.  The easiest solution would be to edit the hosts files of all the computers in the network, but many are notebook computers which will need to access the server both on the LAN and externally.  The server is Windows Server 2012, so I could set it up as the internal DNS server but I don't have enough experience with this to really understand how it would interact with the router, DHCP, etc.  I am prepared to purchase a new router if I need something with greater capability. It appears from my research that most IT admins prefer to solve this problem with split DNS rather than hairpin NAT. I understand the concept of hairpin NAT more clearly than split DNS. It seems to me that the router just needs to provide LAN clients with the local IP of the server when clients use the public name (sub.domain.com). Isn't that just an entry in a local DNS cache? Is that what split DNS does?  What would be a good solution to implement this fix for a small business?


Preventing a specific application from accessing a folder

I just installed an application that has the bad habit of automatically scanning all my folders for files to edit.  The app has no available options to disable this behavior. I cannot just remove read/list permissions for those files because the app runs with my user permissions, and I still want other applications to be able to access them.  Is there a security mechanism to prevent the application from being able to read some folders? I tried using apparmor, but since it is "default deny" there doesn't seem to be a way to say "allow the app to do everything it wants EXCEPT access these files".  Thanks.


Per-site equivalent of Stack Overflow reputation page

In  I learned about this URL  which provides the full reputation history on Stack Overflow.  Is there an equivalent URL for specific sites in the Stack Exchange family? If there is not such an equivalent URL, what is the simplest way I can obtain this information for myself, given that I have less than <10k reputation events? In particular, I would like to obtain a precise histogram of my reputation per day on a specific site.


Find the number of ways of distributing 999 identical balls into 3 identical boxes.  This number(999) is too huge to allow a case by case treatment.  Ans: 83667


C++ OOP template undefined reference to function

I`m new to OOP and need some experienced opinions about what I am doing wrong. As I understood, according to the error I dont have function definition/implementation for the respective call in the int main(). WHile I think I do. Please, give me a hint. House.h: class House { public:       template<class T> bool checkRoom(int nessTemp, int nessHumid, int nessIllum, T obj); private:      int roomCount; };  House.cpp: #include "House.h" #include "Room.h"  template<class T> bool House::checkRoom(int nessTemp, int nessHumid, int nessIllum, T obj) {     tuple <int, int, bool, int> RD = room.getRoomData();     return false; }  Room.h: #include <tuple>  using namespace std;  class Room { public:       tuple <int, int, bool, int> getRoomData(); private:      tuple <int, int, bool, int> RoomData;      void SetRoomData(int setTemp, int setHum, int setIllum);  };   Room.cpp: #include "Room.h"   tuple <int, int, bool, int> Room::getRoomData() {     return RoomData; }  void Room::SetRoomData(int setTemp, int setHum, int setIllum) {     return; }  main.cpp: #include <iostream> #include "House.h" #include "Room.h"  using namespace std;  int main()  {      House house;     Room kitchen;     house.checkRoom<Room>(25, 15, 20, kitchen);       return 0;  }  Result: /usr/bin/ld: /tmp/cccYxx0f.o: in function `main': main.cpp:(.text+0x62): undefined reference to `bool House::checkRoom<Room>(int, int, int, Room)' collect2: error: ld returned 1 exit status


Why is the time limit for editing comments 5 minutes?


Merge list into list of tuples of 4 items

here is the list that I want to merge l = [3.23, 5.32, 8.23, 2.23, 9.98, 7.43, 6.43, 8.23, 4.23]  the list has to be sorted from high to low l.sort() l.reverse  I need this as a result p = [(9.98, 8.23, 8.23, 7.43), (6.43, 5.32, 4.23, 3.23), (2.23,)]  Can someone help me do this in python?


Attaching existing server files to filefield

How do you set an existing file path for a file field, in Drupal 7? The only option I see is to upload the file again.  In Drupal 6,  seems to do this.   Does  or  along with file field allow assignment of server files? Is there an API to programmatically manage file fields?  Edit I just discovered that this can all be done with the media module. I also have  installed. However it is not completely intuitive, so here are the steps I took:  Import to media library: /admin/content/media/import    Create a mediafile asset field. This allows you to attach from the library.    Display formats (example for audio) are at /admin/config/media/types/manage/audio/display/, instead of content type "manage display" which only provides "large", "small", "preview", etc.


Lists of Lists assignment of values to each cell

I have a list of lists(m) that contains some element based on which I want to change my another proxy  lists of lists. Problem is whenever I assign a cell value to be something in proxy list (p) it just  copies the list to all the lists in proxy list i.e. instead of list-0  being changed it changes list-0, list-1 and list-2. My code is as follows:  m = [[2,2,1],     [3,3,1],     [0,0,1]]  p = [[-1]*len(m[0])]*len(m)   for i in range(0,len(m)):     for j in range(0,len(m[0])):            if i ==j:               continue            if m[i][i] == m[i][j]:                  p[i][i] -= 1                  p[i][j] = i   The actual output after every iteration is :    1st : [[-2, 0, -1], [-2, 0, -1], [-2, 0, -1]]   2nd : [[1, -1, -1], [1, -1, -1], [1, -1, -1]]   The expected output is :   1st : [[-2, 0, -1], [-1, -1, -1], [-1, -1, -1]]  2nd : [[-2, 0, -1], [1, -2, -1], [-1, -1, -1]]


$f: \mathbf{R} \rightarrow \mathbf{R}$ monotone increasing $\Rightarrow$ $f$ is measurable

Problem. Let $f: \mathbf{R} \rightarrow \mathbf{R}$ be a monotone increasing function. Show that $f$ is measurable.      Solution. We know that the set of discontinuites of any monotone increasing function $f$ is measure zero (since it is at most countable). We define a continuous function $g$ such that $g(x)=f(x)$ except the discontinuous points of $g$. Then $g(x)=f(x)$ almost everywhere. Note that any continuous function $g: \mathbf{R}\rightarrow \mathbf{R}$ is measurable. Also note that if $g$ is measurable and $f=g$ almost everywhere, then $f$ is measurable. Hence we conclude that $f$ is measurable.    Is my solution correct? Thanks.


Could the magic links be updated so that we can link to help center subsections? In the past, [faq#section] used to work, now neither [help#section] nor [help/section] work.  Could this be added?    As per Nick's request, I'm starting a list of shortcuts that would be nice to have; besides the [help#anchor] → /help/anchor ones. Feel free to edit more in:   #benice →  (preferably a section link to the "be nice" section) #bounty →  #promotion →   (preferably a section link)


If $A,B>0$ and $A+B = \frac{\pi}{3},$ Then find Maximum value of $\tan A\cdot \tan B$.

If $A,B>0$ and $\displaystyle A+B = \frac{\pi}{3},$ Then find Maximum value of $\tan A\cdot \tan B$.  $\bf{My\; Try::}$ Given $$\displaystyle A+ B = \frac{\pi}{3}$$ and $A,B>0$.  So we can say $$\displaystyle 0< A,B<\frac{\pi}{3}$$. Now taking $\tan $ on both side, we get  $$\displaystyle \tan(A+B) = \tan \left(\frac{\pi}{3}\right).$$ So $\displaystyle \frac{\tan A+\tan B}{1-\tan A\tan B} = \sqrt{3}$.  Now Let $\displaystyle \tan A\cdot \tan B=y\;,$ Then $\displaystyle \tan B = \frac{y}{\tan A}.$  So $$\displaystyle \frac{\tan A+\frac{y}{\tan A}}{1-y}=\sqrt{3}\Rightarrow \tan^2 A+y=\sqrt{3}\tan A-y\sqrt{3}\tan A$$  So equation $$\tan^2 A+\sqrt{3}\left(y-1\right)\tan A+y=0$$  Now for real values of $y\;,$ Given equation has real roots. So its $\bf{Discrimnant>0}$  So $$\displaystyle 3\left(y-1\right)^2-4y\geq 0\Rightarrow 3y^2+3-6y-4y\geq 0$$  So we get $$3y^2-10y+3\geq 0\Rightarrow \displaystyle 3y^2-9y-y+3\geq 0$$  So we get $$\displaystyle y\leq \frac{1}{3}\cup y\geq 3$$, But above we get $\displaystyle 0<A,B<\frac{\pi}{3}$  So We Get $$\bf{\displaystyle y_{Max.} = \left(\tan A \cdot \tan B\right)_{Max} = \frac{1}{3}}.$$  My Question is can we solve above question using $\bf{A.M\geq G.M}$ Inequality or Power Mean equality.  Thanks


Assume $f$ is $C^\infty$ on $\mathbb R$, and satisfies  There exists $M>0$ such that for any non-negetive integer $n$ and any $x\in\mathbb R$, $\left|f^{(n)}(x)\right|\leqslant M$ $\displaystyle f\left(\dfrac{1}{m}\right)=0, m\in \mathbb Z^{+}$  Prove: $f(x)\equiv 0$ on $\mathbb R$.  I have no ideas about this problem. How can we make use of the second claim? Does it implies that we can firstly prove $f(x)=0$ at every rational numbers and then extend to the whole real numbers?


Let a,b,c $\in\mathbb{Z}$ such that a|k, b|k and gcd (a,b)=1. Prove that ab|k.  Any hints would be helpful.


A identity relating a infinite series and a definite integral

Prove that,   $$ \sum_{n=1}^{\infty} \frac{1}{n^n} = \int_{0}^{1} x^{-x}dx$$  I made no significant progress, I'm looking for hint/ideas to approach this problem. Thanks!


Question:     A man like you should not do this, _______?   Which question tag should I use in the blank space?   should he? should you?   Which would be grammatically correct? I think 1 is true.


What should commands echo [:space:]  and echo [:alpha:] print on bash terminal? The behavior seems pretty random.  Sometimes it just prints the whole strings [:space:] or [:alpha:], at other times they expand to some (but not all) single character file names in the directory.


The sentence is the following:     This is a (apparently) beautiful town.   Should it be 'an' because of the Parentheses?


How can I add a panel to the properties area of the file browser?

I would like to wrap my properties inside collapsible panels when using the ExportHelper or ImportHelper class but I can not figure it out how to draw them properly:  This is my code so far (reduced version of the Operator File Export template): import bpy  # ExportHelper is a helper class, defines filename and # invoke() function which calls the file selector. from bpy_extras.io_utils import ExportHelper from bpy.props import StringProperty, BoolProperty, EnumProperty from bpy.types import Operator   class ExportSomeData(Operator, ExportHelper):     """This appears in the tooltip of the operator and in the generated docs"""     bl_idname = "export_test.some_data"  # important since its how bpy.ops.import_test.some_data is constructed     bl_label = "Export Some Data"      # ExportHelper mixin class uses this     filename_ext = ".txt"      def execute(self, context):         return {'FINISHED'}   class SubPanel(bpy.types.Panel):     bl_label = 'SubPanel'     bl_idname = 'Sub_PT_Layout'     bl_parent_id = 'export_test.some_data'     bl_space_type = 'FILE_BROWSER'     bl_region_type = 'TOOL_PROPS'      def draw(self, context):         layout = self.layout         layout.label(text = 'test')          use_setting: BoolProperty(             name="Example Boolean",             description="Example Tooltip",             default=True,         )   def register():     bpy.utils.register_class(ExportSomeData)     bpy.utils.register_class(SubPanel)   def unregister():     bpy.utils.unregister_class(SubPanel)     bpy.utils.unregister_class(ExportSomeData)   if __name__ == "__main__":     register()      # test call     bpy.ops.export_test.some_data('INVOKE_DEFAULT')  Unfortunately I get the following error:  RuntimeError: Error: Registering panel class: parent 'export_test.some_data' for 'Sub_PT_Layout' not found  Q: How can I add a panel to the properties area of the file browser when using the ExportHelper or ImportHelper class?


Animation with no smoothing between keyframes

Most 2D animation software can render the animation 'frame-by-frame'. There are no smooth transitions between each frame, and each frame after is usually blank, and the artist re-draws the scene, a bit different. The last can also sometimes be altered for a new frame. It will be like an animated lego stop-motion like film:    My goal is to be able to have my scene all set in frame one and then duplicate that scene to the next frame to be altered and to not 'smooth' the animation frames.   Question:  Is something like a stop-motion (no actual footage) possible with CGI in Blender? If so, how do I go about creating this environment to animate with?


Does it make sense to claim that something cannot be proven without induction?

Often we have questions on this site which ask for a proof of some result without induction.1 It seems that when such a question is posted, it is quite well-understood what is meant by proof avoiding induction.2 But can the meaning of this phrase be precise?        Is it possible to define formally what do "proof without induction" and "proof using induction" mean?      For example, I would suspect that if the claim contains some object defined by induction, then we would expect that the proof uses induction, too. (Perhaps in some non-obvious way.) In the other words, if we want induction-free proof, we should have induction-free formulation of the theorem. (Although I do not claim that this intuition is correct - as you can see from this question, I cannot give even reasonable formalization of this.)  Examples of claims which are typically shown by induction and which involve objects defined by induction could be:3   $\sum_{k=1}^n k = \frac{n(n+1)}2$ (We have several posts about this sum, for example .) If $a_1,\dots,a_n$ are elements of a finite abelian group $G=\{a_1,\dots,a_n\}$ (where $|G|=n$, i.e. no element is listed twice), then $(a_1a_2\dots a_n)^2$ see    Of course, induction can also be used in proofs where inductive (recursive) definitions are not used in the formulation of the result.4        If we have some formalization of the distinction between proofs with/without induction, is it possible to prove about some results that induction cannot be avoided in the proof?   What are some examples of results for which it is proven that any proof will need induction. (For some reasonable meaning of the phrase "need induction".)      Perhaps I could imagine something like this when working with . We could simply omit the induction axiom and ask whether there is a proof using the remaining axioms. (Or whether there is a model in which the claim fails.) However, in this way we restrict ourselves to claims about natural numbers. Moreover, if we want to omit induction axioms, we would have problems already with formulating results which use recursive definitions. (The fact that recursive definitions are possible in Peano Arithmetic is proved using this axiom. Some authors calls this result .)  The question becomes more complicated if we move beyond natural numbers. For example, if we are working in ZFC, then there is not an easy way out by just saying: "Let us omit the axiom about induction."    1You can . Some of the most popular examples (base on the number of views and score) could be   2I do not remember seeing some lengthy argument about whether some proof involves induction or not. Just compare that with the  type of questions. Situation is somewhat similar in that we often intuitively can see whether some answer is correct (or at least reasonable) or not; whether it was the solution intended by the creator of the problem. But such questions almost immediately get the response: "Any number can be an answer. Just take Lagrange interpolation."  3Here $S_n=\sum_{k=1}^n k$ is defined inductively by $S_{n+1}=S_n+(n+1)$. Similarly, we have inductive definition for $a_1a_2\dots a_n$. I think that the well-know proofs use induction in some hidden way. For example, the proof based on $2S_n=(1+\dots+n)+(n+\dots+1)=\underset{\text{$n$-times}}{\underbrace{(n+1)+\dots+(n+1)}}$ used commutativity several times. Similarly in the proof that product of all elements of abelian groups we would use commutativity. If by commutativity we mean that the product of $n$ elements gives the same result when reordered in any way, the formal proof of this fact would be based on induction.  4One example I was able to find quickly:  But I cannot at the moment think of an example where it would be difficult to give a proof without induction.


Inserting a file into another file at certain point

Using a bash script, I'm having difficulty trying place one file into another based on a certain location.  ||bob ||mary ||david   destination:  ||urty ! comment ||gdfgrw ||fdfdf   So basically drop all of the contents of one file into (below the ! comment) header:  So the destination should look like this:   ||urty ! comment ||bob ||mary ||david ||gdfgrw ||fdfdf


is the Canon 430 ex speedlite compatible with the Nikon D90?

Can I use a Canon 430 ex speedlite with a Nikon d90 DSLR? I want to buy a Nikon D90 and use the existing Canon 430 ex.  Would it work in TTL or manual mode?


How to append previous line to next line in a file if first character of a line is |

Input :  MAKTG|MAKTX|MANDT|MATNR|SPRAS ARALDITE AV 5308 |araldite AV 5308 |910|132252374801|E HARDER HV 5309 |harder HV 5309 |910|132252374901|E BAYFLEX 5965 I|Bayflex 5965 I|910|132252380101|E KUPFERPULVER FEIN 2703|kupferpulver fein 2703|910|132252382701|E   Needed Output:  MAKTG|MAKTX|MANDT|MATNR|SPRAS ARALDITE AV 5308|araldite AV 5308|910|132252374801|E HARDER HV 5309|harder HV 5309|910|132252374901|E BAYFLEX 5965 I|Bayflex 5965 I|910|132252380101|E KUPFERPULVER FEIN 2703|kupferpulver fein 2703|910|132252382701|E


In VHDL how can I get a clock frequency of 40 MHz if my onboard clock is 50 MHz. I know how to divide the frequency by integers but this case is dividing by 1.25. I am using this for VGA so I think it's important that it is precise. thanks!


In how many ways can the letters of the word CHROMATIC be arranged,  find the probability that the string of letters begins with the letter M  I don't understand how to single out M so the possibilities would only begin with M?


Computer no longer asks which OS to boot from

My computer came with Windows Vista, and I later dual-boot installed Ubuntu. Recently, I upgraded Windows Vista to Windows 7, and since then, the computer no longer asks which operating system I want to boot from. So this means I no longer know how to boot Ubuntu at all. I'd prefer not to have to reinstall Ubuntu unless absolutely necessary.  Any idea what I can do to fix this?


We've been given a template to work with. I am adding figures with the following code:  \begin{figure}[H]     \begin{center}       \includegraphics[scale=0.7]{Figures/System/reinf-learning.jpg}       \caption{Components of a reinforcement learning agent}       \label{fig:reinf-learning}     \end{center} \end{figure}   However, there is always a new line between after the figure. I'm trying to find something that will allow me to remove this new line. How can this be done? Thanks.  I've tried adding \setlength{\belowcaptionskip}{-10pt} but to no avail.


I just moved into a small home (~1150sf) that currently has 150 amp service. The disconnect is outside by the meter (pictured). The meter is attached to the side of the carport, which I'm about to convert into a garage.  The sub panel is inside in the middle of the house (pictured). Though I have some room if I replace some of the breakers with doubles, she's pretty full.   I need significant power in the new garage. Here are the circuits I'd like to install in the new garage. Some of the items can be run on the same receptacle and few, if any, of the 220v tools will be run simultaneously:   120v for A/C 30a, 220v for table saw 30a, 220v for plasma cutter 60a, 220v for welder (8) 120v receptacles for various woodworking tools   In every other house I've lived in, I've had room in my panel and have wired the circuits I've needed myself.   I guess I can run a sub panel to the garage from the sub in the house and then wire up the circuits, but since the disconnect is about 5' from the garage, I was wondering if there are other options.  Any advice? Thanks in advance.


I am trying to make a timer in Bash which countdowns 20 minutes and then starts a 10 minute break immediately after the previous. Then the loop  continues and returns again to 20 minutes.   #!/bin/bash MIN=20 BREAK=10 while [[ 0 -ne $MIN ]]; do     echo "$MIN"     sleep 1     MIN=$[$MIN-1] done WHILE [[ 0 -ne $BREAK ]]; do     echo "$BREAK"     sleep 1     BREAK=$[$BREAK-1] done   I made it with seconds here. So 20 seconds pass by and then the 10 seconds start immediately. But when the 10 seconds expire the script stops. Is there a way to start again with 20 minutes?  Thank you!


How to pass a function with some (but not all) arguments to another function?

I have this function f(x, a, b):  def f(x, a, b):     return a*x + b   and I have to pass this function to another one with 'a' and 'b' pre-set, e.g.:  def print2(f):     x = np.linspace(0,1,10)     print(f(x))  print2(f( , 1, 1))   I know that there are other ways to solve this particular problem, however this is just an example, not the real problem, and I'd like to know if there's anyway to do something like this "print2(f( , 1, 1))". In other words, is there anyway to do this without having to pass the arguments all the way through? Like,  def print3(f, a, b):     x = np.linspace(0, 1, 10)     print(f(x, a, b)) print3(f, a, b)


So I am reading a file and need to count the number of duplicates within that file. I cant store duplicates. I would then need to display the contents of the file based on order of occurrence  My code so far:      // use hashmap to store the values     Map<String, Integer> myMap = new HashMap<>();      // loop through     for (String line = r.readLine(); line!=null; line = r.readLine()) {         if (myMap.containsKey(line)) {             myMap.put(line, myMap.get(line)+1);         } else {             myMap.put(line, 1);         }     }      I am storing them in a map because they have unique keys; the problem I am facing is that I need to sort them by the value of the integer from greatest to least.   Example input:  World World World Hello Hello Hello Hello   Expected output:  Hello World


show that rational numbers with the multipiciation are not abelian finitely generated group

we need to show that $( Q \ast , \bullet )$ is not abelian finitely generated group for all finite subset $S \subseteq Q \ast $  $ Q\ast=Q \setminus  \big\{0\big\} $


You know this how you can express a sum of consecutive terms like this: $1 + 2 + 3 + ... + n = \frac{n(n + 1)}{2}$? In other words, only using $n$? I would like to know if there is a way to shorten, or to express such a sum of sums: For example, for $n = 4$ $$\sum_{i = 1}^{4}\frac{i(i + 1)}{2} =1 + (1 + 2) + (1 + 2 + 3) + (1 + 2 + 3 + 4) = 20$$ Can I express this using only $n$?


How do I reorder the Nautilus right-click menu?

Is it possible to reorder the default items in the Nautilus context menu?  e.g. when I right-click on an archive, the top item is "Open with Archive Manager" but way down the bottom is "Extract Here".  I would like to move the "Extract Here" item next to the "Open with Archive Manager" item as they are both actions that deal with the archive itself.


Purchases on fortnite mobile not transferring to PS4

I bought a lot of vbucks on mobile. I even bought the battle pass and a few skins and dances (on mobile). I also have a ps4 account which has the exact same username as my mobile. I linked my account to my ps4 and everything, but none of my purchases are showing up on my ps4, not even my progress. I've tried re-installing fortnite (on both platforms) as well as tried unlinking and linking it back on Ps4. Nothing is working. My skins and emotes on mobile, are not showing up on my Playstation. I've run out of ideas, help!


How can I clear myself of emotional attachment when reading reviewer feedback?

I have received feedback from reviewers on my latest conference paper (this is in Computer Science). It was an acceptance, which is nice.  I feel I really need to consider in depth the reviewer feedback.  I have consciously noticed I have a emotional reaction. Which is not rational, practical, or useful.  How can I clear myself from it, and handle the review on a factual basis?  Is it better to sleep on it? Perhaps it would help to strip the acceptance from it. Or maybe to rewrite it in my words as if I were reviewing the paper?  Overall I guess I should feel happy, but of course the written reviewer feedback only points at the weaknesses in the work. Which is reasonable, since they can indicate it was generally good with their accept statement. (At the end of the day, an accept is an accept, right?)


How to split a string in python but keep anything in a grouping symbol as one

I want to take a string: x = 'The following is a string: \'Here is a nice python string\'  and split it, but keep the inner string intact so it returns: ['The', 'following', 'is', 'a', 'string:', '\'Here is a nice python string \'']  This should act the same for {} or [] or (), however, not <>.


Cannot find the appropriate stack exchange site in the list when flagging a question as "off-topic"

I am trying to flag a question as off-topic because it's a code review question posted in stackoverflow. I follow the steps :     Flag > should be closed... > off-topic because... > This question belongs on another site in the Stack Exchange network.   But now I don't find the option to select codereview.stackexchange.com, I see other 5 options (see image). What should I select now?


Gödel: If a statement of existence is neither provable nor refutable, doesn‘t that imply that the statement is false?

I‘m not very versed in Gödel‘s incompleteness theorem but in a naive way: If a statement of existence is not provable, there you cannot find an example which fulfills the statement (otherwise the statement would be provable with this example). But when there is no element which fulfills the statement, doesn’t that imply that the statement ist false? I thought about that one in the context of the measure problem - because the statement $$\exists \text{ measure function } \mu: 2^{\mathbb R} \to [0,\infty] \, \forall I = [a,b] \subseteq \bar{\mathbb R}: \mu(I) = b - a$$ is neither provable nor refutable. But if I cannot prove there is a measure function, I cannot find a $\mu$ for which the statement is true. Because finding such a $\mu$ would prove the statement. But when there is no such $\mu$, the statement of existence is false, isn‘t it? Where is my mistake in thinking?


Does lightning bolt trigger wrath of the storm?

A enemy  cast  while within five feet of a tempest domain .  The cleric inquired if the lightning bolt triggers the wrath of the storm feature since the enemy wizard was "attacking him."   Wrath of the Storm description says:     When a creature within 5 feet of you that you can see hits you with an attack, you can use your reaction to cause the creature to make a Dexterity saving throw. The creature takes 2d8 lightning or thunder damage


Python selecting k elements form an array

I am trying to select all possible sub-arrays of an array of length n which have k elements. I have just started with Python and not sure how to start with it.   I know there will be nCk (n choose k)  but don't know how to start. Could anyone please give me a hint or a method I could use?  $$\frac{n!}{(n-k)!k!$$


Can Ubuntu 16.04 be installed on a Macbook Pro (Retina, 13 inch,early 2015)


How to decompose a 4x4 TRS transformation matrix with negative scale?

As the title says I need to decompose 4x4 TRS transformation matrices and extract the proper scale vectors and the proper rotation vectors (or rotation quaternions). I know how to extract those information when the upper 3x3 matrix determinant is not negative. The problem is that those matrices can have that negative determinant and as far as I could understand, this negative determinant indicates a flip or mirrored transformation. What do I have to do to extract the proper values for scale and rotation in those cases?


Show that $\lim_{n \to \infty} \left(1+\frac{a_n}{n}\right)^n= e^a$ when $a_n \to a$

I have seen a proof that shows $$\lim_{n\to\infty} \left(1+\frac{x}{n}\right)^n = e^x$$ by looking at the Taylor series expansion of $\ln(1+x)$ at $x=0$. To prove a theorem, my textbook uses the fact $$\lim_{n \to \infty} \left(1+\frac{a_n}{n}\right)^n = e^a$$ when $a_n \to a$. How can I prove this?


How do I integrate $\int \frac{dx}{\sin^3 x + \cos^3 x}$?

How do I integrate the following $$\int \frac{dx}{\sin^3 x + \cos^3 x}$$ ?  It appears that I am supposed to break this up into $(\sin x + \cos x)(1-\cos x \sin x)$, but the next thing to do is not apparent to me.


What are exactly those \widowpenalties and what are they doing precisely?

, the author is using the command \widowpenalties=3 10000 10000 150. While I can understand what \widowpenalty is doing, I found no documentation for \widowpenalties3 nor for \widowpenalties4. I looked in the TeXBook, in the Companion book, in source2e.pdf, but they don't explain anywhere what those commands are doing, and how they work exactly, with precise details. Could you please shed some light on this notion?


How to choose an option in some windows with keyboard?

For example, when I close an app with some changes without saving ir before. A window asks me if I want to save or not.    In Windows I can choose between these options with Tab but in Mac does not work.  EDIT: To save the document It's obviously that I can press Enter but I want to know how can I choose the other options.  PS: sorry for my english, I'm from Argentina  EDIT2: I found the answer here but I don't know how to mark as 'Answered':


First time installing (erasing Windows) from usb, did everything just so, Boot Device Not Found

We downloaded Ubuntu here  just as prompted. The 64 bit.    We followed howtoubuntu perfectly, using Rufus to put Ubuntu on a new usb stick.   We installed Ubuntu. Everything looked perfect, step by step.   The computer prompted us to restart, so we did.   With the usb stick in, we are prompted to install Ubuntu. Or one time, it started and looked like we were good to go but nothing would open. But when we try to reinstall, we are told the computer already has ubuntu, would we like to install alongside?   Without the usb stick, we are told to install an operating system. "Boot device not found"  You can probably tell by my vernacular that I am not familiar with this process. How can I fix this? Just want to run Ubuntu on the laptop.   Thanks, Tabitha   Edit: this is an hp pavilion laptop, which I could probably tell you more about if I hadn't just deleted everything on it in a failed attempt to use Ubuntu.  Edited to add sudo fdisk -l response:  Disk /dev/sda: 698.7 GiB, 750156374016 bytes, 1465149168 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disklabel type: dos Disk identifier: 0xc9478f8b  Device     Boot      Start        End    Sectors   Size Id Type /dev/sda1  *          2048 1457870847 1457868800 695.2G 83 Linux /dev/sda2       1457872894 1465147391    7274498   3.5G  5 Extended /dev/sda5       1457872896 1465147391    7274496   3.5G 82 Linux swap / Solaris  Partition 2 does not start on physical sector boundary.     Disk /dev/sdb: 57.9 GiB, 62109253632 bytes, 121307136 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: dos Disk identifier: 0x003a2730  Device     Boot Start       End   Sectors  Size Id Type /dev/sdb1  *     2048 121307135 121305088 57.9G  c W95 FAT32 (LBA)


Android 4.4.2 not automatically connecting to wifi

I have a samsung galaxy tab 3 8.0 running android 4.4.2 unrooted. My tablet is not automatically connecting to wifi networks. It was previously automatically connecting to two wifi networks (both are home networks secured with a password) but now I have to re-enter the password every time I try to connect to either of these networks. How can I get my tablet to remember the wifi networks?


How can i make two objects move together?

how can i make 2 objects move together? i am creating a Minecraft animation, and need the sword to move with my hand. I have tried Ctrl+G, yet it still doesnt move together


How to make a small $\varhexagon$ in latex?

I would like to have a command that shrinks down the size of $\varhexagon$ from the wasysym package in latex to a very small size.  In principle, $\tiny \varhexagon$ does what I want, but apparently the command "tiny" is not allowed in math mode.  Is there a way to circumvent this?-Note that \scriptscriptstyle does not seem to give the same size as \tiny.  In short, I want a command that does the same as $A_{\tiny \varhexagon}$ but does not use the illegal command \tiny.