I am java programming beginner and I want to save (java) source file. However,when I open the java file from note pad  the indentation is totally different from the one that I wrote in eclipse.So how can I adjust indentation of Notepad or how to save java file so that to submit my project with correct indentation like tab should be 4 space instead of 8 space?  thank you
By default  indents with a hard tab character. How do I change it to spaces?
What are some good books for learning general relativity? Blender is rendering an older version of my project, not the most recent one. I have made it using the Blender Render but it does not want to render in cycles either. A black and grey screen is rendered as if everything is transparent. Checked general camera, lighting and compute devises in case I messed something up but I can't find anything. All my textures and objects look normal, does anybody know what is wrong or what to check?  Ok added link: Integral $ \int_{-\pi/2}^{\pi/2} \frac{1}{2007^x+1}\cdot \frac{\sin^{2008}x}{\sin^{2008}x+\cos^{2008}x}dx $ I am trying to solve this integral $$ \int_{-\pi/2}^{\pi/2} \frac{1}{2007^x+1}\cdot \frac{\sin^{2008}x}{\sin^{2008}x+\cos^{2008}x}dx $$ A closed form does exist despite the looks of the integrand.  This problem is from some old high school IMO training courses.  I am not sure how to solve it. The only information that may be of help is $$ \sin x=\sum_{n=1}^\infty \frac{(-1)^n x^{2n+1}}{(2n+1)!}, \quad \cos x=\sum_{n=1}^\infty \frac{ x^{2n}}{(2n)!} \quad \forall \ x $$ Thanks, I am looking for a complete solution, not a description as of what to do. I am generating a fairly large index of .txt, .tex, and .pdf files. This process has worked for a long time, and the size of the index is not the issue. I have added logic to insert additional links in the index and now am running into:  TeX capacity exceeded, sorry [save size=80000]  Questions:  What are the typical causes of this kind of problem, and any suggestions on how to determine the cause of this. Can the save size be increased?  Of course any solution that just allows me to increase the save size would be preferable if it works, the first question is only important if the size can't be increased or I run into this problem again. Notes:  Generating smaller indices seems to work just fine, only when I attempt to generate the entire index do I run into problems, so coming up with a MWE will be difficult. How to set Oracle's Java as the default Java in Ubuntu? What gifts would be welcome for a Swedish host family? Alternative methods to prove that $Z_m$ is a field under addition and multiplication $\bmod\ m$ iff $m$ is a prime I am looking for ways to prove that $\mathbb{Z}_m=\{0,1,2,\dots,m-1\}$ is a field under addition and multiplication $\bmod\ m$ iff $m$ is a prime.   I tried it this way: If $m$ is a prime $p$,it is obvious that most importantly, we need to prove that every non-zero element in $\mathbb{Z_p}$ has an inverse in $\mathbb{Z_p}$.We note that if $a,b\in \mathbb{Z_p}$, then $a\cdot b\in \mathbb{Z_p} \dots \boxed{*}$. Next, $a^p\equiv a \bmod p$ for prime $p$(the proof follows by induction on $a$).As  $\displaystyle 0\leq a\leq p-1$,$a\not =p$. Thus $$a^{p-1}\equiv 1 \bmod p$$ for prime $p$ which,together with $\boxed{*}$ guarantees the existence of an inverse in $\mathbb{Z_p}$.Proving the other properties is simple.  Conversely,if $\mathbb{Z_m}$ is a field,then every non-zero element of $\mathbb{Z_m}$ has an inverse.Note that inverse of an element is unique.For if $a\cdot b\equiv a\cdot c\equiv 1 \bmod m$,then $(a\cdot b)\cdot c\equiv c\equiv (a\cdot c)\cdot b\equiv b \bmod m$ i.e $m|(b-c)\implies b-c=0(0\leq a\leq m-1,a\in \mathbb{Z_m})$.So, inverses must be unique and every element is either an inverse of itself or has in inverse in the field.That allows us to conclude that $[(m-1)!]^2\equiv 1 \bmod m$ which can only mean that either  $(m-1)!\equiv 1 \bmod m$ or $(m-1)!\equiv -1 \bmod m$. If $m$ is not a prime, it has a prime factor, say $p$. $ 0\leq p\leq m-1\implies p|(m-1)!\implies p|1$or $-1$ which is absurd, a contradiction.Thus $m$ is prime.  I feel that this method is too involved and complicated. Can anyone please suggest some other method?(Some context: This is a problem from Finite Dimensional Vector Spaces by Paul Halmos. I am learning linear algebra for the first time.It seems some of the comments have been posted on the assumption that I know rings and fields; I don't. ) I get this error in the deployment step of a share-point farm based project. Most of the suggested solutions on the net are a simple Visual Studio re-start, however, a simple VS restart won't fix this.   Any ideas on what might be causing this? Find the coefficient of the term $x^2$ in $\left(x+\frac 2x\right)^{4}$ Find the coefficient of the term $x^2$ in $$\left(x+\frac 2x\right)^{4}$$   This is what I have done so far.  We know $a$ = $x$ and $b$ = $\frac2x$ and $n$ = 4  So what I have done is $4c2$ x $(x)^2$ x ($\frac2x$)$^2$  As we know that $^2$ + $^2$ = 4, and 4 is the $n$ value.  The answer is one though?  What have I done wrong?   P.S.  was the tutorial that helped me. What is $48\div2(9+3)$? Why doesn't my systemd user unit start at boot? Zero divisor in $R[x]$ Let $R$ be commutative ring with no (nonzero) nilpotents. If $f(x) = a_0+a_1x+\cdots+a_nx^n$ is a zero divisor in $R[x]$, how do I show there's an element $b \ne 0$ in $R$ such that $ba_0=ba_1=\cdots=ba_n=0$? how to set camera to the same view as I turn my cursor? I want to turn the camera to get the view I want, but everytime I turn the camera, I need to go to render window to check if it's the view I want. I turn the view with my mouse cursor, but that does not affect the actual camera view in rendering, can I set the camera view the same as I turn my cursor? How to convert an instance of std::string to lower case G acts on X transitively, then there exists some element that does not have any fixed points Let $X$ be a transitive $G$-set. ($G$ acts on  $X$ transitively.) If $X$ is finite and has at least two elements, show that there is some element $g$ $\in$ G which does not have any fixed points; that is, such that $g$$($$x$$)$ $\ne$ $x$ for all $x$ $\in$ $X$  I am trying to use contradiction, but it is not very clear to me why this is true. Volume control on asus zenbook 3 Using Ubuntu 16 LTS  I installed ubuntu on my new asus zenbook3 ux390. Nearly everything works fine except the volume controls don't work. The volume is either on or off. I can adjust volume in specific apps or websites (like youtube) successfully, but the internal volume control either wants to be muted or at 100%. Windows executables are started with archive manager I have Wine installed and several Windows applications installed there run fine, if I start them using the right mouse menu "Open with Wine program loader". But if I try starting an .exe file by just double clicking instead, the archive manager tries to open the executable.  How do I fix that?  And something like a bonus question as a former Windows user: Can this be done easily for a single file I currently see in the file manager (similar to the "Open with..." context menu in Windows) and for many file types together (like in Windows, using the menu "Folder settings" in the Explorer)? How can I switch off exception handling in MSVC? I have this new problem since 2014 begin. I cant remotely login to this enterprise network for giving them support. Its keep showing this new error.  How to fix it please?    EDIT: I'm starting to do designs meant for printing, but I'm fairly new to this medium so I don't really understand how bleed works and how much bleed should I specify for:   Business cards Large format prints (42 inches and bigger) Magazines   Should I extend the design into the bleed areas?