Ive searched the internet but i coudnt fix it with the answers providen. The problem is, i canot bake my model. I have the object selecten in normal and edit mode, the image is selected and created.  But it just doesnt let me bake it.
This happens pretty much every time I try to bake normal maps. It's quite a broad error message and I still don't know exactly what the problems I'm having are, only that if I keep clicking things for half an hour eventually it sometimes just works.  My understanding of the things needed:   A "Generated" blender Image that the normals are written to (In UV/Image Editor, click Image->New)   Tell blender that this is the bake output, below (this is the really confusing bit which blender seems to try to guess and fails)  A UV Map for the low poly model (you only need the geometry of the high poly and it doesn't need a UV map) Under Bake, in the rendering tab:   Bake Mode = Normals Normal Space = Tangent Selected to Active = ✓ (for the next bit)  Select the high rez object first, then the low poly object With the two objects selected, click Bake (you may have to move the mouse to see the error pops up)   Now, from what I can tell the only  (with regard to the setup and apart from the internals of baking) is how blender finds the output image:   Cycles  Have a material using an ImageTexture node which points to your normal map output. Then  says the node must be selected, but  doesn't mention selecting. Blender Render  Have a texture attached to the material that uses the image.  is pretty vague on assigning the output image. Sometimes I've found hitting tab to go to edit mode and selecting the normal map image in the UV editor to help, or at least it seemed to.   I would like to know the exact details of what blender goes looking for when you hit Bake, rather than have to guess by following tutorials. For example, it seems to look for the high and low poly objects in your selection and based off the order you select them. How does it find the normal map/image to write to for both cycles and blender render? Does the Texture need to Influence Normals or does it just need to reference the Image? etc...
Server login attempts NOT blocked after configuring fail2ban General closed form of $\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$ I once asked a  about how to integrate the reciprocal of the square root of cosine.  Is  there a general closed form for the integral $$\int_{0}^{\theta_0} \frac{1}{\sqrt{\cos \theta-\cos \theta_0}} d\theta$$   in terms of the gamma function?  Thank you. Explicit "do not award bounty" button Shouldn't there be a way to prevent automatic awarding of a bounty? For example, if someone provides an answer that sounds good but is totally wrong, it may happen that it gets a score of +2, but doesn't deserve the bounty. If no one else answers, half the bounty will automatically go to this person. Automatic awarding is good if an inactive user offers a bounty, but I think there should be a button that basically means "I know the bounty should now be awarded, but I have read the answers and none of them deserve the bounty".  The button should obviously not refund the bounty, just let it go to /dev/null instead of awarding it to someone who doesn't deserve it. How many integers between $1$ and $10^4$ contain exactly one $8$ and one $9$? I have this problem: How many integers between $1$ and $10^4$ contain exactly one $8$ and one $9$?, but i dont know if $18, 19, 28, 29...$ serve, else it could be $8$ y $9 = 2$ numbers, help please. Why can this product of rectangular matrices not be the identity matrix? How do you do it? Given a byte array:  byte[] foo = new byte[4096];   How would I get the first x bytes of the array as a separate array? (Specifically, I need it as an IEnumerable&lt;byte&gt;)  This is for working with Sockets. I figure the easiest way would be array slicing, similar to Perls syntax:  @bar = @foo[0..40];   Which would return the first 41 elements into the @bar array. Is there something in C# that I'm just missing, or is there some other thing I should be doing?  LINQ is an option for me (.NET 3.5), if that helps any. The divisibility rule for $3$ is well-known: if you add up the digits of $n$ and the sum is divisible by $3$, then $n$ is divisible by three.  This is quite helpful for determining if really large numbers are multiples of three, because we can recursively apply this rule:  $$1212582439 \rightarrow 37 \rightarrow 10\rightarrow 1 \implies 3\not\mid 1212582439$$ $$124524 \rightarrow 18 \rightarrow 9 \implies 3\mid 124524$$  This works for as many numbers as I've tried.  However, I'm not sure how this may be proven.  Thus, my question is:     Given a positive integer $n$ and that $3\mid\text{(the sum of the digits of $n$)}$, how may we prove that $3\mid n$? This is a question from the free Harvard online abstract algebra .  I'm posting my solutions here to get some feedback on them.  For a fuller explanation, see  post. This problem is from assignment 5.  a) Prove that the relation $x$ conjugate to $y$ in a group $G$ is an equivalence relation on $G$. b) Describe the elements $a$ whose conjugacy class (= equivalence class) consists of the element $a$ alone.  a) Let $G$ be a group and $R$ be a relation on $G$ defined by $a\sim b$ if $a$ is conjugate to $b$.  Then $a\sim b$ if there is a $g\in G$ such that $a = gbg^{-1}$.  Let $a$ be an element of $G$.  Then $a=eae^{-1}$.  So $a\sim a$ and $R$ is reflexive.  Let $a$ and $b$ be elements of $G$ such that $a\sim b$.  Then there is a $g\in G$ such that $a=gbg^{-1}$.  Then $b=g^{-1}ag$.  Since $g^{-1}\in G$, $b\sim a$.  Hence, $R$ is symmetric.  Let $a,b$, and $c$ be elements of $G$ such that $a\sim b$ and $b\sim c$. Then there are elements $g,g^\prime\in G$ such that $a=gbg^{-1}$ and $b=g^\prime cg^{\prime -1}$.  Then $a=g(g^\prime c g^{\prime -1})g^{-1}=(gg^\prime)c(g^{\prime -1}g^{-1})=(gg^\prime)c(gg^\prime)^{-1}$. Since $gg^\prime\in G$, $a\sim c$.  Hence $R$ is transitive.  Therefore $R$ is an equivalence relation on $G$. b) Let $S$ be the set of elements of $G$ such that, for $s\in S$, $s=gsg^{-1}$ for any $g\in G$.  Then $sg=gs$.  So $S$ is the set of elements that commute with every element of $G$.  In other words, $S$ is the center of $G$. Again, I welcome any critique of my reasoning and/or my style as well as alternative solutions to the problem. Thanks. Finding $\int_0^\infty \frac{\cos(ax)-\cos(bx)}{x}dx$ I am practicing calculus section of GRE Math Subject test, and I can't figure out a way to do the following integral: $$\int_0^\infty \frac{\cos (ax) - \cos (bx)}{x}dx.$$  I absolutely have no clue how to do this. Can someone show me the solution explicitly? Thank you. I am already dual booting windows 10 with Linux Mint, and I am trying to replace Mint with Ubuntu. I have already created a bootable usb for Ubuntu.  When I try to install Ubuntu, I don't see any option to install Ubuntu alongside windows 10. Rather, I see "install Ubuntu alongside Linux Mint". I didn't find any option to keep my windows 10. How can I replace Mint with Ubuntu in this dual boot system? Mint is installed on an ext4 partition and I have a Linux swap partition. Is there a ZIP code I can enter when paying-at-the-pump in the USA with a foreign credit card? I have 14" 16:9 notebook and would like my Windows 10 taskbar have on the (left) side. Unfortunately, although I set it to small icons the bar is pretty wide. Do not you know how to make it thinner?  This is how I would like to have it: group of units in a topological ring Prove: $\lim\limits_{n \to \infty} \int_{0}^{\sqrt n}(1-\frac{x^2}{n})^ndx=\int_{0}^{\infty} e^{-x^2}dx$ I'd like your help with the following claim to prove:  $$\lim_{n \to \infty} \int_{0}^{\sqrt n}\left(1-\frac{x^2}{n}\right)^ndx=\int_{0}^{\infty} e^{-x^2}dx.$$  I think I should use the claim:     Let $a,b$ two real numbers and $\{f_n\}$ a sequence of continuous functions on $\left[a,b\right]$  which converges uniformly to $f$ on $[a,b]$. Then    $$\lim_{n\to\infty}\int_a^bf_n(t)dt=\int_a^bf(t)dt.$$   But for this, I must prove that $(1-\frac{x^2}{n})^n$ uniformly converges to $e^{-x^2}$.  How do I do that? One of the hardest and trickiest things to do is to prove this uniformly converges.. every function has its own way. I believe that the more examples I'll see the easiest it will be. Thanks again! How do I prove that $f(x)f(y)=f(x+y)$ implies that $f(x)=e^{cx}$, assuming f is continuous and not zero? This is part of a homework assignment for a real analysis course taught out of "Baby Rudin."  Just looking for a push in the right direction, not a full-blown solution.  We are to suppose that $f(x)f(y)=f(x+y)$ for all real x and y, and that f is continuous and not zero.  The first part of this question let me assume differentiability as well, and I was able to compose it with the natural log and take the derivative to prove that $f(x)=e^{cx}$ where c is a real constant.  I'm having a little more trouble only assuming continuity; I'm currently trying to prove that f is differentiable at zero, and hence all real numbers.  Is this an approach worth taking? I am running 14.04 and have a HP Deskjet 2545 wireless printer which is supported by Ubuntu. I have run HpLIP, the latest version and installed the printer.  The printer is recognised by Ubuntu, printer and network, but LibreOffice do not see the printer. Only a Generic printer.  I don't know what to do anymore and would like to get some good advice Supporting Multiple Screen Sizes in Storyboards (3.5 and 4 inch screens) Do systemd unit files have to be reloaded when modified? Let's say I write a mine.service file. Then I use systemctl enable mine.service.  If I later decide to edit mine.service, do I have to tell systemd that mine.service was changed? If so, how do I do that? For example, the square can be described with the equation $|x| + |y| = 1$. So is there a general equation that can describe a regular polygon (in the 2D Cartesian plane?), given the number of sides required?  Using the Wolfram Alpha site, this input gave an almost-square: PolarPlot(0.75 + ArcSin(Sin(2x+Pi/2))/(Sin(2x+Pi/2)*(Pi/4))) (x from 0 to 2Pi)  This input gave an almost-octagon: PolarPlot(0.75 + ArcSin(Sin(4x+Pi/2))/(Sin(4x+Pi/2)*Pi^2)) (x from 0 to 2Pi)  The idea is that as the number of sides in a regular polygon goes to infinity, the regular polygon approaches a circle. Since a circle can be described by an equation, can a regular polygon be described by one too? For our purposes, this is a regular convex polygon (triangle, square, pentagon, hexagon and so on).  It can be assumed that the centre of the regular polygon is at the origin $(0,0)$, and the radius is $1$ unit.  If there's no such equation, can the non-existence be proven? If there are equations, but only for certain polygons (for example, only for $n &lt; 7$ or something), can those equations be provided? It seems to me that my costlier (Tamron 90 f/2.8 macro) lens gives better colors than my cheap Canon 18-55 IS kit lens.  So does lens matter for color quality? What physical processes are involved in that?