I installed Ubuntu and now I want to get rid of it because I hardly use it. I deleted the Ubuntu partitions, but that also broke Grub. I reinstalled Ubuntu and then repaired Grub, but I still want to get rid of Ubuntu. I don't have a CD burner, so I cant create a Windows rescue disk. I want to know if I can delete Ubuntu partitions and reinstall Grub via live USB to still be able to boot into Windows 7.

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.


So, I'm a bit confused. I need to be able to create many (up to a billion) small (<8 elements) fixed-sized arrays at runtime. I was using std::vector, but the memory overhead was too high (24 bytes per array).   I decided to implement my own array, templated on the contained type (T1) and the type storing the static size of the array (T2).  The class is called lw_vector. If I call:  sizeof(lw_vector<int, unsigned char>)    I get 16. However, as I calculate it, the size should be sizeof(int*)+sizeof(unsigned char)=9 on a 64-bit system. What am I doing wrong here? Is it possible to create an object that only requires 9 bytes of memory?  Here's the implementation of lw_vector:  template<class T1, class T2> class lw_vector { private: public:     T2 N;     T1 * content;      lw_vector() : N(0)     {}      lw_vector(T2 Nt) : N(Nt)     {         content = new T1[N];     }      ~lw_vector()     {         delete[] content;     }      lw_vector& operator=(lw_vector temp)     {         std::swap(N, temp.N);         std::swap(content, temp.content);         return *this;     }      lw_vector(const lw_vector& other)         : N(other.N),         content(new T1[other.N])     {         std::copy(other.content, other.content + N, content);     }      inline T1& operator[](T2 ind) const     {         return content[ind];     } };   Thank you for your time!  John

Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members?


I would like to calculate the probability of a certain result coming out at least 'x' times in 'n' attempts when the probability of result varies on every attempt; all attempts are independent events.  I found that I can use PMF when I have the same probability for every event, e.g. probability of 3 tails in 5 coin tosses. But there the probability is 50% (If we use a fair coin) for all events. When the probability changes on each attempt I'm lost.  Let's say that the probabilities of outcomes in 5 events are: 30% in the first, 35% in the second, 50% in the third, 42% for the fourth, and 25% in the fifth. What are the probabilities of it happening at least 1 in the 5, what are the probability of 2 of the 5, 3/5, 4/5 and 5/5?  I don't need the probability of the hypothetical case I'm using here as example just the formula for calculate this kind of probability or the name of this kind of thing so I can search it.

I am interested in how uncertainty can be accounted for when considering the risk of extinction of a species. Forgive me for extending a rather tired thought experiment, but at least it's familiar territory and I hope it illustrates what I am trying to understand.  Let's say that Schrödinger was not satisfied with killing and not killing only one cat, so he went out and collected the last 15 remaining Himalayan Snow-Cats. He put each one in a box with a vial of poison, hammer, and a trigger device for releasing the hammer. Each trigger device has a known probability of releasing the hammer within any given hour, and the poison will take 5 hours to kill a cat (things got a bit trippy when he used radioactive decay, so this time he steers clear of quantum mechanics). After one hour, Schrödinger receives a notice from the ethics board telling him he's nuts and ordering him to release the cats immediately. He pushes a button which opens a cat-flap at the back of each box, thus releasing them all back into the wild. By the time the humane society check the boxes, all the cats have bolted. Before anyone can restrain him, Schrödinger detonates the remaining triggers, so nobody knows how many of the cats were poisoned.  The probability that each of the cats is poisoned is as follows:   0.17 0.46 0.62 0.08 0.40 0.76 0.03 0.47 0.53 0.32 0.21 0.85 0.31 0.38 0.69   After 5 hours have elapsed and all poisoned cats have died, what is the probability that there are:   (A) More than 10 Himalayan Snow-Cats still alive  (B) 10 or less still alive (C) 5 or less still alive (D) 2 or less still alive


If I found a wrong spelled tag , what should I do ?  ? I think it's JAVASCRIPT . Can I flag to moderator for it ?

During the re-tagging of questions, tags sometimes become orphaned from existing questions.  Are these zombie tags ever removed from the ?  What if a tag is misspelled and needs to be removed? How do we get rid of it?


I am arguing about this topic with my school teacher in so long time, I want to  finish this debate. My teacher's opinion is "Yes, Time is vector" because four-vector has $t$ component, and mine is "No. Time is not vector" here is my counterargument:   proper time $\tau$ is obviously scalar, and since $t=\gamma\tau$ and $\gamma$ is scalar, $\tau$is scalar, so time $t$ is scalar. if time is a vector, it should have four components, but time is not. Time is just a component of a 4-vector, not a vector itself. in normal 3-dimensional space, position vector has $x,y,z$ components, but "length" is not a vector, so time is not a vector for the same reason.   And here is teacher's answer,   speed of light $c$ is a constant, so $\dfrac{v}{c}$ is not dimensionless number, so gamma is still vector.   Can anyone answer this problem with clear and strong reasons?

In  it's said that time is a scalar quantity. But its hard to understand that how? As stated that we consider only the magnitude of time then its a scalar. But on basis of time we define yesterday, today and tomorrow then what it will be?


I find each time I read a line, the end of of line character is included as well (showing as '$' in vi set list command) and am wondering how to automatically remove it when reading from a file?  From the print output, you can see end of line is output each time so that it seems two lines are printed each time.  Here is the code and input file, with output,  import sys  fileInput = open(sys.argv[1], 'r')  for line in fileInput:         print line  python TestLineParse.py TestInput.txt.csv 216  218  219  248  head TestInput.txt.csv 216 218 219 248

What is the Python equivalent of Perl's chomp function, which removes the last character of a string if it is a newline?


Questions like looking for css templates, blog templates, icons ... In general, resources (let's leave the licensing terms aside for now) which you might need when building a project of your own. Where should those questions go?  They're definitely not on-topic on Stack', SuperUser maybe although I doubt it. Webapps? Hmm, probably not.  Is there a place where they would be on-topic on the SE network?

Stuff like polls, recommendations based on subjective constraints, puzzles, webcomics etc. do not belong on the serious main SE sites, where professionals should be considered at work and having just a few spare minutes ("code's compiling") to answer questions, so they should not be distracted by such things. However, I'd also like to have a home for these things still using the SE engine. For the reason I mentioned before, this needs to be a separate place though. Let's call it four.[sitename-here].com.


Consider  proof of the triple product identity. In this proof, they state that $\lambda $ does not depened on any choice of three vectors $A,B,C$. I don't understand why is that true? I'll appreciate any help!

THe question is to show the following: $$\vec{a}\times (\vec{b}\times\vec{c})=(\vec{a}\cdot\vec{c})\vec{b}-(\vec{a}\cdot\vec{b})\vec{c}$$ $$(\vec{a}\times \vec{b})\times\vec{c}=(\vec{a}\cdot\vec{c})\vec{b}-(\vec{b}\cdot\vec{c})\vec{a}$$ In fact, I am able to finish the proof using high school method, which is calculate  $\vec{b}\times\vec{c}$ and then cross with $\vec{a}$. However, I would like to use another more mathematical way to prove this triple vector product.  For the first one, $\vec{b}\times\vec{c}$ is a perpendicular vector towards b and c. Then this vector is cross with a. Then, the final results $\vec{a}\times (\vec{b}\times\vec{c})$ is a vector lies on a plane where b and c do also. Hence, it is a linear combination of b and c. $$\vec{a}\times (\vec{b}\times\vec{c})=x\vec{b}+y\vec{c}$$ Take a dot product with $\vec{a} $to both side, L.H.S becomes $0$. $$0=x(\vec{a}\cdot\vec{b})+y(\vec{a}\cdot\vec{c})$$ Then...how an I go further?? I have read a similar proof, but I don't understand the step after I got $0=x(\vec{a}\cdot\vec{b})+y(\vec{a}\cdot\vec{c})$. The reference link is   Thank you.


I want to know if there is a plugin/tool in QGIS, that let me cut lines of a shapefile where the points of another shapefile are.

I need to create a shapefile with crossed streets. I can't split the lines to number each segment with the house number ranges.


I get a null pointer exception error when i try to give a name to it. I mean it gives an error while doing R.id.contacts which probably means it's layout doesn't have the listview.       @Override public View onCreateView(LayoutInflater inflater, ViewGroup container,                          Bundle savedInstanceState) {     DataBaseOperations hell = new DataBaseOperations(getActivity());     SQLiteDatabase db = hell.getReadableDatabase();     String[] columns = {mDatabase.Tableinfo.ID,mDatabase.Tableinfo.Contacts_phone,mDatabase.Tableinfo.Contacts_name,mDatabase.Tableinfo.Contact_pic};     Cursor Contacts = db.query(mDatabase.Tableinfo.contacts, columns, null, null, null, null, null);     ContactsAdapter adapter = new ContactsAdapter(getContext(), Contacts,0);     ListView iv = (ListView)lview.findViewById(R.id.contacts);     iv.setAdapter(adapter);     Contacts.close();     lview = inflater.inflate(R.layout.fragment_contacts_list, container, false);     return lview; }   as it inflates the layout named fragment-contacts_list.Here is the code for that     <?xml version="1.0" encoding="utf-8"?> <ListView xmlns:android="http://schemas.android.com/apk/res/android" xmlns:tools="http://schemas.android.com/tools" android:id="@+id/contacts" android:layout_width="match_parent" android:layout_height="match_parent" android:layout_marginLeft="16dp" android:layout_marginRight="16dp" android:layout_weight="1" tools:listitem="@layout/fragment_contacts" />   Why is my listview null???

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 have a base class, which includes a constructor with variable argument list:  class Super { public:     Super(int num, ...); ... }   Now, in my subclass constructor I need to somehow call this superclass constructor, but how do I do it?  The usual thing, naturally, doesn't work:  class Sub { public:     Sub(int num, ...) : Super(???) { ... } ... }   So what do I put into instead of ???  I do have another constructor that accepts a vector, but having one like this is a direct requirement from the client.

In C, is it possible to forward the invocation of a variadic function? As in,  int my_printf(char *fmt, ...) {     fprintf(stderr, "Calling printf with fmt %s", fmt);     return SOMEHOW_INVOKE_LIBC_PRINTF; }   Forwarding the invocation in the manner above obviously isn't strictly necessary in this case (since you could log invocations in other ways, or use vfprintf), but the codebase I'm working on requires the wrapper to do some actual work, and doesn't have (and can't have added) a helper function akin to vfprintf.  [Update: there seems to be some confusion based on the answers that have been supplied so far. To phrase the question another way: in general, can you wrap some arbitrary variadic function without modifying that function's definition.]


I have a laptop with a 16" screen @ 1366x768 resolution, and a 24" external monitor at 1920x1200 resolution. I'm extending the Windows 7 desktop onto the other screen.  The 24" is the secondary monitor, and is positioned so the bottom of that screen lines up with the bottom of the 16" screen. Currently, if I move the mouse to the top portion of the 24" screen, then move left, the mouse will stop at the edge of the 24" screen until I move it down far enough to get into the range of the 16" screen.  So that's all pretty standard; but I'm wondering if there's any software out there that will allow me to "scale" the mouse-crossover position, such that if I'm at the TOP of the 24" screen and move left, the mouse will cross to the TOP of the 16" screen, whereas if I'm at the BOTTOM of the 24" screen, crossing over will position the mouse at the BOTTOM of the 16" screen. So then, if the mouse cursor is on the 24" screen at (x,y) position (10,600), and I move 20 pixels left, the mouse is now on the 16" screen at position (1356,384).  Anyone know of such a solution??  Note: I also use Ubuntu, so if there's a solution to this for X, but not Windows, I'd be interested in that also.

I'm not sure if I'll be to explain this right. I have a dual monitor display on Windows 7 and my left monitor (laptop) has a lower vertical resolution than the right monitor (regular LCD monitor). So obviously, if I stick these monitors together, there's a part in the upper-left corner of my LCD monitor where cursor cannot go to the other monitor. I remember there was a trick to make this gap disappear, and make it seem like the monitors are of equal height.  Any suggestions?  By the way, I am also using UltraMon.


I want to install wine on Ubuntu 16.04, but I am getting errors:   $ sudo apt-get install wine Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  wine : Depends: wine1.6 or                  wine1.8 but it is not going to be installed E: Unable to correct problems, you have held broken packages.   Also tried this:   $ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   I followed the answers to  and ran the following command.  dpkg --get-selections | grep hold   But there was no output.  After that I also tried dpkg --get-selections to see all the packages. There were some with "deinstall" so I ran the following:  $ dpkg --get-selections | grep deinstall ca-certificates-mono            deinstall libevent-2.0-5:amd64            deinstall libgdata2.1-cil                 deinstall libglib2.0-cil                  deinstall libgtk2.0-cil                   deinstall libmx-1.0-2:amd64               deinstall libnewtonsoft-json5.0-cil       deinstall mono-runtime-common             deinstall nvidia-304                      deinstall nvidia-opencl-icd-304           deinstall tlp                             deinstall tlp-rdw                         deinstall transmission-gtk                deinstall xserver-xorg-legacy             deinstall   But these packages cannot be uninstalled. I have also tried answers given to  and  but it has not resolved anything.  I have also tried using Aptitude, but the problem is still the same.  I also tried with Synaptic package manager. it is also unable to resolve the dependencies.     I have also tried the following commands:  sudo aptitude -f install wine sudo apt-get dist-upgrade sudo apt-get update dpkg --get-selections | grep hold dpkg --get-selections dpkg --get-selections | grep deinstall sudo apt-get clean sudo apt-get autoclean sudo dpkg --configure -a sudo aptitude -f install wine sudo apt-get -f install wine   But none of them fixed it.   What else can I try?

After upgrading from 10.04 to 12.04 I am trying to install different packages.  For instance ia32-libs and skype (4.0).  When trying to install these, I am getting the 'Unable to correct problems, you have held broken packages' error message.   Output of commands:  sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   After running this:  sudo dpkg --configure -a foo@foo:~$ sudo apt-get install -f Reading package lists... Done Building dependency tree        Reading state information... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.


Can someone explain the structure of the following sentence?     Not till he got home did he realise that he had lost his mobile.   Why we are doing inversion here ?

I was  subject predicate inversion     inverted word-order... is also used in clauses introduced by a   negative or restrictive clause element. In the following example, the   initial element Not only is negative and is followed by inverted word   order: could congress declare...      (12) Not only could (v) Congress (S) declare (V) war but the states   were forbidden to engage in it without the consent of Congress.   I am struggling to intuitively apply this.  Can someone explain the rule? E.g. the former sounds wrong, but perhaps the latter inversion does less damage. Maybe not.  Is the sentence Not all my cigs lit a candidate for inversion in the first place? And why or why not?   Not all my cigs lit -> Not all my lit cigs Not all my cigs lit burning straight -> Not all my lit cigs burning straight   Specifically could the phrase in bold be such an inversion (please ignore whether it is):   Not all your light tongues talking aloud / could be profound


Let's consider more general situation. Let $R$ be a ring and $I\subset R$ be an ideal of it. Fix a homomorphism $$ f: R\to R/I $$ where $f$ is not necessarily the quotient map. Suppose $f$ happens to be an isomorphism of rings, then can we conclude $I=(0)$?  The question is inspired by  where the answer is negative. But examples there more or less involve some infinite direct products. I doubt that this kind of examples may not exist if we work with some ring like the polynomial algebra $R=\mathbb C[x_1,\dots,x_n]$.      Question: Maybe with some reasonable conditions (like noetherian), we can actually show $I=(0)$.

Let $R$ be a commutative Noetherian ring (with unity), and let $I$ be an ideal of $R$ such that $R/I \cong R$. Then is it true that $I=(0)$ ?  I know that a surjective ring endomorphism of a Noetherian ring is also injective, and since there is a natural surjection from $R$ onto $R/I$ we get a surjection from $R$ onto $R$, but the problem is I can not determine the map explicitly and I am not sure about the statement. Please help. Thanks in advance.


Are there any issues if I purchase a round trip air travel on my credit card for someone else? They have a valid U.S. passport but live in Ghana. I have been told that I may either have to be present when the board or that they have to purchase the ticket themselves. Is that true?

If someone else is booking international ticket for me using his credit or debit card, does he need to be present physically at the time of check-in?   Suppose I am coming back from Singapore to my home country and my ticket is booked by my friend for me, who lives in my home country. Do airlines in Singapore ask for the person to be present physically to check in?


I am getting the following stacktrace:   java.lang.NullPointerException: Attempt to invoke virtual method 'void android.widget.EditText.setText(java.lang.CharSequence)' on a null object reference --------- Stack trace --------- mypackage.Inbox$9.onclick(Inbox.java:1538) android.view.View.performClick(View.java:5204) android.view.View$PerformClick.run(View.java:21153) android.os.Handler.handleCallback(Handler.java:739) android.os.Handler.dispatchMessage(Handler.java:95) android.os.Looper.loop(Looper.java:148) android.app.ActivityThread.main(ActivityThread.java:5444) java.lang.reflect.Method.invoke(Native Method) com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:746) com.android.internal.os.ZygoteInit.main(ZygoteInit.java:636)  double taxvalue = 0.0; double acttotal=Global.getDouble(((EditText)container.findViewById(R.id.textView9)).getText().toString()); taxvalue = Global.getDouble(((EditText) container.findViewById(R.id.textView8)).getText().toString());  ((EditText) (table.getChildAt(1).findViewById(R.id.amount))).setText(Global.formatDouble(acttotal - taxvalue));   Here table - LinearLayout, Last line is Line no 1538.  I tried table=null; But cannot be reproduced. what is the chance to get this issue.


Hello fellow drupal developers, i'm creating a store on drupal commerce and one of the goals is to add VAT to the product if the buyer is a company.  I've added the company field on the address on both billing and shipping forms but how can i make the rules validate the field if its empty or filled? I've been hammering on this for a while and i could use some help!   Thank you in advance!

I have a custom checkout page. I have already included the Swedish taxes of different amounts in my product price. Now the customer wants me to remove the taxes if the buyer is outside the EU. I tried commerce tax remove but couldn't make it happen.  I was thinking if I use the base price instead of the commerce_order_total['und'][0]['amount'] for order order total and to use base price for products on line items?  Will this be correct?  Thank you.


As I understand it, Hawking radiation predicts black hole evaporation because of quantum effects. After the creation of a particle/anti-particle near the horizon of the black hole, if the one gets trapped inside the black hole and the other escapes, the black hole will have lost part of its mass.  Why can't we interpret this as the universe instead losing part of its mass inside the black hole? Why is the particle emitted viewed as the one with positive energy? What if, instead, the one with positive energy is the one trapped causing the black hole to grow and the universe to shrink?

I was reading Brian Greene's "Hidden Reality" and came to the part about Hawking Radiation. Quantum jitters that occur near the event horizon of a black hole, which create both positive-energy particles and negative-energy particles, produce the so-called Hawking radiation. However, I do not understand why only the negative-energy particles are being absorbed into the black hole, while the positive-energy particles shoot outward. Shouldn't there be 50/50 chance that each type of particle is being absorbed by the black hole? Also, the book mentions that a negative-energy particle would appear to an observer inside the black hole as positive. Why?


I want to format my float number with 2 digit after decimal.     >>> x =5.0 >>> y=float("{:0.2f}".format(x)) >>> y 5.0   i want my output in this format:  5.00

I want a to be rounded to 13.95.  >>> a 13.949999999999999 >>> round(a, 2) 13.949999999999999   The  function does not work the way I expected.


We just got a spammy post () and I'm confused by the view / vote counter:    This was after a refresh - I saw it, though what!?, refreshed and it stayed...  I this due to the weird behaviour of the vote counter? It is worse than it seems - vote 1 is the OP and they can't have downvoted their post, so the view counter is off by at least 2...

How can a post be viewed 7 times and downvoted 8 times? Is it a bug?


I ran across  who has a fairly prolific SE profile. But I noticed something odd in their list    The question link is as such  https://law.stackexchange.com/questions/-2147481790/34047#34047   A negative question ID? Wait, the first number seems out of place entirely! I went looking and found it's really , so the ID is correct at the end. A rather interesting bug in their profile page.

I discovered a strange, blank link in 's Top Network Posts:        The above link and screenshot are of the user's Unix & Linux site profile, but this issue can be reproduced on any of the user's site profiles other than Meta Stack Exchange (as the blank post appears to be on this site, and posts from the same site are excluded).  The link seems to go to , which features a really negative question ID (close to the lowest value that can be represented by a 32-bit signed integer, specifically -(2^31) + 1005), and lacks the title in the URL that is present in all of the other links. It leads to a 404 error.  Going to the  seems to go to an actual answer on a question migrated to this site, which happens to have a score of 13 (as of the time this was asked).  Why is the question ID incorrect here? Based on the duplicates, it seems that this affects posts (both questions and answers) that were migrated from other sites: somehow, the question ID seems to be getting messed up.  Update: It looks like the above linked user has deleted their account on this site, so the issue cannot be reproduced on the profile I originally reported. It can, however, be reproduced on . The errant link in that profile is , and the errant question ID seems to also be close to the lowest possible 32-bit signed integer, -(2^31) + 3412.


Everytime I boot my iMac up while my iPhone is attached it attempts to import photos, giving me a message as soon as I login about how it "can not import photos because the device is locked". This has started up in the last 3-4 days, presumably because of an OS X update (I'm on version 10.10.5).  I don't want it to try importing them on boot (and it's annoying getting this message on each boot), and I've already disabled various settings to stop it importing automatically when I connect my iPhone.   How can I prevent it from trying to import photos each time I boot my Mac up?

The Photos app opens whenever I plug in my phone.    How can this be prevented?  I have seen many solutions for the old iPhoto app that involve changing the "Connecting camera opens" option, but the new app has no such option.


I used to run a Boot Camp partition on my Macbook Air (Early 2015, Catalina). When I didn't need it anymore I deleted the partition using Disk Utility.  However, I noticed that when I boot up my Macbook while holding down option to show the boot drives, it shows my old Windows drive.   When I select it, it fails with the following screen:   I also did a full reinstall of Mac OS recently using Internet Recovery where I reformatted the entire drive. The Windows option still appears even after the reinstall, which means there are artifacts left over.  What's causing this behaviour? Where are these boot options stored and how would I go about deleting the Windows option?  Thanks!

The short version:   I was running Boot Camp on my Retina MacBook Pro, but I decided just recently to ditch it because I never use it and I'd like to reclaim the space. The official method of removing it with Boot Camp Assistant failed so I went the harder route involving booting into Internet Recovery mode and deleting the partitions manually, which worked and gave me the space back - except when I rebooted I got a Windows screen telling me booting failed, and when I hold down OPTION on a boot I still see "Windows" as an option.   If I pick OS X when I hold down OPTION it boots like I want it to but on a restart it still gave me the Windows error screen. Booting into Internet Recovery again and setting "Macintosh HD" as the Startup Disk seems to have fixed it and now on subsequent reboots I'm in OS X like I want again, but I can still see "Windows" as an option as I hold down OPTION on reboot.   Is there any way to get rid of this "ghost" of Windows/Boot Camp on my system and if there's not, is this something I should be concerned with?  The long version  So here's the sequence of events:   Got my rMBP in 10/2014 A few months later I added Boot Camp, initially with Windows 8.1 and later upgraded to Windows 10 The other day I decided to ditch Boot Camp as it's taking up space and I never use it.  Did a few different backups Uninstalling Boot Camp via the Boot Camp Assistant didn't work, which is apparently really common Read online that the next best thing is deleting the Boot Camp partitions directly and/or modifying them to appease Boot Camp Assistant Tried removing the Boot Camp partition in Disk Utility. It wouldn't let me. (By the way, Disk Utility is really crappy and unusable in El Capitan - they've removed the old standard partitioning method and replaced them with a PIE CHART that doesn't work half the time) Did lots of reading, a fair amount of panicking, and booted into Internet Recovery mode Using the Disk Utility in Internet Recovery Mode (which is the old one from Mavericks/Yosemite, yay) I was able to do a series of maneuvers that, long story short, allowed me to delete the Boot Camp partition - along with a couple of others that, I'm guessing, are artifacts of Windows/Boot Camp - and got back to one big huge partition. I happily restarted... ...and was presented with a clearly-from-Microsoft screen (fonts, colors, etc.) saying Windows couldn't load. At this point I've got the "No! We killed you!" scene from Robocop going through my head Reboot, hold down OPTION, and I see Macintosh HD and Windows. I pick Macintosh HD OS X boots up, I have all my space back, life is wonderful Reboot the Mac to see what happens and I'm back in Windows error land Back in OS X (after rebooting and holding down OPTION again) I go to Startup Disk in System Preferences and try to set Macintosh HD as the start disk but it won't let me do anything because there's only one hard drive now and as far as it can tell it's already the startup disk I booted the Mac into Internet Recovery mode and set the Startup Disk to Macintosh HD (since, I'm guessing, when you're in Internet Recovery mode you're booting off of the temporary-from-the-Internet disk) and restarted.  Mac restarts in OS X like I want it to Reboot again, Mac still restarts in OS X like I want it to. Did this a few times to be sure. Reboot again, hold down OPTION, I can still see Windows as an option but I don't know where it's coming from   So basically things are where I want them to - except there's this "ghost" of my Boot Camp install lingering. Is there any way to get rid of it? And failing that, can I just ignore it safely?


Is $ \mathbb{Q} \times \mathbb{Q[i]}$ an integral domain ?  My attempt :  I know that  $ \mathbb{Q} \times   \mathbb{Q}$  is not integral domain take  $(0,1) \times (1,0) =( 0,0)$  But im confused in $ \mathbb{Q} \times \mathbb{Q[i]}$

Suppose that $R = S × T$ is a direct product of rings with $S$ and $T$ each having at least two elements. Prove that $R$ has zero divisors.


Which of the following statements are true?  There exists three mutually disjoint subsets of $\Bbb R$, each of which is countable and dense in $\Bbb R$  For each $n \in \Bbb N$, there exists $n$ mutually disjoint subsets of $\Bbb R$, each of which is countable and dense in $\Bbb R$  There exist countably infinite number of mutually disjoint subsets of $\Bbb R$, each of which is countable and dense in $\Bbb R$  There exist uncountable number of mutually disjoint subsets of $\Bbb R$, each of which is countable and dense in $\Bbb R$   We know that  $A$ is countable if $A$ ~ $\Bbb N$  $A$ is dense in $\Bbb R$ if $\bar A = \Bbb R$   I think if option 4 is correct then all options are correct. If I take $A = \Bbb Q$ and $B = \Bbb Q -({a})$ such that $\bar A = \Bbb R$ and $\bar B = \Bbb R$ but $ A \cap B \neq \phi$ How can we get $A$ and $B$ such that $\bar A = \Bbb R$ and $\bar B = \Bbb R$ with $ A \cap B = \phi$

Does there exist countable/uncountable number of mutually disjoint subsets of $\mathbb R$, each of which is countable and dense in $\mathbb R$?  For finite number, I am able to choose irrationals say, $r_n=\sqrt2-\frac1n$, and get the finite number of mutually disjoint sets as the rationals in $s_1=(-\infty,r_1),s_2=(r_1,r_2),\dots$ But how is such a thing possible for countable/uncountable irrationals because they can not be arranged in increasing order? Is there any other way of doing this? Is the answer to this question in the affirmative? Please help.


I have Battlefield Hardline for Xbox 360, and my brother has it for the Xbox One - can we play together online?

Is it possible to play against and with Xbox 360 players through my Xbox One?


$$\begin{cases} {a_n} = 3a_{n-1} - 3a_{n-2} + a_{n-3}\\ {a_0} = 1, a_1=2, a_2=5 \end{cases}$$  Hey everyone..  So far I have solved only questions of 2 root kind. I tried to solve this one but no success.. I dont know what do to after i found out:  $$x^{3} - 3x^{2} + 3{x} - 1 = 0$$ equals to: $$(x-1)^{3}$$  Aaaand lost.

Suppose $a_0,a_1,a_2$ satisfy the recurrence $a_n = 3a_{n-1}-3a_{n-2}+a_{n-3}$ for $n\ge3$   Let $c_n=a_{n+1}-a_n$ for $n\ge1$ and $c_0=0$   Find a linear recurrence of degree at most 2 for the sequence $c_0,c_1,c_2,...$  I'm not entirely sure what they are asking for but I think it is asking for a recurrence relation for $c_n$ where the characteristic polynomial has degree at most 2.  I tried finding a closed form for $a_n$ to try and get rid of the $a_n$ in the $c_n$ equation, but I can't figure it out when the initial conditions aren't specified ($a_0,a_1,a_2$)  Any help would be appreciated!


Scenario is given below. On Account, I have an approval process. and it's multistep approval. Let's assume its a 2 step approval. but in the approval steps, No approvers are mentioned. for the approvers, we are not having user lookups on Account but We have an Account Role object (Child of Account) from where approvers will be picked up dynamically based on the role (field on the object level) of the user. Now suppose in the Account Role we have 3 users (3 records which contains user with the role) with the role Manager so in that case, approvers in the "first step" will be these 3 users and any of them can approve the record, and once approved the record will go in the next step to be approved. Now I want to assign approvers dynamically in each step of the approval as explained in the above scenario. Can I call the same defined approval in apex and then in apex set the approvers in different steps and fire the approval?? Any suggestions would be appreciated. Thanks.

Can anyone answer to the following questions:   What is static approval process What are the limitations of static approval process Purpose of Dynamic approval process Differences between static and dynamic approval processes.   Thanks in advance.


I've come across a proof online of the H.B theorem using the goemetric version.   There is a step in the proof which im not sure why is true and it is as follows:   Let $X$ be a linear space and $M \subset X \times \Bbb R$ be a maximal subspace.  Then $M = G(F)$ for $F :X \to \Bbb R$ linear.   Someone can show me why this is true?   Maybe I misunderstood the proof, its the last paragraph of Matrin's answer here -.   Thanks a lot for helping!

I want to prove that the geometric Hahn Banach theorem implies the analytic one.   Edit:  To avoid confusion I will state the vesion of H.B theorems im familiar with:  Analytic H.B:   Let $X$ be a linear space(over $\Bbb R$) and $Y\subset X$ a subspace. Let $p:X \to \Bbb R$ be a sub-additive function. Suppose $f:Y\to \Bbb R$ is a linear map s.t $f(y) \le p(y)$ for all $y\in Y$ then there exists an extention $g:X\to \Bbb R$ of $f$ s.t. $g(x)\le p(x) $ for all $x\in X$.  Geometric H.B:  Let $X$ be a linear space. $K \subset X$ convex s.t. each point in $K$ is an internal point. Let $D$ be a plane disjoint from $K$ then there exists hyperplane that contains $D$ and disjoint from $K$.  In my problem $X$ is NOT a normed space so there are no open sets.   Given $X$ a linear space and $Y\subset X$ a subspace $p:X\to \Bbb R$ sub-additive, and $f:Y\to \Bbb R$ linear s.t $f(y)\le p(y)$ for $y\in Y$ we need to extend $f$ to $g:X\to \Bbb R $ and $g(x)\le p(x)$ fo r all $x\in X$  So, we look at $X \times \Bbb R $and define $K = \{(x,t) : t>p(x)\}$.  The fact that $K$ is convex is easy. How can I show directly that every point in $K$ is internal? (can't say that $K$ is open).  Now after showing that, we can look at $Graph(f)$ and observe that $Graph(f)\cap K = \emptyset$.  So by the geometric H.B theorem we have a hyperplane (which is a maximal subspace in this case because $(0,0)\in Graph(f)$ ) M containing $Graph(f) $ and disjoint from $K$.  Now my problem is to show that each $x\in X$ has a unique $t\in \Bbb R$ s.t. $(x,t) \in M$.  (I need it in order to extend $f$).  I know that if we take $v_0\notin M$ then each $v \in X \times \Bbb R$ has a unique representation as $v = \alpha v_0 + m$ for $m \in M$ , this is because $M$ is a maximal subspace. not sure if that helps.  Thanks for helping!


I am developing an app which opens links, I started with always showing the 'Open As' dialog, but now adding the ability to specify a default in the program.  I pulled a  from the registry, but the noticed some strange behavior with IE.  If you Process.Start a URL with IE (eg. Start > Run > www.superuser.com) it will open in an existing IE window. (I have my Tabbed Browsing Settings set to Open links from other programs in: a new tab in the current window).  If you Process.Start IE with a URL (eg. Start > Run > iexplore.exe "www.superuser.com") a new instance of IE will open with the URL.  As every other browser had the same behavior, I suspected it may be explained in the registry I checked my HKEY_CLASSES but couldn't find anything to explain the behavior.  I've looked at a few   and even the .  Have I missed anything in trying to open IE links in an existing browser without having to override the default program?

When IE10 is set as my default browser, double-clicking an internet shortcut (*.url file) opens it in a new tab of the existing IE window. However, when it is not the default, every way of opening a *.url that I've tried brings up a new IE window per file. Is it possible to keep opening files in new tabs of the same IE window when it's not set as the default browser, and how?  What I've tried and it didn't work:   "C:\Program Files (x86)\Internet Explorer\iexplore.exe" "C:\Dir1\file.url" (opens a new window every time) C:\Windows\System32\rundll32.exe "C:\Windows\System32\ieframe.dll",OpenURL C:\Dir1\file.url (opens the default browser) classexec "C:\Dir1\file.url" --class htmlFile (using  utility, opens a new window every time)   I use Windows 7 x64.


I just got a Chrome phishing warning on main for   Is it just me, Chrome screwing things up or do you people have work to do?  The message in English:     Known phishing site detected.   Google Chrome has denied the access to stackoverflow.com. This site is reported as phishing site.      Phishing sites are designed to mislead you, so that you disclose your login credentials, password or other personal data. These sites occur as sites which you probably trust.

Users  with freeimagehosting.net are getting SO flagged.  Not sure where else to post this, but I thought I'd let the meta-mongers know. I obviously know it's not an issue personally but it could potentially freak people out.


Prove that for any positive integer $n $: $(2n)!$ is divisible by $({n!}) ^2: $   If you know a solution to the problem, please help..  Sorry, this problem was edited by another user who changed some values. I have now fixed the problem.

Prove that $\frac{(2n)!}{(n!)^2}$ is even if $n$ is a positive integer.      For clarity: the denominator is the only part being squared.   My thought process:   The numerator is the product of the first $n$ even numbers and the product of the first $n$ odd numbers.   That is, $(2n!) = (2n)(2n-2)(2n-4)\cdots(2n-1)(2n-3)(2n-5).$ In effect, the product of even numbers can be cancelled out with $n!$ resulting in the following quotient:  $$ \frac{(2^n)(2n-1)(2n-3)}{(n!)}\;.$$  To me this looks even thanks to the powers of $2$. But I am not convinced for some reason.   Was this approach to naive?   Sorry for the poor notation, I don't know any coding languages, my apologies.


trying to substitute single apostrophes to doubles. But cant get it right.  sed 's/'/"/'

I'm having trouble with escaping characters in bash. I'd like to escape single and double quotes while running a command under a different user. For the purposes of this question let's say I want to echo the following on the screen:  'single quote phrase' "double quote phrase"   How can I escape all the special chars, if I also need to switch to a different user:  sudo su USER -c "echo \"'single quote phrase' \"double quote phrase\"\""   Of course, this doesn't produce the right result.


I get this thing everytime I open my laptop. It says, /dev/sda5: recovering journal /dev/sda5: clean, 250073/6102208 files, 10123692/244058880 blocks  The numbers I wrote are not increasing at all so I don't know what to do. I just installed it yesterday and don't know anything about Ubuntu so please help me out. Oh yeah and I am using the latest LTS from Ubuntu. Don't know if that helps you find a something though.

dev/sda1: clean, 552599/6111232 files, 7119295/24414464 blocks   After I turn on my laptop this message appears. The system never boots, the message just stays there.


I have 3 WRT54G routers (12V), 1 voip gw (9V), 1 cable modem (9v) and a gbit ethernet switch (12v) which are all operating from their own adapters.  I planning to build a low power (probably 12V UPS) later on not just to power these but to power some computers through X3-ATX-300 300 Watt High Power 24pin DC-DC ATX.  As I understand transformators are all lossy especially these cheap power adaptors which these devices come with from China.  What I really care about is that the Watt consumption at the end. I realize it's not possible to calculate this in advance how much would I won with the switchover since that wattage shown in the devices datasheet is the possible maximum or not even an accurate data. The only way to see how much will I save with this is to use a powermeter plug all the adaptors into one electric switch which is connected to the meter then do the same thing with my all-in-one adapter.  How should I go with calculating how many amps max will my all-in-one transformator needs to provide?   Looking at these big brick power adapters for the WRTGs:    One can do 1Amp, I think it could easily power all 3 routers for example but I want to go for sure. How to calculate what powersupply will I need and which one should I buy which is the most efficient?   Thanks!

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


In  has listed the sandboxes which are in Spring 14.  My sandbox is one of those, but any other way to ensure my instance is in Spring 14 preview release?

Usually you can tell what release (e.g. Winter '14) you are running under by looking at the logo in the top left, but if that has been customized or removed it's not an option. Is there some place in the setup or settings that let's you know what release you are running?


I want to prove the following:   Suppose $\sum_\limits{n\in\mathbb{N}}{b_n}$ is divergent. Then $\sum_\limits{n\in\mathbb{N}}{\dfrac{b_n}{1+b_n}}$ is divergent.  I think you have to prove by contradiction and by using Cauchy's criterion. But how to start with that? Or is it possible to use another well-known criterion?

As the title says, given a series $b_n > 0$, where $\sum_{n=1}^\infty b_n$ is divergent:  Show that the series $$\sum_{n=1}^\infty \frac{b_n}{1+b_n}$$ is also divergent.  So I've defined the series as $\sum_{n=1}^\infty u_n v_n$ where $u_n = b_n$ and $v_n = \frac {1}{1+b_n}$.   I'm sure there was some sort of convergence test which stipulated that for a product of two series, if one diverges the entire thing does, however I might be mistaken. If so, how do I properly prove this?


This question is mainly about if there was any canon occasion when the Borg tried to infect a founder/shapeshifter with nanoprobes and if there was, what was the result. If it did not occur, I'm also curious about educated guesses on if it is possible for the borg to assimilate a shapeshifter, or the entire Great Link. I know borg nanoprobes are mostly capable of assimilating humanoids but not exclusively. Also nanoprobes work on a cellular/subcellular level, so they might effect Changelings too.

Are there any works, canon or otherwise, that deal with the concept of the Founders, or other shapeshifters, being assimilated or otherwise encountering the Borg?  The idea of an assimilated Founder just came to me, and the difficulty of inserting nanoprobes into a non-solid mass interests me. I suspect the answer to this question is negative, but am curious.


In this comma-separated expression. Why doesn't the x gets value an instead of b? int main() {  int a=20; int b=100; int x; x=(a,b);  cout<<x; }   Gives output: 100

How does the comma operator work in C++?  For instance, if I do:  a = b, c;     Does a end up equaling b or c?   (Yes, I know this is easy to test - just documenting on here for someone to find the answer quickly.)  Update:  This question has exposed a nuance when using the comma operator.  Just to document this:  a = b, c;    // a is set to the value of b!  a = (b, c);  // a is set to the value of c!   This question was actually inspired by a typo in code.  What was intended to be  a = b; c = d;   Turned into  a = b,    //  <-  Note comma typo! c = d;


I have a simpĺe python script that triggers an animation base on the location of a cube. import bpy  scene = bpy.context.scene obj = scene.objects['Text']  def recalculate_text(scene):     x = scene.objects['Cube'].location[0]     obj.data.body = '{0:.1f}'.format(x)  bpy.app.handlers.frame_change_pre.append(recalculate_text)  Using a text Object it shows the location of the cube in the Viewport. The problem is that because my python skills are very basic, i can't Render the animation; once i hit "Render animation" ( Itried: EEVEE and CYCLES: Image sequence and video) it only shows the first frame of the text object.

this works in viewport but not in render.  import bpy from math import *  def frame_handler(scene):     z = scene.objects['Lift'].location[2]     scene.objects['Text'].data.body = str(floor(z / 4.0) - 2)  bpy.app.handlers.frame_change_pre.clear() bpy.app.handlers.frame_change_pre.append(frame_handler)   How to get it working in render? I've read  and changed from "bpy.data.objects" to "scene.objects" as already seen in the script. What am I missing? Blender v. 2.81.16  Edit. Tried that depsgraph thing mentioned in comments and changed to frame_change_post:  import bpy from bpy.app.handlers import persistent from math import *  @persistent  # maybe not relevant but doesn't harm anything? def frame_handler(scene, depsgraph):     z = scene.objects['Lift'].evaluated_get(depsgraph).location[2]     scene.objects['Text'].data.body = str(floor(z / 4.0) - 2)  bpy.app.handlers.frame_change_pre.clear() bpy.app.handlers.frame_change_post.clear() bpy.app.handlers.frame_change_post.append(frame_handler)   Now the Text doesn't show up at all in rendered (but works in viewport).


public static String checkStatus(String status)     {         while((status != "s" || status != "S" || status != "m" || status !=    //this line is in the main program marital = checkStatus(marital);  //this is a method that keep asking for s or m if user input is not s or m public static String checkStatus(String status)  {   while(status != "s" || status != "S" || status != "m" || status != "M")   {    status = JOptionPane.showInputDialog(null, "Please enter M or S for marital status: ");    }   return status;  }     "M"))         {             status = JOptionPane.showInputDialog(null, "Please enter M or S for marital status: ");      }     return status; }   //I keep getting a infinite loop that ask for m or s

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?


first time poster but I've been a long time reader! Here goes...  I've just converted a WD Green, 2TB HDD (data only) NTFS - using Minitool Partition Wizard 9.1 from MBR to GPT. Drive was about 67% full.  Using Windows 10. I have a UEFI GPT boot drive. The website specifically said this does not lose data!  Using the convert mbr to gpt command only took a couple of seconds (should it have been a long process?)  It now shows up as Basic GPT - Unallocated - empty space.  Also no drive letter is assigned.  Its not a system disk so no activity should have over written any data yet.  Before I try to recover the partition, does anyone have any experience - should I:  1 - first convert the drive BACK to MBR then try and recover the data?  or  2 - Is it safer to stick with the GPT and attempt recovery from its current type?  or  3 - Assign a driveletter and reboot, maybe the system will then see the GPT?  Thanks for any help!  AP

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


Let $a_n$ a sequence of real numbers such that $\lim_{n\to +\infty}a_n=A$. Is it true that  $$\lim_{n\to +\infty}\Big(1+\frac{a_n}{n}\Big)^n=e^A?$$

Assume that $x_n$ is a sequence such that $x_n$ converge to a constant $x$. I would like to prove that   $\left( 1+ x_n/n \right)^n \rightarrow e^x$  Obvious if $x_n = x$ the result would be given. The extra sequence complicates things and I would like a hint or solution on how to proof this.


Find a closed form for $\sum_{k=0}^{n} k^3$.  I would appreciate ideas for approaching questions like this in general as well.  Thanks.

How do you find an algebraic formula for $\sum_{k=1}^n k^3$? I am able to find one for $\sum_{k=1}^n k^2$, but not $k^3$. Any hints would be appreciated.


The operating system I use is Ubuntu version 13.04. How do we upgrade it to Ubuntu version 13.10 ?

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


As I understand \n means a new line and endl means end of the line.I have read somewhere that using endl(stream manipulator) is advantageous.Which one should be preferred and when?

Many C++ books contain example code like this...  std::cout << "Test line" << std::endl;   ...so I've always done that too. But I've seen a lot of code from working developers like this instead:  std::cout << "Test line\n";   Is there a technical reason to prefer one over the other, or is it just a matter of coding style?


$$(a_1 + a_2 + · · · + a_n)( 1/a_1 +1/a_2+ · · · +1/a_n) ≥ n^2$$  My TA mentioned he solved this using Cauchy Schwartz inequality, but I don't see how. All I've managed to do is make a summation of $1$, $n$ times, which ends up being $n ≥ n^2$.

If $x_1,...,x_n$ are positive real numbers and if $y_k=1/x_k$, prove that $$\left(\sum^n_{k=1}x_k\right)\left(\sum^n_{k=1}y_k\right)\geq n^2.$$   I've been learning induction, and I've come across this problem that I really can't even break down and begin to think about. I've been told it has something to do with Cauchy-Schwarz, but I cannot figure out how to apply it. I would appreciate help figuring out how to go about and formulate this proof. Thanks!


Let $p_1,\ldots,p_n$ be a sequence of distinct primes $>0$. How to prove that  $\sqrt{p_n}\not\in \mathbb{Q}(\sqrt{p_1}, \ldots, \sqrt{p_{n-1}})$. I tried to prove it be the principle of the mathematical induction but i could not. Also, i could not complete a proof by contradiction. I will be grateful if someone helps me solving that.  Thanks in advance.

I need to find a way of proving that the square roots of a finite set    of different primes are linearly independent over the field of    rationals.    I've tried to solve the problem using elementary algebra  and also using the theory of field extensions, without success. To  prove linear independence of two primes is easy but then my problems  arise. I would be very thankful for an answer to this question.


Is there a way to allow a running game (made with Blender) to save its current state?  E.g. when the player wants to shut down the game and, later, restart from that point.  I read in the documentation there are Quit/Restart Game Actuators (restarting the game from the beginning...), but what about "Save/Load"?  If I well understand, "Save bge.logic.globalDict" is used to save only some game properties.  Thanks and kind regards.

I probably need the help of a Python script to make this work.  What I want is: The player will be able to save and turn off the game, but continue from where they saved when they next log in. Items such as gold, weapons, etc. must be stored.  It feels like something hard to do and I am not managing to figure it out alone. Although I love problems and solving them, in this case I need help.  I know that BSE People should not  ask more questions.  But.  Is this stupid or must I have several Scenes in my game. Say that my player goes into a house. Should the house then be in another Scene, or should I move camera and player to inside the house from the same Scene?  Any advice would be very helpful. I have no one near me whom I can ask.  //  Robin W


The book of Thoms Jech on set theory mentions some equalities involving $\aleph_{\omega}$:  $\aleph_\omega^{\aleph_1} = \aleph_\omega^{\aleph_0} \cdot 2^{\aleph_1}$ If $\alpha < \omega_1$, then $\aleph_\alpha^{\aleph_1} = \aleph_\alpha^{\aleph_0} \cdot 2^{\aleph_1}$. If $\alpha < \omega_2$, then $\aleph_\alpha^{\aleph_2} = \aleph_\alpha^{\aleph_1} \cdot 2^{\aleph_2}$  How can the above equalities be proved?

So basically I want to show:  $\aleph_{\alpha}^{\aleph_{1}} = \aleph_{\alpha}^{\aleph_{0}}\cdot2^{\aleph_1}$ , Where $\omega\leq\alpha<\omega_1$  There is a proof that I found;    But I don't understand his proof for the limit case of $\alpha$.  To be more specific, I dont understand why $ \left( \sup_{\omega \le \beta < \alpha} \aleph_{\beta}\right)^{\aleph_1} \le \left( \prod_{\omega \le \beta < \alpha} \aleph_{\beta}\right)^{\aleph_1}$  Any insights or help is deeply appreciated.  Cheers


I analysed different nonoperative management practices and all of them showed worse outcomes than surgery. The sentence I am writing:  None of the nonoperative management practices disconfirms the superiority of surgery.  Is "disconfirm" the correct word to use or there are better options?

The term "deny" means to reject the truth of some claim.  However, it often seems to imply the claim is in fact true, denial notwithstanding.     Smith continued to deny that he had shot Jones.   I believe it is for this reason that Wikipedia  used to subvert the neutrality of encyclopedic articles.  Is there an alternative to "deny" that does not carry this non-neutral connotation?


Sometimes, when I answer a question, I use a list to explain things and add some code after that, for example:  argument 1 is hoppa  argument 2 is klap  argument 3 is klap command hoppa klap klap   The command however is not formatted correctly on Stack Overflow. When I add a line between them (which basically does not mean anything)  argument 1 is hoppa argument 2 is klap argument 3 is klap  blah blah: command hoppa klap klap  The code is formatted correctly. Adding two spaces extra, will produce code that seems part of the last list item, which is not what is meant.  argument 1 is hoppa  argument 2 is klap  argument 3 is klap command hoppa klap klap    The question is closed with a referral to a completely different question: that of nesting code in a list. Also some comments point to that. This question is not about nesting code in a list. If you look at the accepted answer, you will also see that this is not the case.

Oftentimes, I want to include code samples in a list, for example:   Item One Item Two, for example: private bool ItemTwo() {     return this.IFeelLucky; } Item Three   The problem is that there isn't a good and intuitive way to do this using . It's doable, but you have to do some formatting black-magic to get it that way, which is just not "nice" to deal with.  Source that produces this:  1. Item One 2. Item Two, for example:

private bool ItemTwo()     {         return this.IFeelLucky;     }
 3. Item Three    I would love to just be able to do it this way:  1. Item One 2. Item Two, for example:      private bool Test()     {         return this.IFeelLucky;     }  3. Item Three  Which results in, well, this:   Item One Item Two, for example:  private bool Test() {     return this.IFeelLucky; } Item Three


I run this code and get run time for both loop blocks. the interesting thing is that when I set the upper bound for j 2 the run time for each block is ~3500ms but when I run it with upper bound for j 10, the run time is <10ms. fast code:          long start = System.currentTimeMillis();         int a = 10;         for (int i = 0; i < Integer.MAX_VALUE; i++) {             for (int j = 0; j < 10; j++) {                 for (int k = 0; k < 1; k++) {                     a += 2;                 }             }         }         long finish = System.currentTimeMillis();         System.out.println(finish - start);          start = System.currentTimeMillis();         a = 10;         for (int i = 0; i < Integer.MAX_VALUE; i++) {             for (int j = 0; j < 10; j++) {                 for (int k = 0; k < 1; k++) {                     a = a + 2;                 }             }         }         finish = System.currentTimeMillis();         System.out.println(finish - start);   slow code:          long start = System.currentTimeMillis();         int a = 10;         for (int i = 0; i < Integer.MAX_VALUE; i++) {             for (int j = 0; j < 2; j++) {                 for (int k = 0; k < 1; k++) {                     a += 2;                 }             }         }         long finish = System.currentTimeMillis();         System.out.println(finish - start);          start = System.currentTimeMillis();         a = 10;         for (int i = 0; i < Integer.MAX_VALUE; i++) {             for (int j = 0; j < 2; j++) {                 for (int k = 0; k < 1; k++) {                     a = a + 2;                 }             }         }         finish = System.currentTimeMillis();         System.out.println(finish - start);   Why 10 runs faster than 2?!

How do you write (and run) a correct micro-benchmark in Java?  I'm looking for some code samples and comments illustrating various things to think about.  Example: Should the benchmark measure time/iteration or iterations/time, and why?  Related:


I'm really new to java.   I'm running some JUnit tests on a constructor. The constructor is such that if it is given a null or an empty string for one of its parameters, it's supposed to throw an exception.   When I test this constructor in JUnit with a null or an empty string parameter, I get a red bar, even though I'm almost 100% sure that the constructor method does indeed throw an exception when such parameters are passed in to it.   Shouldn't there be a green bar in JUnit if the method throws an exception the way it is supposed to? Or is it that when you are supposed to get a red bar when the exception throwing works the way it is supposed to?

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


I need make a usb bootable for windows 7 for GPT partition and UEFI, mi desktop computer loss the boot file and now i need fix it... someone know a good software highly configurable for this that work on linux ubuntu?.

I'd like to create a Windows bootable USB stick, but I don't have a Windows machine with me at the moment to do so. How could I achieve the same using Ubuntu?


Hopefully my title makes sense I am not very good with character encoding. Anyway I have an application and I sometimes get input that looks like this ❤❤❤❤❤❤❤❤ and then it's saved to my db which is utf-8 encoded and it looks like this â¤ï¸â¤ï¸â¤ï¸â¤ï¸â¤ï¸â¤. When the user then requests the information again it looks like the latter. How can I save this data to my database and return it to the user looking the same as it was sent to me? I have looked around for some libraries that would do this but wasn't able to find any.

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I am trying to use javascript to change a value of a select box on a ToysRUs address page. The project is an extension that fills out an address form automatically.     The item id is billingAddress.address.stateSelect  document.getElementById("billingAddress.address.stateSelect") // returns the element.  $("#billingAddress.address.stateSelect") // returns null.   I wanted to use $("#billingAddress.address.stateSelect").val("CA") to change the selection, but I cannot because it is null.  The page is using jQuery      (typeof jQuery != 'undefined') // is true   I still get null after escaping the periods with backslashes.  s=document.getElementById("billingAddress.address.stateSelect").id; console.log(s); s= "#"+s.replace( /(:|\.|[|])/g, "\\$1" );  //also tried \\\\ backslashes and \\\ backslashes console.log(s); //gives billingAddress\\.address\\.stateSelect console.log($(s)); //is still null

Given the following classes and controller action method:  public School {   public Int32 ID { get; set; }   publig String Name { get; set; }   public Address Address { get; set; } }  public class Address {   public string Street1 { get; set; }   public string City { get; set; }   public String ZipCode { get; set; }   public String State { get; set; }   public String Country { get; set; } }  [Authorize(Roles = "SchoolEditor")] [AcceptVerbs(HttpVerbs.Post)] public SchoolResponse Edit(Int32 id, FormCollection form) {   School school = GetSchoolFromRepository(id);    UpdateModel(school, form);    return new SchoolResponse() { School = school }; }   And the following form:  <form method="post">   School: <%= Html.TextBox("Name") %>
   Street: <%= Html.TextBox("Address.Street") %>
   City:  <%= Html.TextBox("Address.City") %>
   Zip Code: <%= Html.TextBox("Address.ZipCode") %>
   Sate: <select id="Address.State"></select>
   Country: <select id="Address.Country"></select>
 </form>   I am able to update both the School instance and the Address member of the school.  This is quite nice!  Thank you ASP.NET MVC team!  However, how do I use jQuery to select the drop down list so that I can pre-fill it?  I realize that I could do this server side but there will be other dynamic elements on the page that affect the list.  The following is what I have so far, and it does not work as the selectors don't seem to match the IDs:  $(function() {   $.getJSON("/Location/GetCountryList", null, function(data) {     $("#Address.Country").fillSelect(data);   });   $("#Address.Country").change(function() {     $.getJSON("/Location/GetRegionsForCountry", { country: $(this).val() }, function(data) {       $("#Address.State").fillSelect(data);     });   }); });


Evaluate $$\int_0^{\pi}\frac{x\sin x}{1 + \cos^2x}\,dx$$   I've tried many substitutions like $u = x\sin x $, $u = \cos x$ and $u = 1+\cos^2 x$ but they didn't work.

Given $$I = \int\limits_0^\pi \frac{x\sin x}{1+\cos^2\!x}dx$$   prove without calculating $ \frac{\pi}{2} \le I \le \pi $ calulate $I$   so far I know $I = \int\limits_0^\pi \frac{x\sin x}{1+\cos^2\!x}dx \le \int\limits_0^\pi x\sin x =\pi$


I joined  associating with my existing credentials. It is showing a different name for me, like jon.doe11943 What is happening? Why is my name something different?

I think I'm having the same issue as reported in this question:    When I log into SEDE with the same OpenID account I use for SE, a different user comes up ("James Wiseman" on Stack Exchange and "adsense" in Data Explorer).  Is there anything I can do personally to rectify this, or must I rely on the admins?


Given $3$ positive real numbers $x,\,y,\,z$ and $x+ y+ z= 3$. Prove that: $$4\geqslant x^2y+ y^2z+ z^2x$$ This problem was homogenized so I set $x+ y+ z= 3$ to cancel stuff. Now I'm stuck. I have noticed a funny equality condition: If $(\,x,\,y,\,z\,)=(\, 2,\,1,\,0\,)$ then we have equality we don't have equality if they are all equal. To me$,$ that implied a weighted AM-GM but I couldn't make that work. Thanks in advance for any help!

Let $a,b,c $ are non-negative real numbers, and $a+b+c=3$.  How to prove inequality $$ ab^2+bc^2+ca^2\le 4.\tag{*} $$    In other words, if $a,b,c$ are non-negative real numbers, then how to prove inequality $$ 27(ab^2+bc^2+ca^2)\le 4(a+b+c)^3.\tag {**} $$ $\color{gray}{\mbox{(Without using "universal" Lagrange multipliers method).}}$  Thanks!


I downloaded my old Blender project from Google Drive which I made in Blender 2.81. Even though I put all procedural textures, everything is pink. The textures are somehow missing. This is how it looks.

I made a character, and its one of my first times texturing, and I saved my character into a new folder, and when I came back to the model ALL the textures were pink, I used to know what to do, but I stopped texturing, how do I bring my textures back?


I have a series of tables that are going to be very (very!) wide, but with only 3 rows. Is there any way I can get the tables to wrap within my margins, without having to break the rows within the .tex file itself?


I dont have any antivirus on my PC because its only for gaming use only. I dont know where did i get these trojan virus, it makes my PC slow and my it eats my HD and also makes my internet slow. I tried to remove it using some software but still it exist.  if i install avast with an existing Trojan after it is installed and scan the computer, can avast delete it?  I havent tried Avast. Just asking. Thanks

What should I do if my Windows computer seems to be infected with a virus or malware?  What are the symptoms of an infection? What should I do after noticing an infection? What can I do to get rid of it? how to prevent from infection by malware?   This question comes up frequently, and the suggested solutions are usually the same. This community wiki is an attempt to serve as the definitive, most comprehensive answer possible. Feel free to add your contributions via edits.


If i'm doing  oidvalue=$(snmpget -v 2c -c public localhost 1234)   This will store the output of that command in oidvalue, however as it is now, it will print some error to the screen. How can I suppress stderr and stdout at the same time store in the variable?  Thanks  2nd EDIT: the below works for my condition:  oidvalue=$(snmpget -v 2c -c public  localhost 1234) > /dev/null 2>&1

touch ~/deleted/$(echo "directory_"$(readlink -f foo)|tr '/' '\') 2> /dev/null   where foo is a directory  It's reading the full pathname of foo and creating it as a file replacing all '/' with '\' and putting a directory_ in front so the directory  /home/test/foo would create a file directory_\home\test\foo  It does exactly what I want except a warning keeps printing tr: warning: an unescaped backslash at end of string is not portable   a. I don't know what that means b. I would like it to not show  I tried to redirect stderr to /dev/null but it doesn't work. How do I suppress it?


Let $X_1,X_2,...,X_n \sim U_{[0,1]}$.  $X_1,..,X_n$ are independent. Let us define : $Y=X_1+X_2+...+X_n$ How to find the PDF of $Y$?


Let the scenario be the following:  I have a volatile String str that is shared between multiple threads. As String is immutable, while we can change the reference str, any Object it is pointing to at any time is read-only.  So now, let's say I have a method in one of my threads that reads in str.  Given the reading in of str is not  synchronized, is it guaranteed that the Object the method reads in as str stays the same, even if at some time during execution the reference str is overwritten?  I.e., if a method gets passed a reference, does it save a local copy of it (so that changing the original reference afterwards has no effect on the method)?  Is this statement true for any general immutable object/primitive?

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


I'm new to Ubuntu. Very strange and annoying thing happened. Terminal  (only) icon larger than it should be and out of windows border. How can I fix that? GNOME tweaks is installed.

A while ago I upgraded from Ubuntu 17.04 to Ubuntu 17.10 and everything is working fine except for the fact that the icon in the window title bar of my Terminal seems to be stretched out to some ridiculous size.    This only seems to happen in the Terminal window. The Nautilus icon is completely fine.    The problem seems to go away if I login into an Xorg session instead of a Wayland one. I've looked around and didn't find any immediate solution to this. Any help would be greatly appreciated.


I have a client asking to develop a system which provides API to consume data from their POI, PA and MPA datasets (in shapefile).  Essentially more like the existing Google Maps or HERE Map API which provides endpoints for users to get information like road speed limit, shop information, postal boundary, property prices, etc.  So for example, if a user wants to get all the speed limit information from point A to B, the API would return the result back to the user with JSON.   What are my options to do this?   Should I develop the system from scratch by maybe converting the shapefile to GeoJSON and then develop the API, or is there any opensource/paid solution already made that perhaps I can just upload the shapefiles, define which data is searchable and define the response template?

I want to start working on a web map at work to map some of our statistics by city.    I have an idea, but I'm not exactly sure where to start.   Are there any definitive resources that provide step by step guidance on how to do this?


How can I prove that the function $d(x,y) = \displaystyle\sum_{i=1}^n (x_i-y_i)^2$ satisfies the triangle inequality $$ d(x,z) \leq d(x,y)+d(y,z)?$$ The book from which this problem came suggests that the Cauchy-Schwarz inequality of the form $$\displaystyle\sum_{i=1}^n (x_iy_i) \leq (\displaystyle\sum_{i=1}^n x_i^2 \displaystyle\sum_{i=1}^n y_i^2)^{1/2}$$ may be helpful. Also, $d: \mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R}$.

How can I show that the Euclidean distance satisfies the triangle inequality?   Where the Euclidean distance is given by: $$d(p,q) = \sqrt{(p_1-q_1)^2 + \cdots + (p_n-q_n)^2}$$  Triangle Inequality: $\forall x,y,z\Bigl( d(x,z) \leq d(x,y) + d(y,z)\Bigr)$.


I'm currently reading An Introduction to Statistical Learning with Applications in R by Hastie & Tibshirani. In their discussion on the hierarchical clustering algorithm, they note that the notion of 'dissimilarity' between pairs of observations can be extended to pairs of groups of observations using the concept of 'linkage', then briefly describe four common types of linkage (complete, single, average, centroid).   Which linkage should I use when? I'd like to see examples to build up some intuition. ISLR doesn't provide them; they merely throw out some assertions (e.g. "average and complete linkage tend to yield more balanced dendrograms than single linkage"; "centroid linkage can lead to inversions"), which is understandable given the level of audience they're pitching at.   If it helps, my background is in physics, I have no formal statistical training.

I am performing hierarchical clustering on data I've gathered and processed from the reddit data dump on Google BigQuery.   My process is the following:   Get the latest 1000 posts in /r/politics Gather all the comments Process the data and compute an n x m data matrix (n:users/samples, m:posts/features) Calculate the distance matrix for hierarchical clustering Choose a linkage method and perform the hierarchical clustering Plot the data as a dendrogram   My question is, how do I determine what the best linkage method is? I'm currently using Ward but how do I know if I should be using single, complete, average, etc?  I'm very new to this stuff but I can't find a clear answer online as I'm not sure there is one. So what might be a good idea for my application? Note the data is relatively sparse in the sense that the n x m matrix has a lot of zeroes (most people don't comment on more than a few posts).


if $\alpha$ , $\beta$  are the values of  $\theta$ satisfying  $$\displaystyle a\tan(\theta)+b\sec(\theta) = c$$     prove that $$\displaystyle\tan(\alpha+\beta) = \dfrac{2ac}{a^2-c^2}$$ How do i solve this, suggestions about how to go about doing this

If $\alpha$ and $\beta$ are the solution of $$a \cdot \tan\theta + b \cdot \sec\theta = c$$, then show that $$ \tan(\alpha + \beta) = \frac{2ac}{a^2 - c^2}$$  I did the following:     $$a \cdot \tan\theta + b \cdot \sec\theta = c$$       Squaring both sides,  $$a^2 \cdot \tan^2\theta + b^2 \cdot \sec \theta + 2 \cdot a \cdot b \cdot \tan \theta \cdot \sec \theta = c^2$$      This implies $$(a^2 + b^2) \cdot \sin^2 \theta + 2 \cdot a \cdot b \cdot \sin \theta + (b^2 - c^2) = 0$$       Hence I get $$\sin \alpha + \sin \beta = \frac{-2ab}{a^2 + c^2}$$ and $$\sin \alpha \cdot \sin \beta = \frac{b^2 - c^2}{a^2 - c^2}$$   But I am not able to solve it further.


What is needed for a soldier to advance his/her psionic abilities?

It is apparent that kills gives you experience that gain you promotion for your normal abilities. How does it work for Psi-abilities? What grants experience/promotion points for Psi-ability promotions?


If I copy a scroll into a spellbook, does the scroll get used and thus become unusable, or do I keep it, still able to use it to cast the spell?

The text on page 32 of the Basic Rules that talks about copying spells does not explicitly state that the process consumes the scroll. Does it?


Despite I followed various instructions/replies indicated in various answers on Askubuntu, I can't in any way use Java plugins in Firefox 71.0 on my Linux Ubuntu 18.04 (Linux 4.15.0-74-generic # 84-Ubuntu SMP Thu Dec 19 08:06: 28 UTC 2019 x86_64 x86_64 x86_64 GNU / Linux).   Do you have any solution to solve this issue?  I encounter the same issue using the chromium browser (Google Chrome 79.0.3945.88). Can anyone tell me how to fix this other issue?  Alternatively can someone point me to a browser that can use the Java Oracle plugin?

As per  article, Mozilla has dropped the support of NPAPI plugins from Mozilla Firefox version 52. Is there any web browser with NPAPI plugin support? I have to use a website frequently, which uses Oracle Java plugin. I'm using Ubuntu 16.04 64 bit with Java JDK 8u121. Helps are much appreciated. Thanks. Edit1: After 3 years of asking this question, Java plugin still works fine in Palemoon v28.9.2-1 64 bit on Ubuntu 20.04 LTS. Java version is JRE 8u251 64 bit Edit2: As of 20th October 2020, Oracle completely removed Java Plugin from 8u271 JRE and JDK packages mentioned in  article. But 8u261 or prior versions works just fine.


I spotted a  on the StackOverflow site. The question was pretty specific about Arduino hardware, however I don't have the rep to migrate it to the  site.  What is the appropriate action here?    Flag it? I can only flag for moderator attention at present. Ignore it and hope someone else flags or migrates it? Answer it, even though it is better answered on the dedicated site?   That question certainly isn't the first which is rather specific to the Arduino platform.    Because this was flagged as a possible duplicate, edited to add:  Comments below indicate that voting to move the question is already available. However I don't have the rep to vote to close. I have a lot more rep on the . But I can't vote to "pull" the question to it, I would need have to have rep here to "push" it (which I don't).     But are you sure the Arduino community wants it?    I am currently ranked #6 for the year and #1 for the quarter on the Arduino site. I am also a moderator on the . Yes, I believe the question is more applicable to the Arduino site. It specifically mentions the ATtiny85 processor, I2C, and a particular Arduino library.  Being a moderator myself on another site, I don't particularly want to pester the moderators here with requests to migrate this, that and the other question every day.  So basically this question is about: is there an easy way to do this without involving the moderators?

Earlier, I voted to close  as off-topic.  The question has since been closed.  There is an , but it didn't show up in the list when I selected "off-topic".  The options were:   Meta Stack Overflow Server Fault Super User Webmasters Programmers   Questions:   Should Wordpress appear in this list? Are there any other sites that should appear in the list?   Should all non-beta sites appear in that list by default?


Why doesn't every bank account come with a "deposit only" number?  I.e. why do I have to give my account number (and thereby give the ability to withdraw money from my account) to someone whenever I want him or her to send me money?  It seems like a deposit only number would add a lot of security and confidence, so there's probably a good reason it hasn't been adopted.

My employer wants me to give my routing-numbers, social-security numbers, and basically everything else required to take money out of my account, to several third-party direct-deposit websites (one for weekly paychecks, one for mileage reimbursements, etc.).  I am not comfortable giving my identity information away to all these places.  I'd like to give them access to an account which they can only deposit into, never withdraw (either a separate account, or, even better, a deposit-only alias to my real account).  Does such a thing exist?    [Edit] I'm not worried about the companies so much as I am worried about bad guys who inevitably hack those companies' databases, or get hired to work there.  This type of account would also be handy for giving read-only access to sites like mint.com or quicken.com, easing my mind about their hackers/unscrupulous employees.


I have a mixamo model (in plum color) who I got a walk cycle for. I need his colors to look exactly like the one behind him, but can't figure out how to do it. The colored model is separate shapes and objects, and so it was easy to assign colors. This new, one Item Mixamo model has got me stumped.

How do you add more than one material to a mesh?   I have tried adding two materials to the object, and then assigning one of the materials to a vertex-group, but I could not find a place to assign it.  I am making a striped bouncy ball that I want to deform, so adding a different material by separating the mesh into different objects would not be ideal.


I was trying to add a dropdown menu inside VF page (where I already have other pageBlockTables). I only need to retrieve one field (c.sfprn) from an existing SOQL query where it is already used for other pageBlockTables.  Here is part of my VF page where I am trying to add a dropdown menu:      <!-- DropDown Menu starts -->          <apex:pageBlockTable value="{!RowList}" var="c">             <apex:column >                 <apex:facet name="header">All Surveys</apex:facet>                 <span>All Surveys: </span>             <apex:selectList id="AllSurvey" size="1">             <apex:selectOptions value="http://www.test.com?sfprn={!c.sfprn}&id=1>Test1</apex:selectOptions>             <apex:selectOptions value="http://www.test.com?sfprn={!c.sfprn}&id=2>Test1</apex:selectOptions>             </apex:selectList>              </apex:column>          </apex:pageBlockTable>          <!-- DropDown Menu ends -->    Here is portion of Apex code:  public PageReference searchPatients(){      RowList = new List<TableRow2>();     TableRow2 tr;      for(Patient__c con : [SELECT sfprn__c,                                  mrn__c,                                 LName__c,                                  FName__c,                                 (select SurveySelection__c.SurveySelection__c from SurveySelections__r)                                  FROM Patient__c                                 where mrn__c =:mrn                                  or LName__c =:lname LIMIT 1                                                                 ]){          tr = new TableRow2();         tr.sfprn = con.sfprn__c;         tr.mrn = con.mrn__c;         tr.lname = con.LName__c;         tr.fname = con.FName__c;         tr.SurveySelection = con.SurveySelections__r.isEmpty() ? null : con.SurveySelections__r[0].SurveySelection__c;          RowList.add(tr);         }      return null;    }      I am curious whether I need to add a new method or I could just call the value="{!RowList}" to bring one field (c.sfprn).  Thanks in advance.

This code compiles but in preview, it shows an error Invalid selectOptions found. Use SelectOption type in Apex.   public list<student__c> myStud = new list<student__c>();    List<student__c> stud_qry = new List<student__c>();     public list<student__c> getStud(){         stud_qry =  [select Id, First_Name__c, name from Student__c];          for(student__c getEm : stud_qry){           myStud.add(new student__c(Name = getEm.first_name__c+' ' + getEm.name));            }            return myStud;    }   VFP  <apex:outputText >Select Student:</apex:outputText>                 <apex:selectList size="1">                      <apex:selectOptions value="{!Stud}"/>                 </apex:selectList>


I am trying to edit the style svmono.cls to tweak the default spacings, but there are entries whose values are not clear to me. In particular, what are \z@ and \p@ in the definitions in lines 244 and 587 (see below)? Thanks, Jorge.  EXCERPT FROM svmono.cls:  \setlength{\parskip}{\z@ \@plus \p@}  \renewcommand\section{\@startsection{section}{1}{\z@}%                        {-30\p@}% \p@lus -4\p@ \@minus -4\p@}%                        {16\p@}% \p@lus 4\p@ \@minus 4\p@}%                        {\normalfont\secsize\secstyle                         \rightskip=\z@ \@plus 8em\pretolerance=10000 }}

in parcolumns it has \z@ all over the space. I don't see it define it anywhere so I assume it is some internal command or something? I can't really make heads or tails of it though and I can't really search google for it(doesn't return anything useful)


I am hesitant whether this question is appropriate for this forum, but I will go ahead and ask it anyways; so please bear with me.  $6$.$\bar 6$ = $20\over 3$  So if you have them multiplied by 30 ; then you should get the same numbers as the answer but obviously you do not. Why is that?

I'm told by smart people that $$0.999999999\ldots=1$$ and I believe them, but is there a proof that explains why this is?


I am doing an exercise where I have to consider the radius and interval of convergence of a series of functions. I found one endpoint to be $e/2$ and I now need to consider whether or not the following sum diverges. $$\sum_{k=1}^\infty \frac{e^kk!}{k^k}$$    I have found from calculators that it diverges but I do not know how to prove this.  Cauchy's ratiotest is inconclusive, as it gives the value 1.  Any help?

Show that this series $$\sum_{n=1}^{\infty}\dfrac{e^n\cdot n!}{n^n}$$ is divergent. My try: since $$u_{n}=\dfrac{e^n\cdot n!}{n^n},\Longrightarrow \dfrac{u_{n+1}}{u_{n}}=\dfrac{e^{n+1}\cdot(n+1)!}{(n+1)^{n+1}}\cdot\dfrac{n^n}{e^n\cdot n!}=\dfrac{e}{\left(1+\dfrac{1}{n}\right)^n}$$ then $$\lim_{n\to\infty}\dfrac{u_{n+1}}{u_{n}}=\lim_{n\to\infty}\dfrac{e}{\left(1+\dfrac{1}{n}\right)^n}=1$$ so this limit is $1$, therefore I can't prove it by using the Ratio test.   From sos440 suggestion: by using Stirling's approximation, we have $$\dfrac{e^n\cdot n!}{n^n}\approx \sqrt{2n\pi}\to\infty.$$  Maybe this problem requires other methods.


I have a Django app running on Heroku. At the moment I only have 1 dyno. One of the urls generates a pdf from database values and this takes about 4 seconds. Since I only have 1 dyno, does it mean that while the pdf is busy generating, my dyno can't respond to any other requests from any other users?  In other words, how many open requests can Django/Heroku handle at a given time?

This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general.


I have an Xperia U[GB] and there are certain apps which do not work on it[device is not rooted shows up everytime I try to open these apps]. So what exactly does it mean by rooted device. Should I root my device? Does it have any negative implications? Also I still haven't updated it to ICS,since I've been told that Xperia U doesn't perform well with ICS.So should I upgrade it?

I heard this phrase or the variants (rooted phone, rooting, etc.) in android forums but I don't know what it means. Can you explain it in simple terms?


1. I am not doing this and have never done that.  2. When I was working and looking outside the window.  I have made up these examples. I want to know if the first sentence is grammatical or do we need "I" before "have" in the first sentence. And does the second sentence mean "when I was working and I was looking outside the window"? Is the second sentence idiomatic?

Is it always necessary to repeat the pronoun before each verb?  For example, do I need always to say:     She called me and she said X   or can I use a shorter one     She called me and said X   ?


I see that Ubuntu 18.04 is out already. I can't update from software & Updates( It says my system is up to date)(Yes,I've enabled notify for new ubuntu version). When I run do-release-upgrade -c ,It says no new release found. Is there any alternative way? Or is it not available for update yet?

Update manger do not provide option to upgrade. It displays "Your system is up-to-date" instead. I tried Check button many times but received same message. Please help.


When looking at my code in the python file, it is lovely and colourful, however these colours do not carry over when putting it into a word document (microsoft). Is there anyway to do this without screenshots or do I have to suffer.

Does anyone know a way to display code in Microsoft Word documents that preserves coloring and formatting? Preferably, the method would also be unobtrusive and easy to update.  I have tried to include code as regular text which looks awful and gets in the way when editing regular text.  I have also tried inserting objects, a WordPad document and Text Box, into the document then putting the code inside those objects.  The code looks much better and is easier to avoid while editing the rest of the text.  However, these objects can only span one page which makes editing a nightmare when several pages of code need to be added.  Lastly, I know that there are much better editors/formats that have no problem handling this but I am stuck working with MS word.


How to prove the following with induction?  $$\sum_{k=1}^{2n} \frac{1}{k(k+1)} = \frac{2n}{2n+1}$$  I have difficulty solving this example. I got past base part where I prove that $L(1) = P(1)$ but I cant prove it for $n+1$. Any ideas how to deal with this kind of example?

I am trying to prove the summation formula using induction:  $$\sum_{k=1}^n \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$$  So far I have...  Base case:   Let n=1 and test   $\frac{1}{k(k+1)} = 1-\frac{1}{n+1}$  $\frac{1}{1(1+1)} = 1-\frac{1}{1+1}$    $\frac{1}{2} = \frac{1}{2}$   True for n=1   Induction Hypothesis:   Assume the statement is true for the n-th case   $\sum_{k=1}^n  \frac{1}{k(k+1)} = 1-\frac{1}{n+1}$  Inductive Step:   Prove, using the Inductive Hypothesis as a premise, that   $$\sum_{k=1}^{n+1}  \frac{1}{k(k+1)} = \sum_{k=1}^{n}  \frac{1}{k(k+1)} + \frac{1}{(n+1)(n+2)} = 1-\frac1{n+1} + \frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)}{(n+1)(n+2)}+\frac{-2-n}{(n+1)(n+2)}+\frac{1}{(n+1)(n+2)} = \frac{(n+1)(n+2)-2-n+1)}{(n+1)(n+2)} = \frac{(n+1)(n+2)-n-1}{(n+1)(n+2)} = \frac{n^2+2n+1}{(n+1)(n+2)} = \frac{(n+1)(n+1)}{(n+1)(n+2)} = \frac{n+1}{n+2}$$  To prove $$ 1-\frac{1}{n+2} = \frac{n+1}{n+2} $$ Multiply both sides by $n+2$ to get an equivalent expression. $$ (1-\frac{1}{n+2}) * (n+2) = (\frac{n+1}{n+2}) * (n+2)  $$ $$ n+1=n+2−1 $$  Does this all make sense? How can this be improved upon?


I was thinking the time complexity will be O(n^2*logn). Is it correct. If not, What will be time complexity? for(i = 0; i < n; i++)    for(j = 0; j < n; j++)          for(k = 0; k < 100000; k++)                    a++;

Most people with a degree in CS will certainly know what . It helps us to measure how well an algorithm scales.   But I'm curious, how do you calculate or approximate the complexity of your algorithms?


Clearly most installers do more than unpack files. Is there a file in there somewhere that lists planned actions?

I want to know what some installers do: mainly what files, folders, and registry entries they add, remove, or modify.  Lots of “ professional” programs are so poorly documented that it’s difficult to find the proper way to configure them, update them, etc.   is a program which is able to take a “snapshot” before and after the installation of a program and then compare the snapshots. This allows you to know what was done and even to create a custom uninstaller. Unfortunately InstallRite seems to no longer be maintained and has not been updated since 2008.


\documentclass{article} \usepackage{amsmath,amsfonts,amsthm,amssymb,mathrsfs,latexsym,paralist} \begin{document} \[ \begin{bmatrix}     1 & 0 & 0 & -1 & 0  & 0  & 1 & -1 & 1  & -1 & 0 \\     0 & 1 & 0 & 0  & -1 & 0  & 1 & -1 & 0  & 1  & -1 \\     0 & 0 & 1 & 0  & 0  & -1 & 1 & -1 & -1 & 0  & 1  \end{bmatrix} \] \end{document}   I am trying to create this 3x11 matrix and it is complaining. What is wrong here? Here is the message.  Extra alignment tab has been changed to \cr.  \endtemplate   l.529 ...0 & 0 & -1 & 0  & 0  & 1 & -1 & 1  & -1 &                                                    0 \ You have given more \span or & marks than there were in the preamble to the \halign or \valign now in progress. So I'll assume that you meant to type \cr instead.  ! Extra alignment tab has been changed to \cr.  \endtemplate

I'm using bmatrix environment from the amsmath package, and I'm trying to do something like this:  \documentclass{article} \usepackage{amsmath}   \begin{document}      \begin{equation}          \begin{bmatrix}              1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11\\          \end{bmatrix}     \end{equation}  \end{document}   However, pdfLaTeX returns an error: "Extra alignment tab has been changed to \cr", and in the output the extra element is moved to the next row. (If I remove one element, then it works perfectly fine). I guess this means that I've hit some hard limit on the number of tab stops in a matrix. Is there a way to change this?  The elements in the matrix are short and could fit perfectly on a single row.


I used dd when I did a very dumb thing. Yes, I did override the wrong drive. I run dd if=file_on_sdb1.iso of=/dev/sdb1 conv=fsync. (Please note: /dev/sdb1/ and not /dev/sdb!) It didn't run completely. I interrupted it after ~20s I guess. (It was connected via USB2.) The device which was /dev/sdb then is a 1TB (~998GB) HDD USB disk. It is formatted with GPT. It contains one huge partition which takes up all the space. That one is formatted with ext4. There was a lot (~50GB I guess) of data on there that I'd like to recover. The file I used for overriding (file_on_sdb1.iso) was maybe ~2.5GB big. That means it probably didn't override everything. It's 20 times smaller, how could it? What I know  the partition table is still there I can't simply mount the hard drive (no usefull data) the first superblock is destroyed  What I'd like to know  Does there (most likely) still exist one of old superblocks? (I can't believe that all the superblocks are overriden first. What would they do this for.)  Bonus points for tips for recovering the data.

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


I want to store both Value & Label attribute upon clicking particular Combo-box value, but currently I am only able to get Value.  When I try to store & print Label - it says undefined.    Here is the .

I'm developing a LWC Combobox and I want to get the label of the selected value in the handleChange() method, not the id. I filled the combobox with JSON Items in this form :   {value :'Id', label:'Label'}   I used this in JS : event.detail.value but it gives the id not the Label.


Is there a maximum to bash file name expansion (globbing) and if so, what is it? See  on tldp.org.  Let's say I want to run a command against a subset of files:  grep -e bar foo* rm -f bar*   Is there a limit to how many files bash will expand to, and if so what is it?  I am not looking for alternative ways to perform those operations (e.g. by using find).

Consider that there are countless number of files under /src/  cp /src/* /dst/   How many files cp will successfully process?


I did camera tracking and applied set up tracking scene...then it create its own render layers....like it create foreground and background layers....I want to return to default render layers...but after changing nodes also render layers don't returned to default...but I want to return to default

I am ready to render my animation but it seems i have a problem with my texture of the object i animated.  In the image u can see that the object is transparent and I can look trough it. So what is the problem here?   This is the node setup.    Thank you for your help!


$$ 0<\theta<\pi/2$$   and $$\sin\theta+\cos\theta+\tan\theta+\cot\theta+\sec\theta+\csc\theta=7$$   then show that $\sin 2\theta$ is a root of the equation $$x^2 -44x +36=0$$   I tried to use the above given equation of all the trigonometric ratios, though I ended up with an expression of $\sin\theta\cos\theta$.   But this too is in the form of $\sin\theta$ and $\cos\theta$ which was $\sin\theta\cos\theta=\frac{1}{6-\sin\theta-\cos\theta}$.  When I put that in the quadratic equation, it would again transform into the form of $\sin\theta$ and $\cos\theta$, and hence at last I couldn't prove the thing.  Even hints would work, as I would like to solve the question myself.

If  $$\sin A + \cos A + \tan A + \cot A + \sec A + \csc A = 7$$ then prove that  $$\sin 2A \quad\text{ is a root of }\quad x^2 - 44x - 36 = 0$$  I have no idea how to solve it. Plz help.