I need certain patterns on a particular texture to be glossy while everything else remains rough. Any ideas? It more like a golden yarn embroidered on a black linen.
I have a skyscraper building but I only want the glass in the texture to be glossy.  How would I accomplish this?    Ok, I have done a test and here are the results.  Here is the original:   here is an adjusted image
In Bash, when to alias, when to script, and when to write a function? "Its" as a Possessive Pronoun Since its can be both determiner possessive pronoun and nominal possessive pronoun, an example of its as determiner possessive pronoun would be:     We saved this question for last because of its complexity.   Because complexity is a noun, so its must be a determiner possessive pronoun in this sentence. I'm looking for an example where its is used as nominal possessive pronoun in a sentence as above. How can I make a Click-once deployed app run a startup?  The best option I found by searching was to set the Publisher on the app to Startup, so the Start menu shortcut would be placed in the Startup folder, but that seems like a huge hack and I would like there to be a Start menu icon people can find.  What options do I have? How do I read a text file with variable hexadecimal value columns in matlab? How can I detect if my apple device supports Bluetooth Low Energy How to get the list of IP addresses in a LAN? In how many ways can $500$ indistinguishable students select books from $10$ titles if no more than $20$ copies of one particular text are selected? Assume that there are an arbitrarily large number of copies of ten diﬀerent discrete math books (which we will call titles) for cmsc250. Each student must choose one title as the course text book. Assume that the ﬁve hundred students taking the course are indistiguishable.  How many diﬀerent ways can the students choose titles, if Epp must be chosen by at most twenty students?   I understand that this is a stars and bars problem where the formula would be ${n+r-1}\choose{r-1}$, but whats throwing me off is the "at most" parameter of the problem. My answer is ${480+9-1}\choose{9-1}$ My reasoning was that we now have one less "bar", and that should be shown by lowering $r$ by 1  Am I approaching this the right way? Do Americans remove the "t" in "wanted"? When you pronounce the phrase "I got a message you wanted to see me", is the "t" usually deleted in the word "wanted"? Thank you. I want to make some 3d models of pixel art. I started by adding a plane, adding a texture to it, added loop cuts to my plane, 15 loop cuts because it's a 16x16 texture, then I selected the blank faces and deleted them. As I extrude this plane, A &gt; E &gt; $0.1$, the texture messes up on the edge of the item, as shown below  Although not all faces mess up on the edge, a lot still do. I tried recalculating normals, unwrapping the object again, but I ended with the same problem, no change at all. Though I may have done it wrong, since I never did it before. I tried smart UV project and cube projection, but they just mess it up even more. Does anyone have a solution to this? Polynomial irreducible - maximal ideal I have a couple of ideals which I wonder if I correctly classify as maximal/prime ideal.  $I_1 = \langle 2x^2 + 9x -3\rangle$, $I_2 = \langle x - 1\rangle$  $\mathbf 1)$ Is $I_1$ a maximal ideal in $\mathbb{Q}[x]$?  Yes, since $I_1$ is irreducible with $p=3$ using Eisenstein's criterion, thus maximal ideal.  $\mathbf 2)$ Is $I_2$ a prime ideal in $\mathbb{Q}[x]$?  Yes, since $I_2$ is obviously irreducible, and thus a maximal ideal, and every maximal ideal is a prime ideal.  $\mathbf 3)$ Is $I_2$ a maximal ideal in $\mathbb{Z}[x]$?  Yes, $I_2$ is obviously irreducible, and thus a maximal ideal.  $\mathbf{Edit:}$ No, as it is not a field. $$ $$  Am I right in my conclusions?  Appreciate any help. Find all rings $R$ satisfying $\mathbb Z \subset R \subset \mathbb Z[\frac {1}{2}]$ Find all rings $R$ satisfying $\mathbb Z \subset R \subset \mathbb Z[\frac {1}{2}]$.   Solution: Let $f \in R$. Then $f= \frac {m}{2^n}$ for some integers $m,n$.  Since $2^{n-1} \in R$, hence $\frac {m}{2} \in R$. Hence one gets that $ \frac {1}{2} \in R$, so $R=\mathbb Z[\frac {1}{2}]$, so there is no ring $R$ satisfying given conditions.     What are the other possible solutions of this problem?    P.S: You can give a solution using any theorem from commutative algebra also. Erlang server, Java client - TCP messages get split? Mafia 3 no more damage to be dealt barclay mills I did most of the barclay mills missions and brought the damage down to 2550 but now I can find anything else to damage or steal, so the meter is stuck at 2550 and the objective says "find and destroy garbage barges" but when I click it, no waypoint.  Please help. The conditions $a^2b^2=b^2a^2$ and $a^3b^3=b^3a^3$ make the group $G$ abelian? Find all solutions to $x^2\equiv 1\pmod {91},\ 91 = 7\cdot 13$ How to do binary calculation？ Make \cite{my reference} show name and year I am trying to figure out how to make author's name and year show up every time I make a reference.  For example:  my_bibtex.bib has this entry:  @article{Franklin1999,  author = {Franklin Allen and Risto Karjalainen}, title = {Using genetic algorithms to find technical trading rules}, year = {1999}, volume = {51}, pages = {245-271}, journal = {Journal of Financial Economics}  }   If in my_paper.tex I use this line:  Important result has been found by \cite{Franklin1999}   My output looks like:  Important result has been found by [1]   But I want it too look like:  Important result has been found by Franklin 1999   I there a way to do it?  My bibliographystyle is set to plain  \bibliographystyle{plain}  \bibliography{my_bibtex} biblatex: \parencite in note field prints spurious ; with authoryear-icomp style Terminal prompt not wrapping correctly I have an issue where if I type in very long commands in bash the terminal will not render what I'm typing correctly. I'd expect that if I had a command like the following:  username@someserver ~/somepath $ ssh -i /path/to/private/key myusername@something.someserver.com  The command should render on two lines. Instead it will often wrap around and start writing over the top of my prompt, somewhat like this:  myreallylongusername@something.somelongserver.comh -i /path/to/private/key  If I decide to go back and change some argument there's no telling where the cursor will show up, sometimes in the middle of the prompt, but usually on the line above where I'm typing.   Additional fun happens when when I Up to a previous command. I've tried this in both gnome-terminal and terminator and on i3 and Cinnamon. Someone suggested it was my prompt, so here that is:  \[\033[01;32m\]\u:\[\033[01;34m\] \W\033[01;34m \$\[\033[00m\]  Ctrll, reset, and clear all do what they say, but when I type the command back in or Up the same things happens.  I checked and checkwinsize is enabled in bash. This happens on 80x24 and other window sizes.  Is this just something I learn to live with? Is there some piece of magic which I should know? I've settled for just using a really short prompt, but that doesn't fix the issue. How many ways can we let people into a movie theater if they only have half-dollars and dollars? My interest in combinatorics was recently sparked when I read about the many things that the Catalan numbers count, as found by Richard Stanley. I picked up a copy of Brualdi's Combinatorics, and while browsing the section on counting sequences I found a nice little puzzle that has definitely puzzled me.     Let $m$ and $n$ be nonnegative integers with $n\geq m$. There are $m+n$ people in line to get into a theater for which admission if $50$ cents. Of the $m+n$ people, $n$ have a $50$-cent piece and $m$ have a $\$ 1$ dollar bill. The box offices opens with an empty cash register. Show that the number of ways the people can line up so that change is available when needed is   $$ \frac{n-m+1}{n+1}\binom{m+n}{m}. $$     I first noted that the first person to enter must be one of the $n$ with a half-dollar. Now the register has a half-dollar change. The second person can be either a person with a half-dollar or a dollar. In the first case, the register will now have two half-dollars, in the second case, the register will now have one dollar bill. So it seems to me that when one of the $n$ people with a half-dollar enters, the number of half-dollars in the register increases by $1$, and when one of the $m$ people with a bill enters, the number of half-dollars decreases by $1$ but the number of bills increases by $1$.   I tried to model this by looking at paths in $\mathbb{Z}^2$. The $x$-axis is like the number of half-dollars, and the $y$-axis is the number of bills. You start at $(0,0)$, and you can take steps forward $(1,0)$ or backwards diagonally $(-1,1)$ corresponding to who enters, but you must always stay in the first quadrant of the plane without crossing over the axes. The goal is to make $m+n$ moves, and I figured maybe the number of such paths is counted by $\frac{n-m+1}{n+1}\binom{m+n}{m}$, but I'm not sure how to show this. I don't know if this observation simplifies the problem at all, as I don't know how to finish up. I'd be happy to see how this problem is done, thank you.