I have a multi class program in which I'm trying to make winning conditions for. However when I attempt to compare the 2D array that contains an object, with another object of the same kind.  Here is a sample, I've tested the bare bones and the method does work, it's the if statements that do not, any help is very much appreciated.  (Yes I converted them to strings with the quotations, however the statement doesn't work either way)  public boolean winner()//Checks to see if someone has won. {     XO x = new XO("X");//creates the objects to mimic the players     XO o = new XO("O");     if((board [0][0]+"").equals(o+"") && (board [0][1]+"").equals(o+"") && (board [0][2]+"").equals(o+""))//top horizontal row     {         return true;     }     else if((board [0][1]+"").equals(o+"") && (board [1][1]+"").equals(o+"") && (board [2][1]+"").equals(o+""))//mid horizontal row     {         return true;     }     else if((board [0][2]+"").equals(o+"") && (board [1][2]+"").equals(o+"") && (board [2][2]+"").equals(o+""))//bottom horizontal row     {         return true;     }     else if((board [0][0]+"").equals(o+"") && (board [0][1]+"").equals(o+"") && (board [0][2]+"").equals(o+""))//left vertical row     {         return true;     }     else if((board [1][0]+"").equals(o+"") && (board [1][1]+"").equals(o+"") && (board [1][2]+"").equals(o+""))//mid vertical row     {         return true;     }     else if((board [2][0]+"").equals(o+"") && (board [2][1]+"").equals(o+"") && (board [2][2]+"").equals(o+""))//right vertical row     {         return true;     }     else if((board [0][0]+"").equals(o+"") && (board [1][1]+"").equals(o+"") && (board [2][2]+"").equals(o+""))//declining diagonal row     {         return true;     }     else if((board [2][0]+"").equals(o+"") && (board [1][1]+"").equals(o+"") && (board [0][2]+"").equals(o+""))//rising diagonal row     {         return true;//                                                                    respectively the same for the lines below     }     //Above O wins, Below X wins     else if((board [0][0]+"").equals(x+"") && (board [0][1]+"").equals(x+"") && (board [0][2]+"").equals(x+""))//top horizontal row     {         return true;     }     else if((board [0][1]+"").equals(x+"") && (board [1][1]+"").equals(x+"") && (board [2][1]+"").equals(x+""))//mid horizontal row     {         return true;     }     else if((board [0][2]+"").equals(x+"") && (board [1][2]+"").equals(x+"") && (board [2][2]+"").equals(x+""))//bottom horizontal row     {         return true;     }     else if((board [0][0]+"").equals(x+"") && (board [0][1]+"").equals(x+"") && (board [0][2]+"").equals(x+""))//left vertical row     {         return true;     }     else if((board [1][0]+"").equals(x+"") && (board [1][1]+"").equals(x+"") && (board [1][2]+"").equals(x+""))//mid vertical row     {         return true;     }     else if((board [2][0]+"").equals(x+"") && (board [2][1]+"").equals(x+"") && (board [2][2]+"").equals(x+""))//right vertical row     {         return true;     }     else if((board [0][0]+"").equals(x+"") && (board [1][1]+"").equals(x+"") && (board [2][2]+"").equals(x+""))//declining diagonal row     {         return true;     }     else if((board [2][0]+"").equals(x+"") && (board [1][1]+"").equals(x+"") && (board [0][2]+"").equals(x+""))//rising diagonal row     {         return true;//                                                                    respectively the same for the lines below     }     else//if none of these are fulfilled         return false;}

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


How can I prove (┐p→p)→p using ONLY (L1, L2, L3, MP) by 19 steps? Sorry for not declaring the Axiom. Here is my Axiom, which is different from the one below:    L1: p→(q→p) L2: (p→(q→r))→((p→q)→(p→r)) L3: (┐p→┐q)→(q→p)   Thanks a lot for answering me again.

$((\neg \alpha \to \alpha) \to \alpha) $  Hi, I am trying to prove this.  Can someone gives me some hints to start the question... My friend told me I might need to use deduction theorem here, but I have no clue to approach it..  Axiom 1: A→(B→A).  Axiom 2: (A→(B→C))→((A→B)→(A→C)).  Axiom 3: (¬B→¬A)→((¬B→A)→B).  To clarify: A, B, C, α, and β are propositions (i.e. assigned True or False). → and ¬ have the standard logical meanings.


I'm trying to insert images using the graphicx package. However, when I compile the code, it comes up with an error:  ! LaTeX Error: Cannot determine the size of graphic in C:/Users/cst2/Pictures/MathsC.png (no BoundingBox).   My file directory is as follows:  \graphicspath{ {C:/Users/cst2/Pictures/} }   and the call function is as follows:  \includegraphics{MathsC.png}   can anyone tell me what could be causing this error?  Many thanks.

I'm trying to include graphics in my Latex-file, which I compiled with latex+dvipdf on OS X. Latex however returns this error: "Cannot determine size of graphic"  My graphic is exported from PowerPoint, so I have tried both .pdf and .png. I get the same errors for both.  Sample code that doesn't work:  \begin{figure}[htb] \begin{center} \leavevmode \includegraphics[width=0.8\textwidth]{graph.png} \end{center} \end{figure}   If I have to manually set some measurements of the image, please tell me how I can find out those measurements. I need the image to take up about 80% of text width and be centered. Thanks.


I am using 4500 RPM motor.To be specific,this is the motor I am using . I am using Cytron MD10C motor driver to drive it.The PWM source is Raspberry pi.What is the range of frequency for PWM that I can use for this setup? Both the motor driver and the motor gets heated when a little amount of load is given.I have tried 50 to 300 Hz.

I'm planning to pwm-control four of the following motors by a single ArduinoUno:   For some reason the nearest pwm frequency I can set is 31kHz.   The other options are: 244, 488, 976, 3096, 7812 and 62500 Hz  In the data-sheet of this motor:  it is written "※PWM Frequency：25kHz"  Would that be an issue if I use 31kHz or one of the other frequancies? Which one would work or none?


I forgot how exactly the rule in English is called where you can omit the usual possessive case 's and s' if we're speaking about a row of nouns and instead just put them in front of each other (with the main noun ahead of the dependent ones).   Let's look at this example:     The redesign of units   It's a process of taking models of the old units and redesigning them to increase their quality / fix issues - gaming.  Using possessive case we can shorten it and put is as:     Units' redesign   Using the rule I mentioned in the first sentence, we can omit the s':     Units redesign   However, as far as I understand, in this case we can also omit the plural form of the word units as in this form it looks unclear whether we're talking about one unit or multiple units (which is fine):     Unit redesign   On the other hand, if we're to list the units that are about to get redesigned, can we keep that last form? I.e.     Changelog:      Unit redesign - unit 01, unit 02, unit 03   Or should it be units redesign or even unit redesigns?  Update: this isn't merely about the apostrophe rule, it's about it being omitted in certain cases too.

I’ve been looking over what has been posted regarding the use of ’s.   I used to be a Technical Writer (years ago). The title of one of our training documents was Users’ Guide.  Once, a coworker said every time he saw that title he expected users to start coming.    Never made any sense to me, but I have to admit that the majority of us didn't understand the use of s’ in place of ’s.  What is the difference?


I want to print all layers preview on one page with the names. I 'm looking for a .atn action or other simple way to do it

Is there a convenient way of creating a grid, or a collage of images, without having to do it manually?  Ideally I want a 64x64 square grid of images that are each 100px * 100px. I've seen them done a few times, I think Groupon used to have one.   Are there any plugins that exist for this or any way of doing it without having to resize each image manually?


I find C#'s Attributes, Python's Properties too a really nice idea, and I guess their direct ancestor might have come from Java's Annotations, but I'm curious as to where this concept originally came from, anyone has any clues?

What languages or platforms influenced the .NET 1.0 Team to build-in the concept of Attributes from the very start? Was this an Aspect-Oriented thing? Serialization? or something else? I was still in VB6-land at this time, and never used any of the pre-1.0 .NET versions.


I'm currently working on an android app to fetch data . It crashes and I get a NullPointerException. Can anyone help me edit my code/ list out my error?  This is a method where it crash       private void ClaimCategory() {      final ArrayList<ClaimModel> claimModels = new ArrayList<ClaimModel>();     claimModels.equals(AareonLocataireManager.getInstance().getClaims());      ArrayList<String> alist = new ArrayList<String>();      claimCategoryModel = new ArrayList<>();       alist.add(getActivity().getString(R.string.Mob_my_claim_category));     claimCategoryModel = AareonLocataireManager.getInstance().getClaimCategoryModelsObject();     // Création d'une ListIterator     ListIterator itr = claimCategoryModel.listIterator();     int i = 0;     // Afficher le contenu à l'aide de 'ListIterator'      while (itr.hasNext()) {          if (i == 2) break;         alist.add(                 claimCategoryModel.get(i).getLIBELLE());         i++;     }       ArrayAdapter<String> catAdapter = initSpinnerValues(alist);      catAdapter.setDropDownViewResource(android.R.layout.simple_spinner_dropdown_item);     categoriesSpinner.setAdapter(catAdapter);   }   Here is my logcat  11-09 19:02:10.646 30715-30715/fr.aareon.saumur E/AndroidRuntime: FATAL EXCEPTION: main Process: fr.aareon.saumur, PID: 30715 java.lang.NullPointerException: Attempt to invoke virtual method 'java.util.ListIterator java.util.ArrayList.listIterator()' on a null object reference   at fr.aareon.saumur.fragments.AddClaimFragment.ClaimCategory(AddClaimFragment.java:519)   at fr.aareon.saumur.fragments.AddClaimFragment.afterViews(AddClaimFragment.java:235)   at fr.aareon.saumur.fragments.AddClaimFragment_.onViewChanged(AddClaimFragment_.java:144)   at org.androidannotations.api.view.OnViewChangedNotifier.notifyViewChanged(OnViewChangedNotifier.java:41)   at fr.aareon.saumur.fragments.AddClaimFragment_.onViewCreated(AddClaimFragment_.java:101)   at android.support.v4.app.FragmentManagerImpl.moveToState(FragmentManager.java:1314)   at android.support.v4.app.FragmentManagerImpl.moveFragmentToExpectedState(FragmentManager.java:1528)   at android.support.v4.app.FragmentManagerImpl.moveToState(FragmentManager.java:1595)   at android.support.v4.app.BackStackRecord.executeOps(BackStackRecord.java:757)   at android.support.v4.app.FragmentManagerImpl.executeOps(FragmentManager.java:2355)   at android.support.v4.app.FragmentManagerImpl.executeOpsTogether(FragmentManager.java:2146)   at android.support.v4.app.FragmentManagerImpl.optimizeAndExecuteOps(FragmentManager.java:2098)   at android.support.v4.app.FragmentManagerImpl.execPendingActions(FragmentManager.java:2008)   at android.support.v4.app.FragmentManagerImpl.executePendingTransactions(FragmentManager.java:763)   at fr.aareon.saumur.activities.DashboardActivity.changeFragment(DashboardActivity.java:171)   at fr.aareon.saumur.activities.DashboardActivity$3.run(DashboardActivity.java:185)   at android.os.Handler.handleCallback(Handler.java:751)   at android.os.Handler.dispatchMessage(Handler.java:95)   at android.os.Looper.loop(Looper.java:154)   at android.app.ActivityThread.main(ActivityThread.java:6121)   at java.lang.reflect.Method.invoke(Native Method)   at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:889)   at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:779)

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


I'm working with PostGIS 2.1.8. I need to split a polyline into as many straight segments this polyline contains. Here is an illustration to make it clear enough:    The initial feature is only one row and the query should produce a 4 rows result with attributes values being maintained and geometry column changed (I don't want to update length column):  # Initial table:  id   | name    | length   | the_geom -----+---------+----------+----------------- 1    | Line 1  | 12.2     | 01000111100000   # Result table:  id   | name    | length   | the_geom -----+---------+----------+----------------- 1    | Line 1  | 12.2     | 01000111100000 2    | Line 1  | 12.2     | 01001111000011 3    | Line 1  | 12.2     | 01000110010000 4    | Line 1  | 12.2     | 00000111100000   I have found the function st_subdivide() () but it is available from PostGIS version 2.2... I can't upgrade my PostGIS version because I'm at work and not allowed to do it.  Any idea on how to achieve that with an older than 2.2 PostGIS version?

I have a MULTILINESTRING in PostGIS consisting of several LINESTRING's. Consider each LINESTRING to have a set of POINT's      P1, P2, ... PN   forming the line segments     L1, L2, ... LN-1   where LX is the line segment connecting PX to PX+1.  Using PostGIS 1.5 how can I explode the MULTILINESTRING into individual line segments of each LINESTRING?


According to the Kolmogorov definition, given two events A and B,  $P(A|B) = \frac{P(A \cap B)}{P(B)}$ . But I dont really understand why this is true. Why isn't $ P(A|B) = P(A \cap B) $??  Somebody please help me get an intuition why the Kolmogorov definition is true??

What is some intuitive insight regarding the conditional probability definition: $P(A\mid B) = \large \frac{P(A \cap B)}{P(B)}$ ? I am looking for an intuitive motivation. My textbook merely gives a definition, but no true development of that definition. Hopefully that's not too much to ask.


I am an Indian Passport holder. I do not want to leave SVO, Moscow airport. Do I still need transit visa for travelling from Guangzhou, CN to Vienna - VIE? Will 3 hours  be enough to pass through all immigration and others issues?

According to  it seems that anyone can make the transit without a visa, but I'm not convinced. Where can I get some more official information on this?


As you can see, I scaled the top surface, and it messes up other parts. It is just a perfect sylinder before I change the scale.   This happen everytime I scale something. Please help, thank you!

My problem is that I sometimes lose the ability to independently translate or otherwise transform any parts of a single mesh. If I try, for example, to just translate several faces, edges, or vertices, then the entire mesh will stretch and displace itself in order to follow the translation. Or, alternatively, if I try to translate just one face then the whole mesh will move as if I'm translating in Object Mode.  I'm not really sure I know how to describe this problem properly. I don't even know how to reliably reproduce it. It seems to happen to any given mesh at random, and it doesn't stop happening to that mesh unless I delete and remake it.  I assume that I must be doing something wrong to cause this to happen. Does anyone have any ideas? Thanks.


I already installed Java 8, but I don't know how to install Java 7 and how to switch between the two Java versions.   I also want to switch between Java 7 and 8 to update a project I am working on. I am a new Ubuntu user, so be very specific.  added: 12/31/2017  gero@4790k:~$  lsb_release -a No LSB modules are available. Distributor ID: Ubuntu Description:    Ubuntu 16.04.3 LTS Release:        16.04 Codename:       xenial   When I try to use:  gero@4790k:~$ sudo apt-get install openjdk-7-jdk Reading package lists... Done Building dependency tree Reading state information... Done Package openjdk-7-jdk is a virtual package provided by:   oracle-java9-installer 9.0.1-1~webupd8~0   oracle-java8-installer 8u151-1~webupd8~0   oracle-java7-installer 7u80+7u60arm-0~webupd8~1 You should explicitly select one to install.  E: Package 'openjdk-7-jdk' has no installation candidate   I don't even know how to select the the java installer 7u80.  Or if you can tell me how to install jdk-7u80-linux-x64.tar.gz or jdk-7u80-linux-x64.rpm .

While installing Android Studio on Ubuntu 14.04 I get the message that my Java version (javac 1.7.0_79) is causing problems. I found a  of how to install a newer Oracle version of Java:  sudo apt-add-repository ppa:webupd8team/java sudo apt-get update sudo apt-get install oracle-java8-installer   However I'm afraid that this might overwrite my existing open-jdk version of Java. Since I don't know which of my programs depend on Java, I fear that this could crash these other programs.  Is there a way to make sure apt-get doesn't overwrite my previous Java? I would basically like to have installed both and be able to switch between them manually, depending on what version I need.


I've seen people write custom classes to more easily handle command line options in various languages. I wondered if .NET (3.5 or lower) has anything built in so that you don't have to custom-parse things like:     myapp.exe file=text.txt

When building console applications that take parameters, you can use the arguments passed to Main(string[] args).   In the past I've simply indexed/looped that array and done a few regular expressions to extract the values. However, when the commands get more complicated, the parsing can get pretty ugly.    So I'm interested in:   Libraries that you use Patterns that you use   Assume the commands always adhere to common standards such as .


Just installed ubuntu 13.10  I did apt-update in terminal and sow this   Err http://ppa.launchpad.net /ubuntu/saucy amd64 Packages                          404  Not Found Err http://ppa.launchpad.net /ubuntu/main amd64 Packages                           404  Not Found Err http://ppa.launchpad.net /ubuntu/saucy i386 Packages     404  Not Found Err http://ppa.laun   W: Failed to fetch http://ppa.launchpad.net/ubuntu-wine/ppa/dists//ubuntu/saucy/binary-amd64/Packages  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/ubuntu-wine/ppa/dists//ubuntu/main/binary-amd64/Packages  404  Not Found   W: Failed to fetch http://ppa.launchpad.net/ubuntu-wine/ppa/dists//ubuntu/saucy/binary-i386/Packages  404  Not Found   W: Failed to fetch http://ppa.launchpad.net/ubuntu-wine/ppa/dists//ubuntu/main/binary-i386/Packages  404  Not Found   E: Some index files failed to download. They have been ignored, or old ones used instead.   I do not understand why am I getting this errors wine's ppa shows that 13.10 is available and the above I even do not know what is it ?? any help how to fix this  grep -rn "ubuntu-wine" /etc/apt/sources*  /etc/apt/sources.list.d/ubuntu-wine-ppa_-saucy.list:1:deb http://ppa.launchpad.net/ubuntu-wine/ppa /ubuntu saucy main /etc/apt/sources.list.d/ubuntu-wine-ppa_-saucy.list:2:# deb-src http://ppa.launchpad.net/ubuntu-wine/ppa /ubuntu saucy main

PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors?


I'm using Nikon FM2, it already has it's own internal light-meter.   I'm wondering if it's good enough.   When to use standalone lightmeter (like Sekonic) when your camera already has it?

I know a few people who carry around a dedicated light meter unit (such as ) and use that to meter photos instead of using the meter built into their cameras (and these are relatively new mid-range DSLRs).  Is there any good reason why someone would do this?


Let $U_n$ denote the group of units in $\mathbb{Z}_n$ with multiplication modulo $n$. It is easy to show that this is a group. My question is how to characterize the $n$ for which it is cyclic. Since the multiplicative group of a finite field is cyclic so for all $n$ prime, it is cyclic. However I believe that for certain composite $n$ it is also cyclic.   Searching through past posts turned up , where there was an answer containing the sentence "In number-theoretic situations there are coherent things that can be said, and/but in general I think nothing decisive can be said."  What are those number theoretic situations?  Thanks

When can we say a multiplicative group of integers modulo $n$, i.e., $U_n$ is  cyclic?   $$U_n=\{a \in\mathbb  Z_n \mid \gcd(a,n)=1 \}$$  I searched the internet but did not get a clear idea.


So I can see S3 console and can get into my folder with files listing but I don't find way to find total number of files in it other than going thru pagination which does not work considering thousands of files.

I'd like to graph the size (in bytes, and # of items) of an Amazon S3 bucket and am looking for an efficient way to get the data.  The  tools provide a way to get the total file size using s3cmd du s3://bucket_name, but I'm worried about its ability to scale since it looks like it fetches data about every file and calculates its own sum. Since Amazon charges users in GB-Months it seems odd that they don't expose this value directly.  Although  returns the number of items in a bucket,  doesn't seem to expose it. I could do s3cmd ls -r s3://bucket_name | wc -l but that seems like a hack.  The Ruby  library looked promising, but only provides the # of bucket items, not the total bucket size.  Is anyone aware of any other command line tools or libraries (prefer Perl, PHP, Python, or Ruby) which provide ways of getting this data?


I have a big problem with Ubuntu for laptops (Lubuntu), in that I need to define a "Root File System". I am completely new to the Ubuntu family, and thus, I come to you for help. How do I access the Partitioning Menu on my computer? I am running an Acer Aspire One, Model number KAV60, with, currently, Windows XP SP3, and Lubuntu 14.10. If further information is needed, I'd be happy to give it, as long as this can get fixed.

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


This is regarding the simple case of y=mx+b.   It's my understanding that the OLS estimator must necessarily pass through the mean of X and Y.  How do you prove that this is always so?

How do you show that the point of averages (x,y) lies on the estimated regression line?


Given a ring $A$ we can make $Spec(A)$ with the Zariski topology. A question in atiyah and macdonald asks you to prove that $Spec(A)$ is quasi-compact. It is clear that if $Spec(A)$ is covered by open sets $U_s, s\in S$, then it is covered by $X_{f_i}, i \in I$ where $X_{f_i}$ are the basic open sets of the Zariski topology. Then it is easy to show if the $X_{f_i}$ cover $Spec(A)$ then they generate the unit ideal. From this point I become very confused. This is because I do not see how the $X_{f_i}$ generating the unit ideal implies some finite subset $J$ of $I$ $X_{f_j}, j\in J$ generates the unit ideal.   edit: well now i understand why there must be a finite subset it comes directly from the definition of sum of ideals. but now i am really confused as to why the definition of sum of ideals is such that almost all of them are 0. i would appreciate some insight as to why this is.

In an exercise in Atiyah-Macdonald it asks to prove that the prime spectrum $\operatorname{Spec}(A)$ of a commutative ring $A$ as a topological space $X$ (with the Zariski Topology) is compact.   Now because the basic open sets $X_f = \{\mathfrak{p} \in \operatorname{Spec} (A) : \{f\} \not\subseteq \mathfrak{p} \}$ form a basis for the Zariski Topology it suffices to consider the case when   $$X = \bigcup_{i \in I} X_{f_i}$$   where $I$ is some index set. Then taking the complement on both sides we get that   $$\emptyset = \bigcap_{i \in I} X_{f_i}^c$$  so there is no prime ideal $\mathfrak{p}$ of $A$ such that all the $f_i$'s are in $\mathfrak{p}$. Now from here I am able to show that the ideal generated by the $f_i$'s is the whole ring as follows. Since there is no prime ideal $\mathfrak{p}$ such that all the $f_i \in \mathfrak{p}$, it is clear that there is no $\mathfrak{p}$ such that $(f_i) \subseteq \mathfrak{p}$ for all $i \in I.$ Taking a sum over all the $i$ then gives $$\sum_{i \in I} (f_i) = (1).$$  Now here's the problem:          How do I show from here that there is an equation of the form $1 = \sum_{i \in J} f_ig_i,$ where $g_i \in A$ and $J$ some finite subset of $I$?       This part has been giving me a headache. I am not sure if the finiteness bit has to do with algebra, topology or the fact that we are dealing with prime ideals.  This is not a homework problem but rather for self-study.  $\textbf{Edit:}$ I have posted my answer below after the discussion with Dylan and Pierre.


I recently was reading through my James Stewart calculus book and learnt  the limit laws . Take for example the sum rule if the limit of 2 functions exist then the sum of their limits is equal to the limit if their sums.this we can use to prove the sum rule for derivatives. However when they say exists what exactly do they mean for example does the limit need to be a real number.for example if the limit of some function is $\lim_{x \to a} f(x)$=$+\infty$ Does the limit not exist and hence we cannot use the sum rule ?

I read in Stewart "single variable calculus" page 83 that the limit $$\lim_{x\to 0}{1/x^2}$$ does not exist. How precise is this statement knowing that this limit is $\infty$?. I thought saying the limit does not exist is not true where limits are $\infty$. But it is said when a function does not have a limit at all like  $$\lim_{x\to \infty}{\cos x}$$.


I have a problem with disk space usage on my server. I find 97% usage in dev/md3 but when I try to find which file or folder takes up space I can't find anything...  Filesystem      Size  Used Avail Use% Mounted on udev            7,8G     0  7,8G   0% /dev tmpfs           1,6G  9,0M  1,6G   1% /run /dev/md3         20G   18G  581M  97% / tmpfs           7,9G     0  7,9G   0% /dev/shm tmpfs           5,0M     0  5,0M   0% /run/lock tmpfs           7,9G     0  7,9G   0% /sys/fs/cgroup /dev/md2        487M  147M  311M  33% /boot /dev/md4        1,8T  311G  1,4T  19% /home   4,0K    ./srv 9,0M    ./run 8,0K    ./snap 4,0K    ./mnt 1,5G    ./usr 7,3M    ./etc 26M ./sbin 311G    ./home 260M    ./var 4,0K    ./opt 116K    ./root 4,0K    ./lib64 64K ./tmp 861M    ./lib 0   ./dev du: cannot access './proc/3718/task/3718/fd/4': No such file or directory du: cannot access './proc/3718/task/3718/fdinfo/4': No such file or directory du: cannot access './proc/3718/fd/3': No such file or directory du: cannot access './proc/3718/fdinfo/3': No such file or directory 0   ./proc 16K ./lost+found 4,0K    ./media 0   ./sys 145M    ./boot 15M ./bin 314G    .   Disk /dev/sda: 1,8 TiB, 2000398934016 bytes, 3907029168 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: gpt Disk identifier: A9EF77EC-EC51-403D-B07F-1A4832C18250  Device          Start        End    Sectors    Size Type /dev/sda1          40       2048       2009 1004,5K BIOS boot /dev/sda2        4096    1050623    1046528    511M Linux RAID /dev/sda3     1050624   42008575   40957952   19,5G Linux RAID /dev/sda4    42008576 3905972223 3863963648    1,8T Linux RAID /dev/sda5  3905972224 3907018751    1046528    511M Linux swap   Disk /dev/sdb: 1,8 TiB, 2000398934016 bytes, 3907029168 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: gpt Disk identifier: 4441E7B0-2838-45FE-83DC-8B6DC3BB05B2  Device          Start        End    Sectors    Size Type /dev/sdb1          40       2048       2009 1004,5K BIOS boot /dev/sdb2        4096    1050623    1046528    511M Linux RAID /dev/sdb3     1050624   42008575   40957952   19,5G Linux RAID /dev/sdb4    42008576 3905972223 3863963648    1,8T Linux RAID /dev/sdb5  3905972224 3907018751    1046528    511M Linux swap   Disk /dev/md2: 511 MiB, 535756800 bytes, 1046400 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   Disk /dev/md4: 1,8 TiB, 1978349322240 bytes, 3863963520 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   Disk /dev/md3: 19,5 GiB, 20970405888 bytes, 40957824 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   /home seems to be the heaviest but it is located on a 1TO partition..  With this information I see that I have more or less 15GB which are counted as used but which do not appear anywhere.  How could I identify which files are taking up space and delete them to get free disk space on /dev/md3?

Looking for a series of commands that will show me the largest files on a drive.


\documentclass [12pt,a4paper] {article} \usepackage {geometry} \usepackage {graphicx} \usepackage {hyperref} % \begin {document} bapi  \par  \begin {eqnarray} \frac{dy}{dt} &=& -t \\ % \frac{dx}{dt} &=& 1 % \end {eqnarray}  \end {document}   To run the LaTeX file abc.tex, I use the command latex abc.tex. Then an error message will occur:  ! LaTeX Error: File `url.sty' not found. Type X to quit or <RETURN> to proceed, or enter new name. (Default extension: sty) Enter file name:   I am using Ubuntu 14.04 LTS and the version of the TeX compiler in my computer is pdfTeX 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian).  Without \usepackage{hyperref}, there is no error message and the .tex file run smoothly.   What is the problem with \usepackage{hyperref}?

Motivation  I want to include a list of related equations, say, for a proof, in my LaTeX document. As far as I know, I have two good options, eqnarray and align.   Question  What is the difference between eqnarray and align, and how do I know which I should be using? Or does it matter at all?


I am new to tries and testing how it works. Right now I am building a contact list. I add 'Prashanth' and 'Pradep' to the trie and when I search 'Pra' I should receive the count as two. My approach is having the variable size in each node and returning it when the string of same length is found. There are some unnecessary things/variables like payload etc which I used for debugging. The problem I found is when I store a character and a node in hashmap, empty node is getting stored. So I am getting 0 as answer all the time.    public class tries {  public static class Node {      HashMap<Character, Node> children = new HashMap<>();     boolean endOfWord = false;     int size =0;     int payload = 10;       public void setNode(char c, Node n) {       children.put(c,n);     }      public Node getNode(char c) {         return children.get(c);     }      public void addNode( String s,int index) {         Node current = children.get(s.charAt(index));         size++;         if(index ==s.length()-1)         {             endOfWord = true;             return;         }         if(current== null)          {              current.payload = 11;             this.setNode(s.charAt(index),current);         }         addNode(s,index+1);      }      public int findcount(String s, int index) {         Node current = children.get(s.charAt(index));          if(index ==s.length()-1)         {             current.endOfWord = true;             return current.size;         }         if(current == null)         {             return 0;         }           return findcount(s,index+1);     } } public static void main(String args[]) {     String c1 = "Prashanth";     String c2=  "Pradep";     Node n = new Node();     //tries t = new tries();      n.addNode(c1,0);     n.addNode(c2,0);      System.out.println(n.findcount("Pra",0));   }   }     Error which I get If i run this code. ( I will get 0 if I alter a bit)   Exception in thread "main" java.lang.NullPointerException at tries$Node.addNode(tries.java:35) at tries.main(tries.java:66) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:57) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:606) at com.intellij.rt.execution.application.AppMain.main(AppMain.java:147)

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


1.New employee is going to join on Sunday. 2.New employee is joining on Sunday. 3.New employee will join on Sunday. 4.New employee joins on Sunday.  Can you please let me know which sentence i should use form abou and why ?

I asked this question  but I haven't gotten a useful answer. Could you tell me the difference in meaning between these sentences?        Do you think you will visit them next week?     Will you visit them next week?     Are you going to visit them next week?     Are you visiting them next week?     Are you going to be visiting them next week?     Are you planning to be visiting them next week?     Do you plan to visit them next week?      Will there be any difference in the answers?        I think I will visit them next week.     I will visit them next week.     I am going to visit them next week.     I am visiting them next week.     I am going to be visiting them next week.     I am planning to be visiting them next week.     I plan to visit them next week.      Can I use "planning to" instead of "going to"?  (E.g. "Are you planning to visit them next week? — Yes, I am planning to visit them next week.") Which of these sentences show that the subject of conversation has already been discussed? For example, I talked with a friend of mine about my plans to visit somebody. So my friend is aware of my plans.  And my last question. Which of these seven sentences express that the action will certainly take place?


We have a user sign up form in our product. In web version we have a email verification process. We will send a verification mail with an activation link after sign up.   Now we have a mobile app for the same product.I feel like following the same process is not good on a mobile because it makes the sign up process longer and user needs to use his mail client and browser to complete sign up process.  A "loooong" process in mobile is really bad, How can we solve this issue.

Everybody knows the normal registration process:    Fill in sign up form Wait for email Click confirmation link in email Done (signed in & confirmation by email)   IMO this process works because people are used to it but it isn't very elegant because it breaks the user's flow. The same process on in a mobile app would look something like this:   Fill in sign up form Wait for email, switch to email app Click confirmation link in email Browser opens and shows confirmation page Switch back to app Type in sign on information Done   This is just painful (even more so if the email address used for the sign up isn't the one that is used on the mobile's email client).  I see two main alternatives but both have some issues:   Don't require a confirmation by email, just sign in the user immediately. Main problem: We can't be sure if the email address is correct (other than syntax). Don't require immediate confirmation: Let the user confirm his email address in the next 7 days or so and sign him in immediately. Main problem: Still can't handle wrong email addresses   Are there any other alternatives or more elegant ways to handle registrations?


I read that a symmetric encryption requires a way bigger key size to have the same security as symmetric encryption with smaller keys. But why is this, and why is it so much harder to compute?

I know the basic differences between Symmetric vs. Asymmetric cryptography, but I'd love to know more details:    Exactly why is the asymmetric approach slower than the symmetric?  Why does it make use of longer keys?  Why does it require more processing power, etc, etc? In what ways does it trump the symmetric approach?   Thanks, in anticipation, for your answers - I'm writing a BSC project on this issue.


What is the inverse of X modulo $1 + X + X^2 + X^3 + X^4$? Is there any open softwares to calculate such things easily?

Let $\theta$ be a root of $p(x)=x^3+9x+6$, find the inverse of $1+\theta$ in $\mathbb{Q(\theta)}$.  So problems like this really annoy me but I did crappy on the last homework after making a lot of arithmetic mistakes so I want to run everything by you guys. This one isn't actually for homework it's just a suggested practice problem but okay lets go!!!  So I'm not sure if the method I used to do this was standard or not, I don't remember my professor showing me, but what I did first was used the canonical euclidean algorithm in $\mathbb{Q[x]}$ and wrote:  $x^3+9x+6$  $=(1+x)(x^2-x+10-\frac{4}{x+1})$  $=(1+x)(x^2-x+10)-4$  the reduced modulo  the minimal polynomial of $\theta$ i.e. $x^3+9x+6$ and so  $4=(1+x)(x^2-x+10)$  $\rightarrow$  $1= \frac{1}{4}(1+x)(x^2-x+10)$ and sooo ah $(\theta^2-\theta+10)\frac{1}{4}$ is what I believe is the inverse of $(1+\theta)$ in the quotient field... Like i said I hate these problems but ehh is this correct? On a lighter note it's finally getting cool enough for me to go on proper runs here and so that's pretty bomb!


Where is this text tutor? I keep finding references to it but only get an empty document when I run it.

I want to learn Vim. The vast majority of people advise me to use vimtutor. I downloaded the package and ran it, but I just get given a blank screen.    I see on  that there should be tons of things on there. But I am not getting it...How can I fix this?  Originally, I was told by the terminal to install vim-runtime in order to run vimtutor, and I did and it ran, albeit with a blank screen. I was able to run this tutorial after I installed vim-gtk. Anyone know why it didn't show up the first time?


Let's say I'm a multiclass rogue/ranger and I have taken Expertise in survival checks. Now, if a ranger is in their favored terrain it says they double their proficiency bonus in intelligence and wisdom checks relating to you environment. If I am in my favored terrain and use my already doubled survival check, will it double again?

Do features that allow you to add twice your proficiency bonus, under some other name, stack with Expertise?  For instance, , with  as applied to History checks, to identify the origin of stonework.  The text of Stonecunning is reproduced below:     Whenever you make an Intelligence (History) check related to the origin of stonework, you are considered proficient in the History skill and add double your proficiency bonus to the check, instead of your normal proficiency bonus.   And, for good measure, the relevant portion of Expertise:     Your proficiency bonus is doubled for any ability check you make that uses either of the chosen proficiencies.


On the PHB p. 72 it just says:  Improved Critical Beginning when you choose this archetype at 3rd level, your weapon attacks score a critical hit on a roll of 19 or 20.  So my assumption is that on attacks made by Booming Blade or Divine Smite, the crit still applies to the regular attack's effects, but does the critical hit then effect with the Booming Blade's on hit Thunder damage, or the Smite's Radiant damage? What about with the bonus action smites? Like Thunderous Smite, does it affect those as well? Basically, my main question is, does Improved Critical basically just boost your critical range, or does it specifically only improve the critical of regular weapon attacks from the attack action?

I'm a bit confused on how extra damage works for critical hits. Let's take the following example: A thief with sneak attack rolls a crit. I'm under the impression he rolls double his normal attack damage dice AND double his Sneak Attack damage dice. Is this accurate? Another example, I finished DM-ing my first campaign recently. The Giant Spider enemy monster has an melee attack that causes a constitution saving throw. If the player fails, the enemy rolls an additional 2D8 of damage. In this situation, if there was a critical hit, and the player failed their saving throw, would I also roll double dice on the additional damage? Or is that considered a separate attack?


How did the phrase "the powers that be" come about, is it an archaic verb tense of "being"?

In the phrase "the powers that be," as in the sentence:  It would never have occurred to the powers that be to run and supervise the National Lottery from anywhere but London.  () Why do we use "be", the infinitive form of the verb? Wouldn't "the powers that are" or "the powers that rule" make a lot more sense?


Whenever I tried to update my system Using sudo apt update && apt upgrade  I found this error E: Could not open lock file /var/lib/dpkg/lock-frontend - open (13: Permission denied) E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend), are you root?  I'm using Ubuntu 20.04.1 LTS x86_64 with plasma

I'm trying to run this command in the terminal:  sudo apt install software-properties-common   This is the error message I get:  E: Could not get lock /var/lib/dpkg/lock-frontend - open (11: Resource temporarily unavailable)   E: Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend),     is another process using it?


I am creating a directional application in android . that why i have to get the location from the android device here is my code when i run this code it give me Exception at these line   curlat = location.getLatitude(); curlng = location.getLongitude();   This is whole function   public void newlocation(Context context) {     locationManager = (LocationManager) getSystemService(Context.LOCATION_SERVICE);     // Define the criteria how to select the location provider     criteria = new Criteria();     criteria.setAccuracy(Criteria.ACCURACY_COARSE); // default     // user defines the criteria     criteria.setCostAllowed(false);     // get the best provider depending on the criteria     provider = locationManager.getBestProvider(criteria, false);     // the last known location of this provider      if (ActivityCompat.checkSelfPermission(this, Manifest.permission.ACCESS_FINE_LOCATION) != PackageManager.PERMISSION_GRANTED && ActivityCompat.checkSelfPermission(this, Manifest.permission.ACCESS_COARSE_LOCATION) != PackageManager.PERMISSION_GRANTED) {         // TODO: Consider calling         //    ActivityCompat#requestPermissions         // here to request the missing permissions, and then overriding         //   public void onRequestPermissionsResult(int requestCode, String[] permissions,         //                                          int[] grantResults)         // to handle the case where the user grants the permission. See the documentation         // for ActivityCompat#requestPermissions for more details.         return;     }     Location location = locationManager.getLastKnownLocation(provider);     mylistener = new MyLocationListener();     if (location != null) {         mylistener.onLocationChanged(location);     } else {         // leads to the settings because there is no last known location         Intent intent = new Intent(Settings.ACTION_LOCATION_SOURCE_SETTINGS);         startActivity(intent);     }     // location updates: at least 1 meter and 200millsecs change     locationManager.requestLocationUpdates(provider, 200, 1, mylistener);     // String a=""+location.getLatitude();     // Toast.makeText(getApplicationContext(), a, 222).show();      curlat = location.getLatitude();     curlng = location.getLongitude();     Log.d("************", "1111111111111111");     new GetAddressTask(this).execute(location);  }

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


I saw this sentence in an English article.     It’s time we had a serious rethink about “learning.”   There are some questions about this sentence.   Why the word 'had' has past tense in this sentence What does 'had' mean in this sentence. It seems like 'had + verb' has some special meaning.   and If I made some mistakes in this question. Please let me know. I'm all ears.  Thanks

Why do we use the simple past but not the present or future in the following expressions:  Don't you think it's time we went a little further Don't you think it's time we ate Don't you think it's time we went home


When I type in sudo apt-get update, I get this error:  $ sudo apt-get update N: Ignoring file 'getdeb.list.bck' in directory '/etc/apt/sources.list.d/' as it has an invalid filename extension E: Type '' is not known on line 3 in source list /etc/apt/sources.list.d/libdvdcss.list E: The list of sources could not be read.

Every once in a while I see users having issues to update due to errors like this:  E:Type 'ain' is not known on line 1 in source list /etc/apt/sources.list.d/some-ppa.list'   with varying types/line numbers/source list files (often after removing a PPA).  How can such an error be fixed?


Consider the sequence $x_{n+1} = \frac{1}{2} (x_n + \frac{2}{x_n})$, $x_1 = 2$. Prove that it converges to $\sqrt{2}$.  I want to show that all of $x_n$ is bounded below by $\sqrt{2}$ using induction. However, I can't see how knowing $x_n \geq \sqrt{2}$ helps show that $\frac{1}{2} (x_n + \frac{2}{x_n}) \geq \sqrt{2}$. Namely, it's not clear whether a higher value of $x_n$ produces a lower (or higher) value of $x_{n+1}$.  Edit: I am looking for a solution that does not use AM-GM (which is proven later in the text that I am reading).

a) Let $a>0$ and the sequence $x_n$ fulfills $x_1>0$ and $x_{n+1}=\frac{1}{2}(x_n + \frac{a}{x_n})$ for $n \in \mathbb N$. Show that $x_n \rightarrow \sqrt a$ when $n\rightarrow \infty$. I have done it in two ways, but I guess I'm not allowed to use the first one and the second one is incomplete. Can someone please help me?  We already know $x_n \rightarrow \sqrt a$, so we do another step of the iteration and see that $x_{n+1} = \sqrt a$.  Using limit, $x_n \rightarrow x, x_{n+1} \rightarrow x$ (this is the part I think it's incomplete, don't I have to show $x_{n+1} \rightarrow x$, how?), we have that   $$x = \frac x 2 (1 + \frac a {x^2}) \Rightarrow 1 = a/x^2 \Rightarrow x = \sqrt a$$ b) Let the sequence $x_n$ be defined as $x_{n+1}= 1 + \frac 1 {x_n} (n \in \mathbb N), x_1=1$. Show that it converges and calculate its limit. "Tip: Show that sequences $x_{2n}$ and $x_{2n+1}$ monotone convergent to the limit." I didn't understand the tip, how can this help me? Does it make a difference if the number is odd or even? Thanks in advance!


I can not fix this issue when selecting EEVEE for my renders. It gets really annoying.  I can get rid of them temporary when I scroll out or into the viewport. Does anyone have an Idea how I can fix that? Blender version 2.81a

I can notfix this issue when selecting Eevee for my renders. It gets really annoying. I can get rid of them temporary when I scroll out or into the viewport. Does anyone have an Idea how I can fix that?  thanks c:


Jean-Paul Sartre claimed we are totally free. This might lead some people to think they can show no concern for others and do whatever they want. He warned, however, if everything is based on free choice, we are responsible for the consequences of our actions on ourselves and others. How might this responsibility limit our total freedom? Give examples.

I am reading "Existenstialism is a humanism", the text of the famous conference by Sartre in which he explains his own version of existentialism. I think is full of logical inconsistencies, but maybe it's just because I don't understand it or I don't know enough about existentialism. Anyway, my question is about a specific passage. After having "demonstrated" that there is no way one can derive an ethics outside of Man (God does not exist and reason is insufficient), he asks himself according to what principle a person should behave and he says:     "For I declare that freedom, in respect of concrete circumstances, can   have no other end and aim but itself; and when once a man has seen   that values depend upon himself, in that state of forsakenness he can   will only one thing, and that is freedom as the foundation of all   values. That does not mean that he wills it in the abstract: it simply   means that the actions of men of good faith have, as their ultimate   significance, the quest of freedom itself as such."   So it seems Sartre says that when deciding a course of action, people will always choose "freedom," (and also, elsewhere, that "freedom" is always a good thing). That is for him the only principle, the only moral that governs or should (because we can do wrong judgments about what is freedom) govern our action.  My questions are:  1) do I understand correctly Sartre's thinking?  2) He says: a) freedom is absolute; b) the values that man chooses are also absolute because no God or reason can tell him what to do, c) therefore man will choose freedom. Is there any logic in this statement? If I replace freedom with X where X is "pleasure" or "justice" or "pain" or "zero temperature", wouldn't I "demonstrate" by this logic that man will choose X?  3) assuming what I said makes any sense, how can existentialism ever find a rule of moral conduct? and if it does, what is it and how can be demonstrated? and if it cannot, why is or has been important at all as a philosophy?  Thanks!


Question has a historical lock:     This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed. More info: help center.   My question:    Historical lock:     This question exists because it has historical significance, but it is not considered a good, on-topic question for this site, so please do not use it as evidence that you can ask similar questions here. This question and its answers are frozen and cannot be changed. More info: help center.   The first question can be viewed in the questions list.  From an answer I got in this question: , it seems to imply that historical locks on questions make it so that you need a direct link to the question to view it. On , my question has altogether disappeared from the Questions list.  Here on Meta.SE, that question seems to have not.

Historical locks are sometimes applied to questions.   What is a historical lock? What is the purpose of a historical lock? How are questions affected by historical locking? When is it appropriate to lock a question for historical reasons?  When is it not appropriate? How do I request a historical lock for a question? What should I do if I notice a serious problem with a historically-locked question or one of its answers?


I'be been using the longtable environment to construct the outlined below (This is only part of the data. The whole data runs over 4 pages and is much wider). The problem that I'm having is that the data runs over the right margin and I get the following error:    Overfull \hbox (605.54675pt too wide) in alignment at lines 12--40.    I've been told that there is no command which automatically adjust the table to fit in the page. However, I would like to know if    there is a way to decrease the distance between each column and  Make the font size smaller in the table so that all the columns fit in the page.    I've read the other posts that are similar to this question however I'm new to LaTeX and I'm having a hard time finding a solution to this problem. Can anyone help? Thanks  Alex  \documentclass{article} \usepackage{graphicx,booktabs,rotating,adjustbox,geometry} \usepackage{longtable} \usepackage{ltablex} \geometry{  a4paper,  total={170mm,257mm},  left=20mm,  top=20mm,} \begin{document}  \begin{longtable}{lllllll}  \toprule[1pt] & \multicolumn{4}{r}{Spectral Index} \\     \cmidrule(l{1pt}){4-5} \emph{MGI Symbols} & \emph{Protein Name} & \emph{UniProt Acc} & \emph{AveKI} & \emph{AveWT} & \emph{KI/WT Ratio} & \emph{Cluster}\vspace{5mm} \\\midrule  Title/Title\vspace{5mm}\\  $Amph$ & Amphiphysin & Q7TQF7 & 1.42E-06 & 0.00E+00 & KI Only & X6\\ $Bin1$ & Myc Box-Dependent-Interacting Protein 1 & O08539 & 1.20E-06 & 0.00E+00 & KI Only & X6\\ $Cltc$ & Clathrin Heavy Chain 1 & Q68FD5 & 5.88E-07 & 6.00E-08 & 9.80 & X6\\ $Dnm1$ & Dynamin-1 & P39053 & 1.97E-06 & 3.41E-08 & 57.76 & X6\\ $Nsf$ & Vesicle Fusing ATPase & P46460 & 3.43E-07 & 0.00E+00 & KI Only & X6\\ $Snap25$ & Synaptosomal-Associated Protein 25 & P60879 & 8.90E-06 & 3.27E-06 & 2.72 & B\\ $Stxbp1$ & Isoform 2 Of Syntaxin-Binding Protein 1 & O08599 & 1.22E-06 & 0.00E+00 & KI Only & X6\\ $Syt1$ & Synaptotagmin 1 & P21579 & 1.02E-05 & 4.81E-06 & 2.13 & B\vspace{5mm}\\  \vspace{5mm}\\\bottomrule  \hline  \end{longtable}  \end{document}

I'm trying to make a longtable that is wider than the textwidth at a certain moment. I've tried different things always ending up with a different problem:  First possibility: If I use the adjustwidth environment the longtabu does not align correctly. The left margin stays fixed and the right margin gets out of the page. This in contrast, if I do the exact same thing to make a tabu (instead of longtabu), it works perfectly. I think using the adjustwidth is the best way to go, but I can't manage to get it working.  Second possibility: I've found a solution using the fullwidth package. That package does the trick on small longtables, but freezes when I'm trying to do it on my big longtable. The command \setlength\LTleft{-2cm} didn't work as well.  The final option I tried was to use geometry. But that changes the margin of the whole page thus making a page break which I'm not interested in. The code I used for this was  \newgeometry{left=1.2cm} \begin{longtable} long table stuff \end{longtable} \restoregeometry   Here's an example of what I want contra what I get  \documentclass[a4paper]{article} \usepackage{longtable} \usepackage{chngpage} \usepackage{lipsum} \usepackage{tabu}  \begin{document} \section{This is the original textwidth.} \lipsum[1]  \section{This is the width I need for my longtabu} \begin{adjustwidth}{-1in}{-1in} \begin{tabu} to \linewidth {*{13}{|X[l]} |} 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ \end{tabu} \end{adjustwidth}  \section{This is what happens} \begin{adjustwidth}{-1in}{-1in} \begin{longtabu} to \linewidth {*{13}{|X[l]} |} 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ 01 & 02 & 03 & 04 & 05 & 06 & 07 & 08 & 09 & 10 & 11 & 12 & 13 \\ \end{longtabu} \end{adjustwidth}  \end{document}


I have this C++ abstraction layer for a STM32F405 board, and I'm trying to interface it with some other code, but I've found that the creation of a large array causes some weird behavior.  Here is my main() function:    int main(void) {   char test[10000];   Board board;   board.init_board();    while(1)   {     board.led0_toggle();     board.clock_delay(100);   }   return 0; }   When I run this, after the second line, it runs through every interrupt routine, however, if I remove the array, i.e.  int main(void) {   Board board;   board.init_board();    while(1)   {     board.led0_toggle();     board.clock_delay(100);   }   return 0; }   It runs as expected.  Any advice on what might be going on?

The following code is generating a stack overflow error for me  int main(int argc, char* argv[]) {     int sieve[2000000];     return 0; }   How do I get around this? I am using Turbo C++ but would like to keep my code in C  EDIT:  Thanks for the advice.  The code above was only for example, I actually declare the array in a function and not in sub main.  Also, I needed the array to be initialized to zeros, so when I googled malloc, I discovered that calloc was perfect for my purposes.  Malloc/calloc also has the advantage over allocating on the stack of allowing me to declare the size using a variable.


i need explanation about object or date in javascript. Because i made some variable with value an object(date), but after i change the a new variable, all variables and the object is being change. I don't know why this happen.  Here is the code  var expDate = new Date(Date.now()); var minExpDate = expDate; var maxExpDate = expDate;  minExpDate.setDate(minExpDate.getDate() + 30); maxExpDate.setDate(maxExpDate.getDate() + parseInt(chf.Get('ExtraDays')));  alert(expDate + '\n' + minExpDate + '\n' + maxExpDate);   but it's okay if i make a new object  var expDate = new Date(Date.now()); var minExpDate = new Date(expDate); var maxExpDate = new Date(expDate);  minExpDate.setDate(minExpDate.getDate() + 30); maxExpDate.setDate(maxExpDate.getDate() + parseInt(chf.Get('ExtraDays')));  alert(expDate + '\n' + minExpDate + '\n' + maxExpDate);   Sorry for my english and the title is too weird. And i hope to get some explanation why this happen.  Thank you,

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


I usually add some description in the JPEG comment when I'm exporting images from GIMP. I was wondering if Google will read those descriptions and show the images when I search for their description.  Also what about other search engines?

Do search engines read image metadata like copyright and author?  Is adding metadata to site's images valuable for SEO?


Is the following statement true or false?     Let  $f$ be  a non-negative  function contnious on $[0, \infty)$ and  differentiable  function  on $(0, \infty)$  such that $f(0)=0$ and such that $f'(x) \le f(x)$ for all $x \in (0, \infty)$. Then $f ≡ 0$.   I think this statement is  false. Take $f(x)= x+e^x-1$ so that $f(0)=0$  and $f'(x)=e^x +1 \le  x + e^x-1$, but $\lim_{x \rightarrow \infty} f(x)=\infty \neq 0$.

mathematicians! I want to ask to all wise people about a problem I met at the quiz to obtain some ideas. The problem is following. It may not be accurate since the problem is dependent on my memory   Let $f : [0, \infty) \rightarrow \mathbb{R}$ and $f$ is differentiable. $|f'(x) |\; \leq\  |f(x)|$ for all $x \in [0, \infty)$. $f(0) = 0$. Then prove that $f(x) = 0$ for all $x \in [0,\infty)$.  At the quiz, I applied the Mean Value Theorem and the Cauchy-Schwarz inequality.   For any $x$, $|f(x)| = |\{f(x) - f(0)\}(x-0)| = |f'(c_{1})(x)|$ for some $c_{1} \in (0,x)$, and then  $$|f'(c_{1})(x)| \leq |f'(c_{1})||x| \leq |f(c_{1})||x|$$ by Cauchy-Schwarz and given assumption. By doing so consecutively, we can obtain the inequality that  $$ |f(x)| \leq |f(c_{n})||x||c_{1}|\ldots |c_{n-1}| $$ for any $x \in [0,\infty)$. As $\{c_{i}\}, \; i\in \mathbb{N}$ is decreasing sequence and $f$ is continuous, $|f(c_{n})|$ can be arbitrary close to $0$ when $c_{n} \rightarrow 0$. Thus the inequality above can be bounded by $\epsilon$.  I think my answer is right, but a bit uncertain. Could you give me a certainty? Thank you very much.


Consider I have N dynamic points on my Scene, I would like to "frame" all them, with my Camera.    How can i calculate (at runtime) Vector3 Position to correctly frame all my scene ?   This is my idea:   Calculate Avarage for all my points Move my Camera "up" / Zoom out to correctly "frame" all my points (i don't know how to calculate ) Use Unity LookAt(myAvaragePoint)   I think i've to use some trigonometryc function to calculate the Y Camera position (to zoom in, zoom out), but i don't know which!  Thanks

Consider I have N dynamic points on my Scene, I would like to "frame" all them, with my Camera.    How can i calculate (at runtime) Vector3 Position to correctly frame all my scene ?   This is my idea:    Calculate Avarage for all my points  Move my Camera "up" to correctly "frame" all my points  (i don't know how) Use Unity LookAt(myAvaragePoint)   Thanks


Let $R$ denote a commutative ring and $Nil(R)$ is the ideal consisting of all nilpotent elements in $R$. I am attempting to prove that $Nil(R)$ is closed under addition.    My work so far is summarized in the following. I know that $a,b\in{Nil(R)}$ implies there exists integers $k_{1},k_{2}$ such that $a^{k_{1}}=b^{k_{2}}=0_{R}$ where $0_{R}$ is the additive identity of $R$.  To assert that $a+b\in{Nil(R)}$ is to assert the existence of an integer $k_{3}$ satisfying $(a+b)^{k_{3}}=0_{R}$, for explicit rings such as the real or complex numbers this is very straight forward and one can merely use exponent properties but I am admittedly uncertain how to go about showing the Nilradical is additively closed for an arbitrary Ring where the elements may not be numbers but objects. Any hints or helpful observations showing how to prove this would be much appreciated.

if $a,b$ are nilpotent elements of a commutative ring $R$, show $a+b$ is also nilpotent  So then $a^n=0, b^m = 0, n,m \in \mathbb{Z}^+$ I know this is solvable using the binomial theorem but I would much rather solve it another way if possible. The answer using the binomial theorem isn't making the most sense at the present moment.


I am performing inset operation on some records and, here I want to log the error out record details in log file. Basically i want to find out error out records from -  list<Database.SaveResult> resultSet object. Kindly find the below code for more details on this requirement. list<Database.SaveResult> resultSet = Database.Insert(ListObject,false); for (Database.SaveResult sr : resultSet) { for(Database.Error err : sr.getErrors()) { System.debug(err.getFields()); } }  In the log currently getting empty round braces only. I am expecting all the field values which got error out. I can see this behavior in the data loader tools error and success file where I can find the whole record in error file and the error message at the end.

I have a list of Line_item__c which is storing my line items as  List<Line_Item__c> toInsertList = new List<Line_Item__c>();   I am inserting these records in database using the below statement :  List<Database.Saveresult> insertResults=Database.insert(toInsertList, false);   Now the result is stored in insertResults which is of Database.Saveresult type but i want the result in a list of Line_Item__c. How do i do this. If anyone has a idea, it will be of great use.


Consider the elliptic curve $$\mathcal{C}: y^2 = x^3 + x.$$  Let us consider the reduction of $\mathcal{C} \mod{p}$.   Some explicit computation show that $\# \tilde{\mathcal{C}}(\mathbb{F}_3) = 4$,  $\# \tilde{\mathcal{C}}(\mathbb{F}_5) = 4$, $\# \tilde{\mathcal{C}}(\mathbb{F}_7) = 8$, and $\# \tilde{\mathcal{C}}(\mathbb{F}_{11}) = 12$ (these totals include the point at infinity).  On page 138, Example 4.6, Silverman and Tate go on to say that it is "not hard to check that" $4 | \# \tilde{\mathcal{C}}(\mathbb{F}_p)$ for all $p \geq 3$.  However, I am struggling to verify this fact myself, and would be very grateful for any assistance!  From working the smaller cases by hand, it seems like a natural divide would be between $p \equiv 1 \mod{4}$ and $p \equiv 3 \mod{4}$. However, if feels like there must be some theorems about solution in these two separate cases that I am missing right now.

Consider the elliptic curve $$E: y^2= x^3 + x$$ over the finite field $\mathbb{F}_p$ with $p \geq 3$. I want to show that $|E(\mathbb{F}_p)| \equiv 0 \mod 4$.   I know that, if $p \equiv 3\mod 4$, then $|E(\mathbb{F}_p)| = p +1$. If needed, I can give the proof. All things aside, I've found the same question here :        But I don't have the book he's referring to, so I can't work it out (and believe me, I've tried!). In short: what do you do in the case that $p \equiv 1 \mod 4$? Am I missing something obvious here? Thanks for the help!


I have been using Tex for a few years now and enjoyed the work of others (e.g., ctan packages, templates, styles). My question sees to practical code to learn from. What would be a good primer, or project to study? For example I looked at ClassicThesis.sty. In order to actively contribute I would like to know how to go about.

I'm interested in writing packages for TeX/LaTeX/XeLaTeX. I googled around, but all I found was guides or tutorials about how to prepare documents using LaTeX. I want to know how LaTeX works and how to change it or add new things to it.   Which book/guide/tutorial is the most useful source to learn LaTeX programming? Is there official documentations around LaTeX development? (I couldn't find development SCM on official site. is source code private?)


Prove the following identity using an Algebraic Proof.   $$\binom{n + m}{2} = nm + \binom{n}{2} + \binom{m}{2}$$  I have no idea where to begin on this problem or let alone finish it.

Need help trying to prove this problem algebraically.  $$\binom{n+m}{2} = nm + \binom{n}{2} + \binom{m}{2}$$  The farthest I've got is simplifying the RHS to $$nm + \frac{n(n-1)}{2!} + \frac{m(m-1)}{2!}$$ but not sure what to do after that.


First of all, I'm kinda new to CSS, so forgive me if this is a stupid question, or my code doesn't make much sense - I've tried solving my issue, and haven't had much luck so far.  I'm having trouble centering an image, inside a div which should make a border around the image - I've made a JFiddle to further explain:    The idea is that the image should be in the center of the bordered div around it.  HTML:

   CSS:  .sponsorLogos ul li {   margin: 10px 10px;   display: inline-block;   height: 128px;   width: 128px;   border: solid 5px #e0e5eb;   overflow: hidden; } .sponsorsDiv .sponsorLogos img {   display: block;   margin-left: auto;   margin-right: auto; }   I've found a few topics on here to try and solve my problem, but haven't yet succeeded.. I know theres probably the right answer out there, but I haven't been able to find it, so sorry in advance if this question is answered elsewhere..

How can I horizontally center a
 within another
 using CSS?

Foo foo


How do I save battery life on my Moto G 2nd generation phone without installing third party apps ?

What can I do to get better battery life on my Droid? Battery life seems awful. Less than 15 hours or so on normal usage.


Could someone please suggest a good way to check for continuity (using the epsilon-delta definition or maybe using some other method.  An example is to show that $f(x)=\sqrt x$ i.e. $f(x)=x^{1/2}$ is uniformly continuous on the positive real numbers.   Thank you! Your help will be greatly appreciated.

I have seen a proof in   Below shows an alternative proof. Please correct me if im wrong.  Proof:  For any given $\varepsilon >0$,  Let $\delta_1 = \frac{\varepsilon}{2}$, $\forall x,y \in [1,\infty)$ with $|x-y|<\delta_1$  Since $|\sqrt x + \sqrt y|\geq2$  $$|\sqrt x - \sqrt y|  = \frac{|x-y|}{|\sqrt x+\sqrt y|} < |x-y| < \delta_1 = \frac{\varepsilon}{2}$$  Hence, $\sqrt x$ is uniformly continuous on $[1,\infty)$.  $\sqrt x$ is continuous on [0,1] , so $\sqrt x$ is uniformly continuous on [0,1].  So, there exist $\delta_2 > 0$ such that $\forall x,y \in [0,1], |x-y|<\delta_2$, $|\sqrt x -\sqrt y| <\frac{\varepsilon}{2}$  Let $\delta = \min{(\delta_1,\delta_2)}$  $\forall x,y \in [0,\infty)$ with $|x-y|<\delta$,  Case 1: $x,y \in [0,1]$ Proven above as $|x-y| < \frac{\varepsilon}{2} < \varepsilon$  Case 2: $x,y \in [1,\infty)$ Proven above as $|x-y| < \frac{\varepsilon}{2} < \varepsilon$  Case 3: $x \in [0,1] , y \in [1,\infty]$  $$|\sqrt x-\sqrt y| = |\sqrt x -1+1-\sqrt y| \leq |\sqrt x-1| + |\sqrt y -1| < \frac{\varepsilon}{2} + \frac{\varepsilon}{2}= \varepsilon$$  by applying case 1 and case 2.


In another question,  about the interaction between photons and electrons. It was suggested that in compton scattering there is no particle to "mediate" the force. The tree-level diagrams in compton scattering of photon and electron are    My questions are:   Why does one not consider the electron to mediate a force between photon and electron? Clearly there is a force, as the two particles scatter, therefore they interact.  Why do force-mediators have to be bosons in general?   If possible I would really prefer an answer which is not just heuristics/storytelling and is grounded in the theory itself.  Edit: A helpful  to essentially the same question has been shared. However, I don't see how the answers are satisfactory to rule out electrons as the force-carrier in the diagrams above. I will explain for each answer.  In the first answer, by Ben Crowell, I see two issues: The spins can add up: $1 - 1/2 = 1/2$, but more importantly, Feynman diagrams are a counting technique to get the combinatorics right. They are strongly suggestive of interactions, but there is no inconsistency if angular momentum is not conserved in a diagram. Otherwise, supposing my spin addition is somehow wrong (which I suspect) then naively, we could use this to predict that electrons and photons do not interact because their mediator would have to be an electron, which would violate angular momentum conservation at tree level, and behold! that prediction would be wrong.  In the second answer by Adam, it suggests that the opposite is true, namely that electrons can be thought of as force carriers.  In the third answer by Trimok, it only addresses interactions between fermions so that's just not the case here.

All of the force-particles in the standard model are bosons, now my question is pretty short, namely:     Why are all force particles bosons?   This can't be a coincidence.


These are the two formulae I came across for the drift speed of electrons in a circuit. Which one of them should I use for calculations? Which one is to be used for calculations?

In the derivation of drift velocity I have seen two variations and want to know which one's correct.   $s=ut+\frac{at^2}{2}$ Assume that the drift velocity of any electron in any conductor is : $$\vec{v_d}=\frac{\vec{l}}{t}$$ Due to the electric field the acceleration of electrons in any conductor is: $$a=\frac{-e\vec{E}}{m}$$ Now the distance travelled by an electron after a long time (initial thermal velocity = 0) $$l=\frac{at^2}{2}\implies \frac{-e\vec{E}t^2}{2m}$$ the time between the collisions is $\tau$ $\therefore$ $$l=\frac{-e\vec{E}\tau^2}{2m}$$ thus the velocity is $$\vec{v_d}=\frac{-e\vec{E}\tau}{2m}$$ In another proof I saw the author using $v=u+at \implies v_d=\frac{-e\vec{E}\tau}{m}$   My question is which of the the two equations of motion can be used in the proof? Can they be used at all.


I have more problems than you can shake a stick at. I want to be able to play my steam games on a flash drive because i am using a chromebook (x86) and it does not have enough storage. my problem is when i go to add a new download folder and pick the flash drive it says "new steam folder must be empty". so i was going to try to movie steam to the flash drive using "mv ~/.local/share/Steam /new/path" but it says no such file directory. someone please help.

I recently got an invitation for Steam. I want to download games but my SSD drive which I have Ubuntu will not be enough. How can I install Steam on a different hard drive?  I went into the "Steam Library Folders" but I can't delete the original folder so steam can install on that drive. I have also tried to change the place but it is again on the down side:


I have repeated xml fragment like this below in a larger document. How to remove all occurrences of well, total and fee using XmlDocument?  <res>   <pay>     <well/>     <total/>     <fee/>     <tit>         <qr>asdf</qr>         <id>             <num/>         </id>     </tit>   </pay> </res>

The following code should find the appropriate project tag and remove it from the XmlDocument, however when I test it, it says:  The node to be removed is not a child of this node.  Does anyone know the proper way to do this?  public void DeleteProject (string projectName) {     string ccConfigPath = ConfigurationManager.AppSettings["ConfigPath"];      XmlDocument configDoc = new XmlDocument();      configDoc.Load(ccConfigPath);      XmlNodeList projectNodes = configDoc.GetElementsByTagName("project");      for (int i = 0; i < projectNodes.Count; i++)     {         if (projectNodes[i].Attributes["name"] != null)         {             if (projectName == projectNodes[i].Attributes["name"].InnerText)             {                                                                 configDoc.RemoveChild(projectNodes[i]);                 configDoc.Save(ccConfigPath);             }         }     } }   UPDATE  Fixed. I did two things:  XmlNode project = configDoc.SelectSingleNode("//project[@name='" + projectName + "']");   Replaced the For loop with an XPath query, which wasn't for fixing it, just because it was a better approach.  The actual fix was:  project.ParentNode.RemoveChild(project);   Thanks Pat and Chuck for this suggestion.


I am constantly told "funner" is not a word. Even Google auto corrects. Yet "funner" is used very often in spoken English with people I meet.   Is funner a word? If not why?  What causes it to not be a word?

We seem to be stuck at an impasse on this issue.  Is funnest a word or not?  If so, does it mean "most fun"?


I downloaded Ubuntu 13.10 so that I could remove the administrator password on my laptop since I forgot it.I was in "try Ubuntu" mode while trying to recover/reset the password, but I kept running into issues.   I hit "Install" the next time, went through the steps up to the part where it didn't give me an option to install alongside Windows Vista. I just installed it and it brought me to the "Disk/Partition" part of the install. I used my hard-drive (/dev/sda3). Since then, I have not been able to use Windows Vista. Please advise how to uninstall Ubuntu 13.10 and revert the changes. Thanks!I would like to remove Ubuntu 13.10 from my windows partition /dev/sda3. How would I do this? Will it revert the partition back to Windows Vista? Please advise. Thanks!  UPDATE:  Instead of trying to uninstall Ubuntu 13.10 I just decided to complete the following steps to get Windows Vista back on the correct partition.   Logged into Ubuntu 13.10 and changed drives/partitions to NFTS in "Disk" download Wintoflash [here] Followed the instructions [here]   After installing Windows Vista via USB my operating system was back up and running!

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


Below is the Screenshot of my lightning-checkbox-group. Instead of showing them vertically I want them aligned horizontally. I have referred several links and applied many CSS but still no luck. Can someone please help me with this. Also I want the background color and border color of the checkboxes to be changed?  .html

                 <lightning-checkbox-group class="green-checkbox" options={objectFieldOptions} value={selectedObjectFieldValue}                     onchange={objectFieldHandleChange} required="true">                 </lightning-checkbox-group>

  For Bg color and border color change I tried this CSS but it's not working .CSS .THIS input[type=checkbox]:checked.green-checkbox{     border-color: #00b200;      box-shadow: 0 0 3px #006A00;      background-color: rgb(0, 178, 0);     border:1px solid; }  .THIS .slds-checkbox {     display: inline !important; }

What CSS would be required to make the items in a lightning:checkboxGroup display horizontally rather than the default of vertical?


For a long time I have been wondering about the existence of many shells in GNU/Linux. To make the question a bit focused I have used only three shells - bash, dash and zsh.   From wikipedia articles  ,  ,  and other sources arguably, the modern bash seems to be the father of all shells.   There doesn't seem to be any coherent story which shares how all the shells started at various parts of time. Can anybody help out here sharing the motivations of various developers at specific points of time and issue they were trying to solve?

I've seen the phrase "sh compatible" used usually in reference to shells. I'm not sure if it also applies to the programs that might be run from within shells.  What does it mean for a shell or other program to be "sh compatible"? What would it mean to be "sh incompatible"?  Edit: This question asking the difference between bash and sh is very relevant:   I'd still like a direct answer to what it means to be "sh compatible". A reasonable expectation might be that "sh compatible" means "implements the Shell Command Language" but then why are there so many "sh compatible" shells and why are they different?


I am making an old family recipe for Easter Bread, but I would like to make a vegan version of it for a friend.   The non vegan ingredients that the recipe calls for are:  milk (substituting with almond milk)  butter (substituting with Earth Balance)  3 egg yolks  Help!! I can not think or find a good alternative to just 3 egg yolks. I am questioning the consistency of a lot of the suggestions I have found online.  Thank you in advance for all suggestions and ideas!

I've been reading (most) questions and answers (here) about baking bread (which I love) and how to replace eggs in many recipes (which I wish I didn't need). Turns out, I too have egg allergy (not too severe) and a few of my favorite breads require one or more eggs.  So far I've seen two options, in many threads, that look promising: Ener-G egg replacer and replacing eggs with flax. However, not a single use case I've seen here is about bread. I'm looking for an option to replace 1-3 eggs in a bread dough with: 500 g of white wheat flour, 200 ml of milk, 50-80 g of butter, a variable amount of sugar (5-50 g) and 20-30 g of fresh yeast.  Examples of this dough are the , the  and a similar recipe from Galicia (northwest Spain) with even more eggs. And so many other breads, but these are my favorite ones :)  Has anyone tried flax or ener-g on a similar bread dough?


My original laptop charger broke, so I got another one that is similar. The problem is that the 2nd one broke too. I found a different one, but don't know would it work. My laptop battery is completely dead and won't charge. Laptop requirements: +19v = 3.42A 65w Charger I found: 24v = 5A (24vdc) I'm not very familiar with voltages and stuff, but would it work? And does it Change a lot if the requirements are +19v and not just 19v?

I'm using a common charger for both of my laptops.  The charger is specified at 20 Volts and 3.25 Amperes. My other laptop has a specification of 19 V and 3.42 A.  Is it safe to charge my laptop with chargers whose specifications exceed or are not equal to the mentioned specifications?  I have read somewhere that it may cause some damage if the voltage or amperage is not matching the specs.


This question is an attempt to find an abstract answer to every "one word or two?" discussion.  My problem is exemplified by this scenario: My text editor's spellchecker recently corrected me on my use of "video game" because it felt "videogame" was proper. Searching the Internet, however, led me to feel "video game" was proper, despite there being many credible sources using "videogame". As I'm writing this now, the spellchecker in my browser wants me to use "video game".  Along my search, I found a quote in a forum from a Wired magazine editor saying they always join words whenever possible. That person credited their book, "Wired Style: Principles of English Usage in the Digital Age", for that decision. I thought this was interesting.  It seems it's up to me to decide what form I want to use. How can I make such a decision? What factors should I consider?

Some compound words are written without hyphens (nonaggression, nonbeliever), some with hyphens (well-intentioned), and others with spaces (post office).  Is there a rule or good guide as to which option should be used?


I'm learning HTML/CSS and trying to recreate google homepage. I'm having difficulties with centering my input searchbar. In my html I have:

     <form action="https://google.com/search">         <input class="searchbar" type="text" name="q">                       <input type="submit" value="Google Search">              <input type="submit" value="I'm Feeling Lucky">              </form>
  This is my css: .image {     text-align: center; }  form {     text-align: center;     width: 50%; }  .searchbar{     width: 400px;     height: 20px;     margin: 10px;     border-radius: 25px;     outline: none; }  div.c {     text-align: center; }  As you can see my image is centered. And I would like my div class="c" to be centered below the image but text-align:center; for div.c does not work. Another thing I noted is when I tried to round my corners using border-radius:25px; there is some bold black line that partially shows up around my searchbar. Anyone experienced this?

How can I horizontally center a
 within another
 using CSS?

Foo foo


Suppose there exist subgroups $H,K\subseteq G$ such that $G = H \cup K$. Prove that $H = G$ or $K = G$.  I am not sure how to start?  Thanks in advance.

Let subgroups $H,K \subseteq G$ such that $G=H \cup K$  Prove $H=G$ or $K=G$


I have the below code which I am unit testing.      public static void Log(string appName, string message)     {         Log(appName, message, string.Empty);     }     public static void Log(string Name, string Message, string Source)     {         if (!baselogger.Initialize) return;         TryInitialize();         Count++;         foreach (ILogging logger in loggers)         {             logWrite(1000);             logger.WriteError(Name, Message, Source);         }         string message = string.Format(CultureInfo.InvariantCulture, "{0}: {1}: {2}", Name, Message, Source);         System.Diagnostics.Trace.WriteLine(message);      }   And I wrote below test methods to test it.     [TestMethod]    public void LogWith2Params()     {         Logging.Log("Host","Control not found.");     }      [TestMethod]    public void LogWith3Params()     {         Logging.Log("Host","Control not found.","ManageAccounts");     }   Are the above two tests enough or do I need to write new test cases ? Or should I write another testmethod by passing 3 parameters and do the shim  for logger.initialize property,TryInitialize method call, logWrite method call,logger.WriteError method call and Trace.Writeline method call ?

What is the best way to unit test a method that doesn't return anything? Specifically in c#.  What I am really trying to test is a method that takes a log file and parses it for specific strings. The strings are then inserted into a database. Nothing that hasn't been done before but being VERY new to TDD I am wondering if it is possible to test this or is it something that doesn't really get tested.


Let $a,b,n$ be any integers greater than $1$ and $b >\phi(n),$ where $\phi$ is Euler's totient function; is the below equation is true or not? $$ a^b \equiv_n a^{\phi(n) + (b \mod \phi(n))}$$

There is a lesser known generalization of Euler's Theorem. Here 'x' and 'm' are NOT COPRIME and $\,n\ge \log_2 m.\,$ I stumbled upon this on this site :   The "derivation" can be found towards the end of the above link; but i can't seem to wrap my head around it. It would be really great if it could be explained a bit better, probably with an example.


I am trying Action<T,T> delegate and got the following error:       An object reference is required for the non-static field, method, or   property   The event declaration looks as follows:  public event Action<string, string> FileStateProcess;   And the usage should looks like this:  if (FileStateProcess != null) {     FileStateProcess(file.FullName, temppath); }   What am I doing wrong?

Consider:  namespace WindowsApplication1 {     public partial class Form1 : Form     {         public Form1()         {             InitializeComponent();         }          private void button1_Click(object sender, EventArgs e)         {             //int[] val = { 0, 0};             int val;             if (textBox1.Text == "")             {                 MessageBox.Show("Input any no");             }             else             {                 val = Convert.ToInt32(textBox1.Text);                 Thread ot1 = new Thread(new ParameterizedThreadStart(SumData));                 ot1.Start(val);             }         }          private static void ReadData(object state)         {             System.Windows.Forms.Application.Run();         }          void setTextboxText(int result)         {             if (this.InvokeRequired)             {                 this.Invoke(new IntDelegate(SetTextboxTextSafe), new object[] { result });             }             else             {                 SetTextboxTextSafe(result);             }         }          void SetTextboxTextSafe(int result)         {             label1.Text = result.ToString();         }          private static void SumData(object state)         {             int result;             //int[] icount = (int[])state;             int icount = (int)state;              for (int i = icount; i > 0; i--)             {                 result += i;                 System.Threading.Thread.Sleep(1000);             }             setTextboxText(result);         }          delegate void IntDelegate(int result);          private void button2_Click(object sender, EventArgs e)         {             Application.Exit();         }     } }   Why is this error occurring?     An object reference is required for the nonstatic field, method, or property 'WindowsApplication1.Form1.setTextboxText(int)


Prove that $\mathbb{R}$ is homeomorphic to $(0,1)$ and that $(0,1)$ is homeomorphic to $(0, ∞)$. also is $\mathbb{R}$ isometric to $(0,1)$? to $(0,∞)$ ?

I need to show that any open interval is homeomorphic to the real line.  I know that $f(x)=a+e^x$ will work for the mapping $f:R \to (a,\infty)$ and $f(x)=b-e^{-x}$ will work for the mapping $f:R \to (-\infty,b).$  Without using two functions, how can I prove the result in general?


I am indexing a big latex project (with xindy). I use biblatex for the bibliography and the command \footcite for the references.  Sometimes, I write long prenotes which contain some words to be indexed. The logical procedure is to put the index command before of after the \footcite command and not in the prenote. But in practice as my prenotes are very long it's sometimes difficult to notice the square backets of the prenote... And it causes a lots of bug during the compilation.  For example :  \footcite[blabla blabla\index[n]{something} blabla.][postnote]{Reference}   It takes a lot of work to correct all the errors. But maybe there is a trick to bypass compilation bugs or loose less time.

LaTeX seems to be having problems handling nested optional arguments. I've included a minimal code example that generates the error:  \documentclass[12pt,oneside]{book} \begin{document}  \newcommand{\termbad}[2][]{#2#1} \newcommand{\termgood}[2][]{#2#1}  \newcommand{\up}[1]{#1} \newcommand{\dd}[1][]{#1}  \termgood{\up{Tart}}{Pop} \termbad[\up{Tart}]{Pop}      \termgood{\dd[Tart]}{Pop} \termbad[{\dd[Tart]}]{Pop} %\termbad[\dd[Tart]]{Pop}   \end{document}   If you run this code, it works. If you remove the % in the second to last line, it fails with:  Runaway argument?  Tart{Pop} \par \par \end {document}  !File ended while scanning use of \dd.   After further tinkering, I have discovered the problem: LaTeX is reading the ] for the inner optional argument as the end of the outer optional argument and then passing a malformed argument in. So it is passing in \dd[Tart as the optional argument to \termbad instead of \dd[Tart].  This still feels like a bug to me. Nesting braces in arguments works, brackets should as well. The following are workarounds:   Enclose the inner optional argument in braces (as in the line before %). Redefine your inner function to require its argument instead of using optional arguments. Redefine your outer function to require its argument instead of using optional arguments.   Any one of the three works around the issue.  (Reposted here; question was originally posted to stackexchange and then closed instead of being migrated.)


In the code given below  content.field_image_link[0]['#url']  is empty but it still enters the if condition and adds html what is incorrect in the below code due to which it enters the if condition whereas it should enter the second if condition given below  {% if content.field_image_link[0]['#url'] %}  {% block paragraph %}
      {% block content %}      {% if content.field_image_link[0]['#url'] %}    {{ content.field_image_2 }}
  {{ content.field_image_link[0]['#title'] }}
 {% endif %} {% if content.field_image_link[0]['#url'] == '' %} {{ content.field_image_2 }}
                                                                                {{ content.field_image_link[0]['#title'] }}
 {% endif %}     {% endblock %}
  {% endblock paragraph %}

I am trying to check if the user_picture field is empty using the twig template, but I am not able to do this.  I tried lots of ways:-  {% if node.user_picture.value %} {% if node.user_picture.entity %} {% if content.user_picture.value %} {% if content.user_picture|render.entity %} {% if content.user_picture|render %}     Sample of code:    {% if node.user_picture.value %}
User-picture 02
     {{ user_picture }}   {% else %}
Anymonus-picture 02

   {% endif %}


I want to create a symbolic link which will not break even after copying the entire directory( which includes the link and its target) in a pendrive/sd-card and using the pendrive/sd-card in other system.  For ex:   S70pppd-dns -> ../init.d/pppd-dns    S77hello_init -> /home/silviya/package/rootfs/etc/init.d/hello_init     Here, the link for hello_init is created by me, other one is there by default. How can I create the symbolic link as shown below ?? S70hello_init -> ../init.d/hello_init    NOTE: I created the link using the command:   ln -s 'target_file' 'symbolic_link'

I have directory that contains some symbolic links:  user@host:include$ find .. -type l -ls 4737414    0 lrwxrwxrwx   1 user group       13 Dec  9 13:47 ../k0607-lsi6/camac -> ../../include 4737415    0 lrwxrwxrwx   1 user group       14 Dec  9 13:49 ../k0607-lsi6/linux -> ../../../linux 4737417    0 lrwxrwxrwx   1 user group       12 Dec  9 13:57 ../k0607-lsi6/dfc -> ../../../dfc 4737419    0 lrwxrwxrwx   1 user group       17 Dec  9 13:57 ../k0607-lsi6/dfcommon -> ../../../dfcommon 4737420    0 lrwxrwxrwx   1 user group       19 Dec  9 13:57 ../k0607-lsi6/dfcommonxx -> ../../../dfcommonxx 4737421    0 lrwxrwxrwx   1 user group       17 Dec  9 13:57 ../k0607-lsi6/dfcompat -> ../../../dfcompat   I need to copy them to the current directory. The resulting links should be independent from their prototypes and lead directly to their target objects.   cp -s creates links to links that is not appropriate behavior. cp -s -L refuses to copy links to directories cp -s -L -r refuses to copy relative links to non-working directory   What should I do?


I am attempting to update a custom Callable Contacts field on the Account object. The trigger will look at all contacts associated with an account, and contacts that have phone numbers will be included in the custom field. Contacts without phone numbers will not be counted. My solution was to basically look at all of the contacts associated with the account, and if any of their phone fields are not null I add them to a list. So far all of my logic appears to work. When I system.debug the callableContacts list, the list size is the correct number of contacts. When I use system.debug(myContact.Account.Callable_Contacts__c);...the result is null even though it should be an integer value. I am having trouble assigning the size of that list to the custom field on the account record. Please advise. trigger CallableContacts on Contact (after insert, after update, after delete) { List<Account> accList = new List<Account>(); if (trigger.isInsert || trigger.isUpdate) {     for (Contact myContact : Trigger.new) {         if (myContact.Id != null) {             List<Contact> acctFromRelatedContact = [SELECT   Id,                                                              AccountId,                                                              Account.Callable_Contacts__c,                                                              Account.Industry                                                                                FROM   Contact                                                      WHERE   Id = :myContact.Id                                                      LIMIT   1];             system.debug(acctFromRelatedContact);             List<Contact> callableContacts = [SELECT    Id                                                  FROM    Contact                                                WHERE    (Phone != null                                                   OR     AssistantPhone != null                                                   OR     HomePhone != null                                                   OR     OtherPhone != null)                                                  AND    AccountId = :acctFromRelatedContact.get(0).AccountId];             system.debug(callableContacts.size());             accList = [SELECT Id,                               Account.Callable_Contacts__c                          FROM Account                         WHERE Id = :myContact.AccountId];             system.debug(accList);             system.debug(myContact.Account.Callable_Contacts__c);                          if (myContact.Account.Callable_Contacts__c != null) {                 for (Account acc : accList) {                     myContact.Account.Callable_Contacts__c = callableContacts.size();                                         }                 update accList;                                 }                           }                                          } }  }

How do reference a related object within a Salesforce Trigger?  I am creating a record for a related object and need to assign a value to one of the fields in the new related object (relatedOject1) from a second related object (relatedOject2).  I understand that a parent or related object is not returned in the list.  I wrote o.relatedObject2__r.Name below to illustrate the intended data to be returned at this point.  trigger objectTrigger on object__c (after insert) {      List<relatedObject1__c> ListToInsert = new List<relatedObject1__c>();      for (Order__c o : Trigger.new) {         relatedObject1__c ro = new relatedObject1__c();         ro.Type__c = 'New Customer';         ro.RecordTypeId = '0121a000000e8sX';         ro.relatedOject2__c = o.relatedObject2__c;         ro.Description__c = 'Open Order:'+o.relatedObject2__r.Name+'  Date: '+o.Date__c;         ro.object__c = o.Id;         ListToInsert.add(ro);     }      if(ListToInsert.size() > 0) {         insert ListToInsert;      } }


I have created a div with a height: 300px and inside this div, are two other divs that are display: inline-block. What I wanted to do is that I want my div to be vertically aligned center.  I already tried vertically aligning the divs, used flex box (but it doesn't really work if I have my wrapper with margin: 0 auto), also used line-height (problem is it doesn't work out that way since I have texts in my 2nd div.)   Here is my SCSS code:      .p-{     &footer-class{         height: 47px;         background: transparent linear-gradient(270deg, #96A3B2 0%, #E9EDF4 100%) 0% 0% no-repeat padding-box;         @include mq('sm'){             padding: 0 25px 0 23px;         }         @include mq('xs') {             padding: 0 25px 0 23px;         }         @include mq('xl') {             // justify-content: left;             // display: flex;             // align-items: center;             height: 267px;            }       }    }     .c-{         &footer-social {         float: left;      }    }      .c-{     &footer-about {         float: right;         @include mq('xs'){             display: inline-block;             margin-top: 4px;         }         @include mq('sm'){             display: inline-block;             margin-top: 4px;         }         @include mq('md'){             display: inline-block;         }         @include mq('xl'){             display: inline-block;         }     }     &footer-text {         display: block;         color: #ffffff;         font: bold 10px/20px "Consolas";         opacity: 1;         &1 {             @include mq('xs'){                 display: inline-block;                 margin-top: 4px;             }             @include mq('sm'){                 display: inline-block;                 margin-top: 4px;             }             @include mq('md'){                 display: inline-block;             }             @include mq('xl'){                 display: none;             }          }     }   }   the mq in @include are the media queries being defined in another file.

I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers?

testing...