I'm looking for a free web hosting (PHP) provider, that permits adult content.  And by adult content, I don't mean videos. At most, photos. And I can keep it non-nude. I just want to display information about pr0n-stars.   If I keep it non-nude, but still contain information about pr0n-stars, do you think 000webhost will allow this?  Any advice would be appreciated. Thanks !

This is a "catch-all" question designed to serve as an answer for all questions about choosing web hosting.  Pro Webmasters no longer accepts new questions about how to choose hosting.  All future questions pertaining to finding web hosting should be closed as a duplicate of this question. For more information about this policy please see .    How to find web hosting that meets my requirements?  What we're looking for in answers to this question are the basics about web hosting:   What is web hosting? What is the difference between shared, VPS, and dedicated hosting? How does a content delivery network relate to web hosting? Anything else you feel is helpful in finding a web host.   What we do not want is:   Endorsements or recommendations for specific web hosts We do not want your experience or other subjective information (just the facts please)


I am trying to make a Java program that counts the words and the lines in an '*.txt' - file. So far so good. The code works only if the '.txt' has only 2 lines. If put more lines into it I get a NullPointerException at the .split(" "); part in my code. I have read somewhere that could be something with .readLine()-function. But I have really no clue what really causes it.  import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException;  public class txt_counter { static String FilePath = "C:\\Users\\diasc\\Desktop\\test.txt";  public static void main(String[] args) throws IOException{     FileReader finput = null;     BufferedReader binput = null;      try {         finput = new FileReader(FilePath);          System.out.println("Orignal txt output:");         int a;         while ((a = finput.read()) != -1) {             System.out.print((char) a);             }           binput = new BufferedReader(new FileReader(FilePath));          int Zcount = 1;          int Wcount = 1;          while ( binput.readLine() != null ) {             String[] woerter = binput.readLine().replaceAll("\\s+", " ").split(" ");             System.out.println("\n\nsplitted String: ");             for(int i =0; i<woerter.length; i++)             {                 System.out.println(woerter[i]);             }             Wcount = Wcount + woerter.length;             Zcount++;          }          System.out.println("\nLines: " + Zcount);          System.out.println("Words: " + Wcount);      }finally {          if (finput != null) {              finput.close();          }          if(binput != null) {              binput.close();          }     } }   Console Output:     Orignal txt output: lol   I   am pretty stupid. haha idk     send halp        splitted String:   I   am   pretty   stupid.   haha   idk   Exception in thread   "main" java.lang.NullPointerException    at txt_counter.main(txt_counter.java:32)

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?


What would the full proof look like for $𝐵\subset 𝐴$? If   $A = \left\{6a + 4b\in\mathbb{Z} : a, b \in\mathbb{Z}\right\}$ and $B = \left\{2a \in\mathbb{Z} : a \in\mathbb{Z}\right\}$. Show that $A = B$  So far I have:  $A\subseteq 𝐵$  Suppose $x\in A$. $x = 6a + 4b$ for some $a, b \in\mathbb{Z}$. $x = 2(3a + 2b)$. Let $k1 = (3a + 2b)$ where $k1\in\mathbb{Z}$. x = 2k1. 2x, x ∈ ℤ. Then $x\in B$.  $B\subseteq 𝐴$ Suppose $y\in B$. $y = 2a$ for some $a\in\mathbb{Z}$. $y = 6a + 4(−a)$. Then $y\in A$.  I need help with showing steps for $B\subseteq A$.  Thank you all for the help!

1) How do I prove the following:   Let A = {6a + 4b ∈ Z : a, b ∈ Z} and B = {2a ∈ Z : a ∈ Z}. Show that A = B.  Thank you all for the help!


Since $$f_X(x) = \frac{(1/2)^{n/2}x^{n/2 - 1}e^{-x/2}}{\Gamma(n/2)}$$ and $$f_Y(y) = \frac{x^{-1/2}e^{-x/2}}{\sqrt{2} \Gamma(1/2)}$$ Using the convolution formula, we get that $$f_{X} * f_Y (z) = e^{-z/2}\frac{(1/2)^{(n+1)/2}}{\Gamma(\frac{n}{2})\Gamma(\frac{1}{2})}\int_{-\infty}^{\infty} (z-w)^{(n/2) - 1}w^{-1/2}\ dw$$ I am not sure how to evaluate the integral on the right.

If $X\sim \Gamma(a_1,b)$ and $Y \sim \Gamma(a_2,b)$, I need to prove $X+Y\sim\Gamma(a_1+a_2,b)$ if $X$ and $Y$ are independent. I am trying to apply formula for independence integral and just trying to multiply the gamma function but stuck ?


I'm traveling to Minsk and would like to get a local sim while I'm there (only for data). What are my options? Can I buy a sim card at Minsk airport?

Next month I am traveling to country X, where I would need Y minutes of calls, Z text messages and most importantly Q megabytes of data. How can I find the cheapest/most reliable SIM card for my needs?


Yesterday I turned my computer to find that the launcher was missing.   In addition, I could not using ctrl-alt-t would bring up a blank white screen.   The only terminal could be found by clicking ctrl-alt-f1.   I used ccsm to turn on Unity.   Unity panel service was working.   I installed tweak tool.   I did all the troubleshooting I could find related to this subject.   Nothing would work.   I ultimately reinstalled Ubuntu 13.10.   Also, I do not have an nvidia graphics card.   I have an intel integrated graphics controller.     Some of the troubleshooting I tried were found:

When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.


I need some C# code to validate a windows credential, the account maybe a local account or a domain account.  Please give some ideas about how to do it.

I want to validate a set of credentials against the domain controller. e.g.:  Username: STACKOVERFLOW\joel Password: splotchy   Method 1. Query Active Directory with Impersonation  A lot of people suggest querying the Active Directory for something. If an exception is thrown, then you know the credentials are not valid - as is suggested in .  There are some serious  however:   You are not only authenticating a domain account, but you are also doing an implicit authorization check. That is, you are reading properties from the AD using an impersonation token. What if the otherwise valid account has no rights to read from the AD? By default all users have read access, but domain policies can be set to disable access permissions for restricted accounts (and or groups). Binding against the AD has a serious overhead, the AD schema cache has to be loaded at the client (ADSI cache in the ADSI provider used by DirectoryServices). This is both network, and AD server, resource consuming - and is too expensive for a simple operation like authenticating a user account. You're relying on an exception failure for a non-exceptional case, and assuming that means invalid username and password. Other problems (e.g. network failure, AD connectivity failure, memory allocation error, etc) are then mis-intrepreted as authentication failure.   Method 2. LogonUser Win32 API   have suggested using the  API function. This sounds nice, but unfortunately the calling user sometimes needs a permission usually only given to the operating system itself:     The process calling LogonUser requires   the SE_TCB_NAME privilege. If the   calling process does not have this   privilege, LogonUser fails and   GetLastError returns   ERROR_PRIVILEGE_NOT_HELD.       In some   cases, the process that calls   LogonUser must also have the   SE_CHANGE_NOTIFY_NAME privilege   enabled; otherwise, LogonUser fails   and GetLastError returns   ERROR_ACCESS_DENIED. This privilege is   not required for the local system   account or accounts that are members   of the administrators group. By   default, SE_CHANGE_NOTIFY_NAME is   enabled for all users, but some   administrators may disable it for   everyone.   Handing out the "Act as a part of the operating system" privilege is not something you want to do willy-nilly - as Microsoft points out in a :     ...the process that is calling   LogonUser must have the SE_TCB_NAME   privilege (in User Manager, this is   the "Act as part of the Operating   System" right). The SE_TCB_NAME   privilege is very powerful and   should not be granted to any arbitrary user just so that they can   run an application that needs to   validate credentials.   Additionally, a call to LogonUser() will fail if a blank password is specified.    What is the proper way to authenticate a set of domain credentials?    I happen to be calling from managed code, but this is a a general Windows question. It can be assumed that the customers have the .NET Framework 2.0 installed.


After the DEM creation, I wanted to create slope layer.   However, the result has not satisfied me. I don't think the slope map is correct. Have you ever encountered false calculated terrain map?  This is the DEM:    And this is the slope layer.

I have a DEM layer from ASTER satellite and I want to get the slope information from it.  I use terrain analysis > slope, but the output is so wrong. Why is that?  Here is the DEM:     And here is the "Slope" that is totally wrong. It should stretch the values from 0 - 89.9097 but it does not.


I have been struggling for almost 6 months trying to find the suitable combination to make Tensorflow/Keras, Cuda and OpenCV work in harmony using Python3, so that I can do some Deep Learning research on Video processing. But I get each time a malfunctioning library.  I tested already the Ubuntu 16.04.3 LTS environment, and it wasn't going well for both of OpenCV and Cuda.  Today, OpenCV 4.0.0 is working fine within my Ubuntu 18.04.1 (64 Bits) setup. However, I am not able to compile Tensorflow, knowing that I have Cuda 9.1, Cudnn 7.1.3, and NCCL 2.1.15 installed.  I am ready to restart everything from scratch, in case you already experienced working on a P400 Quadro-like GPU (which is of compute capability 6.1) (I am these days meeting some problems with ).  nvidia-smi : When I run :  nvidia-smi    In the command line, I get the following answer :  NVIDIA-SMI has failed because it couldn't communicate with the NVIDIA driver. Make sure that the latest NVIDIA driver is installed and running.   I installed, days ago, the Nvidia driver metapackage from nvidia-driver-390 using the Software & Updates software.    Can you suggest me a stable user-friendly GNU/Linux distribution or any stable Ubuntu version that I can put in place to make my GPU run properly and reduce drastically such recurring library interconnection issues ?  Relevant settings to mention :   GPU : Quadro P400 (Compute Capability 6.1) CPU : Intel Core i7, 7700K

How can I easily get tensorflow gpu running?


Let $K$ be a field and $K[x]$ be the ring of polynomials over $K$ in a single variable $x$ for a polynomial $f$ belong to $K[x]$. Let $(f)$ denote the ideal in $K[x]$ generated by $f$. show that $(f)$ is a maximal ideal in  $K[x]$ if and  only iff $f$ is an irreducible polynomial over $K$.

Let $R$ be a PID, and $r\in R- \{0\}$. Prove that   $\langle r\rangle$  maximal $\iff r$ irreducible.   "$\Leftarrow$"Easy.  "$\Rightarrow$"If $J=\langle r \rangle$ then we will prove that $r$ is irreducible. If $r=ab$, we want to prove that $a\in U(R)$ or $b \in U(R)$.  If we take the ideal which is generated by $\langle a\rangle$ then (because $J$ is maximal)$$\langle a\rangle \subseteq\langle r \rangle \iff r\mid a \iff a=kr, k\in R \Longrightarrow r=krb\iff r(1-kb)=0_R \iff kb=1_R$$ so $b\in U(R)$. Same way if we work with $\langle b \rangle$.  Is this proof right?


Lets say I have a document file named sample.docx added to an IDE python project. I have a python tkinter program and I want the user to be a able to click a button that will automatically open the sample.docx file. I think the only way is by opening the windows save as window with the file already loaded.  How do I do this?

I need to be able to open a document using its default application in Windows and Mac OS. Basically, I want to do the same thing that happens when you double-click on the document icon in Explorer or Finder. What is the best way to do this in Python?


In a few weeks' time, I will be visiting the US for 14 days. Coming from the EU, roaming is very expensive, so I am considering getting a temporary SIM card. However, looking around for the options, I ran into a few things that seem to work differently that I'm not sure about.  What I would like is the following:   Something that works with my European  Reasonable coverage in Utah and adjacent states (I understand there's no reception at the bottom of Grand Canyon, but it would be nice to have coverage most of the time while driving down I15 from Salt Lake to Vegas). Small data bundle to look up addresses and stuff along the way (500 MB or 1GB will do, doesn't have to be 4G all the time) Will use mostly for calling within US, but would be nice if there's a reasonable rate for calling to (or being called from) the EU so I can call home a few times.   Looking at the options, I got really confused about a few things.   Since I have my own device, can I get a SIM only without buying a phone?  It seems that I need to buy the credit separately, or is a starting credit usually included?  Is it possible to get internet access on a prepaid card? Do I buy this separately or is it included in the credit, at $ xx / MB?  Should I order anything in advance or can I just walk into a local AT&T store or Walmart and walk out with a local phone number?   Since I'll only be there for two weeks, ideally I'd like to keep the total around $30. Is that reasonable?


"Item Name","Item Number",Description,"Cost Price","Unit Price",Count,"Reorder Level" " CHEFS TROUSERS BLUE/WHITE",21013,,£5.67,£12.50,1.00,0.00 ... ...   A csv file with the above format incorrectly displays a euro symbol in excel as Â£. Is there a way to fix this?

I am programmatically exporting data (using PHP 5.2) into a .csv test file. Example data:   Numéro 1 (note the accented e). The data is utf-8 (no prepended BOM).  When I open this file in MS Excel is displays as NumÃ©ro 1.  I am able to open this in a text editor (UltraEdit) which displays it correctly.  UE reports the character is decimal 233.  How can I export text data in a .csv file so that MS Excel will correctly render it, preferably without forcing the use of the import wizard, or non-default wizard settings?


I have an input file in my asp.net application. The user submit a CSV file to update the database.  This CSV file is created by exporting a .xlsx. This .xlsx file contains non-ascii chars, such as França, Rússia, etc. The user sometimes, incorrectly saves it via "CSV (MS-DOS)" (which writes ASCII format) instead of "CSV (comma separated file)" (which preserves .xlsx encoding).  So, to validate file encoding before write its content in the database....  How can I safely detect file encoding of a file submitted in .net?  ps.: BOM verification is not enough. A file can be UTF w/ BOM.

In our application, we receive text files (.txt, .csv, etc.) from diverse sources. When reading, these files sometimes contain garbage, because the files where created in a different/unknown codepage.  Is there a way to (automatically) detect the codepage of a text file?   The detectEncodingFromByteOrderMarks, on the StreamReader constructor, works for UTF8  and other unicode marked files, but I'm looking for a way to detect code pages, like ibm850, windows1252.     Thanks for your answers, this is what I've done.  The files we receive are from end-users, they do not have a clue about codepages. The receivers are also end-users, by now this is what they know about codepages: Codepages exist, and are annoying.  Solution:    Open the received file in Notepad, look at a garbled piece of text. If somebody is called François or something, with your human intelligence you can guess this. I've created a small app that the user can use to open the file with, and enter a text that user knows it will appear in the file, when the correct codepage is used.  Loop through all codepages, and display the ones that give a solution with the user provided text.  If more as one codepage pops up, ask the user to specify more text.


Inside my website tag <head> part code like below and recently I get some error report from 'Google Webmaster Tools → International Targeting':     en - no return tags   es - no return tags   I googled but still can't get what "no return tags" means?    I checked the URL http://example.com/?hl=en work in my website route enable to get content. Or does that mean there must have a dom <a> href and same as the language URL inside my <body> content?  <head>   <!-- … -->   <link href="http://domain.com/" rel="canonical">   <link href="http://domain.com/" hreflang="x-default" rel="alternate">   <link href="http://domain.com/?hl=en" hreflang="en" rel="alternate">   <link href="http://domain.com/?hl=es" hreflang="es" rel="alternate"> </head>

I'm getting HREF no return errors in search console and I don't understand why.    We have a page that contains buttons for get multiple pages of results.  URL structure:  Base page: `https://example.com/XX/publications` Pagination of results: `?count=50&page=4` Actual url: `https://example.com/au/publications?count=50&page=4`   Source page:  <link rel="canonical" href="https://example.com/au/publications"> <link rel="alternate" hreflang="en-US" href="https://example.com/us/publications">   alternate page:  <link rel="canonical" href="https://example.com/au/publications"> <link rel="alternate" hreflang="en-AU" href="https://example.com/au/publications">   How can I tell Google that it should ignore the URL query parameters?


At first the GDM worked just fine but all of a sudden I lost the ability to login. I can still get to my desktop using startx (sound doesn't seem to work when I do that but it might be a by-product of having to use root privileges to get startx to run.) There doesn't seem to be anything especially incriminating in any of the error logs or journalctl except for   Mai 10 03:56:38 curtis-UX301LAA systemd[1]: Started Light Display Manager. Mai 10 03:56:38 curtis-UX301LAA systemd[1]: Started ACPI event daemon. Mai 10 03:56:38 curtis-UX301LAA systemd[1]: Starting ACPI event daemon... Mai 10 03:56:38 curtis-UX301LAA systemd[1]: Started Run Click system-level hooks. Mai 10 03:56:38 curtis-UX301LAA acpid[1295]: starting up with netlink and the input layer Mai 10 03:56:38 curtis-UX301LAA acpid[1295]: 9 rules loaded Mai 10 03:56:38 curtis-UX301LAA acpid[1295]: waiting for events: event logging is off Mai 10 03:56:38 curtis-UX301LAA acpid[1295]: client connected from 1288[0:0] Mai 10 03:56:38 curtis-UX301LAA acpid[1295]: 1 client rule loaded Mai 10 03:56:38 curtis-UX301LAA systemd[1]: Received SIGRTMIN+21 from PID 384 (plymouthd).   I know this is really vague but if someone could point me towards where to start finding potential errors I'm sure I'd be able to make progress on this.  Q:What is the best way going about debugging this?  P.S. The issue isn't with permissions and I've uninstalled-reinstalled both GDM and lightDM many times. The only thing I can think of is there is something up with my lightdm config file but all I have in there is autologin and user-session=gnome. Also there is nothing in .xsession-error. This is what makes my issue different from .   Updates: It seems that the sessions are getting correctly started and actually persist (at least as far as I can tell by looking at the journalctl output.) There are no errors getting returned from X but I do see dbus errors scattered a little bit everywhere.

My Ubuntu is stuck in a login loop when trying to enter my desktop. When I login, the screen gets black and soon after that the login screen comes back.   I've read that the problem might be caused by an error depending on the graphics, here's my graphics card: ATI Radeon 7670M


Here is my problem:  Use induction to show that for $n\ge1$, $$\frac{4^n}{\sqrt{4n}} \le \frac{(2n)!}{(n!)^2}\le \frac{4^n}{\sqrt{3n+1}}.$$  What I have so far:  For $n=1$ it is $2≤2≤2$, and I tried to originally do this problem by assuming that the case holds for $n\ge 1$, and if it hold for n+1, than it should hold for all $n\ge 1$.  I started with $n+1$ case: $$\frac{4^{n+1}}{\sqrt{4(n+1)}}\le\frac{(2(n+1))!}{((n+1)!)^2}\le\frac{4^{n+1}}{\sqrt{3(n+1)+1}},$$ but this did not really lead me anywhere.

What are common lower bounds for ${{2n} \choose {n}}$?    Edit:  I made a mistake in my original question.  It doesn't change my question but there is no reason for me to include the mistake.


5 minutes after voting a lock is placed on votes for the question/answer. A user can only recast his/her vote if the post is edited.  So my question is    Why is there a locking mechanism on question/answers? Should the locking time be increased to 10 min OR 15 min?

I downvoted  and now really can't say why, so I wanted to remove my downvote. However, I get the message:  You last voted on this question yesterday Your vote is now locked in unless this question is edited  Why is this? I don't think I voted on it multiple times, and even when I did, I can change my mind, can't I?


In a , Elio Fabri says:     A well-known case is the famous paradox of the two capacitors, one charged, the other uncharged. If you connect them, charge is shared, and energy appears not being conserved. But if the connecting wire has a non-null resistance $R$, you can see that the lacking energy is dissipated as Joule heat in $R$. The paradox is that the energy dissipated does not depend on $R$, so that the limit $R\rightarrow$ 0 would still give the same value.   I haven't thought about it very deeply, and I'm sure others have analyzed this carefully, but it seems to me that for small values of resistance, this circuit would behave like an $LRC$ circuit and exhibit oscillations, and in the limit $R\rightarrow0$, radiation would become a more efficient dissipative mechanism than resistive heating. Is this a correct analysis?

A capacitor is charged. It is then connected to an identical uncharged capacitor using superconducting wires. Each capacitor has 1/2 the charge as the original, so 1/4 the energy - so we only have 1/2 the energy we started with. What happened? my first thoughts were that the difference in energy is due to heat produced in the wire. It may be heat, or it may be that this is needed to keep equilibrium.


Using the Android app, I frequently select from the tags list to view recent questions on subjects I might be able to help with.  However, after viewing a question, tapping back (either the phone's default or the arrow in the top bar) returns me to the tags list, not the questions as one would expect. It makes for a frustrating user experience.  Any chance this could be altered in a forthcoming version?

This looks a little bit like a variation on  but specific to the tags view.  Reproduction (app version 1.0.71):   Select any site (say Meta) from the sidebar Switch to the tags view using the top bar Choose a tag, any tag ( is nice)   optionaly refine your search with more terms  Go to any question found, go back   you end on the unfiltered tags view  Go back again   lucky you, your search is here


I have another game that uses rectangles instead of textures which works fine. When I run it I get this error:   C:\Users\Owner>cd desktop  C:\Users\Owner\Desktop>java -jar FLIPPERFLAP1.0.jar java.io.FileNotFoundException: res\FlubberFlap.png (The system cannot find the path specified)         at java.io.FileInputStream.open(Native Method)         at java.io.FileInputStream.<init>(FileInputStream.java:131)         at FSMain.MainFS.main(MainFS.java:68)  C:\Users\Owner\Desktop>   In line 68 where I load the texture, I do this :  wood = TextureLoader.getTexture("PNG", new FileInputStream(new File("res/SuperGuy.png")));   It works when I use the IDE (eclipse) but not after exported. The images are in a source folder called res. When I use JarSplice do I have to export the textures in natives or jars?

I'm still experimenting with some OpenGL in LWJGL, and as I get to know more and more about OpenGL, I start to do more complicated things like multi texturing, shadowmapping and more. Now, right now I'm using the src folder (src/res) for my resources, and use src/resourcename in my code. When I export it, this won't work on another location as the relative path is ofcourse incorrect. What would be the best way of deploying your game with all the resources in one file? Maybe put the files in the jar?  I would like to hear from a few people how they store and deploy their project with resources, thanks!


I generated a patch using the diff command with the number of context lines as 1 (-c option). My patch file contents:  *** /home/sk/abc/def/src/klm/a.py 2015-05-18 16:25:50.348398554 +0530 --- /opt/abc/def/ghi/klm/a.py  2015-05-18 14:27:13.860503469 +0530 *************** *** 72,73 **** --- 72,74 ----               output, error, rCommand = "", "", "" +             import subprocess               rCommand = self.copyCmd % (self.executor_hostname, self.testId, self.testId)   When I tried to apply the patch using these commands,  cd / patch -p0 < sg.patch   I got this output,  can't find file to patch at input line 3 Perhaps you used the wrong -p or --strip option? The text leading up to this was: -------------------------- |*** /home/sk/abc/def/src/klm/a.py  2015-05-18 16:25:50.348398554 +0530 |--- /opt/abc/def/ghi/klm/a.py  2015-05-18 17:10:48.368670076 +0530 -------------------------- File to patch:   Why doesn't the patch command take the file name in second line as the file to patch?

I have a patch with absolute paths that I wish to use. i.e. the first few lines are as follows.  --- /usr/share/apps/plasma/packages/org.kde.pager/contents/ui/main.qml  2014-10-10 18:47:23.000000000 +1100 +++ /usr/share/apps/plasma/packages/org.kde.pager/contents/ui/main.qml.mod  2014-11-11 09:44:17.786200477 +1100   However, it fails unless I am in the root directory.  ~$ cd ~$ sudo patch -i /tmp/fix_kde_icons.patch -p0 Ignoring potentially dangerous file name /usr/share/apps/plasma/packages/org.kde.pager/contents/ui/main.qml Ignoring potentially dangerous file name /usr/share/apps/plasma/packages/org.kde.pager/contents/ui/main.qml.mod can't find file to patch at input line 3 Perhaps you used the wrong -p or --strip option? ... ~$ cd /tmp /tmp$ sudo patch -i /tmp/fix_kde_icons.patch -p0 ... #same error as above /tmp$ cd /usr /usr$ sudo patch -i /tmp/fix_kde_icons.patch -p0 ... #same error as above /usr$ cd / /$ sudo patch -i /tmp/fix_kde_icons.patch -p0 patching file /usr/share/apps/plasma/packages/org.kde.pager/contents/ui/main.qml   Is there a way to make patch use the absolute path with any working directory?


Let $f:G_1 \to G_2$ be a homomorphism between multiplicative groups.  Suppose that $N_1$ is a normal subgroup of $G_1$. Is the image $f(N_1)$ of $N_1$ a normal subgroup of $G_2$?

I want to find an example of a homomorphism $f:G\to H$ such that $A$ is a normal subgroup of $G,$ but $f(A)$ is not so in $H.$  I know that if $f$ was onto $f(A )$ must be normal , but otherwise i want to find an example!


I've tried using the bootstrap 4 classes 'align-middle' and 'align-content-center' to make the contents of the parent div vertically align in the middle. But applying these classes does not give the result I want. The contents are still positioned at the top.

       The text I want to vertically align in the middle

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...


Quantum fluctuations are thought to be the reason why we have energy even if there is nothing in a region of space. My question is if quantum fluctuations give back what they got from nothing using Heisenberg's uncertainty principle $\Delta Ε \cdot \Delta t \geq \frac{h}{2}$, how do they result in a sum of energy $> 0$?  An answer that I came up with, though don't know if correct is: if you freeze time then you will catch quantum fluctuations in the in-between phase when they have not returned their energy back. And if you add all those in a region of space such as a cubic then the sum ends up being $10^{113}\text{ J/m}^3$ although the observed cosmological constant is $1.5 \cdot 10^{-9}\text{ J/m}^3$, but that's the cosmological constant problem a completely different topic.  Also when the 2 particles remerge don't they emit photons? If so photons have energy $E=hf$. But if quantum fluctuations emit photons in the end and photons have energy then how is the energy given back?  Don't be afraid to include math to your answer especially if math makes your answer more correct and complete.

In popular physics articles and even some physics classes I've been to, the vacuum of space is described as being constantly full of quantum fluctuations.  Supposedly, all sorts of particle-antiparticle pairs at all scales are constantly appearing and disappearing.  We end up with a mental image of the vacuum as a roiling, choppy sea with all sorts of things going on, rather than a calm, placid background.  However, the vacuum, being the lowest-energy state of a theory, should be an energy eigenstate—which means it is time-invariant (except for a physically-irrelevant phase factor).  So it seems the vacuum really should not be seen as a dynamic entity with all kinds of stuff happening in it, as we're led to believe.   that     A “vacuum fluctuation” is when the ground state of a system is measured in a basis that does not include the ground state; it’s merely a special case of a quantum fluctuation.   So it sounds as if the existence of vacuum fluctuations is contingent on measuring the vacuum—in particular, measuring something that doesn't commute with energy (such as, I guess, the value of a field at a point).  How much truth is there to the idea that vacuum fluctuations are constantly happening everywhere, all the time?  Is that really a useful way to think about it, or just a myth that has been propagated by popularizations of physics?


I would like to compare multiple means using a method such as an ANOVA. This would have to be followed up with either Scheffe's test or the Games-Howell post-hoc method (my data is non-normal - to different degrees and can't all be transformed to normality using the same transformation - heteroscedastic and has greatly differing sample sizes).  In their Opthalmic and Physiological Optics paper, Armstrong et al. (2000) state that these tests can only be performed after an ANOVA returns a significant result. My question is this - how can an ANOVA be appropriately applied to data such as mine, which require these post-hoc tests simply because they violate so many assumptions of the ANOVA? It seems odd to me that they should advocate the use of an ANOVA before post-hoc tests that are used in place of others because of the violations of the ANOVA assumptions.  Also - on a side note, does anyone have any advice as to whether to use the above approach or to use the multcomp package available in R?  Many thanks!

I often hear that post hoc tests after an ANOVA can only be used if the ANOVA itself was significant.    However, post hoc tests adjust $p$-values to keep the global type I error rate at 5%, don't they?  So why do we need the global test first?  If we don't need a global test is the terminology "post hoc" correct? Or are there multiple kinds of post hoc tests, some assuming a significant global test result and others without that assumption?


Apologies if this has been asked. I've been searching the website to find a comment on a post I read about online scheduling systems.  I'm looking for a free online system that will enable students to book in consultation times for their research papers with me on pre-set timeslots that I arrange. I have 300 students enrolled so would like to avoid the hassle of emails (if at all possible).   I know that doodle offers something like this, but I don't like the fact that doodle allows everyone to see everyone else's timeslot. I would prefer it to be a more private system for the students.  In a question/answer post I read, someone had mentioned a few websites but me being the idiot I am didn't write them down and now can't find them throughout this website.   Does anyone have any good suggestions? I would prefer to avoid the email back and forth while I wait for students to respond as to what time on a particular day suits, so a booking system would be ideal for both me and my teaching assistant.

I'm wondering if there's a more efficient method of booking an academic supervision appointment. The method I experienced was a schedule on the professor's door, first-come-first-serve.   How do we employ technology that is the most efficient (reduces scheduling time, permitting all students to view sign ups)?


arg_to and arg_from are of type char*   while (*(arg_to++) = *(arg_from++)); while ((*arg_to)++ = (*arg_from)++);   Why does the first expression work properly whereas the second one throws the following error:     error: lvalue required as left operand of assignment


I have a total of three machines. I have installed MaaS in one of my machines and the other two machines were added to the MaaS nodes list and kept in ready state.  When I run the fourth step given in the  Ubuntu documentation, both the machines went to the deployed state.  The Ubuntu OpenStack installer screen is running for too long a time. I don't know to how to proceed. Please help me. I am looking for this to do simple job scheduling in a cloud environment using OpenStack.

I have a total of three machines. I have installed MaaS in one of my machines and the other two machines were added to the MaaS nodes list and kept in ready state.  When I run the fourth step given in the  Ubuntu documentation, both the machines went to the deployed state.  Both the nodes in the deployed state are asking for login and password, and the Ubuntu OpenStack installer screen is running for too long a time. I don't know to how to proceed. Please help me. I am looking for this to do simple job scheduling in a cloud environment using OpenStack.


I am doing a math presentation in beamer. How can i have "théorème" written instead of "theorem" and "définition" instead of "definition" ? This is what i have as of now :  \documentclass[11pt]{beamer} \usetheme{Warsaw} %\setbeamertemplate{theorems} \usepackage[utf8]{inputenc} \usepackage[french]{babel} \usepackage[T1]{fontenc} \usepackage{amsmath} \usepackage{amsfonts} \usepackage{amssymb} %\author{} \title{ccc} %\setbeamercovered{transparent}  \begin{document} %\logo{}  \institute{}  \date{01/06/2014}  %\subject{}      \def\O{\mathcal O} \def\Q{\mathbb Q} \def\R{\mbox{$\mathbb R$}} \def\Z{\mathbb Z} \def\C1{\mathbb C}

I'm Malay user. I want to rename the theorem tag in Beamer. Does anyone know how to do it? When the document class is article or book, I can simply modify the preamble as follows:  \newtheorem{theorem}{Teorem} \newtheorem{lemma}[theorem]{Lema} \newtheorem{corollary}[theorem]{Korolari} \newenvironment{proof}[1][Bukti]{\noindent\textbf{#1.} }{\ \rule{0.5em}{0.5em}}   However, the above things does not work in Beamer. So, does anyone know how to do it?


I have some data in ArcGIS, but unfortunately there isn't projection coordinate, like the picture below:     This place is in America and its longitude and latitude is about -75.2° and 40.1°. Can anyone guess its "projection coordinate"?  As suggested by @JGH, the projection coordinate is "Pennsylvania State Plane South (3702)"!It matches perfectly!  Besides this shapefile above (Place 1), there is another file (Place 2, the same place), but they are not overlapped. I was wondering the projection of this shapefile.

I have a Shapefile but its coordinate system is Unknown, and there is no *.prj file.   How can I identify it now?


It is written in the  paper that the ipad=0x36 and opad=0x5C were chosen such that it maximize the  of the part of the key used in the inner and outer part of the HMAC process.  Since 0x36=0b0110110 and 0x5c=0b1011100, it seems that the Hamming distance is 4, but I would expect that ipad and opad with Hamming distance of 8 would have been used.  Do you know how does those exact ipad and opad values make the scheme stronger?

Wikipedia lists the following pseudocode for HMAC:  function hmac (key, message)     if (length(key) > blocksize) then         key = hash(key) // keys longer than blocksize are shortened     end if     if (length(key) < blocksize) then         // keys shorter than blocksize are zero-padded ('∥' is concatenation)          key = key ∥ [0x00 * (blocksize - length(key))]      end if      // Where blocksize is that of the underlying hash function        o_key_pad = [0x5c * blocksize] ⊕ key      // Where ⊕ is exclusive or (XOR)     i_key_pad = [0x36 * blocksize] ⊕ key       // Where '∥' is concatenation        return hash(o_key_pad ∥ hash(i_key_pad ∥ message))  end function   Why are they there?  How were they chosen?  It seems to me that  $hash(key + hash(message))$ (where + is concatenation) would suffice.    Obviously I'm missing something.  What is it?


The aim is to find a recurrence of prime numbers. So we'll take the trigonometric functions as they're standard periodic functions, like $\sin(x)$: we'll take as an argument of $\sin(x)$ the angle found before:   $$y=\sin(πx/n) \mid n ∈ ℕ, n>1.$$  Fixed $n$ the function gives as result 0 exactly when $x=n$ for obvious reasons and the other zeros are given for every k*n, where $k=1,2,3,...$  Then take $n_1 ∈ ℕ, n_1 > 1$, for all $n ≠ n_1$ and $ n_1 ∉ $ set of all zeros of the harmonics, $n_1$ is prime because there is only one harmonic that has the first zero in $x=n_1$. This harmonic is called prime harmonic.  The set of all zeros of prime harmonics are ℕ/{1} then we can build a function that preserves these zeros. The best method is the multiplication. If the first prime harmonic has n=2, the next number without the zero is 3. Then take the second harmonic that has n=3, the next number without zero is 5 and so on. With this method we build gradually a function $p(x)$:  $$p(x) = \prod_{n=2}^\infty \sin (πx/n)$$  where $x, n ∈ ℕ$ for all $n \in \sin (πx/n).$ This function $(p(X))$ is called prime function.

I saw this formula on  page 2  $$\pi (n)=\sum_{j=2}^{n}\frac{\sin^{2}\left(\pi \frac{(j-1)!^{2}}{j}\right)}{\sin^{2}(\frac{\pi }{j})}$$  Where $\pi(n)$ is the prime counting function. Is this true? How to prove it?


I have learned in class that for Python, characters stars from [0]. For example in Monty Python, 'M'=0, 'o'=1, 'n'=2, 't'=3, 'y'=4, ' '=5, 'P'=6, 'y' = 7, 't' = 8, 'h'=9, 'o' = 10, and 'n' = 11.  But I am confused when I saw the following operation on NLTK:   genre_word = [(genre, word) for genre in ['news', 'romance']                             for word in brown.words(categories=genre)]  genre_word[:4] genre_word[-4:]   I thought all character numbering starts with [0]. What does the [-4:] means?

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.


Let $G$ be group of order $15 = 3 \cdot 5  = p \cdot q$ , where $p < q$ are primes. I know that there exists a unique non abelian group of order $pq$ and one abelian non isomorphic group of order $pq$. I think here are two non isomorphic of order $15$  Am i right or wrong ?

I wanted to share with you my resolution of this exercise.     How many different groups of order $15$ there are?   My resolution:     We're looking for groups such that $|G|=15=3\cdot 5$. Then: $G$ has an unique Sylow $3$-subgroup of order $3$ ($P_3$) and an unique Sylow $5$-subgroup of order $5$ ($P_5$).      Furthermore, $$|P_3 \cap P_5|\  \Large\mid\ \normalsize|P_3|,\ |P_5|$$   So $$|P_3 \cap P_5|=1\implies P_3 \cap P_5=\{e\}.$$      Then:$$|P_3\cdot P_5|=\displaystyle\frac{|P_3|\cdot |P_5|}{|P_3 \cap P_5|}=|P_3|\cdot |P_5|=3\cdot 5=|G|,$$      and $$G=P_3\cdot P_5 \simeq P_3 \times P_5 \simeq \mathbb{Z}/3\mathbb{Z} \times \mathbb{Z}/5\mathbb{Z}.$$   It's everything correct and well justified? There's some things that I didn't say, for example that a subgroup a prime $p$ as order is cyclic, and thus isomoprhic to $\mathbb{Z}/p\mathbb{Z}$. Maybe I did something wrong. I would appreciate someone to look and criticize my exercise.  Thank you.


We have been given n, find total number of ways to form a $3\times n$ board using $2\times 1$ boxes.

How many ways are there to tile dominos (with size $2 × 1$) on a grid of $2 × n$?  How about on a grid of $3 × 2n$?


Is real Altruism even possible? We can argue the giver feels good about themselves after giving. Or that they do it to get points with God. Even the atheist still can feel good about themselves. You could argue that feeling was just a side effect and the ultimate motive was the good. But we cannot help but feel good. Why do we really help. Are we all truly selfish and only dressing it differently. Whom are we really fooling except ourselves. Could we say if a person puts their own life in danger to save someone else count as altruism? As that's the ultimate sacrifice.

Is it possible for people to actually be selfless? It seems that in many cases where someone is being kind, they are actually performing in a manner that will benefit them. Either the recipient of the kindness will reciprocate, or the act of kindness itself is deemed commendable. Therefore, the one who offered the kindness still benefits personally from their action.  A child shares a toy in the same way. Even with the heroic act of martyrdom, the possibility of knowing one could become a martyr may be uplifting. It seems that every "selfless" act, in some way, may benefit the one being "selfless".  In light of those observations, is selflessness truly possible? What does philosophy have to say about this question?


Let $R$ be a commutative ring. We consider the set of ideals which are not finitely generated: $$ \Theta :=\{I ~:~ I\textrm{ is an ideal of } R\textrm{ which is not finitely generated} \}. $$ We assume that $\Theta \neq \varnothing$. By Zorn's lemma, let $I$ be a maximal element of  $\Theta$.  Show that $I$ is a maximal ideal of $R$.

I've been doing some old exam problems and I've come across a problem that I've answered, but my gut is telling me that there's something I'm glossing over.     Let $R$ be a commutative ring with identity and let $U$ be an ideal that is maximal among non-finitely generated ideals of $R$. I wish to show that $U$ is a prime ideal.   Assume that $U$ is not prime. Let $x, y\not\in U$ be such that $xy\in U$. $U$ is contained in a maximal ideal $M$ and $xy\in M$, so either $x$ or $y$ is in $M$; assume $x\in M$. The condition $U\subset M$ then implies that there is a ring homomorphism $$\varphi: R/M\to R/U$$  Since $R/M$ is a field, $\varphi$ is injective. Hence, $\varphi(x)\in U$. This is a contradiction, so $U$ must be prime.  The thing that worries me is that I never explicitly used the hypothesis that $U$ was not finitely generated or the result that $M$ must be finitely generated.


In  my question () contains a "$" in a quoted section of the question.  Originally I had a second "$" in a second quoted  section of the same question.    However when I did this the second $ seemed to trigger a style that made the text italic and lost spacing between words.  I took out the second "$" and instead emphasized it with the word "dollars" which solved the immediate problem.  However, in the listing of the question, (not the question itself) the same thing happens after the first "$".  The summary shows the text without spaces between words and in italic.  Seems like a bug.  Below is a verbatim copy/paste of the original issue (two dollar signs):    I was able to find a small ESC for about $12 off of ebay.  If you were designing a robot, would you see that and think?       $12 bucks for an ESC that connects to simple pulse-wave interface -   sign me up!   Or would you think:     $12 just to control a motor? I could throw together an H-bridge for   $0.50 and be done with it.   My robot in particular actually has two motors and therefor $24 to control the two of them.  But the interface is really easy (plus has the added advantage of being R/C vs computer controlled with a simple change of connectors.  Which way would you go?

I want to write something basic like "10 $US" but sometimes it makes the text look weird. It changes the font and writes italic text. And sometimes it will insert a newline. For example in my .  How can I safely insert a dollar sign?


I have constructed the number $7131372917538397234773191167617941438959$, which is prime as shown , using all primes under $100$ which contains two digits  by randomly ordering them as $31,37,29,\ldots, 59$  except $13$. I have got that number $7131372917538397234773191167617941438959$ satisfies the following properties:           1.- The sum of its digits is also prime: it is equal to $193$.          3.- The number is of the form $6n+1$          4.- This number can't be written as a sum of $3$ squares.      Now my question here is:          Could be this : $7131372917538397234773191167617941438959$ written as $x^{2}+y^{2}$ with $x, y$ integers?

Example 19.2.6 Prove that there do not exist integers $a$ and $b$ such that $\left.a^{2}+b^{2}=1234567 \text { . [Problems IV, Question } 1\right]$ Solution The set of remainders modulo $4, R_{4},$ is $\{0,1,2,3\}$ and so working modulo 4 we have four possibilities to consider. From modular arithmetic,  \begin{array}{l} a \equiv 0 \bmod 4 \Rightarrow a^{2} \equiv 0 \bmod 4 \\ a \equiv 1 \bmod 4 \Rightarrow a^{2} \equiv 1 \bmod 4 \\ a \equiv 2 \bmod 4 \Rightarrow a^{2} \equiv 4 \equiv 0 \bmod 4 \\ a \equiv 3 \bmod 4 \Rightarrow a^{2} \equiv 9 \equiv 1 \bmod 4 \end{array}  Thus for any $a \in \mathbb{Z}, a^{2} \equiv 0$ or 1 mod $4 .$ Therefore given two integers $a$ and $b$, $a^{2}+b^{2} \equiv 0$ or 1 or 2 mod $4,$ i.e. $a^{2}+b^{2} \neq 3$ mod 4 Suppose now for contradiction that $a$ and $b$ are integers such that $a^{2}+b^{2}=1234567 .$ Then, since $1234567 \equiv 3$ mod $4,$ we have $a^{2}+b^{2} \equiv$ 3 mod 4 giving the required contradiction. Hence such integers cannot exist.  I understand the solution but I don't know how the author decided to start with modulo 4 instead of something else? What is it about the expression $a^2+b^2=1234567$ that would trigger us to select modulo 4 instead of something else. I tried to solve the question in a similar manner using modulo 2 but eventually got stuck. This leads me to believe that this question can only be solved using modulo 4. Is this true?


I have a function that takes a long time to finish. How do I execute another function every X seconds while the long function is executed?  The script is using Python 3.4

I want to repeatedly execute a function in Python every 60 seconds forever (just like an  in Objective C). This code will run as a daemon and is effectively like calling the python script every minute using a cron, but without requiring that to be set up by the user.  In , the solution appears to effectively just  for x seconds. I don't need such advanced functionality so perhaps something like this would work  while True:     # Code executed here     time.sleep(60)   Are there any foreseeable problems with this code?


How can I randomize a numerical value for a node? Is there any one node, or combination of nodes that can achieve this effect?

Is it possible to generate a random number for use in the node editor?  I am aware of the Object Info node, but I want a random number which I have more control over. Ideally I could change it with some sort of "seed" vale and be able to define limits for maximum and minimum values.  How is this possible?


The  COVID outbreak resulted  and provides a unique opportunity to gain insight into epidemiology  dynamics.   Given the well documented CVN-71 context:    856 tested positive as of 24-April-2020   :     Roughly 60 percent of the over 600 sailors who tested positive so far   have not shown symptoms of COVID-19, the potentially lethal   respiratory disease caused by the coronavirus, the Navy says. The   service did not speculate about how many might later develop symptoms   or remain asymptomatic.   If a modified  Goal => Question => Feature was applied to the Roosevelt population, where the goal is to understand the correlation between patient feature and likelihood of asymptomatic infection, what would features would be of interest?  For example:   Gender Age  Race Blood type height & weight   Although features are appreciated, a narrative featuring a sound thought-process will be favored.

According to  , half of the   virus carriers show no symptoms.   What are the biological factors that determine whether an infected individual will be asymptomatic or not?


I need to find the taylor series of $$\log \frac{1-z^3}{1+z^2}$$ around $0$ and the radius of convergence. I wrote $\log((1-z^3)/(1+z^2))=\log(1-z^3)-\log(1+z^2)$ And then wrote the Taylor series for each term but I couldn't find a nice way to write this as 1 series. Any ideas?

Taylor series for $\ln(\frac{1-z^2}{1+z^3})$ I've tried to $$\ln(1-z^2)-\ln(1+z^3)=\sum (-1)^{3n-1}z^{2n}-\sum(-1)^{4n-1}z^{3n}$$ I didn't manage to make it one series any help is good


I have a Samsung Galaxy S5 with Android 5.0 and since about 2 weeks or so my Bluetooth keeps getting turned on.  Until now I only used Bluetooth for connecting with my Bluetooth speakers.  I already tried: rebooting the phone and checking for viruses with Kaspersky Mobile.  Maybe there's an app that shows me all apps that have the permission to turn on Bluetooth so that I can deinstall those to see if that helps? Or any idea what the issue could be here?

I recently got back from a holiday without internet, when I got back heaps of my apps updated and one of them now continuously turns my Bluetooth on. How can I determine which app it is?  I have a rooted Nexus 4 running 4.4.4


So, I preparing for this test and one of the questions is this.  The teacher remarked that they all had done it very badly.  Why is this sentence structure wrong? I found  that expands more on the position of the word all in a sentence.

"We are all mad." "We all are mad."   I think each of these conveys the same idea. Besides this, we can use "we are all" alone. I hear the first one more frequently.  Does the second one sound worse to a native speaker? I wonder about this.  Note: I'm not a native speaker.


Ok so I went to USA end of september and came back a few days ago. I had originally booked 3 weeks but extended my trip whilst I was there. I am  planning to return in February, exactly 2 months after coming back to the UK. I want to stay for just under the 90 days. I have no real ties to the UK that can be proved unless anyone can help me with things I could use. Family here apparently does not count. What are my chances of being sent back? I know its hard to answer that but I am getting more and more worried now.  Will this be ok? I know it says you can have as many visits as you like under the visa waiver program but it also says a reasonable length of time between visits. would two months be reasonable? I do not work I claim benefits in the UK so I would not be able to stay much longer than I plan to in the US. I can prove I have enough money to stay in the US without working. I would be staying with a friend. Would I be better off booking a shorter return trip of a couple of weeks and then paying to change my departure or because I did this before would that be a red flag? I just want some reassurance or advice really. Anybody else have experience with this?

I am a British citizen visiting the USA in early August for a two week vacation with friends. After the holiday I'm returning to my home in the UK for three weeks. After that I will return to the USA and will be working for my British employer under the Visa Waiver Program for a period of 80-85 days.  I have read already that there is technically no problems with this under ESTA rules, but should I limit this working period to a shorter time frame (e.g. 70 or so days) so that it does not negatively affect the decision made by the POE officer? Ideally I would love to be over in the states for the near-full 85 day period.  Any advice or previous experiences anyone can offer?  Some clarifications: As confirmed by the immigration attorney, as I am employed by my UK employer, it will be regarded as a business trip, the important part being that I will be working officially as a consultant for my UK employer just overseas for the allotted 85 or so days


I have a comment type named "reviews" (it happens to be a field in a node that's displayed alongside webform submissions).  I'm trying to differentiate between the add comment form and the edit comment form so I could, for example, alter the submit button text (value) on one but not the other.  I'm currently using HOOK_form_comment_form_alter(&$form, &$form_state)  In both cases (add and edit):   $form['form_id']['#id'] = edit-comment-reviews-form $form['#id'] = comment-form $form_state->getFormObject()->getOperation() = default   Is there anything in $form I'm missing?  Solution:  $entity = $form_state->getFormObject()->getEntity(); if ($entity->isNew()) {    ...

I want to know whether form is add/edit in hook_form_alter. In Drupal 7 we can get all these in hook_form_alter.  I tried like this in D7:  function MYMODULE_form_alter(&$form, &$form_state, $form_id) {   // Check pages(s) , don't use $_GET.     if (strpos($form['#action'], '/add/') !== FALSE) {       $page = 'add';     }     if (strpos($form['#action'], '/edit') !== FALSE) {       $page = 'edit';     } }   Here I am getting add/edit in D7. Whereas in D8 I am not getting any it in $form['#actions']. And i don't want to use $_GET. Is there any way to check add/edit page in hook_form_alter.


We have deck of cards (52 cards). 10 random cards will be picked. How many chances are there, that atleast 1 of the random cards is "ace".  At first I tried to calculate how many different possibilities are there to pull 10 random cards without any extra conditions. According to formula nCk= n! / k!(n-k)!: I got 52! / 10! * 42!  Next I tried to calculate how many possibilities are to pull 10 cards from deck, that does not contain any "aces" I got 48! / 10! * 38!  Then I could subtract second answer from first and I would be left over with answer. Since the numbers are too huge to try on calculator, I wondered if my solutions works.

If from a deck of 52 cards, I extract 10. In how many combinations do you get at least one ace?  I have come up with two possible answers, but I don't know which one is the right one and why.  So one is $$4{51 \choose 9}$$  the reasoning is that first I extract an ace from the four that there are, and then I have ${51 \choose 9}$ combinations for the other 9 cards.  The second is  $${52 \choose 10} - {48 \choose 10}$$  reasoning that there are ${52 \choose 10}$ total combinations of ten cards and I subtract ${48 \choose 10}$ combinations without any aces.  So from other questions it seems that the first one is the correct answer, but why would the second one be wrong?  Thanks for the answers.


One of my servers is unable to upgrade from Ubuntu 12.10 (Quantal Quetzal) to newer versions:  $ cat /etc/lsb-release DISTRIB_ID=Ubuntu DISTRIB_RELEASE=12.10 DISTRIB_CODENAME=quantal DISTRIB_DESCRIPTION="Ubuntu 12.10"  $ cat /etc/update-manager/release-upgrades | grep -v '^$\|^\s*\#' [DEFAULT] Prompt=normal   (also tried with Prompt=lts)  $sudo apt-get update ...  $sudo apt-get dist-upgrade Reading package lists... Done Building dependency tree Reading state information... Done Calculating upgrade... Done 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.  $ sudo do-release-upgrade -d Checking for a new ubuntu release No new release found   Tried to change servers to http://old-releases.ubuntu.com (got from ), and from digitalOcean but result is the same.  Eventually I upgraded this server using the following steps:   Backup /etc/apt/sources.list file Changed original servers to  Changed all quantal to raring in /etc/apt/sources.list file Updated package lists (apt-get update) Updated packages (apt-get dist-upgrade) - everything completed smoothly Rebooted server Checked for new distribution (sudo do-release-upgrade -d) - still not found Changed raring to saucy  in /etc/apt/sources.list file Repeated steps 4-7 with same results Restored backed-up /etc/apt/sources.list file Changed saucy to trusty  in /etc/apt/sources.list file Repeated steps 4-7 with same results   Now I have Ubuntu 14.04 LTS (Trusty Tahr) release. It is OK until 2019-04, but it still cannot find upgrades.  Is there a way to restore the ability of an Ubuntu distribution to upgrade using the do-release-upgrade script?  Command line solution is highly preferred.

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


This is a followup to . It's well known that Cauchy's functional equation, $$f(x+y) = f(x) + f(y)\text,$$ has discontinuous solutions. In fact, any discontinuous solution is discontinuous everywhere (except perhaps 0). Now let's consider the functional equation $$f\left(a^b\right) = f(a)^{f(b)}\text.$$ For simplicity we will restrict the domain to $\mathbb{R}_{\ge 0}$. We have seen in the original question that the only continuous solutions are trivial. However, we have not explored what discontinuous solutions there are. Let $$U = \{a \in \mathbb{R}_{\ge 0} | f(a) \not\in \{0, 1\}\}\text.$$ One property of any discontinuous solution is that, because $$f\left(a^{1+\mathrm{d}x}\right) = f(a)^{f(1+\mathrm{d}x)}$$ for all $a \in U$, continuity at any such $a$ is equivalent to continuity at 1. Therefore any solution that is discontinuous anywhere on $U$ is discontinuous everywhere on $U$. However, this property does not obviously prove or disprove the existence of such functions, not to mention provide us with an example of one if they exist. So the questions are: are there discontinuous solutions, how are they characterized, and what is a canonical example of one?

Consider the functional equation problem $$ f : \mathbb R \to \mathbb R \text , $$ $$ f \left( a ^ b \right) = f ( a) ^ { f ( b ) } \text , $$ when $ a , b \in \mathbb R $, $ a , b \ge 0 $. So far the only solution I have is the trivial $$ f ( x ) = x \text . $$ Does there exist any other possible solution? Even if the $ f $ doesn't have a closed form in terms of elementary functions, is there some way I could derive a series or an alternative expression for it? I tried to get a little more creative: $$ f ( w ) = f \left( w ^ { \frac 1 w } \right) ^ { f ( w ) } \text , $$ which nests deep into $$ f ( w ) = f \left( w ^ { \frac 1 w } \right) ^ { f \left( w ^ { \frac 1 w } \right) ^ { f \left( w ^ { \frac 1 w } \right) ^ \vdots } } \text , $$ which is equivalent to $$ \ln \big( f ( w ) \big) = \ln \bigg( f \left( w ^ { \frac 1 w } \right) \bigg) f ( w ) \text . $$ I was hoping to generate some sort of series using this.


I have this HD partition.    I want to know:   If it is normal to have two consecutive "Unallocated" space? What sense does it?  You can see I have two:   162.35GB The Right Side of the first Unallocated. (Narrow)    I have another Disk without this LAST Free Space (Unallocated)!!!   I'm NOT asking -how merge consecutive partition?-, I asking if is normal have two consecutive "Unallocated" spaces in HD (is different question).  This  is not answer for my question...

I have got a new laptop with Windows 7. It has a 500gb HDD and it is partitioned to 3 volumes. Now I want to install Windows 8 in it. I shrunk 2 volumes (D: & E:) to get the enough space for installing Windows 8, but I have got two different unallocated spaces.  I want to merge those two unallocated spaces. How can I do that?  I did not find any option to merge them.  Volume  Volume Before Shrunk  Amount Shrunk  Unallocated space   D       132GB                 32GB           32GB   E       132GB                 32GB           32GB   How can I merge these two unallocated spaces to install Windows 8 in that combined space?


I worked part time for a corporate company that never paid me. I received a W-2. Who do I contact? I tried to reach the manager but he won't return my calls.

I just now received a W-2 from a company that I worked for 3 days as a contractor. I had to leave country for 2 months due to a family emergency. Since the employment duration was very short, I was not paid. I was told that they don't want to charge the client because 3 days is not enough contribution.  Since I had to leave country the same day, I did not argue with them and told it's okay if they feel right.  Now I have a W-2 from them saying they have paid me about $1500. I contacted them but I have not received any reply yet.  I just want to be prepared. What can I do here?


I am trying to write a simple code to understand volatile keyword in java.   The idea is to increment the value of count field of Runner class using two threads. Helper class implements Runnable where run method increments the count which both static and volatile.          class Helper implements Runnable{              @Override             public void run() {                  for(int i=0; i<100000;i++){                              Runner.count+=1;                 }              }         }           public class Runner {              public static volatile long count=0; // to be incremented              public static void main(String[] args){                  Thread t1 = new Thread( new Helper());                  Thread t2 = new Thread( new Helper());                  t1.start();                 t2.start();                  try {                     t1.join();                     t2.join();                 } catch (InterruptedException e) {                     e.printStackTrace();                 }                  System.out.println("Count= "+count); // output expected to be 200000             }          }      The expected output for every run is Count= 200000 , but sometimes i get a different number.   Please help me understand how is that possible

At work today, I came across the volatile keyword in Java. Not being very familiar with it, I found . Given the detail in which that article explains the keyword in question, do you ever use it or could you ever see a case in which you could use this keyword in the correct manner?


$$I_{n}=\int x^n(1-x^2)^{\frac{1}{2}} dx$$ Show that  $$(n+2)I_{n}=(n-1)I_{n-2}-x^{n-1}(1-x^2)^{\frac{3}{2}}$$  I can't seem to get this answer. Can someone please explain how to get to this?   Thanks in advance.


How to install Microsoft fonts on Ubuntu 16.10? I tried with $ sudo apt install ttf-mscorefonts-installer but unsuccessfully. Here is the screenshot:  $ sudo apt install ttf-mscorefonts-installer ... Reading package lists... Done Building dependency tree        Reading state information... Done The following packages were automatically installed and are no longer required:   libc++1 libjemalloc1 linux-headers-4.8.0-26 linux-headers-4.8.0-26-generic   linux-headers-4.8.0-27 linux-headers-4.8.0-27-generic   linux-image-4.8.0-26-generic linux-image-4.8.0-27-generic   linux-image-extra-4.8.0-26-generic linux-image-extra-4.8.0-27-generic   linux-signed-image-4.8.0-26-generic linux-signed-image-4.8.0-27-generic Use 'sudo apt autoremove' to remove them. The following additional packages will be installed:   cabextract libmspack0 The following NEW packages will be installed:   cabextract libmspack0 ttf-mscorefonts-installer 0 upgraded, 3 newly installed, 0 to remove and 86 not upgraded. Need to get 89,2 kB of archives. After this operation, 362 kB of additional disk space will be used. Do you want to continue? [Y/n] y Get:1 http://nl.archive.ubuntu.com/ubuntu yakkety/main amd64 libmspack0 amd64 0.5-1 [38,2 kB] Get:2 http://nl.archive.ubuntu.com/ubuntu yakkety/universe amd64 cabextract amd64 1.6-1 [21,4 kB] Get:3 http://nl.archive.ubuntu.com/ubuntu yakkety/multiverse amd64 ttf-mscorefonts-installer all 3.4+nmu1ubuntu2 [29,5 kB] Fetched 89,2 kB in 0s (577 kB/s)                    Preconfiguring packages ... Selecting previously unselected package libmspack0:amd64. (Reading database ... 321446 files and directories currently installed.) Preparing to unpack .../0-libmspack0_0.5-1_amd64.deb ... Unpacking libmspack0:amd64 (0.5-1) ... Selecting previously unselected package cabextract. Preparing to unpack .../1-cabextract_1.6-1_amd64.deb ... Unpacking cabextract (1.6-1) ... Selecting previously unselected package ttf-mscorefonts-installer. Preparing to unpack .../2-ttf-mscorefonts-installer_3.4+nmu1ubuntu2_all.deb ... Unpacking ttf-mscorefonts-installer (3.4+nmu1ubuntu2) ... Setting up libmspack0:amd64 (0.5-1) ... Processing triggers for update-notifier-common (3.175) ... ttf-mscorefonts-installer: processing... ttf-mscorefonts-installer: downloading http://downloads.sourceforge.net/corefonts/andale32.exe Err:1 http://downloads.sourceforge.net/corefonts/andale32.exe   404  Not Found W: Can't drop privileges for downloading as file '/var/lib/update-notifier/package-data-downloads/partial/andale32.exe' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) E: Failed to fetch https://downloads.sourceforge.net/project/corefonts/the?download&failedmirror=heanet.dl.sourceforge.net  404  Not Found E: Download Failed Setting up cabextract (1.6-1) ... Processing triggers for man-db (2.7.5-1) ... Setting up ttf-mscorefonts-installer (3.4+nmu1ubuntu2) ... Processing triggers for fontconfig (2.11.94-0ubuntu2) ... Processing triggers for libc-bin (2.24-3ubuntu1) ...

I have been receiving notifications about "failure to download extra data files" from update notifier. It asked me to download fonts in request from the ttf-mscorefonts-installer package. However, whenever I click on the "run this action now", a window pop up (see figure below) and it never got downloaded.     It keeps "waiting for headers" until timeout. Same thing will happen if I use the wget in terminal to download the package:  wget downloads.sourceforge.net/corefonts/andale32.exe --2016-05-02 11:57:32--  http://downloads.sourceforge.net/corefonts/andale32.exe Resolving downloads.sourceforge.net (downloads.sourceforge.net)... 216.34.181.59 Connecting to downloads.sourceforge.net (downloads.sourceforge.net)|216.34.181.59|:80... connected. HTTP request sent, awaiting response...    It will fail again.   I have noticed similar issues like , but the known solutions never worked on me. The wired thing is that I can download the font package from a browser like Chrome, and run the following command to fix the font problem:  sudo dpkg-reconfigure ttf-mscorefonts-installer   with the fonts folder directed. But my question is do I have any problem with my package-data-downloader and terminal configuration? The sudo apt-get update command can run with a few errors and warning showing that but generally it can download data from internet. It only fails when the terminal connect to sourceforge or maybe similar websites.   Hopefully you have some idea on how to make the download from terminal work for all cases. Let me know what else information I can provide. Thanks!


I am using ie 11. I am adding a row to a table. I am using a modal popup to enter the data and I am making an AJAX call to update the underlying data. When that is done, I am using JQuery to add the row to the table. This all works fine except for one thing. The end of the tablerow contains a button. All the other buttons on the table work, but the new button does not. When I look in developer tools the button for the new row has the same mark up as the mark up for the others, so it should work in the same way. So the table looks this;

                     Survey	                     Contract	                     Select

                 @foreach (var contract in                     SessionObjectsMSurvey.ContractList.Where(x => x.SurveyId > 0)                                         .OrderByDescending(x => x.SurveyCreated))                 {
                         @contract.SurveyTitle	                         @contract.ContractTitle	                                                      <button class="btn btn-xs btn-primary selectContract"                                     data-msurvey-row-id="@contract.RowId">                                 Select                             </button>
                 }

   I add the row of data here. Notice the button has a class of selectContract. This works  var addRowToTable = function (data) {     var row =     '
' +         '{{surveyTitle}}	' +         '{{contractTitle}}	' +         '' +         '<button class="btn btn-xs btn-primary selectContract" data-msurvey-row-id="{{rowId}}">Select</button>' +         '	' +     '
';       //Add row     $('#surveyList').prepend(row.compose({         'surveyTitle': data.SurveyTitle,         'contractTitle': data.ContractTitle,         'rowId': data.RowId     })); };   And this is the click event which usually works but not for the new row. The button on the new row does fire an event, I do not know where the event handler is, it should be this one but it isn't;  $(".selectContract").on("click", function (e) {     e.preventDefault();     var $this = $(this);     var rowId = $this.data("msurvey-row-id");     var url = GetHiddenField("msurvey-get-contract-and-survey-url");     dataService.getContractAndSurvey(rowId, displayContractInfo, url); });

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


I am running Ubuntu 16.04 on my desktop.I use my smartphone as a wifi hotspot in case my Wired Broadband goes down or becomes unusable, So i thought of buying a usb wifi adapter and bought a TENDA TEW311MI Wireless N150 USB Adapter Nano from Amazon since it was the only one that said will support Linux OS and it did But after a few days it died,I have heard such instances with USB Adapter are a common thing,So i am thinking of getting a PCI Card for this,But i am not sure which of those supports Linux,So please guide me in this search with your knowledge and i prefer a card in the budget range. Thank you. Rahul

I need a PCI wireless adapter that works well with Ubuntu 12.04. I have looked around on the web but a lot of the information is out-of-date or confusing. Could someone point me to a wireless PCI adapter on Newegg or Amazon that they know works well with Ubuntu 12.04? I would really appreciate it.


I am currently an Australian studying at ANU. I have worked as a tutor for about a year and now I am about to apply for a Ph.D. program in the states. Since the US uses TA (teaching assistant) instead of tutor (at least my institution uses this term.) When listing my teaching experience, shall I use TA or tutor as a title? Are they the same thing?  I run labs or tutorials, I mark exams and assignments and so on.)

It seems to me that the terms "Teaching Assistant" and "Instructor" refer to a variety of positions. At some places, a teaching assistant is responsible for things like helping the actual lecturer by handing out papers, grading homework, etc., and instructors hold recitation sessions.  At other places, I saw the term "instructor" referring to the lecturer giving the course, while a teaching assistant is the person doing anything else (recitations, grading etc.).  Is there some widely accepted definition of the two positions?  For context: The question arose because I wasn't sure whether I'm using the correct terms in my CV -- I am a math graduate student, and I would like to make a distinction between jobs in which I only graded course assignments/final exams, and courses in which I held recitation classes* (and also participated in grading the final exams). Is it OK to use "Instructor" for the latter? What should the former be referred to as?  *In the course I'm currently teaching, the recitations are planned and written by the ones giving them (without the professors' supervision). Also, the people giving the recitations are not necessarily grad students (some already hold a PhD). I'm elaborating on that because from what I've seen, some of it could be relevant for the definition of the job.


Before the official release of Windows 10 there seems to have been an option (on the "Taskbar and start menu properties" navigation tab) to uncheck When I sign in or close all apps on a screen, go to the desktop instead of Start in order to use the Start Screen "instead" of the desktop.  Is there any way to do that in Windows 10 today?

I was skeptical about the modern-UI interface in Windows 8 (and 8.1), having been a Windows 7 user for a while, but slowly got used to it.  My laptop got the upgrade to Windows 10 yesterday that I had reserved a while back; the upgrade process was fast and overall Windows 10 runs far better than Windows 8 did on my laptop.  The only thing wrong with it (in my opinion) is that the start menu has changed again:    It's nice to use on a desktop, but as my laptop is touch-screen, I find it somewhat annoying to use. I know that the start menu in Windows 10 is still touch-oriented, but it's still annoying as I had got used to the start screen in Windows 8.  Is it possible to change back to the start-screen that was in Windows 8?


Should adjectival phrases that are hyphenated when they modify a noun, e.g. a case-sensitive password, be hyphenated when they are predicate adjectives, e.g. The password is case-sensitive?

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


Note that I am asking what it should be, not how it works, and not how people feel about it.  It’s all too obvious how people feel about it.   sounds like a duplicate, but it didn’t get answered there.  I thought I read somewhere that it was to make it easier to find better questions and better answers.  Yet I see numerous complaints, even some whin(g)ing, about losing points or not getting them, with words like “penalized” or “punished.”  (I’m not talking about the far fewer curious questions trying to understand an anonymous unexplained downvote.)  So which is it?  A tool to gauge quality/improve the community, or a competition between rivals?

Simple question.   SO had turned me into a better developer by far, I like to browse questions that strike my interest and curiosity and just read through the answers. I never fail to learn something new everyday, whether it's something trivial or something much more complex.  When I receive reputation it means a lot to me, almost a self achievement of sorts. Something I can show to someone to prove my "worth". I think it works for me as a great confidence booster, also its something I can show my friends who don't understand what I do.   It almost feels like I can finally have something to back me up if need to be.  So the question is what does YOUR reputation mean to YOU? Is it simply a number, is it a score as if you're playing a game, or does it help you mentally achieve your goals and improve yourself like it does for me.


The official Android app is giving me old push notifications. That's also in opposite order, meaning most recent one was pushed first. I am getting push messages every few minutes.

Version of the app: 1.0.51. (It is up to date at the time of writing according to Google Play.)  This started happening after the network problem that happened earlier this morning. Both my tablet and my phone are popping up notifications for events (comments, and probably edits too) that happened prior to the network issue. I had received notifications for these events already and had already cleared them before the network issue happened.  The repeated notifications do not show up in the bar displayed at the top of the Stack Exchange sites. In other words, I get notified again in Android but do not get notified again on the SE web sites.


I am quite new to Arcgis and I am wondering how I can categorize values in a table based on their distance values. For example, I have a table with INPUT_FID and distance values (ignore everything else). I created a new field and I want to categorize each INPUT_FID based on their distances in that new field (A if distance is less than 200, B if distance is more than 200).

I have added a new field (Category) in an attribute table of a shapefile and I would like to fill it with numbers, 0 or 1, based on the numbers of another field (Calorific value) of the same attribute table.   That means that if the Calorific value is higher than 15, then I would like to fill in the corresponding cells of the (new) Category field with 1. If the Calorific value is less than 15, then the rest cells of the (new) Category field to be filled in with the number 0.   Is there a way to do this automatically rather than manually?


I want do draw a line from one point to another using the blender opengl functions provided in bgl. Both points are in world coordinate system. I found a function in bpy_extras.object_utils called world_to_camera_view which needs a scene, a camera and a Vector of the point as a parameter.  I can get the scene from   bpy.context.scene   but how do I get the viewport camera?   Background: What I want to do is, to write a modal operator which lets the user move, rotate and zoom the camera in the viewport and the lines between the points in the viewport are drawn correctly. Its just an operator to learn drawing with bgl.

I could just use:  obj_camera = bpy.data.objects["Camera"]   to get the camera, but it is possible to have a scene with multiple cameras.  So if that is the case, how can I choose the active one?


On a Polish website where the title and content of the "Services" page is all in Polish, should I use an English permalink (www.example.com/services) instead of a Polish permalink (www.example.com/usługi) for better SEO?

What is the best practice when translating a site to Chinese, go with URLs in Chinese or English?      Could you please share the reason why?


I have a udev rule that will run a shell script to create a directory and mount a device in read-only mode. The problem is that when the rule runs (when I insert the device), it creates the directory but doesn't mount the device. Naturally, something must be wrong with the script then. However, I can run the script (I insert the device, delete the directory that is created by the udev rule manually, then run the script manually as well) and it creates the directory and mounts the device just fine. Relevant section of udev rule (filename = '10-magicusb.rules'): ENV{MYMOUNT}=="1", RUN+="/etc/udev/scripts/romount.sh"  romount.sh: #!/bin/bash mkdir /media/sdb1 /bin/mount /dev/sdb1 -o ro,noatime /media/sdb1  Technically the device name comes from further up in the udev rule (its not hardcoded, trust me). I run a script that creates romount.sh and I pass that script the device with %k. However, that shouldn't be related since the script runs from udev, but stops halfway through execution. My guess is there is some timing issue going on here. When the rule runs, for some reason it cannot mount the device, but when I do it later manually the system has had time to sort things out I guess. I added a sleep 10 to the top of the bash script to no avail. Thank you in advance. EDIT 1 Based on what David G. has posted, I did some testing with the improved script so now romount.sh looks like this: #!/bin/bash mkdir /media/sdb1 (     echo 'before while iteration' > /etc/udev/scripts/iteration.txt     while [[ ! -b /dev/sdb1 ]]     do         sleep 1         echo 'iteration performed' > /etc/udev/scripts/iteration.txt     done     /bin/mount /dev/sdb1 -o ro,noatime /media/sdb1 ) &  and the resulting iteration.txt file has: before while iteration only. Which means the condition for the while loop is never triggered. This means the device node is available at time of execution, right? EDIT 2 I finally got it to work with the second answer here:  Adding PrivateMounts=No to the systemd-udevd.service worked for me.

I have the following content in in /etc/udev/rules.d/81-external-disk.rules:  ENV{ID_FS_UUID}=="6826692e-79f4-4423-8467-cef4d5e840c5", RUN{program}+="/bin/mount -o nofail,x-systemd.device-timeout=1 -t ext4 -U 6826692e-79f4-4423-8467-cef4d5e840c5 /backup/external"   After running:  udevadm control --reload ; udevadm trigger /dev/sdb1   It does nothing at all. However if II change the mount command for something such as /bin/touch /tmp/xyz it works.  Versions:  [root@helsinki rules.d]# rpm -qa | grep udev libgudev1-219-19.el7_2.12.x86_64 python-pyudev-0.15-7.el7_2.1.noarch [root@helsinki rules.d]# rpm -qa | grep systemd systemd-libs-219-19.el7_2.12.x86_64 systemd-219-19.el7_2.12.x86_64 systemd-sysv-219-19.el7_2.12.x86_64 [root@helsinki rules.d]# cat /etc/redhat-release  CentOS Linux release 7.2.1511 (Core)


I understand the axioms defined on the set of natural numbers that $m+0:=m$ and that $m+n’:=(m+n)’$. Where does the commutativity come into this?

the background I'm allowed to deal with to solve this problem is as follows:  Definition of +: \begin{equation} m+0=m\quad \text{for all}\quad m \in \mathbb{N} \\ m+(k+1) = (m+k)+1  \end{equation} in conjunction with the induction property of $\mathbb{N}$. In a previous task I showed that $ 0+m=m \quad \forall \, m \in \mathbb{N}$.  Task: Prove $m+n=n+m$ by induction on $n$.  Now, it follows directly that $0+m=m=m+0$. With the assumption that $k+m=m+k$ for a $k\in\mathbb{N}$, it can be deduced: \begin{eqnarray} m+(k+1) & = & (m+k)+1\quad \text{by def. of}+\\ & = & (k+m) + 1\quad \text{with assumption}\\ & = & k + (m+1)\quad \text{by def. of}+. \end{eqnarray} Here, it looks to me that the true base step would be $m+1 = 1+m$, because then it would be possible to bring the proof straight to an end. But I tried hard to hack this last nut without any results. Is there anybody who could help me with this? Or maybe there is a completely different way to come up with the proof requested?  Thanks in advance for your help


I think that it's a correct statement and that it can be proven by negation, but I'm having difficulty doing so, any help will be appreciated.

I have to solve following problem     If $\Re (f)$ is bounded above or below for a function $f$ holomorphic on $\mathbb{C}$ then $f$ is constant.   My attempt: If there is $M$ such that $\Re(f) \le M$, then $\|e^{f}\|=e^{\Re(f)}\le e^{M}$. From Liouville's theorem the entire function $e^f$ is constant, that is $0=(e^f)'=f' e^f$. This means $f' =0$, so $f$ is constant. If $\Re(f)$ is bounded below, we consider $e^{-f}$ and proceed the same way.  Am I correct? Is there a solution using maximum modulus principle?


It is well known that if $X$ is compact every continuous map from a compact space to a Hausdorff space is closed. I know general compact space is not characterized by "every continuous map to a Haudorff space is closed" by . But is it true if we assume $X$ to be normal?

Suppose a $T_4$ space $X$ satisfies a property that every continuous map $f$ from $X$ to any Hausdorff space $Y$ is a closed map. Show that $X$ is compact. What I am thinking is to let $\mathcal{U}$ be an open cover of $X$ and find a way to choose finite open sets from $\mathcal{U}$ that can cover $X$ again. Do we need to define a suitable continuous map by ourselves and use the fact that it is a closed map to choose suitable open sets from $\mathcal{U}$? I have tried to define a continuous map $f \colon X \to Y$ as mapping different open sets from $\mathcal{U}$ to different points in $Y$. However, different open sets from $\mathcal{U}$ may intersect with each other and hence $f$ may not be well-defined. Apart form that, I have no idea about how to choose suitable $f$ and $Y$. Can someone help me please? Edit 1: I am trying to apply the Urysohn Lemma or the Tietz Extension Theorem due to the normality of $X$. But still have no idea. Edit 2: Finally found a way to prove without using compactification. I will post the proof when I’m free. Hint: Use Urysohn Lemma and Tychonoff Theorem.


I have a simple table like:  \documentclass[varwidth]{standalone} \usepackage[table]{xcolor} \usepackage[english]{babel} \usepackage{multirow}  \begin{document}     \begin{center}         \renewcommand{\arraystretch}{1.9}         \begin{tabular}{cc}             \cellcolor[rgb]{0.0,0.5,1.0}Unsolvability & \multirow{2}{*}{ \cellcolor[rgb]{0.91,0.91,0.91}Chapter 7}\\             \cellcolor[rgb]{0.0,0.5,1.0}Relaxation & \cellcolor[rgb]{0.91,0.91,0.91}\\         \end{tabular}     \end{center} \end{document}   But the output is not what I exactly wants since the background color covers the cell's text.    How should I fix this?

I am trying to color a multirow in my table, but without success until now: \documentclass{scrartcl} \usepackage[utf8]{inputenc} \usepackage{multirow} \usepackage{hhline} \usepackage{colortbl} \usepackage{multicol} \begin{document} \begin{table} \begin{tabular}{|l|c|c|c|c|} \hline \multicolumn{5}{|c|}{Type} \\ \hline   & A  &    B & C & D \\     \hline     X & 53,2\%  &   51,6\%  &  \multirow{2}{*}{\cellcolor[gray]{.9}49\%} & \multirow{2}{*}{\cellcolor[gray]{0.9}49\% }\\     Y  & 53,8\%  &  52,2\%  &  & \\ \hline \end{tabular} \end{table} \end{document}   What should I do, so that the two last multirow-cells get completely grey-colored?


We have recently built a new house in an existing subdivision.  I am registered with 911 and receiving mail at this address.  Street is not currently shown on Google maps.  How do I add my location to Google Maps so deliveries can find me.  I am also having problems with changing my address (getting invalid address messages) ... apparently since it does not currently show up in Google Maps.

When I search for my address on Google Maps it cannot be found which means I can't order takeaway etc.  Is there a way of adding my address to Google Maps or even add a street address?  I want the address to be publicly available so others can search it.


I am trying to find the best way to configure a new version of python in my computer (windows) so that I do not have any problem with the python version that I have with ArcGIS. Is there anyway to have two versions of python and install/run anything on version 2 (say version 1 is my ArcGIS version)without having a conflict? I had to reinstall ArcGIS before due to this conflict. I am a beginner in programming and so please be patient if I am not making sense here.

I am writing a VB.net console application that calls ArcGIS Desktop 10.1 ArcToolbox geoprocessing tools from my code. Some of these tools use Python syntax and  that I suspect is caused by conflicting architectures. Is there a way to control which version of Python that ArcGIS uses?    System: 64 bit Windows 8.1 ArcGIS: 32 bit ArcGIS 10.1 Service Pack 1 Python: Both 32 and 64 bit versions installed (latter from ESRI's background processing download) My App: 32 bit VB.net (not Any CPU) console application.


I accidentally spilled some oil on the stove which seeped down below the top.  The oil is now in the insulating blanket that surrounds the oven and caught fire while a burner was on.  Can I buy new insulating material, cut out this patch and replace it?  Any help appreciated.  edit:  can I use this product to patch it?

We've had mice work their way into the oven insulation of our standalone range and now it stinks when we turn the oven on.  Looking around on the web suggests that replacing the oven is the most common solution, but that seems extreme!  Any suggestions?  (In this case the oven is a "Viking Professional" (bottom of the line) 4 burner + oven freestanding range. I haven't yet been able to pull it out enough to check if it has removable panels or been able to find a manual online.)  I'm guessing the answer will be something like:   locate the manual for your appliance remove access panels remove insulation while being careful about ?? remove insulation that is "stuck" by doing ?? replace with new insulation from ?? put it all back together and test as follows in general be careful of ??   And, perhaps this is too specific to the brand of appliance? It would be useful to know which brands are more amenable to DIY repairs of this type than others.


I have successfully found out how to add space between entries in the list of contents, but how can I make it work with the lists of figures ad tables?    \documentclass{report} \usepackage[a4paper,bindingoffset=0.5cm, left=2.6cm,right=2.6cm,top=2.6cm,bottom=3cm, footskip=.67cm]{geometry}  \usepackage{etoolbox} \preto\chapter{%     \ifnum\value{chapter}=0\addtocontents{toc}{\vskip0.1pt}\fi     }  %\preto\figure{% %   \ifnum\value{figure}=0\addtocontents{lof}{\vskip10pt}\fi %} \usepackage{longtable} \usepackage{graphicx} \usepackage{float}  \begin{document}  \tableofcontents  \begingroup \let\cleardoublepage\relax \let\clearpage\relax \listoffigures \listoftables \endgroup  \section{Prologue} \section{Acknowledgements} \section{Abstract} \section{Introduction}  \begin{figure}[H]     \centering     \includegraphics[scale=0.5]{gfx/no-cloud}     \caption{There is no cloud} \end{figure}  \section{Theoretical framework}  \begin{figure}[H]     \centering     \includegraphics[scale=0.7]{gfx/lb-stick}     \caption{Libreboot sticker} \end{figure}  \begin{figure}[H]     \centering     \includegraphics[scale=0.6]{gfx/Trisquel}     \caption{Fully free GNU/linux} \end{figure}  \begin{figure}[H]     \centering     \includegraphics[scale=0.6]{gfx/TEX}     \caption{tex.stackexchange.com} \end{figure}   \setcounter{table}{0} \begin{longtable}[H]{c c}     Q & A  \\     \hline     ? & !\\     \caption{Q\&A} \end{longtable}   \begin{longtable}[H]{l r}     1& 2\\     \caption{Numbers} \end{longtable}  \end{document}   ----------  \documentclass{report} \usepackage[a4paper,bindingoffset=0.5cm, left=2.6cm,right=2.6cm,top=2.6cm,bottom=3cm, footskip=.67cm]{geometry}  \usepackage{etoolbox} \preto\chapter{%     \ifnum\value{chapter}=0\addtocontents{toc}{\vskip0.1pt}\fi     }  %\preto\figure{% %   \ifnum\value{figure}=0\addtocontents{lof}{\vskip10pt}\fi %} \usepackage{longtable} \usepackage{graphicx} \usepackage{float}  \begin{document}  \tableofcontents  \begingroup \let\cleardoublepage\relax \let\clearpage\relax \listoffigures \listoftables \endgroup  \section{Prologue} \section{Acknowledgements} \section{Abstract} \section{Introduction}  \begin{figure}[H]     \centering     \includegraphics[scale=0.5]{gfx/no-cloud}     \caption{There is no cloud} \end{figure}  \section{Theoretical framework}  \begin{figure}[H]     \centering     \includegraphics[scale=0.7]{gfx/lb-stick}     \caption{Libreboot sticker} \end{figure}  \begin{figure}[H]     \centering     \includegraphics[scale=0.6]{gfx/Trisquel}     \caption{Fully free GNU/linux} \end{figure}  \begin{figure}[H]     \centering     \includegraphics[scale=0.6]{gfx/TEX}     \caption{tex.stackexchange.com} \end{figure}   \setcounter{table}{0} \begin{longtable}[H]{c c}     Q & A  \\     \hline     ? & !\\     \caption{Q\&A} \end{longtable}   \begin{longtable}[H]{l r}     1& 2\\     \caption{Numbers} \end{longtable}  \end{document}

I am trying to adjust spacing between entries in LoF and LoT. My code is  \documentclass[11pt,a4paper]{book} \usepackage[english,greek]{babel} \setcounter{secnumdepth}{3} \usepackage[iso-8859-7]{inputenc} \usepackage{kerkis} \usepackage[pdftex]{graphicx} \usepackage[margin=2.8cm]{geometry} \usepackage[Glenn]{fncychap} \usepackage{fancyhdr} %!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! \usepackage{tocloft} \setlength\cftparskip{-15pt}%For ToC works great \setlength\cftbeforesecskip{-8pt}%For ToC works great \setlength\cftbeforesubsecskip{-5pt}%For ToC works great \setlength\cftbeforechapskip{-1pt}%For ToC works great \setlength\cftaftertoctitleskip{-50pt}%For ToC works great  % I also tried \renewcommand instead of \setlength \setlength\cftbeforeloftitleskip{-2cm}%It has no effect in LoF \setlength\cftbeforelottitleskip{-5cm}%It has no effect inLoT  \makeatletter \newcommand*{\tocwithouttitle}{\@starttoc{toc}} \makeatother %-------------------------------------------------------------------------------- \makeatletter \newcommand*{\lofwithouttitle}{\@starttoc{lof}} \makeatother %-------------------------------------------------------------------------------- \makeatletter \newcommand*{\lotwithouttitle}{\@starttoc{lot}} \makeatother %-------------------------------------------------------------------------------- %!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! \renewcommand{\cftsecleader}{\cftdotfill{\cftdotsep}}  \begin{document}  %~~~~~~~~~~~~~~~~~~~~~~~Front-Page~~~~~~~~~~~~~~~~~~~~~~~~~~ \begin{titlepage} Εξώφυλλο \end{titlepage}  \chapter*{\contentsname} \markboth{\MakeUppercase{\contentsname}}{\MakeUppercase{\contentsname}} \tocwithouttitle \addcontentsline{toc}{chapter}{Πειρεχόμενα}  %LoF \chapter*{Κατάλογος σχημάτων}%List of Figures \markboth{\MakeUppercase{Κατάλογος Σχημάτων}}{\MakeUppercase{Κατάλογος Σχημάτων}} %\renewcommand\cftbeforeloftitleskip{5pt} %\renewcommand\cftbeforelottitleskip{5pt} \lofwithouttitle %\setlength\cftbeforefigskip{0pt} \addcontentsline{toc}{chapter}{Κατάλογος Σχημάτων}  %LoT \newpage  \chapter*{Κατάλογος Πινάκων} \markboth{\MakeUppercase{Κατάλογος Πινάκων}}{\MakeUppercase{Κατάλογος Πινάκων}} \lotwithouttitle %\renewcommand\cftbeforeloftitleskip{5pt} %\renewcommand\cftbeforelottitleskip{5pt} \addcontentsline{toc}{chapter}{Κατάλογος Πινάκων}  \newpage \end{document}   While some code is working on ToC(See comments in Preamble) I cannot adjust spacing in LoF/LoT. How can this be achieved?


Hey guys im a window user and I just installed ubuntu into my lowspec laptop.  During the installation it was stucked in a place where it says "retrieving files 92 out of 123".  I restarted my laptop and put it back on installing again but same issue appeared.  Then I saw a skip button after pressing that everything went running again and after it got installed now I'm facing issues with installing anything from both the terminal or the software center, it says      unable to install "application name"   and after watching few tutorial from youtube things got worst: now it says something like   "E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.    Kindly help get rid of this problem thank you!

I was running an upgrade with the apt-get command, and it was taking an exceptionally long time because half way through my ISP hit me in the face with their fair usage policy.   After sitting outside & watching the rain for awhile my electronics regained consciousness, so I went back to complete the upgrade and my terminal scolds me with   "E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem."   The last bit of legible info was all this:  Installing (ri/RDoc) documention for (stuff and such) ERROR:  Could not find a valid gem 'watobo-0.9.8.724.gem' (>= 0) in any repository rm: cannot remove `watobo-0.9.8.724.gem': No such file or directory  Setting up metasploit (4.3.0-bt1) ... Upgrading Pre-Existing Installation... /opt/metasploit/postgresql/scripts/ctl.sh : postgresql  (pid 1191) already running prosvc is running metasploit is running [*] [*] Attempting to update the Metasploit Framework... [*]   So on it goes for miles, talking about gem caches, rubies, & stuff I wish I had. All up until:  A    lib/gemcache/ruby/1.9.1/gems/state_machine-1.1.2/gemfiles/active_record-2.1.2.gemfile.lock   ...and there it has sat, all night.    If I stop it, will I still get the dpkg error (on the off chance that I won't), or if so what do I need to to resume using apt-get commands and its Super Cow Powers?


In my thesis (my first real project with LaTeX), I need Japanese and some Russian characters. I divided my thesis by submodules. My main module looks as follows:   \documentclass[11pt]{article}   \usepackage{amsmath}  \usepackage{amssymb}  \usepackage{graphicx}  \usepackage[utf8]{inputenc}  \usepackage[T1]{fontenc}  \usepackage{CJK}   \includeonly{spis_tresci}   \begin{document}   % Definition of title and author  \title{ My Thesis title. }  \author{Mazeryt Freager \\  \\  \begin{CJK*}{UTF8}{min}   一部の日本人のもの  \end{CJK*}  \\ śćóœ}  \maketitle   \clearpage    \input{Table_of_Contents}   \end{document}   And the above code works perfectly. The problem is in submodule "Table of Contents"   \section{Table_of_Contents}   %When I add here something more than ASCI code I got into compilation failure  %No mather if it is:  %\begin{CJK*}{UTF8}{min}  %一部の日本人のもの  %\end{CJK*}  %\\ śćóœ}  abcdefghijklmnoprstuwxyzABCDEFGHIJKLMNOPRSTUWXYZ  %but standard ASCI works   I search a lot about this but I didn't find any solution that works for me. Any idea?

I'm writing a document in English.  However, I need to use a few words of both Japanese and Russian.  In principle, it seems to work, but as soon as I used Japanese characters, I cannot use Russian characters afterwards.  Please note that it is crucial for me that the document compiles using pdflatex.  Here are two minimal examples to illustrate my problem.  This one works:  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T2A,T1]{fontenc} \usepackage{CJK}  \begin{document} {\fontencoding{T2A}\selectfont ф} \begin{CJK}{UTF8}{min} ル \end{CJK} \end{document}   But this doesn't:  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage[T2A,T1]{fontenc} \usepackage{CJK}  \begin{document}   {\fontencoding{T2A}\selectfont ф}   \begin{CJK}{UTF8}{min}   ル   \end{CJK}   {\fontencoding{T2A}\selectfont ф} \end{document}   I cannot figure out why.  In the second case, I get this error message:  ! Undefined control sequence. \CJK@XX ...r `#1\endcsname {`#2}\CJK@ignorespaces                                                    \fi  l.12   {\fontencoding{T2A}\selectfont ф                                         }   I cannot find any explanation and I would really appreciate any help.