Which of the following is correct? Does the is/are depend on the total number of things in the list, or only on the thing immediately following the is/are?     There is 1 apple and 1 orange available.   There are 1 apple and 1 orange available.   Also, would it make a difference if one would put the is/are near the end, like so?     1 apple and 1 orange is available.   1 apple and 1 orange are available.

It seems I put a   Bounty assigned by outside party, two lengthy, reference-citing answers, one "-1" (awarded the bounty), one "-2", two others scored "0" and "-2" respectively, the answers suggesting one or the other is correct, 73 comments and no consensus so far - and me, as the asker, lost without a clue what to think of the answers anymore -  this is no longer "Learners' Level" question, so I thought I'd bring it here and hear what the experts have to say.    Original question:  Plurality of verb depending on plurality of list elements  An edit was suggested to my sentence.     There was were an orange, some grapes, two apples and a small pile of cherries on the plate.   In my native language plurality of the verb always follows plurality of the first element on the list. There were an orange,... sounds awkward to me, no matter what follows up. My simple solution was reordering:     There were some grapes, an orange, two apples and a small pile of cherries on the plate.   But that's not the first time I faced this situation and I'd like to know what the rules of grammar say about that - was my editor overzealous or am I trying to copy rules of my language that don't apply in English?    Someone linked a  for negatives, where the situation is more clear-cut ("There is no..."). Same applies to connection with "or" apparently, per accepted answer there. Still, nothing for "and".  It seems there is a consensus that in that if the verb goes after the list, it will be plural.     an orange, some grapes, two apples and a small pile of cherries were on the plate.   There doesn't seem to be clear consensus for:     On the plate { was | were } an orange, some grapes, two apples and a small pile of cherries   Adding more to the confusion is the abbreviated form: "There's"     One last note. In North America, at least, there is a widespread use of using a singular form like "there is" and "there was", without regard for the subject item or items, and this "there is" is often shortened to "there's":           There's three apples on the table!      Could you please clarify this mess?


I have installed debian 8 jessie via usb stick on my thinkpad x250 (the laptop doesn't have any cd-dvd rom). Now when i want to use the synaptic or install some programms (especifically pure data) via: sudo apt-get install puredata i get this in terminal:  Media change: please insert the disc labeled  'Debian GNU/Linux 8.4.0 Jessie - Official i386 DVD Binary-1 20160402-13:26' in the drive '/media/cdrom/' and press enter  Why this happens and how am i supposed to insert a dvd when i haven't any dvd-rom? How can i fix this?

I installed Debian 7 using a DVD version, so every time I'm trying to install something using apt-get, the system ask me to mount the DVD. Is there a way to avoid that (inserting every time the dvd).


When I close a window in Outlook, I want the program to minimize to the taskbar so I can continue receiving email notifications as I work.  I know it's possible to have Outlook , but programs like Skype, Steam, and Discord have gotten me used to programs continuing to run in the background when closed.  How can I make Outlook close to to the taskbar, so it can continue running in the background?

When clicking the X button or ALT+F4, how can I get Outlook to minimze to the tray instead of close?  Several programs have this behavior, and it's annoying that Outlook behaves different...


In my database there is a table with values below  image attached  In need a qry to get the result like this

Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?


I have two problems. The first one is i cant enable my wireless broadcom driver. For that i need an internet connection. I tried plugging in the cable but it just shows like its connecting to wifi. My network interface is eno1. Im dual booting windows 10 and ubuntu 16.04. Btw it recognizes the device.  EDIT: shameless bump

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


I bought HP Laser MFP 135a black and white scanner/printer. I am new in Ubuntu and I use Ubuntu 18.04 LTS. I tried to open localhost:631 by installing CUPS in Terminal as seeing in one youtube video but no suceed. I do not know much to do. I use printer/scanner via USB. Could someone be kind and help me to set to work both scanner and printer. :~$ lsusb -t  /: Bus 03.Port 1: Dev 1, Class=root_hub, Driver=xhci_hcd/4p, 5000M  /: Bus 02.Port 1: Dev 1, Class=root_hub, Driver=xhci_hcd/11p, 480M  |__ Port 1: Dev 4, If 0, Class=Vendor Specific Class, Driver=, 480M |__ Port 1: Dev 4, If 1, Class=Printer, Driver=usblp, 480M  |__ Port 1: Dev 4, If 2, Class=Vendor Specific Class, Driver=, 480M  /: Bus 01.Port 1: Dev 1, Class=root_hub, Driver=ehci-pci/3p, 480M  |__ Port 1: Dev 2, If 0, Class=Hub, Driver=hub/8p, 480M |__ Port 3: Dev 3, If 1, Class=Wireless, Driver=btusb, 12M  |__ Port 3: Dev 3, If 0, Class=Wireless, Driver=btusb, 12M  |__ Port 6: Dev 4, If 1, Class=Video, Driver=uvcvideo, 480M  |__ Port 6: Dev 4, If 0, Class=Video, Driver=uvcvideo, 480M  |__ Port 7: Dev 5, If 0, Class=Application Specific Interface, Driver=, 12M  |__ Port 7: Dev 5, If 1, Class=Chip/SmartCard, Driver=, 12M  |__ Port 7: Dev 5, If 2, Class=Chip/SmartCard, Driver=, 12M  |__ Port 7: Dev 5, If 3, Class=Application Specific Interface, Driver=, 12M

Let's assume that one has some HP printer and/or scanner and checked its support status on the corresponding page of HPLIP site - .  So one have the following information: the device Model name, Min. HPLIP Version and Driver Plug-in need.   What should one install to make Ubuntu fully support the HP printer and/or scanner?


When trying to browse  I receive an error that the certificate is not valid. The reason is that *.stackoverflow.com comes with a certificate for *.stackexchange.com at the moment.    More details:   SHA-1 fingerprint of the cert:      DD:BE:B5:C8:5C:F8:40:66:23:AE:1D:93:6B:FE:91:7D:B6:59:CA:54   Issued by: DigiCert High Assurance CA-3

Is it safe to use passwords on Stack Exchange sites following the announcement of ?  Currently,  does not list the sites being fixed.


I have Ubuntu 14.04 server installed in my office. We're treating it as a local server. I have downloaded all our stuff from our dedicated hosting server (as server have viruses) to my local Ubuntu server.   So, as all the files are infected do i use any antivirus to clean all the files ??  Means how can i get rid of the viruses ?? If yes please suggest me some free antivirus for the same..  Thanks

What antivirus programs are available for Ubuntu?  We previously used Symantec Endpoint Protection but it does not work in Ubuntu.


I'm trying to write a regex to validate below conditions in a password string   Atleast one number and a letter Should not contain any special characters   Tried this regex  [a-zA-Z]+[0-9]+[a-zA-Z0-9]*|[0-9]+[a-zA-Z][a-zA-Z0-9]*   But it allows special characters.  Any help would be appreciated!  Example   aaaa - Not accepted  11111 - Not accepted aaaa1 - Accepted aaaa1* - Not accepted

I know it's possible to match a word and then reverse the matches using other tools (e.g. grep -v). However, is it possible to match lines that do not contain a specific word, e.g. hede, using a regular expression?   Input:  hoho hihi haha hede   Code:  grep "<Regex for 'doesn't contain hede'>" input   Desired output:  hoho hihi haha


I feel like there is a lot of excitement involving the initial steps towards developing games.  Kids (myself younger self included) get very excited about making games and talk for hours about the games in their imaginations.  Then comes the initial game making experience.  A lot can happen there.  It feels like a no-man's land where many enthusiasts fall away.  It seems to me that there are a lot of good, talented people out there who end up stuck in the mud.  Is that just the nature of competition and a necessary hurtle to greatness or should something be done to avoid it?  I feel that experienced game designers with a history of success could offer a lot of help, but then again, sometimes people are punished for our kindness.  However, I feel that having the right mentality would both help a person get through the hard times and make it easer to approach professionals.  Could I get some tips on crafting a positive and effective mentality regarding these issues during the early staged of a game design career?

How can I successfully finish a hobby game project in my free time?  How do I motivate myself to keep it up and drive right through to the finish without losing interest or motivation along the way?


What's nobody phrase in Terminal (and iTerm)?   It sometimes changes to my Mac name. But why is it nobody and how to prevent it?

When I open my terminal it shows this:  wpa-2-602:~ david$   I just curious what the wpa-2-602 means? "david" is my user name, and sometimes it was something else. What makes it change?


Because Ebola takes over the immune system and uses it to replicate more and more of the virus, how does the body survive?   Is it a case of the virus being self-limiting and eventually just getting 'too big for its britches' so to speak? Or does the body somehow eventually start producing antibodies to fight it off?

How does the ebola virus attack and how do some people get away with it? Normally any virus would attack a cell with some kind of receptors and some kind of lock and key mechanism entering the cell and then multiplying.  What happens to the virus if a person manages to live through it, does the virus die and is thrown out or still remains inside the host?  I am not sure about a normal virus attack i tried to explain please correct on that also.


I have a set with $N$ members $\{1,2, \dots, N\}$. I would like to know number of set partitions in which each subset is either of size $1$ or $2$, i.e., cardinality of each subset in the partition is maximum $2$. For example with $N=3$, we have the set partitions of maximum size $2$ are $\{1,2,3\}, \{(1,2),3)\}, \{1,(2,3)\}, \{(1,3),2\}$. However I am not interested in $\{(1,2,3)\}$ since it is of length $3$. Kindly tell me number of such set partitions for a set with $N$ members.

let $n \gt 1$ be an integer, and consider n people; $P_1,P_2,...,P_n$ let $A_n$ be the number of ways these $n$ people can be divided into groups, such that each group have either one or two people  determine $A_1,A_2,A_3$ So I have  $A_1=1$ way   $A_2=2$ way   $A_3=4$ way  and from this I derive the formula $A_n = 2^{n-1}$ but this is not true for $n\ge 4$  so I have to prove that for each integer $n\ge 3$  $$A_n = A_{n-1} + (n-1) * A_{n-2}$$  So I proved this by Induction:  Where I assumed that $n \ge 2$ so $A_{n+1} = 2^n$  So I did the induction step.. and I was wrong  I was hoping anyone on here could help me by proving this with induction?  Thanks


I have a textbox in a form field that gets populated by the user.  However currently (in Firefox 10) the user can navigate away from the page, then come back, and the input will be populated with its previous value.  I think this creates for a confusing user experience, and would like to prevent it.  Is there a way to do this without manually resetting the value?  I have tried changing the response to not cache as well as setting autocomplete='false' with no luck.

How do you disable autocomplete in the major browsers for a specific input (or form field)?


I have the following piece of code :  str1 = "abcd" print(str1[1:9:3])   The answer I get is "b"  How is this being calculated. This means that in the string str1, print out the 3rd character from 1st position to 9th. Hence str1[1:9] will be "bcd". And the third character in this should throw me an error. But instead I am getting "b". How is this ?

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


Around 2000 or 2001 there was a cartoon I used to watch and I can't remember the name of. Here's what I remember:   The setting was post-apocalyptic but there was still high-technology, just a lot fewer people. The main character was a young man, typical "good guy looking for answers about the past", but at the point I stopped watching he was turning "evil" due to some sort of nanotech infection. He basically fell into a  river. I seem to recall a rivalry between the hero's father and some other guy, reminiscent of the rivalry between Superman's dad and General Zod. The nanotech in that cartoon wasn't identified as nanotech. It looked a lot like the Inque character from Batman Beyond.   The art style was rather minimalist, the character design was a bit "geometric", think "Clone Wars".  Finally, I used to watch this on French TV, which means it may actually have been produced before 2000.  Any idea what this might be?

I watched this cartoon in the '90s or early 2000s and believe that it is American. I remember that the story was about the world after an asteroid impact. An important detail is that uranium/plutonium somehow stops working, thus no nuclear power. Therefore, there was always a struggle for energy.  There was a kind of world government with strong governors (maybe on continental level). However, some evil warlord with its rebels (in red, maybe) ruled in a forbidden zone. The last thing I remember is that the protagonist (I forgot about him) discovered that another impact might occur soon.  Sorry for the few details but I looked in all blogs, wikis and IMDb lists and cannot find it.


How do I completely remove Ubuntu One (U1) from my computer running Ubuntu 12.04?

I've looked in the Software Center, and there is an entry under Accessories for Ubuntu One, but I'm not sure if that'll actually remove Ubuntu One. On Ubuntu One's website, it gives a bunch of terminal commands to remove it, so should I use those or use the entry in the Software Center?  The reason I'm trying to remove Ubuntu One is because its sync doesn't work with my comp for some reason. It keeps saying that its trying to sync files in the client window, then it stops with the red X next to it after a few seconds. If Ubuntu One is this useless, I see no use for having it on my computer.


Somehow I cannot access my windows folder. It worked fine for the last couple of months. This is the first time this happened.

Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux


Winzip claims that it can create a password protected zip on Windows 10, but the Winzip installer fails part way during the installation on Win10.    Is there an alternative to Winzip?

I normally use a tool like WinZip, 7Zip, or WinRAR to create zip files but I'm on a Windows 7 system that doesn't have these tools installed (and I can't install new apps).  Outside of 3rd party tools like the above, can I create (or modify) a zip file in Windows 7 and request that it be password protected? (the files would contain sensitive information that I plan to transmit to another PC)*  e.g. the process I'm familiar with on Windows is to select the files, right click and choose: "Send to..." > "Compressed (zipped) folder" - but there doesn't seem to be any additional options.  * Note: I'm aware this isn't 100% secure, locked down mega encryption - just looking for "reasonable effort" to secure the data in transit.


I'm creating bash scripts to copy files search errors etc. from all our test servers.  I want to create an input file for these servers because they’re all test systems so they change hostname and IP from time to time.   Currently, I have to change all scripts if a server is changed.   I want one input file so I only have to change it there.  So I only have to change the input file.  My input file I have created looks like this:  #!/bin/bash SERVER1=$(echo "node1.example.com") SERVER2=$(echo "node2.example.com") etc.   I have tried   export file="path/to/input/file"   and also   read file="path/to/input/file"   but it doesn't work.  Now I want to read the values $SERVER1, $SERVER2, etc. into my other scripts.  How can I do that?

I want to insert in my script a value (string) that I would read from a text file.  For example, instead of:  echo "Enter your name" read name   I want to read a string from another text file so the interpreter should read the string from the file and not the user input.


According to The Hitchhiker's Guide to the Galaxy, 42 is the .   Is it ever explained, in canon1, why the answer to the meaning of life is 42?  1 - Book, Film, TV series or Radio series.

Star Trek often refers to 47 and Star Trek made a sport out of finding real or imagined references to 47. Why did Douglas Adams pick 42 as the ultimate answer in the Hitchhikers guide to the galaxy?


I have output like so v12:     "owner" : "cs1372", v12:     "num-of-connections" : 1, v12:     "owner" : "cq5838", v5:     "owner" : "bb9886", v5:     "owner" : "aq0903", v5:     "owner" : "bj2468", v5:     "owner" : "di3080", v5:     "num-of-connections" : 1,  I need to return the line above the num-of-connections line. So what I want in this output is v12:     "owner" : "cs1372", v5:     "owner" : "di3080",  Is there an easy way to do this with sed or awk?

I need to find a string and need to print the line above it.   case1: The same line won't have the more than one matching pattern   ie)  consider a file containing  $cat > para returns between the paragaraphs italic or bold     quotes by placing italic   Here i need to find for italic, and i need to get the output as below   returns between the paragaraphs quotes by placing   How can i get the output like this?


I want to reformat an external harddisk    For some reasons there is no option of APFS. How can I enbale APFS for an external harddisk?  Here is the detail of the external harddisk  My Passport 0837:    Product ID:   0x0837   Vendor ID:    0x1058  (Western Digital Technologies, Inc.)   Version:  10.72   Serial Number:    57999999414199999365659999   Speed:    Up to 5 Gb/sec   Manufacturer: Western Digital   Location ID:  0x01100000 / 1   Current Available (mA):   900   Current Required (mA):    896   Extra Operating Current (mA): 0   Media: My Passport 0837:   Capacity: 1 TB (1,000,170,586,112 bytes)   Removable Media:  No   BSD Name: disk4   Logical Unit: 0   Partition Map Type:   MBR (Master Boot Record)   USB Interface:    0   Volumes: Photo Backup 1 bad:   Capacity: 1 TB (1,000,169,537,536 bytes)   Available:    912.63 GB (912,629,383,168 bytes)   Writable: Yes   File System:  Case-Sensitive Journaled HFS+   BSD Name: disk4s1   Mount Point:  /Volumes/Photo Backup 1 bad   Content:  Apple_HFS   Volume UUID:  2254E6C8-8BB6-38B0-9153-D99C10A7B874

When I use  app in  to format an external drive, I do not see the new  offered as a choice of format.  Does it matter that my external drive is a  Portable External Hard Drive plugged into a  via USB-3 cable? I know APFS is optimized for solid-state storage, so does Disk Utility not offer it for a spinning-metal disk drive?  ➥ Why is APFS not offered by Disk Utility?


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

Doing a little reading over the break (The Probabilistic Method by Alon and Spencer); can't come up with the solution for this seemingly simple (and perhaps even a little surprising?) result:     (A-S 1.6.3) Prove that for every two independent identically distributed real random variables $X$ and $Y$,   $$Pr[|X-Y| \leq 2] \leq 3 Pr[|X-Y| \leq 1].$$


(Sir Edward) Coke further noted that   legal disputes about such matters as inheritance of goods:           are not to be decided by natural reason but by the artificial reason and judgment     of law, which law is an art which requires long study and experience, before that     a man can attain to the cognisance of it: that the law was the golden metwand     and measure to try the causes of the subjects; and which protected his majesty in     safety and peace. . . .      I know that this was written in 1607, but:    How would you determine the purpose of which? It doesn't sound like the modern relative pronoun; "which is an art which" sounds curious. This refers to .  I think that is optional, but is it truly? Why or why not?   This doesn't duplicate; the linked question doesn't answer question 2.   Source: P13, How the Law Works, Gary Slapper

Here's a standard English sentence:     The folder which is missing from the principal's office contained the answers to today's exam.   (Separate question, discussed elsewhere I'm sure, whether it should really be "which" or "that".)  But simpler is usually better, so I would actually just write:     The folder missing from the principal's office ...   But my question is: I have seen legal statements which would write:     The folder, which folder is missing from the principal's office, contained ...   Assuming that the writer is actually correct in thinking that s/he's adding some value by repeating "folder" after the "which", what value is s/he adding?


Which pronoun is correct to use in this sentence and why?  (1)Are you sure the guys are okay with me coming?  (2)Are you sure the guys are okay with my coming?

I assume that the following sentences are grammatically correct:   He resents your being more popular than he is. Most of the members paid their dues without my asking them. They objected to the youngest girl's being given the command position. What do you think about his buying such an expensive car? We were all sorry about Jane's losing her parents like that.   I'm still getting used to this possessive gerund structure. It sounded so weird to me at first. Is the structure used in both formal and informal contexts? Are there any alternative structures that result in the same meaning and are more frequently used? (Examples taken from )


Is it possible to automatically check if a user also posts the same question on one of the other stackexchange sites? If so, can you provide a link to the other question?  For instance,       It is a small step for developpers, but a huge step for people spending time helping others (whilst the question is in fact already solved elsewhere).  Is it also possible to throw fire at cross-posters?

How difficult would it be to detect cross-posts when the relevant questions have identical titles and content, and are posted by the same user? As an example:        If this is technically possible,  I'm not sure what the best response would be?   Notify the user when asking the question that . For off-topic cross-posts (e.g. the above example): Let the question be closed as off-topic, and then automatically block or flag the question as an exact duplicate during migration. For on-topic cross posts (eg a game programming question on SO and gamedev): Not sure what the process is for flagging/closing cross-posts, but whatever it is, can we automate some aspect of that? Something else?   (Edited to remove request for auto-detecting same-site re-posting, which has already been implemented since the example I listed occurred)


How can I printing a document on a specific printer from a Windows-Service without the need of any user-interaction?  A string, or a text-file. Maybe Crystalreport?  Thanks.

I am working on a project right now that involves receiving a message from another application, formatting the contents of that message, and sending it to a printer.  The technology of choice is C# windows service.  The output could be called a report, I suppose, but a reporting engine is not necessary.  A simple templating engine, like StringTemplate, or even XSLT outputting HTML would be fine.  The problem I'm having is finding a free way to print this kind of output from a service.  Since it seems that it will work, I'm working on a prototype using Microsoft's RDLC, populating a local report and then rendering it as an image to a memory stream, which I will then print.  Issues with that are:   Multi-page printing will be a big headache. Still have to use PrintDocument to print the memory stream, which is unsupported in a Windows Service (though it may work - haven't gotten that far with the prototype yet) If the data coming across changes, I have to change the dataset and the class that the data is being deserialized into.  bad bad bad.   Has anyone had to do anything remotely like this?  Any advice?  I already posted a question about printing HTML without user input, and after wasting about 3 days on that, I have come to the conclusion that it cannot be done, at least not with any freely available tool.  All help is appreciated.  EDIT: We are on version 2.0 of the .NET framework.


I would like to recollect some questions. Some time after I find them, I have to refer them. When my first search used some keyword, which is not in my mind after some time. So I would like to keep those links in my profile and refer them later. Is there any way to bookmark such things in Stack Overflow itself, like Browser BookMarks?

What does bookmarking a question mean? How do you bookmark a question? Do users get updates on their bookmarked questions? Are my bookmarks publicly visible? How do you see your own bookmarks? How do you see other users' bookmarks? How do you see which users have bookmarked a particular question? What impact does the bookmark system have on the voting system? Can I "un-bookmark" a question? Can I search within my bookmarks?


BMX frame has two holes on front tube for forks.

We often get questions on bicycles.stackexchange about identifying a bicycles manufacturer, model, make, and year.  Often these questions are downvoted or closed -- usually with a comment attached to them that it's not necessary to know the exact model/make/year of a bicycle if you want to fix, repair, or ride your bike. Why should owners not care about the model/make/year of their bicycle? Especially when it comes to less expensive bikes (aka BSOs) and BMX bicycles? This is intended as a canonical question that we can point closed questions to. Also see      (generally not helpful for identifying a brand/model)


Can anyone give me good hand book links of ubuntu?

What is a up-to-date good book that talks about general usage of Ubuntu or Linux in general (but that applies to Ubuntu as well) ? Things like:   what are the common commands (man, ls, etc.) basics of bash (including redirection, piping etc.) where files are generally installed (eg. what is difference between /usr/lib and /usr/local/lib; when we to make for a lib like libpng, where does it get installed)   I suppose I want to find some book that is a good starting point for understanding the Linux system/environment.


In a campaign amongst my friends and myself, I am playing a divination wizard who enjoys utilizing suggestion in social activities from time-to-time. In this particular scenario, my party and I were in a were in a church speaking to a Cardinal in his office. A monk friend of mine decided to say some heretical words which prompted the Cardinal to yell "Guards!" thus beginning a train of 15 guards rushing into the room. In this time, I wanted to cast suggestion as a means of evading subsequent conflict. Whether or not my suggestion would have been seen as reasonable is not a part of this question, but instead I am interested in the manner in which the guards would have viewed this spell cast. Suggestion, of course, is composed of a verbal component and a material component which is then followed by up to a two sentence suggestion. The immediate feedback from the DM upon attempting to use suggestion is that the cast would be obvious to the guards as spellcasting in itself is not a secret to bystanders thus no opportunity to roll out any plays. DM ruling accepted with some pushback, but we tabled this until after the session where we basically agreed that in situations such as a busy bar or a busy marketplace I could potentially get away with pulling off a suggestion without drawing too much attention to myself. Seems reasonable to me. Now my issue lies in how this was handled. If these guards are rushing in, certainly making some noise, they don't necessarily know I'm a wizard before hand, and I'm not facing these guards; should my verbal and material components use be painfully obvious to the guards or is this something that can be done with some subtlety given the situation?

In a recent game the verbal component of 'Suggestion' came up. I had assumed that the verbal component was just me saying the words and was added to mechanically stop me from casting it in magical silence. This came up because I tried casting it on a PC while a another party member was near-by.  My questions are:   Did my character actually perform a chant before giving the suggestion? Would the victim's character notice on a successful saving throw? Would a bystander notice that a spell was being cast?


It's very simple. I don't know how to interpret these symbols (highlighted in image below) in the context of this example. So, can someone tell me how to read them?

In some cases, we will have to consider the union or the intersection of several, even infinitely many sets, defined in the obvious way. For example, if for every positive integer $n$, we are given a set $S_n$, then   $$\bbox[border:1px solid red]{\bigcup_{n=1}^\infty S_n}=S_1\cup S_2\cup\cdots=\{x\mid x\in S_n\text{ for some }n\},$$   and   $$\bigcap_{n=1}^\infty S_n=S_1\cap S_2\cap\cdots=\{x\mid x\in S_n\text{ for all }n\}.$$   Two sets are said to be disjoint if their intersection is empty. More generally, several sets are said to be disjoint if no two of them have a common element. A collection of sets is said to be a partition of a set $S$ if the sets in the collection are disjoint and their union is $S$.   Normally what I know is that you can make a union or an intersection between only two sets. In this expression, there is a big union of sets. I'm asking about the meaning of this expression – what does it mean? What does the infinity sign do at the top?  Things are even more complicated with De Morgan's laws, which use the same expression:     Two particularly useful properties are given by De Morgan's laws which state that   $$\left(\bigcup_nS_n\right)^c=\bigcap_nS_n^c,\quad\quad\quad\quad\left(\bigcap_nS_n\right)^c=\bigcup_nS_n^c.$$   Anyone who can explain to me the expression or De Morgan's laws would be much appreciated.


I have some long URLs which doesn't contain special "line break characters" like "-" or "/". How can I automatically break these URLs?  \documentclass{scrreprt}  \usepackage[ngerman]{babel}                     \usepackage[latin1]{inputenc}                 \usepackage[T1]{fontenc} \usepackage[backend=biber]{biblatex} \usepackage{url} \usepackage{dingbat}  % for \carriagereturn symbol \makeatletter \g@addto@macro{\UrlBreaks}{\UrlOrds} \g@addto@macro{\UrlBreaks}{% \do\/\do\d% } \makeatother  \begin{filecontents}{bachelorarbeit_lit.bib} @ONLINE{java96,     author = {{Joe Black}},     title = {Foobar 1.0},     year = {1996},     month = {1},     url = {http://www.aaa.bb.cccc.dh/uploads/dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd.pdf},     urldate = {2011-03-02},     sortname = {Sun},     keywords = {www} } \end{filecontents}  \bibliography{bachelorarbeit_lit}  \begin{document} Test \cite{java96} \printbibliography \end{document}   edit  I don't know why but it still doesn't work. Is there an option to automatically break long URLs. I don't care where the break is but it should be done automatically. Even if I manually specify the "breaking character" it doesn't work (as the example shows).

I have a problem with the line break of an URL. The URL can´t break correct and extends into the border. I´ve tried some things. Amongst others I loaded the package breakurl, but without any success. When I set the bibliography left-aligned there isn´t a problem. But I need it justified. Here is an example:  \documentclass[ a4paper,                          fontsize=11,                     BCOR=10mm, DIV=11 ]{scrreprt}  \usepackage[ngerman]{babel}                     \usepackage[latin1]{inputenc}                 \usepackage[T1]{fontenc} \usepackage{lmodern}                         \usepackage{microtype}     \usepackage[     style=numeric,      maxnames=1,     bibencoding=latin1,     backend=bibtex8,     defernumbers=true,     hyperref=true,     alldates=long ]{biblatex} \usepackage{hyperref} \usepackage[hyphenbreaks]{breakurl}  \begin{filecontents}{bachelorarbeit_lit.bib} @ONLINE{java96,     author = {{Sun Microsystems}},     title = {JavaSoft ships Java 1.0},     year = {1996},     month = {1},     url = {http://findarticles.com/p/articles/mi_m0EIN/is_1996_Jan_23/ai_17853565/?tag=content;col1},     urldate = {2011-03-02},     sortname = {Sun},     keywords = {www} }  @ONLINE{java02,     author = {{Computer Weekly}},     title = {Write once, run anywhere?},     year = {2002},     month = {5},     url = {http://www.computerweekly.com/Articles/2002/05/02/186793/Write-once-runanywhere1.htm},     urldate = {2011-03-02},     sortname = {Computer},     keywords = {www} } \end{filecontents}  \bibliography{bachelorarbeit_lit}  \begin{document} \chapter{Test} Test \cite{java02} Test \cite{java96}  %\raggedright \printbibliography \end{document}   Does anyone have an idea?


This is an example from a blog post by  that addresses IIFE's. The following block of code returns 4 repeated 'undefined' responses by design:  function printFruits(fruits){   for (var i = 0; i < fruits.length; i++) {    setTimeout( function(){       console.log( fruits[i] );     }, i * 1000 );   } }  printFruits(["Lemon", "Orange", "Mango", "Banana"]);   Avaylo then shows how to produce what (to me) would have been the expected output of the first code block (it outputs the values of the array):  function printFruits(fruits){   for (var i = 0; i < fruits.length; i++) {     (function(){       var current = i;                    // define new variable that will hold the current value of "i"       setTimeout( function(){         console.log( fruits[current] );   // this time the value of "current" will be different for each iteration       }, current * 1000 );     })();   } }  printFruits(["Lemon", "Orange", "Mango", "Banana"]);   I understand that the IIFE creates a new scope. What I don't understand is the reason why the first block of code doesn't produce the (again, to me) expected output of returning the values in the array. I've been staring at this for a few days now, thus I conclude that my javascript knowledge is missing something fundamental.  Thank you for any insight!

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


When exporting a print layout to image or PDF in QGIS 3.6, the default resolution is 300dpi. I'd like to change that default.  There's an analogue question here:   But that targets QGIS 2.12 and the answer does not apply to QGIS 3.6.  There is a variable for DPI which is set to 300 but I'm unable to change it:

I am using QGIS 2.12.    I would like to adjust the Print Composer's output resolution for "Export as Image" and "Export as PDF".    The default is 300 dpi, but I would like 600 or 1200.    Multiple websites say that it can be done, but they don't say how.


Please any help is very good. I was trying to start with the definition of expected value but I don't know how to finish.

The more detailed question.    I'm kinda having some trouble starting out with answering this question. My initial approach would be to $g(x)= x^2$ since that is a convex function and find the expected values of $(T-P)^2$ and $(S-P)^2$.  However I fear that that would be too specific since the question would like to prove for any convex function. Is there a way to prove this more generally?


Let $A$ be an $m \times n$ matrix. Show that, even though they may be of different sizes, both Gram matrices $K = A^TA$ and $L = AA^T$ have the same rank.   My attempt:  We have that $K$ and $L$ are Gram matrices so $K = A^TA = (A^TA)^T = AA^T = L$ and by definition we have that $\mathrm{rank}(A) = A^T$.

How can I prove $\operatorname{rank}A^TA=\operatorname{rank}A$ for any $A\in M_{m \times n}$?   This is an exercise in my textbook associated with orthogonal projections and Gram-Schmidt process, but I am unsure how they are relevant.


I want to run eclipse via terminal.  Eclipse is in this directory ~/eclipse/java-photon/eclipse/.  When I write in terminal cd ~/eclipse/java-photon/eclipse/ and then ./eclipse it works.   But how can I set the PATH in the .profile file to only type in eclipse and it runs the program?  I tried it like explained in :   I set export PATH=$PATH:~/eclipse/java-photon/eclipse/ at the end of the .profile file and saved it.   Now when I type eclipse in the terminal it says  command 'eclipse' not found.

I'd like to know if there is a way to run  program/shell script without typing full path:  /opt/idea/bin/idea.sh


i tried my setup box to play over laptop(lenovo G560) with HDMI port, but it did'nt work at all, please suggest is there any third party tool to use setup box(dish TV) with my laptop (lenovo G560). if anyone have solution please help us.

What would be a good solution for hooking up the satellite TV box (Dish network) in my room to be able to watch it on my PC and possibly record video from it?  Please share with me the best cards, cables, software, anything else needed to do this in the most efficient way?  I am looking at the WinTV-HVR from Hauppauge.  I am not sure, for performance, what would be the best to go with, PCI, PCI express, USB2.0?  Also on the Hauppauge website I saw this note: "WinTV-PVR products will not work in PC systems with 4GB or more of memory."  The new PC I am building will be 12-24gb of DDR3 RAM, does that mean their products will not work at all with my memory?  So confused now!


I have a function:  void func(string a = "hi", int b = 2, float c = 3f) {   // return whatever }   Say in a case I want to use the function but I only know b's value in this case, can I still use this func? How? The following code would compare my input with a which causes error:  func(4);   Is there a way to pass in value to a particular argument(the 2nd one) and still use default values for the one on the left?

Note: This question was asked at a time when C# did not yet support optional parameters (i.e. before C# 4).  We're building a web API that's programmatically generated from a C# class. The class has method GetFooBar(int a, int b) and the API has a method GetFooBar taking query params like &a=foo &b=bar.   The classes needs to support optional parameters, which isn't supported in C# the language. What's the best approach?


I am trying to install ubuntu on my pc but i can't.I can't find what problems are. Booting from dvd and getting to the purple screen and after that installing ubuntu,but it goes to black screen with a cursor blinking and nothing happens. My PC Spec: Mainboard:Foxconn H61AP-S cpu:Intel Celeron G460 ram:Kingmax 4 GBs DDR3 VGA:Nvidia Geforce 210 HDD:1TB Toshiba i have winodws 7 64bit installed on my pc.by the way, i tried many ways.nomodeset, noalpic, acpi=off and others.and also tried installing from USB, But outcome was the same.

I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:


Let $X$ be a connected topological space and a homeomorphism $h:X \to X$ exists such that $h(h(x))=x$ for all $x \in X$. Prove that for every continuous function $f: X \to \mathbb{R}$ there exists $x \in X$ such that $f(x)=f(h(x))$. I can jot down just these information from this problem- $1.$ $f(X)$ and $h(X)$ is connected. $2.$ $f(x)=f(h(h(x)))$ for all $x$. Please help me with this problem.

This is a homework problem in an undergraduate topology class that I am ludicrously (and probably stupidly) stuck on. Any guidance would be appreciated:  Let X be a connected space, $f:X\to X$ a continuous involution (i.e. f is its own inverse), $g:X\to\mathbb{R}$ continuous. Prove that $\exists$ $x\in X$ such that $g(x)=g(f(x))$.  Here are the things I understand:  Some examples of $f$ include the identity map, $f(x)=-x$, $f(x)=\frac{1}{x}$ if $x\neq0$, etc. The result clearly holds if $f$ has a fixed point. I know any continuous involution in $\mathbb{R}^2$ has a fixed point, but we are on an arbitrary connected space, and I have no results I can use for such a thing. I can define a new continuous function $h:X\to\mathbb{R}$ so that $h(x)=g(f(x))-g(x)$. If this function has a zero, the result follows, but I don't know how to show it does. I could apply the intermediate value theorem since X is connected and $g:X\to\mathbb{R}$, but I again don't see how this would be helpful.  Thanks very much in advance!


Isn't it just the assumptions of autocorrelation, unbiasedness and homoscedasicty that are relevant to proving the efficiency and the unbiasedness of OLS estimators?  How does the normality in the distribution of the residuals play in here?

In linear regression, each predicted value is assumed to have been picked from a normal distribution of possible values. See below.  But why is each predicted value assumed to have come from a normal distribution? How does linear regression use this assumption? What if possible values are not normally distributed?


Which one is correct or more accurate? "A lively child" or a "child who is alive"?  When you want to say a person is not dead and he is normally living in his country, for instance, what do you say? What is the difference between "live" and "living"?   I know this is a broad question, but they are similar terms and I really am confused between them all.

Although she forgot to water it for a week, the plant was still alive/live.   Which one is right?  My professor has just told me that you must use ALIVE. But I don't know why yet.


I used to be an amateur options trader and lost several thousand dollars over the past 2 years. I understand how the wash rule works but here is my question. Let's say I lost 150,000 dollars over the past 2 years. I know you can deduct 3000 a year for losses in the market. My question is this If I gain 150,000 dollars this year as capital gains on short term trading, will I owe any taxes ?

Let's use this example for US taxes: let's say someone losses $50,000 in the stock market one year, then makes $50,000 the next year. Do they pay $0 in taxes for the latter year?  I see that you can deduct $3,000 per year from losses with a schedule D. But, I heard somewhere that you don't pay taxes on any stock profits until you break even on losses from previous years. Is this true?


I have been using python for more than a year now but I am confused by something in this example:  def mul(x,y): return x*y  def setArg(f,a):     def fx(*x):         return f(*x,a)     return fx  def test1():     mul3=setArg(mul,3)  def test2():     mul=4  def test3():     mul=setArg(mul,3)  def test4():     mu=setArg(mul,3)     mul=mu   running test1 and test2 works fine,but running test3 and test4 give this error: UnboundLocalError: local variable 'mul' referenced before assignment  Can I only redefine mul inside a testX globally? Why is so in python? using python3.7

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


I upgraded to 18.04 after 16.04 had no way to make the touchpad work.   The only issue with 18.04 is that when I close the lid (with or without external monitor) the laptop does not suspend.  How can I patch this? I read some instructions for 16.04 - 17.10 that point to edit /etc/systemd/logind.conf and change the file to this:  #  This file is part of systemd. # #  systemd is free software; you can redistribute it and/or modify it #  under the terms of the GNU Lesser General Public License as published by #  the Free Software Foundation; either version 2.1 of the License, or #  (at your option) any later version. # # Entries in this file show the compile time defaults. # You can change settings by editing this file. # Defaults can be restored by simply deleting this file. # # See logind.conf(5) for details.  [Login] #NAutoVTs=6 #ReserveVT=6 #KillUserProcesses=no #KillOnlyUsers= #KillExcludeUsers=root #InhibitDelayMaxSec=5 HandlePowerKey=suspend HandleSuspendKey=suspend HandleHibernateKey=suspend HandleLidSwitch=suspend HandleLidSwitchDocked=suspend #PowerKeyIgnoreInhibited=no #SuspendKeyIgnoreInhibited=no #HibernateKeyIgnoreInhibited=no #LidSwitchIgnoreInhibited=yes #HoldoffTimeoutSec=30s #IdleAction=ignore #  This file is part of systemd. # #  systemd is free software; you can redistribute it and/or modify it #  under the terms of the GNU Lesser General Public License as published by #  the Free Software Foundation; either version 2.1 of the License, or #  (at your option) any later version. # # Entries in this file show the compile time defaults. # You can change settings by editing this file. # Defaults can be restored by simply deleting this file. # # See logind.conf(5) for details.  [Login] #NAutoVTs=6 #ReserveVT=6 #KillUserProcesses=no #KillOnlyUsers= #KillExcludeUsers=root #InhibitDelayMaxSec=5 HandlePowerKey=suspend HandleSuspendKey=suspend HandleHibernateKey=suspend HandleLidSwitch=suspend HandleLidSwitchDocked=suspend #PowerKeyIgnoreInhibited=no #SuspendKeyIgnoreInhibited=no #HibernateKeyIgnoreInhibited=no #LidSwitchIgnoreInhibited=yes #HoldoffTimeoutSec=30s #IdleAction=ignore #IdleAction=ignore #IdleActionSec=30min #RuntimeDirectorySize=10% #RemoveIPC=yes #InhibitorsMax=8192 #SessionsMax=8192 #UserTasksMax=33%

This was working perfectly on 17.10 but after upgrading to 18.04 yesterday, when the lid is closed the screen turns off but doesn't suspend properly.  I travel around a lot and immediately noticed the heat (and battery draining) when taking it out of the travel case.  I've tried uncommenting these lines in /etc/systemd/logind.conf  HandleLidSwitch=suspend HandleLidSwitchDocked=suspend   and restarted but didn't make any difference.


I'm trying to create a restful API using mod_rewrite.   I have the rule:   RewriteRule v2/(.*)$ v1/index.php?request=$1 [QSA,NC,L]   However the path could contain base64 encoded strings (i.e. can have + or /) and they are being decoded before it gets to PHP.  For example, if I go to   /v2/cards/9VwQLli%2Bf0ogFl19AVRFLuztbp8cP0rYCgXBu3H9%2BDc%3DBe   PHP gets $_REQUEST['request'] as cards/9VwQLli f0ogFl19AVRFLuztbp8cP0rYCgXBu3H9 Dc=Be'.  And to make things worse, if I add a slash in there (e.g. 9VwQLli%2Bf0ogFl19AVRFLuztbp8c%2FP0rYCgXBu3H9%2BDc%3DBe - the %2F is the slash) I get a 404.  How can I prevent this from happening?   Note: I tried the B and NE flags but they didn't have any effect. I suppose as a hack I could just convert all + characters to _ and all / to -, or maybe even double url encoding it, but I was wondering if there was a better way.

This is a  about Apache's mod_rewrite.   Changing a request URL or redirecting users to a different URL than the one they originally requested is done using mod_rewrite. This includes such things as:   Changing HTTP to HTTPS (or the other way around) Changing a request to a page which no longer exist to a new replacement. Modifying a URL format (such as ?id=3433 to /id/3433 ) Presenting a different page based on the browser, based on the referrer, based on anything possible under the moon and sun. Anything you want to mess around with URL   Everything You Ever Wanted to Know about Mod_Rewrite Rules but Were Afraid to Ask!  How can I become an expert at writing mod_rewrite rules?   What is the fundamental format and structure of mod_rewrite rules? What form/flavor of regular expressions do I need to have a solid grasp of? What are the most common mistakes/pitfalls when writing rewrite rules? What is a good method for testing and verifying mod_rewrite rules? Are there SEO or performance implications of mod_rewrite rules I should be aware of? Are there common situations where mod_rewrite might seem like the right tool for the job but isn't? What are some common examples?   A place to test your rules  The  web site is a great place to play around with your rules and test them. It even shows the debug output so you can see what matched and what did not.


If A is a $m$ $x$ $n$ matrix such that: $Ax = 0$, for every $x \in \mathbb{R}^n$, then A = 0 is the zero matrix.   I have no idea how to begin proving this. The only hint is to consider a $j$ column in the Identity matrix $I_n$, but I don't see how that helps. Can anyone help me?

How can I quickly prove that if for every $x \in \mathbb{R}^N$ $$Ax=Bx$$ then $A=B$ ? Where $A,B\in \mathbb{R}^{N\times N}$. Normally I would multiply both sides by inverse of $x$, however vectors have no inverse, so I am not sure how to prove it.


I have dumped 2 tbsp of dried mint and 2 handfuls of crushed mint leaves into a reduced 28 oz tomato sauce but it only made a dent of mint taste in the sauce. I don't get it - a little dry or fresh basil or oregano is enough to give marinara a strong herb flavor. I dumped a LOT of both dry and fresh (it had strong smell) mint leaves into my marinara and it only gave a very weak mint flavor.  What am I missing here?

I want to create a tomato based mint sauce. I have access to fresh mint. What is the best way or the best time while cooking the sauce to incorporate the mint? Are the flavor components in mint water or fat soluble?


I'm pretty new to C++, so sorry if I asked something obvious.      srand(time(NULL));     int randomID = (rand() % 100);  string path = "./Questions/" + randomID + ".quiz";   In /Questions there are .quiz Files that are named as random integer numbers like "1.quiz", "202.quiz", "13.quiz"  It doesn't work when I put the randomID in, how can I solve this? The Error is in German so I don't think it will help you, it just says that ".quiz" is wrong.

I thought this would be really simple, but it's presenting some difficulties. If I have std::string name = "John"; int age = 21;  How do I combine them to get a single string "John21"?


I've created a table, within which I've used some absolute positioning to ensure that the cells are always square.  I'm running into an issue when I try to vertically center the text within these divs.  I can't find a good method to accomplish this, within the structure I'm working.  CODE    table.module-table {  width: 100%;  border-collapse: collapse;  border: none;  text-align: center; } table.module-table tr { vertical-align: middle; } td.module {  border: 1px solid rgba(255,255,255,0);  padding: 0;  width: 33.33%;  position: relative;  vertical-align: middle; } td.module:after {  content: '';  display: block;  margin-top: 100%; } td.module .module-number {  position: absolute;  top: 0;  bottom: 0;  left: 0;  right: 0;  background: #ccc;  transition: .5s all; } td.module a {  display: block;  color: #fff;  line-height: 1;  font-size: 55px;  font-weight: bold;  text-decoration: none;  white-space: nowrap; } td.module .module-number.one-one:hover { background: #e11b22; } td.module .module-number.one-two:hover { background: #c81b74; } td.module .module-number.one-three:hover { background: #800052; } td.module .module-number.one-four:hover { background: #46026b; } td.module .module-number.one-five:hover { background: #7f4e99; } td.module .module-number.one-six:hover { background: #2a2a86; } td.module .module-number.one-seven:hover { background: #105bac; } td.module .module-number.one-eight:hover { background: #00605d; } td.module .module-number.one-nine:hover { background: #809027; }

1.1

1.2

1.3

1.4

1.5

1.6

1.7

1.8

1.9

     Fiddle -

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

testing...


How can I construct subgroups of $G \times H$, where $G = H = (\mathbb{Z}, +)$?    I thought that the only subgroups of the integers where the integers times some constant, but then I don't know how to prove that, and even if I did I don't know if that applies to this situation.

Find all subgroups of $\mathbb{Z}\times\mathbb{Z}$.   I can find all the infinite subgroups of the form $n\mathbb{Z}\times m\mathbb{Z}$, where $n,m$ run over $\mathbb{Z}$. But I don't know how to write out all the finite subgroups in a uniform expression.  Any suggestions? Thanks in advance.


I'd like to find the SVD for the following matrix: $$\left(\begin{array}{cc} 5 & 5\\ -1 & 7 \end{array}\right)$$  I've calculated the eigenvalues and eigenvectors of $XX^{T}$ and the eigenvectors of $X^{T}X$, arriving at  $$X=\left(\begin{array}{cc} 5 & 5\\ -1 & 7 \end{array}\right)=U\Sigma V^{T}=\left(\begin{array}{cc} \frac{1}{\sqrt{2}} & \frac{1}{\sqrt{2}}\\ \frac{1}{\sqrt{2}} & -\frac{1}{\sqrt{2}} \end{array}\right)\left(\begin{array}{cc} \sqrt{80} & 0\\ 0 & \sqrt{20} \end{array}\right)\left(\begin{array}{cc} \frac{1}{\sqrt{10}} & -\frac{3}{\sqrt{10}}\\ \frac{3}{\sqrt{10}} & \frac{1}{\sqrt{10}} \end{array}\right)^{T}$$ This does not work. However if I multiply the second column of $U$ by -1: $$\left(\begin{array}{c} \frac{1}{\sqrt{2}}\\ -\frac{1}{\sqrt{2}} \end{array}\right)\mapsto\left(\begin{array}{c} -\frac{1}{\sqrt{2}}\\ \frac{1}{\sqrt{2}} \end{array}\right)$$  Everything works out.   The question is why? Both are normalized orthogonal eigencectors, shouldn't either one work? How do I choose?

I have a very trivial SVD Example, but I'm not sure what's going wrong.  The typical way to get an SVD for a matrix $A = UDV^T$ is to compute the eigenvectors of $A^TA$ and $AA^T$. The eigenvectors of $A^TA$ make up the columns of $U$ and the eigenvectors of $AA^T$ make up the column of $V$. From what I've read, the singular values in $D$ are square roots of eigenvalues from $AA^T$ or $A^TA$, and must be non-negative.  However, for the simple example $A = \left[\begin{matrix} 1 & 0 \\ 0 & -1 \end{matrix}\right]$, $A^TA$ and $AA^T$ are both the identity, and thus have eigenvectors $\bigg\lbrace \left[\begin{matrix} 1 \\ 0 \end{matrix}\right]\ ,\ \left[\begin{matrix} 0 \\ 1 \end{matrix}\right]\bigg\rbrace$. Clearly, the eigenvalues are 1 and 1, so our decomposition ought to be: \begin{align}  \left[\begin{matrix} 1 & 0 \\ 0 & -1 \end{matrix}\right] = \left[\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}\right]\left[\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}\right]\left[\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}\right] \end{align}  What has gone wrong?


My solution makes same loop, which eventually makes the equation as 0 = 0 form.

The question is to evaluate $\displaystyle7\int\frac{dx}{x^2+x\sqrt{x}}$.  My solution is attached.      The problem of my solution is if I use partial fraction, loop will be made, and this makes whole equation $0 = 0$. I want to know how to approach this question.


#include <stdio.h>      int main()     {         const char* s = "Number: 420604953084";         long number;         sscanf(s, "Number: %ld", &number);         printf("Result: %ld", number);          return 0;     }  This code, compiled on desktop with c++11 (or, for example ) returns correctly: Result: 420604953084  But compiled with ARM Mbed 6.6 the result is: (#include <mbed.h>) ... Result: -301941924  Does anyone have a clue? Unforunatelly, these things are not documented at all in Mbed.

I'm looking for detailed information regarding the size of basic C++ types. I know that it depends on the architecture (16 bits, 32 bits, 64 bits) and the compiler.  But are there any standards for C++?  I'm using Visual Studio 2008 on a 32-bit architecture. Here is what I get:  char  : 1 byte short : 2 bytes int   : 4 bytes long  : 4 bytes float : 4 bytes double: 8 bytes   I tried to find, without much success, reliable information stating the sizes of char, short, int, long, double, float (and other types I didn't think of) under different architectures and compilers.


Can you use a colon following a question mark? I am not sure about the colon and/or capitalization when adding the list of characteristics.     Which of the following characteristics do you automatically associate with women?: Decisive, pushy, assertive, competitive, collaborative.

How should sentences that end with both a colon and a question mark be formed? Two examples are below, both questions, but one in which the colon presents a piece of information and the other in which it begins a list.     Is this the one you meant?:          Do you have any of these symptoms?:     •  Headache     •  Nausea     •  Dizziness    Obviously a question-mark—colon combination is no good, and at best, looks odd. Putting the question mark after the item(s) is no good either. Do they have to be rewritten in a more pointed way such as below or is there another option?     Is the one in the following picture the one you meant?                   Do you have any of the symptoms below?        •  Headache     •  Nausea     •  Dizziness


I have seen proof of -: Sum of two rationals is rational and that implies that sum of all rational is always rational( by induction). Now my question is about Basel Problem-:. How can the sum of rationals be equal to an irrational number?

For example how come $\zeta(2)=\sum_{n=1}^{\infty}n^{-2}=\frac{\pi^2}{6}$. It seems counter intuitive that you can add numbers in $\mathbb{Q}$ and get an irrational number.


Travelling from US to India via Brussels with Jet Airways , do I need a transit visa?   I-94 Expired Visa Expired Valid H1-B pettion till 2017

I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland


A very long time ago I read a paperback at school, it was one of if not the first SciFi books I ever read. I would like to try and find a copy but being so long ago I have no recollection of the author or title.  As I recall the plot involved the following.  A couple of divers discover a sarcophagus hidden in an underwater grotto. It contains a woman in suspended animation. She is from a long lost city which may or may not have been Atlantis. (I can't remember.) They bring her sarcophagus on to their boat and revive her.  Later in the book they discover her city still intact deep underground. They also discover still living an enemy race of the woman's civilisation. The enemy may or may not have been humans, more likely not.  I think it ended with the enemy being defeated but at the cost of the buried city either also being presumed destroyed or lost by descending even deeper in to the Earth.

When I was a kid, I read a book (likely from the '60s) about a pair of kids who find an ancient lizard/fish man inside a cave. The cave has been recently exposed by an earthquake and the creature is inside a super technologically advanced stasis chamber. I think this creature's name is something like "Sslaa". He takes the kids on a quest to find his lost underwater city.  They end up finding the city, which is still populated by creatures like himself and protected from the ocean above by an immense diamond dome. Eventually, Sslaa has to drive an advanced mining vehicle deep into the crust of the earth, presumably to prevent his city's destruction by an impeding magma flow or other seismic event.  For extra obscurity bonus points, I could swear I managed to find this book on Google several years ago, and was shocked to learn that it had originally been written in German, and then translated to English.  Does anyone out there recognize this one?


I understand the sign of the eigen vectors / PCA rotations can be positive or negative (see  or ).   But I am curious why the following two approaches yield different results, from numerical method perspective?  > d = iris[,1:2] > pca = prcomp(d) > r = eigen(cov(d)) > r$vectors             [,1]        [,2] [1,] -0.99640834 -0.08467831 [2,]  0.08467831 -0.99640834 > pca$rotation                      PC1        PC2 Sepal.Length  0.99640834 0.08467831 Sepal.Width  -0.08467831 0.99640834

I'm learning PCA in R language. I met two problems right now that I don't understand.  I am performing a PCA analysis in R on a 318×17 dataset using some custom code.  I take eigen function in R  to find eigenvalues and eigenvectors.  But my 1st and 3rd eigenvectors are of the opposite sign to my handbook.  My second eigenvectors is almost the same.  I know that given a square matrix A, the condition that characterizes an eigenvalue, $\lambda$, is the existence of a nonzero vector $x$ such that $Ax=\lambda x$; this equation can be rewritten as follows: $(A - \lambda)x=0$. Now I calculate covariance of my data and have eigenvalues. I want to solve this linear combination equation to find $x$ and compare with initial eigenvectors. When I take solve function in R, my $x$ vector is always zero.   Here are my questions: Why the sign is different? How to use solve function in R  to find a non-zero vector $x$?


For any $n$, does there exist a group $G$ of order $n$ so that $G$ is not isomorphic to any subgroup of $S_j$ for $j<n$?

I'm considering finite groups only. Cayley's theorem says the a group $G$ is isomorphic to a subgroup of $S_{|G|}$. I think it's interesting to ask for smaller values of $n$ for which $G$ is a subgroup of $S_n$. Obviously, it's not always possible to do better than Cayley's theorem. But sometimes it is possible (for example, $\mathbb{Z}_6$ as a subgroup of $S_5$).  So I'm asking:        Given a finite group $G$, is there an algorithmic way to find or approximate the minimal $n$ for which $G$ is isomorphic to a subgroup of $S_n$?   If the answer to $(1)$ is not known, is it known for specific classes of groups?   In particular, for finite abelian groups, is it true that for a prime $p$, the minimal $n$ for $\mathbb{Z}_{p^{t_1}} \times \mathbb{Z}_{p^{t_2}}$ is $p^{t_1}+p^{t_2}$ (I can prove that is is true for different primes $p_1$ and $p_2$, but have problems when it's the same prime in both factors).      Thanks!


I want to use Python and Flask to serve static html pages which will read arguments from the URL parameters.  I don't know how much data will be passed in with the query strings, and I would like to know what kind of limits there are on Flask's handling of URL parameters? Can I have as many URL parameters as I want, and send as large strings as I want with them?  (The HTML will primarily be requested by a Chrome/Chromium browser)

What is the maximum length of a URL in different browsers? Does it differ among browsers? Is a maximum URL length part of the HTTP specification?


I want to created a chat app project with android studio and when I want to run my project my app crashed please help me?  My code is below:  private void readUser() {     final FirebaseUser firebaseUser = FirebaseAuth.getInstance().getCurrentUser();     DatabaseReference reference = FirebaseDatabase.getInstance().getReference("Users");      reference.addValueEventListener(new ValueEventListener()     {         @Override         public void onDataChange(@NonNull DataSnapshot dataSnapshot) {             if (search.getText().toString().equals("")) {                 mUsers.clear();                  for (DataSnapshot snapshot : dataSnapshot.getChildren()) {                     User user = snapshot.getValue(User.class);                      assert user != null;                     assert firebaseUser != null;                      if (!user.getId().equalsIgnoreCase(firebaseUser.getUid())) {                         mUsers.add(user);                     }                 }                 userAdapter = new UserAdapter(getContext(), mUsers, false);                 recyclerView.setAdapter(userAdapter);             }         }         @Override         public void onCancelled(@NonNull DatabaseError databaseError)         {         }     }); }   and this is my error:  java.lang.NullPointerException     at com.example.mahdi.chatapp.Fragments.UsersFragment$3.onDataChange(UsersFragment.java:132)   and error from this line:  if (!user.getId().equalsIgnoreCase(firebaseUser.getUid())) {

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?


In Supernatural, Castiel is tricked into giving up his Grace, the source of his Angelic powers, including his wings, and falls from heaven. In the process he loses those wings.   The same thing (or a very similar thing) happened to the Angel Anna earlier in the series, and though she goes for a while without wings, when she recovers her grace, she gets her wings back. But when Castiel gets his grace back, he doesn't reclaim his wings:    Why?

In Supernatural the "Book of the Damned" Castiel managed to      retrieve his grace, although we can see that his wings are broken.   However, Castiel lost his grace before Metatron expelled all of the angels from heaven, so when all of the angels had their wings irreparably damaged, Castiel was already human?      So what happened to make his wings like that? Or was it not necessarily the drop to Earth that damaged the angels, or the spell itself that Metatron cast? Or am I just wrong in assuming his wings looked broken?


heres a link https:  I followed this tutorial:  but when I got to set the parent for the rig it wouldn't work. I tried to remove some unnecessary verts but it affects the mesh... what do I do?

Here it goes again, the rigging error. I have a model that has a mirror modifier already applied and a subsurface and displace modifier (not applied) in my model. So when I try to parent my model to my armature it gets the bone heat error message, but before I applied the mirror modifier it worked, although the bones only work on the left side and the right side didn't work at all.   Solutions I have tried:   Remove doubles (doesn't work) Recalculate (doesn't work either) Remove all modifiers (no luck) Place the root bone at the center of the model (still get the error) Apply the subsurface modifier and parent them (no result) Apply the decimate planar modifier (this works, but the decimate modifier destroys my seam marked on my model, which causes my displace modifier to not function well because I baked my displace map with another model that has a multiresolution level of four).   blender file:   I have the unapplied mirror modifier model in layer 3 and applied mirror modifier model in layer 1.


Given is one single datapoint $\vec{x}$, which contains the same feature twice, hence $\vec{x} = (x,x)$ and a label y. We have to add the regularization term $\lambda*||\vec{\beta}||^2$, $\lambda > 0$ to the regular linear regression problem,  solve this problem, as well as explain what relationship the components of the solution $\vec{\beta^*}$ satisfy. I would use the following equation to solve the problem by hand: $(X^TX)*\vec{\beta} - \lambda*\vec{\beta}= X^Ty$, specifically for our problem:  $\begin{bmatrix} x^2 & x^2\\ x^2& x^2\end{bmatrix} *\begin{bmatrix}\beta_1 \\ \beta_2 \end{bmatrix}+\begin{bmatrix}\lambda\beta_1 \\ \lambda\beta_2 \end{bmatrix} = \begin{bmatrix}xy \\ xy \end{bmatrix} $   Is this correct so far? I know for ridge regression, the closed form solution always exist (the added regularization allows for invertibility), but I am not sure what I can conclude for the solution and the components in this particular case.

Given is a linear regression problem, where we have one training point, which is 1-dimensional: $x \in R_{>0}$ and the corresponding output, $y \in R$. We duplicate the feature, such that we have one training point with two (identical) features.   For this, we have to determine if we can apply the closed form solution $\beta = (X^TX)^-1*X^T*y$. Then we have to solve the linear regression problem by taking into account that $f(X) = ||y-X*\beta||^2$ is convex.   Application of the closed form solution: For this I want to determine if $X^TX$ has full rank. Given is $X = (1,x_{11},x_{12})$. Hence $X^T*X$ results in:  \begin{bmatrix}     1 & x_{11} & x_{12}  \\     x_{11} & x_{11}^2 & x_{11}x_{12}  \\     x_{12}  & x_{11}x_{12} & x_{12}^2   \end{bmatrix}   This matrix seems to have full rank (independent column vectors), so the closed form solution is applicable. Correct? Is there another way to determine the rank without explicitly calculating $X*X^T$?   For minimizing $f(\beta)$ I would derive $||y-X*\beta||^2$ and set it equal to zero.


Everytime I update new image like 'index.gif' to website without changing image's name, the user could not see the update until they fresh the browser by F5 to clean the image cache.  It is same as updating css, but I usually change css link version like:  <link href="index.css?ver=xxxxxx" rel="stylesheet" type="text/css" />   Because there is only one reference to this css, so I can change it easily. In contrast, there are so many refers to one image, so I'm frustrated for changing all the links to new image.  So is there any easy way to solve my problem?

I generate some images using a PHP lib.  Sometimes the browser does not load the new generated file.   How can I disable cache just for images created dynamically by me?  Note: I have to use same name for the created images over time.


Find a formula for: $$ \binom n0 + 2\binom n1 + 4\binom n2 + 8\binom n3 + \cdots + 2^{n-1}\binom n{n-1} + 2^n\binom nn $$ using a counting argument.  I just used the binomial t. to show it's $3^n$ but I can't find a combinatorial way. Any help?

Give a combinatorial proof of the following identity:  $$3^n=\sum_{i=0}^{n}\binom{n}{i}2^{n-i}$$  I can't see any counting argument that would yield $3^n$, and the right hand side is also pretty opaque. For some reason I really really suck at doing these proofs - I just started my first combinatorics course.


Suppose that $c_0, c_1, \cdots , c_n$ are real numbers and that $c_0 + \frac {c_1}{2} + \frac {c_2}{3} + \cdots + \frac {c_{n-1}}{n} + \frac {c_n}{n+1} = 0$. Prove that the equation: $c_0 + (c_1)x + \cdots + (c_{n-1})x^{n-1} + (c_n)x^n = 0$ has at least one real solution between 0 and 1.

Problem: If   $$C_0+\frac{C_1}{2}+\cdots + \frac{C_{n-1}}{n}+\frac{C_n}{n+1} =0,$$  where $C_0,...,C_n$ are real constants, prove that the equation  $$C_0+C_1x+\cdots +C_{n-1}x^{n-1}+C_nx^n=0$$  has at least one real root between $0$ and $1$.  Source: W. Rudin, Principles of Mathematical Analysis, Chapter 5, exercise 4.


I spent the last few hours evaluating this converge. I am pretty sure it converges. However, I am not able to prove it. Can you help me? I have already proven it absolutely diverges.  $$\sum_{n=1}^\infty \frac{(-1)^{\lfloor\sqrt{n}\rfloor}}{n}$$  I have tried to apply both the Abel and Dirichlet criteria. I got to the point, where I need to prove that $$\sum_{n=1}^\infty \frac{(-1)^{\lfloor\sqrt{n}\rfloor}}{\sqrt{n}}$$ is bounded, which is unresolvable for me as well.

Does $\sum\frac{(-1)^{\lfloor \sqrt n\rfloor}}{n}$ converge ?  I know there is a technical method that uses an adapted Abel's rule  $(*)$ ; I would like to know if you see another method (which is understable with basic knowledge) to prove it converges. Thank you.  Remark: Actually, it can be proved that for all $z \in \mathbb C$ such that $|z| = 1$, $\sum\frac{(-1)^{\lfloor \sqrt n\rfloor}}{ n}z^n$ converges.  $(*)$ Consider two series $\sum a_n$ and $\sum b_n$. Define $B_m = \sum_{n=0}^mb_n$   If the sequence $(a_n)$ tends to $0$ and the sequence $(B_n)$ is bonded, and if the series $\sum (a_{n+1} - a_n)$ converges absolutely, then $\sum a_nb_n$ converges.  You have to adapt this theorem to use it here.


My correct URL is http://mydomine.com/cars/register.php (without slash in the end).  But I send emails to our customers with wrong URL http://mydomine.com/cars/register.php/ (with slash in the end).  Customers cannot access the page correctly.  How to re direct them to the correct URL when they click on the wrong link?

The situation  Across the entire domain, we'd like the URLs to hide file extensions and remove trailing slashes, independent of the domain name itself (as in, works on any domain).  Sample of our directory structure  We're not using index.* files except for the homepage.   /  /index.php /account.php /account  /subscriptions.php  /login.php /login  /reset-password.php     The goal  Some examples of how these files might be requested, and how they should look in the browser:   / and index.php --> mydomain.com (literally just the bare domain name). /account.php or /account/ or /account --> mydomain.com/account /account/subscriptions.php or /account/subscriptions/ or /account/subscriptions --> mydomain.com/account/subscriptions   As you can see, there are several ways to access each webpage, but no matter which of the 2 or 3 ways you use to get there, it only shows the one preferred URL in the browser.  The question  How is this done with .htaccess using mod_rewrite?  I've banged my head against the wall trying to figure this out, but in general, the rewrite flow would seem to be something like this:   External 301 redirect ( mydomain.com/account/ --> mydomain.com/account ) Internally append .php ( mydomain.com/account --> mydomain.com/account.php )   I've been Googling this all day, read thousands of lines of documentation and config texts, and have tried several dozen times... I think more brains on this would help a lot.  UPDATE  We found an answer our question (see below).


Let $\tau_a = \inf\{t: W_t > a\}$, where $W_t$ is a Wiener Process. I am interested in expected value $\mathbb E \left[e^{-\lambda\tau_a}\right]$, where $\lambda \in \mathbb R$. I think that I should use the fact that $M_t = e^{\lambda W_t-\frac{\lambda^2}{2}t}$ is a martingale, but no I idea how to go from there. Thanks for any hints.

Let $B_t$ be the standard Brownian motion process, $a > 0$, and let $H_a = \inf \{ t : B_t > a \}$ be a stopping time. I want to show that the Laplace transform of $H_a$ is $$\mathbb{E}[\exp(-\lambda H_a)] = \exp (-\sqrt{2\lambda} H_a)$$ by considering the martingale $$M_t = \exp \left(\theta B_t -\frac{1}{2}\theta^2 t\right)$$  There's an obvious argument to follow here: assuming the optional stopping theorem applies, we have $$1 = \mathbb{E}[M_{H_a}] = \mathbb{E} \left[ \exp \left(\theta a - \frac{1}{2}\theta^2 H_a\right) \right] = \exp(\sqrt{2\lambda} a) \mathbb{E} \left[ \exp(-\lambda H_a) \right]$$ where $\theta = \sqrt{2\lambda}$. This is exactly what we wished to show. However, as far as I can tell, the hypotheses of the optional stopping theorem are not satisfied here. Here is the statement I have:     If $(X_n)$ is a martingale and $T$ is an a.s. bounded stopping time, then $\mathbb{E}[X_T] = \mathbb{E}[X_0]$.   I think not all is lost yet. $M_t > 0$ for all $t$, so the martingale convergence theorem applies, and $M_t \to M_\infty$ a.s. for some integrable random variable $M_\infty$. For each $t$, $H_a \wedge t = \min \{ H_a, t \}$ is a bounded stopping time, so certainly $\mathbb{E}[M_{H_a \wedge t}] = \mathbb{E}[M_0]$. But, $$\mathbb{E}[M_{H_a \wedge t}] = \mathbb{E}[M_{H_a} \mathbf{1}_{\{H_a \le t\}}] + \mathbb{E}[M_t \mathbf{1}_{\{H_a > t\}}]$$ and clearly what one wants to do is to take $t \to \infty$ on both sides. But here's where I get stuck: I'm sure I need a convergence theorem here in order to conclude that the equation remains valid in the limit.   Now, $0 < M_{H_a} = \exp \left(\theta a - \frac{1}{2} \theta^2 H_a \right) \le \exp(\theta a)$, so the dominated convergence theorem applies, and so $$\lim_{t \to \infty} \mathbb{E}[M_{H_a} \mathbf{1}_{\{H_a \le t\}}] = \mathbb{E}[M_{H_a} \mathbf{1}_{\{H_a < \infty\}}]$$ and I believe Fatou's lemma gives me that $$\liminf_{t \to \infty} \mathbb{E}[M_t \mathbf{1}_{\{H_a > t\}}] \ge \mathbb{E}[M_{\infty} \mathbf{1}_{\{H_a = \infty\}}]$$ but I think what I need is the equality $$\lim_{t \to \infty} \mathbb{E}[M_t \mathbf{1}_{\{H_a > t\}}] = \mathbb{E}[M_\infty \mathbf{1}_{\{H_a = \infty\}}]$$ and as far as I can tell neither the monotone convergence theorem nor the dominated convergence theorem applies here. Is there anything I can do to rescue this line of thought?


Is there any way to use Skype with video on Arch?  The AUR package doesn't install, and it seems that the web interface has no video.

I've looked everywhere and nothing has worked. I am just trying to install skype.  I tried to see if it was in the repositories but didn't find it. So I wen't to the skype website and found a linux version but didn't know how to install it after extracting the tar file.  I then tried to loook in the AUR and found skype. But when I tried to run makepkg I get a   ==> ERROR: PERMISSION was not found in the build directory and is not a URL.  I tried looking around for solutions but couldn't find anything. Every thread I found asks to cehck the /etc/pacman.conf file. Which I did and made sure I have the multilib included   /etc/pacman.conf  # # /etc/pacman.conf # # See the pacman.conf(5) manpage for option and repository directives  # # GENERAL OPTIONS # [options] # The following paths are commented out with their default values listed. # If you wish to use different paths, uncomment and update the paths. #RootDir     = / #DBPath      = /var/lib/pacman/ #CacheDir    = /var/cache/pacman/pkg/ #LogFile     = /var/log/pacman.log #GPGDir      = /etc/pacman.d/gnupg/ #HookDir     = /etc/pacman.d/hooks/ HoldPkg     = pacman glibc #XferCommand = /usr/bin/curl -C - -f %u > %o #XferCommand = /usr/bin/wget --passive-ftp -c -O %o %u #CleanMethod = KeepInstalled #UseDelta    = 0.7 Architecture = auto  # Pacman won't upgrade packages listed in IgnorePkg and members of IgnoreGroup #IgnorePkg   = #IgnoreGroup =  #NoUpgrade   = #NoExtract   =  # Misc options #UseSyslog #Color #TotalDownload CheckSpace #VerbosePkgLists  # By default, pacman accepts packages signed by keys that its local keyring # trusts (see pacman-key and its man page), as well as unsigned packages. SigLevel    = Required DatabaseOptional LocalFileSigLevel = Optional #RemoteFileSigLevel = Required  # NOTE: You must run `pacman-key --init` before first using pacman; the local # keyring can then be populated with the keys of all official Arch Linux # packagers with `pacman-key --populate archlinux`.  # # REPOSITORIES #   - can be defined here or included from another file #   - pacman will search repositories in the order defined here #   - local/custom mirrors can be added here or in separate files #   - repositories listed first will take precedence when packages #     have identical names, regardless of version number #   - URLs will have $repo replaced by the name of the current repo #   - URLs will have $arch replaced by the name of the architecture # # Repository entries are of the format: #       [repo-name] #       Server = ServerName #       Include = IncludePath # # The header [repo-name] is crucial - it must be present and # uncommented to enable the repo. #  # The testing repositories are disabled by default. To enable, uncomment the # repo name header and Include lines. You can add preferred servers immediately # after the header, and they will be used before the default mirrors.  #[testing] #Include = /etc/pacman.d/mirrorlist  [core] Include = /etc/pacman.d/mirrorlist  [extra] Include = /etc/pacman.d/mirrorlist  #[community-testing] #Include = /etc/pacman.d/mirrorlist  [community] Include = /etc/pacman.d/mirrorlist  # If you want to run 32 bit applications on your x86_64 system, # enable the multilib repositories as required here.  #[multilib-testing] #Include = /etc/pacman.d/mirrorlist  [multilib] Include = /etc/pacman.d/mirrorlist  # An example of a custom package repository.  See the pacman manpage for # tips on creating your own repositories. #[custom] #SigLevel = Optional TrustAll #Server = file:///home/custompkgs   I have look all over can't seem to find any solution.


I think it would be helpful if I could get a notification when a new question is posted for a tag that I have favorited, this could be an opt in option so people can choose to leave it off if they so wish.

Is there a way to get notified if a new question is posted in one of my Favorite tag other than me clicking on the tag or browsing through new questions all the times?  I have a favorite tag (Bloomberg) with low monthly number of questions in it (around 30-40).  And since I can be of great help in that area to other people, I would like to see if there a notification system in place (such as email).


There is this new UI design thing going on for a while, where the UI is made with wide variety of strong/retro colour palette, its a vector design ,and the whole design is "digital" and over simplified = no shadows, no details, pretty bold but very intelligent .  You can see it in many places and I am  trying to read more about this approach but I don't know its name ?  Examples :   google's general design approach,the simplicity and colours or these guys

I want to buy some stock photos like the ones below. What is this design called?  I don't even know how to start searching...


My hats aren't showing up in chat!      My self-image next to my chatbox has my full regalia, but the gravatar next to my posted messages has a measly two hats!  It's not a cache delay because it already put on my current hat.  It is using an outdated version of my gravatar and adding my current hat to that.  Do I have too much bling for chat?

Following scenario:   user registers, has 1 point user visits chat, notes he cannot post because of only 1 point and needs 20 user goes back to SO, answers a question. gets enough points to chat user goes back to chat, but his profile still shows 1 point   Now my questions:   How long does it take for the profile on chat to update? Is there a way to force updating?   Update: Logging in and out did not help.


I am trying to autorun a fairly simple HTML photo gallery from a pen drive to give to clients. Clearly I don't know what drive letter is going to be assigned to the drive in any particular pc.  How do I get a pen drive to autorun an index.htm file if I don't know the drive letter or will I need human intervention to get it to run?

I have created a file named autorun.inf to make one of my software setup run when the usb is plugged into Windows 8/8.1 OS .  This is my autorun.inf code:   [AutoRun] shellexecute="Mem.exe //It would be nice if i could add path to this like my Doc//mem.exe UseAutoPlay=1   Is there any software that let's us to create auto-run files for USB Sticks?  Is there any way to add new options in right click menu only on my USB window?


Application gets crashed after user taps on button multiple times  java.lang.NullPointerException             at fragment.FragmentHealthBelief.onSuccess(FragmentHealthBelief.java:117)             at datamodel.JsonParser$1.onResponse(JsonParser.java:97)             at datamodel.JsonParser$1.onResponse(JsonParser.java:92)             at com.android.volley.toolbox.StringRequest.deliverResponse(StringRequest.java:60)             at com.android.volley.toolbox.StringRequest.deliverResponse(StringRequest.java:30)             at com.android.volley.ExecutorDelivery$ResponseDeliveryRunnable.run(ExecutorDelivery.java:99)             at android.os.Handler.handleCallback(Handler.java:730)             at android.os.Handler.dispatchMessage(Handler.java:92)             at android.os.Looper.loop(Looper.java:137)             at android.app.ActivityThread.main(ActivityThread.java:5103)             at java.lang.reflect.Method.invokeNative(Native Method)             at java.lang.reflect.Method.invoke(Method.java:525)             at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:737)             at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:553)             at dalvik.system.NativeStart.main(Native Method)

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?


Say I'm in a hurry and I really need help to fix some code. I want to reach many people and get the best answer as soon as possible.  In this situation I would probably copy and paste the same question on a few good websites like Stack Overflow and .  Are there any consequences I might face for doing this, being reported for example, or is it perfectly acceptable and maybe pretty common?

It is possible to migrate a question from one Stack Exchange site to another by closing, but if I have a question that I think is on-topic for multiple Stack Exchange sites, is it OK to post it on both (multipost)?   For example, I have a question that's earned me the tumbleweed badge on SO and I'm not sure what the best thing to do with it is. It's about a web server so it might be answerable on Server Fault but it's really more of a programming thing, hence the posting the question on Stack Overflow.    Is there any way to make the question visible on multiple sites (crosspost) and then accept the answer wherever it came from?


Today I was reading about Google Interview math puzzles and I couldn't solve the following puzzle.  Imagine a town where there is a law:   If a couple have a girl born, then they can't have more children. If they have a boy born, then they can have more children. They keep having children until a girl is born.  Question is: What is the portion of girls to boys in town.  I'm trying to solve it using mathematics. Here is my approach but I'm not getting anywhere. I'm using probabilities to model this world.    Probability that a new couple has 1 boy is 1/2.  Probability that a new couple has 1 girl is 1/2.    Probability that a couple with 1 boy has 2 boys is 1/4.  Probability that a couple with 1 boy has 2 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 1 boy has 1 boy and 1 girl is 1/4.    Probability that a couple with 2 boys has 3 boys is 1/8.  Probability that a couple with 2 boys has 3 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 2 boys has 2 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 2 boys has 2 boys and 1 girl is 1/8.    Probability that a couple with 3 boys has 4 boys is 1/16.  Probability that a couple with 3 boys has 4 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 3 boys has 3 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 3 boys has 2 girls is 0. (You can only have 1 girl by law.)  Probability that a couple with 3 boys has 3 boys and 1 girl is 1/16.    At this moment I'm starting to see a pattern. If couple has a boy, then with equal probability they can have a girl as well.  So I sum all the probabilities of all couples in town (infinite number of couples), and I multiply probability by number of boys:  $Boys in Town = 1*1/2 + 2*1/4 + 3*1/8 + 4*1/16 + ...$  I get infinite series:  $ 1/2 + 1/2 + 3/8 + 4/16 + 5/32 + ...$  I sum it up and I get:  $ 1 + 3/8 + 4/16 + 5/32 + ...$  (I don't know how to sum this)  So there will be more than 1 boy for sure!  So I think in this town the ratio will be that there are more boys than girls.  In particula there wil be $ 3/8 + 4/16 + 5/32 + ...$ boys more than girls in town.  There will be 1 girl and 1 + $ 3/8 + 4/16 + 5/32 + ...$ boys.    Please let me know what you think of my analysis. Thanks!

Puzzle  In a country in which people only want boys, every family continues to have children until they have a boy. If they have a girl, they have another child. If they have a boy, they stop. What is the proportion of boys to girls in the country?  My solution (not finished)  If we assume that the probability of having a girl is 50%, the set of possible cases are:  Boy (50%)  Girl, Boy (25%)  Girl, Girl, Boy (12.5%)  ...  So, if we call G the number of girls that a family had and B the number of boys that a family had, we have:  $B = 1$  $P(G = x) = (1/2)^{x+1}*x$  So  $G = \Sigma (1/2)^{x+1}*x$  I feel like the sum of this infinite serie is 1 and that the proportion of girls/boys in this country will be 50%, but I don't know how to prove it!  Thanks!


Made bootable usb using rufus, new asus tuf a15 the bios is uefi without cms When selecting usb from boot menu theres a black screen for a second goes back to boot menu. How to boot into the usb.

This question is asked often in Ask Ubuntu, sometimes with few hints about the situation.   Please provide a list of possible reasons to help troubleshoot the problem.


When I go through official documentation (which isn't so great) I cannot figure out how to run an Ubuntu Sever through Virtual box. I cannot find an option, and my iso is never a proper iso to boot from in the storage options... any help would be great or maybe pointing me to a good tutorial would be awesome. I just want to mess around and see what up. Thanks.

I would like to know if anyone can help me with installing Ubuntu on VirtualBox


I am trying to update from Mountain Lion to Mavericks using a DMG installer that I obtained over BitTorrent.  I don't want to download it via the official App Store as I don't have good enough Internet connectivity to download the 5 GB file.  How do I install from this DMG file?  I tried double clicking the DMG file, double clicking OS X Install Mavericks.app, then clicking install; I am shown the software license agreement, and I accepted it, but nothing happens after accepting the software license agreement.

I could probably copy the contents from the package, but what is the best way to create an install Flash Drive for Mavericks?  Of course ideally the drive should be bootable.


How do I make two-sided clothing using the Cloth modifier, such that the front and back have different materials?

How could a one-sided material be achieved with the Cycles renderer?  I would like to create a plane that is completely transparent from one side, and a mirror from the other side.  It would be cool if Cycles/Blender simple supported backface culling like the game engine. But I guess it doesn't?  How could something like that done with nodes?


Given $a_n$ be a sequence and IF $\lim_{n\to\infty}a_{n}=l$, Then prove that  $\lim_{n\to\infty}\frac{a_{1}+a_2+\cdot..+a_n}{n}=l$  I do not know how to do this. Can someone help me with this?  Thanks  ATTEMPT

Prove that if $\lim_{n \to \infty}z_{n}=A$ then:  $$\lim_{n \to \infty}\frac{z_{1}+z_{2}+\cdots + z_{n}}{n}=A$$ I was thinking spliting it in: $$(z_{1}+z_{2}+\cdots+z_{N-1})+(z_{N}+z_{N+1}+\cdots+z_{n})$$ where $N$ is value of $n$ for which $|A-z_{n}|<\epsilon$ then taking the limit of this sum devided by $n$ , and noting that the second sum is as close as you wish to $nA$ while the first is as close as you wish to $0$. Not sure if this helps....


I am just wondering if my camera is an SLR camera?   It is a Panasonic Lumix DMC-FZ45.   Could you also tell me what an SLR camera is? I have read a few descriptions but still am not sure.   Thanks :)

My question, specifically: why is the   not an SLR?


I’ve been flying around the two islands available at the start of the game for ages, but I’m aware that on mobile there’s a third large island called Snowstone. But I just can’t seem to find it anywhere.  In the races section there’s a few I haven’t unlocked, including one called ‘yeti scramble’, which I can imagine is on this island.  So how do you find Snowstone Island?

After taking off in Simpleplanes and flying around over the ocean for a while, I've found a lots of tiny islands all over the place, and a few really big ones that unlock new spawn locations once found.  Large islands appear to also have many discoverable 'locations' around them as well, like airports, carriers, or landmarks.  These locations automatically become available as start points once discovered.  Where can I find all of these major islands, and once there, where should I look to unlock all of the locations?


I don't know what to do here but pagination is driving me crazy! As you can see, "Older" points to blog/page/2 but when clicked, the site stays on blog/.  I'm using wp-pagenavi for pagination.  The site url is   Sorry, here is the blog template page: (embedding not working - )  blog template
 <?php //Fix homepage pagination if ( get_query_var('paged') ) { $paged = get_query_var('paged'); } else if ( get_query_var('page') ) {$paged = get_query_var('page'); } else {$paged = 1; }  $temp = $wp_query;  // re-sets query $wp_query = null;   // re-sets query $args = array( 'post_type' => array('post'), 'orderby'=>'date', 'order'=>'DESC', 'posts_per_page' => 10, 'paged' => $paged); $wp_query = new WP_Query(); $wp_query->query( $args ); while ($wp_query->have_posts()) : $wp_query->the_post();  ?>

         <?php if (function_exists('has_post_thumbnail') && has_post_thumbnail()) {?>
             <img src="<?php echo get_template_directory_uri();?>/timthumb.php?src=<?php echo thumb_url();?>&amp;h=84&amp;w=84&amp;zc=1" alt="" class="boximg-pad" />
         <?php } ?>
         <div class="postbox <?php post_class(); ?>">
<a href="<?php the_permalink();?>"><?php the_title();?>

        <?php the_excerpt(__('Continue reading »','example')); ?>

           <?php echo __('Posted at ','ecobiz');?><?php the_time( get_option('date_format') ); ?> |            <?php echo __('By ','ecobiz');?>: <?php the_author_posts_link();?>  |                                    <?php echo __('Categories ','ecobiz');?>: <?php the_category(',');?>  |            <?php comments_popup_link(__('0 Comment','ecobiz'),__('1 Comment','ecobiz'),__('% Comments','ecobiz'));?>

     <?php endwhile; ?>

I've got a custom loop that I'm using to display some Real Estate listings that will be available within 60 days. I'm calling it with the following function:   <?php  $sixtydays = date('Y/m/d', strtotime('+60 days')); $paged = (get_query_var('paged')) ? get_query_var('paged') : 1; $query = new PostsOrderedByMetaQuery(array(   'post_type' => array('post', 'real-estate'),   'meta_key' => 'Time Available',   'meta_compare' => '<=',   'meta_value' => $sixtydays,   'paged' => $paged,   'orderby_meta_key' => 'Price',   'orderby_order'    => 'ASC' )); ?> <?php while ($query->have_posts()) : $query->the_post(); ?>   While the loop works great, I can't get it to paginate. It shows the first 10 (my default) posts but doesn't show the pagination. The only way to display all posts is to show them on one page by adding 'posts_per_page' => -1, I have similar loops on other pages that have no problem paginating. The only difference with this one is that there are two meta keys that are filtering the posts.   I'm using WP Page Navi for this and the rest of my pages. I'm closing the loop and adding the pagination using the following code:   <?php endwhile; // End the loop. Whew. ?> <?php wp_pagenavi(); ?> <?php wp_reset_query(); ?>   How can I go about fixing this?