I would like to know of a quick way to auto align LaTeX code where appropriate, similar to the ctrl + i keyboard shortcut used in MATLAB after highlighting a bunch of code that isn't aligned correctly.
I've been using Texmaker for ~5 years now and prefer it over other editors because of its flexibility.   Is there a way to auto-indent LaTeX code in TeXmaker so that the code becomes more manageable ?
Blurring/Feathering a Procedural Pointiness Mask I'm trying to create a procedural mask to affect the sharp edges of my model using the Pointiness output from the Geometry node, leading to the eventual idea of using it to create customisable weathering effects, such as .  This is the base setup that I've got so far.   How is it possible to blur/feather the black edges of the mask so that they would essentially expand across the object until the whole object is rendered black?   I've had a look at both of the go-to texture blur methods suggested for cycles found  and  however these seem to rely on there being a vector input/output for the texture, which is not the case in my example.  The Procedural Cracks tutorial by CGMasters came closest to what I was trying to achieve with the 'Worn Edges' section of the , but I didn't have any success trying to convert it to my situation.  Any ideas would be massively appreciated! :)  EDIT: Not sure if it was clear enough from the description but I'm trying to steer clear of baking/UV-Unwrapping/the Works on this one... Purely procedural :)  UPDATE: I've made a couple of updates to the shader which has given me slightly better results, although it's still not quite there and the mask blur/expansion issue is still not successful.  This is what it now looks like:   The issue is now coming from the grey values of the mask 'leaking' out across the whole mesh and not stemming from the black values... if that makes sense? :P   In researching weathering effects in blender, I stumbled across , which is exactly what I want to achieve?  UPDATE 2: Still no luck achieving the desired effect in the gif, however I feel I'm slightly closer from adding another colour ramp node after the previous ones.    Does anyone have any more ideas?  UPDATE 3: Found a working solution, added an answer below if people are interested :) Show that if $x$, $y$, $z$ are integers such that $x^2 + y^2 = z^2$, then at least one of them is divisible by $2$, at least one is divisible by $3$, and at least one is divisible by $5$.  I know that $x,y,z$ are sides of a right-angled triangles. If I start putting values, then I can show, but have no clue about mathematical approach.  How do I solve it mathematically, using modular arithmetic? Define $\sigma(m) = \sum$ d : d|n.  Prove that $p^j$$q^i$ cannot be a perfect number for $p, q$ odd, distinct primes.  Attempt at Solution: I have shown that $p^k$ can never be a perfect number, and im trying to use the multiplicative property of $\sigma$ to generalize to $p^j$$q^i$ The &quot;Your Spellbook&quot; sidebar for the wizard includes the following line:  Copying a Spell into the Book. When you find a wizard spell of 1st level or higher, you can add it to your spellbook if it is of a level for which you have spell slots and if you can spare the time to decipher and copy it.  Does this mean that a Wizard 1/Cleric 19 can copy any wizard spell they find into their spellbook? Is there anything preventing them from casting these spells? QR factorization of complex matrix If you have two complex numbers $a,b$ how can you find the QR factorization of   $ M = \begin{bmatrix}        aI_n\\          bI_n \end{bmatrix} $,  I can't seem to be able to do it. I tried an earlier trick, but I now know it's not necessary true for complex numbers. Is there anyway to do this?  I think if I use a Givens algorithm I should be able to reduce it to a QR factorization. Writing basic systemd service files When can you call yourself doctor? Why my tweet is not appearing on the timeline of the person I am following? I have tried tweeting someone I follow couple of times.  My tweets appear on my profile but when I look at the other person's timeline, my tweet is not there. I am following him but he is not following me. Prove $aba^{-1}b^{-1}\in{N}$ for all $a,b$ I am trying to prove the above with the conditions that N is normal to G and $G/N$ is abelian.  So then for $Na,Nb\in{G/N}, NaNb=NbNa$.  But $NaNb=Nab=Nba$, so then we know $ab=ba$, so G is abelian.  So if $ab\in{G}, N=abN(ab)^{-1}=abN(ba)^{-1}=baNa^{-1}b^{-1}....$ and i'm getting lost... E: The repository 'http//archive.canonical.com precise Release' is not signed Java Hashmap: How to get key from value? Given that the majority of biologists do not currently consider viruses to be alive, a virus can never die.  It can, however, get destroyed by long exposures to soapy water, alcohol, and apparently certain frequencies of UV light.  Why is an individual SARS-CoV2 virion not infectious forever?  Or is it? R's lmer cheat sheet There's a lot of discussion going on on this forum about the proper way to specify various hierarchical models using lmer.  I thought it would be great to have all the information in one place. A couple of questions to start:   How to specify multiple levels, where one group is nested within the other: is it (1|group1:group2) or (1+group1|group2)? What's the difference between (~1 + ....) and (1 | ...) and (0 | ...) etc.? How to specify group-level interactions? Dynamically reformatting man pages on terminal dimension changes One common workflow of mine is to open a manual page in a terminal, then another terminal in which to test things. The man page is formatted to the initial dimensions of the first terminal. When I now resize my windows (or have my WM do that for me automatically), there is either a gap to the right of the preformatted page, or lines wrap. At this point I usually q(uit) and !! (run again), which loses my position in the page.  I assume the formatting process is quite CPU intensive, or maybe it stems from ancient times of fixed terminal sizes. The less pager dynamically reacts to terminal resize events, so it should be possible in theory.  I tried perusing man pages, searching the Web, asking on IRC -- the whole lot -- but couldn't come up with anything.   Can I trigger reformatting from within or outside of the man utility? Is there a version of the man utility that resizes the page dynamically?  Is there way to customize some part of the formatting/display process to make it update on SIGWINCH? A net $\varphi : [0, \omega_1) \to M$ on a metric space $M$ converges $\iff \varphi$ is eventually constant I want to prove that      If $M$ is a metric space, then a net $\varphi : [0, \omega_1) \to M$ converges if and only if $\varphi$ is eventually constant. ($[0, \omega_1)$ is the set of ordinals less than $\omega_1$, where $\omega_1$ is the first uncountable ordinal, with the order topology).   $(\Leftarrow)$ is clear.  My trouble is with $(\Rightarrow)$. Suppose that $\varphi \rightarrow x$.  Let $U = \{ \alpha \in [0, \omega_1) \, \mid \varphi(\alpha) \neq x \}.$  If $U = \emptyset $ we are done, so assume $U \neq \emptyset$. Since $[0, \omega_1)$ is well ordered, there is a $\alpha_1 \in U$ such that $ \alpha_1 \leq \alpha \, \, \forall \alpha \in U.$  If $ U \setminus \alpha_1 = \emptyset$ we are done. If not, we repeat the procedure.  It is clear that if $card(U) = n$ for some $n \in \omega$ then we only have a finite set of ordinals $\{\alpha_1, \ldots, \alpha_n\}=U$ so $\varphi$ is constant for $\alpha &gt; \alpha_n.$  If $U$ is countably infinite, then $U = \{\alpha_n\}_{n \in \omega}$ and since $[0, \omega_1)$ is sequentially compact and the $\alpha_n$'s are countable ordinals  we obtain a convergent subsequence $\{\alpha_{n_k}\}$ of $U$ to some countable ordinal $\beta \in [0, \omega_1)$ $[\beta = \cup_{n_k \in \omega}\alpha_{n_k}???],$ hence $\varphi$ is constant for all $ \alpha &gt; \beta.$     But what if $U$ is uncountable?    Idea: If $U = [0, \omega_1),$ then since $\varphi \rightarrow x$, for every $n \in \omega$ there is $\alpha_n \in U$ such that $\alpha \geq \alpha_n \implies \varphi(\alpha) \in B_{\frac{1}{n}}(x).$ This is a countable sequence, so since $[0, \omega_1)$ is sequentially compact, there is a subsequence converging to a countable ordinal $\beta \in [0, \omega_1)$. Clearly, $\beta$ satisfies that $\phi(\beta) \in B_{\frac{1}{n}}$(x) for every $n \in \omega.$     We can conclude that $\varphi(\beta)= x$ right?   For if $\varphi(\beta) \neq x$, then taking $n$ such that $0 &lt; \frac{1}{n} &lt; d(x, \varphi(\beta)),$ we would have that $\varphi(\beta) \not \in B_{\frac{1}{n}}(x),$ contradicting the hypothesis.  I feel pretty confident about this, but If someone sees an error in the argument, please comment. Thanks. On the position of multiple sub and superindices Mistakenly filed as Exempt from income tax witholdings for entire year 2019 I am a basic 30 year old filing Single, W2, healthy working individual. No dependents, no additional schedules, capital gains or losses other than Student Loan interest expense.   I started a new job in January 2019 and somehow during my new hire enrollment, "I or someone" marked in my file as Exempt... I am pretty familiar with filing my own 1040 (as its pretty basic)and I know for a fact that I would never for under any reason think that I am Exempt from absolutely anything tax related. Nobody in my new job's HR department reached out to confirm whether this Exemption was correct or not with me personally. My CPA said that anytime they receive an Exempt W-4 form, that they automatically return the form to the employer to confirm.   I unknowingly went 11 full months in 2019 without any taxes being withheld. Of course my paycheck was more than before, but I also got a better/higher salary job, so I never thought about the difference being from not paying taxes. And, no I do not print out my paystubs. It’s all through Paycom and it clearly shows you your gross pay &amp; a "$XXX" amount in deductions/withholdings - kicker is, you have to click the drop down menu to actually see the entire breakdown. At which point, I never saw the big $0 in taxes being withheld... I know the taxes have to be paid one way or another, but I don't feel like I should be entirely responsible for a $5k-$6k tax liability for a HR clerical error. Even if I did actually input it incorrectly the first time.   Is there a way to check with the IRS to see if they indeed receive my file as Exempt and if they did actually return it to my Employer? I’m just wondering if either HR forgot to follow up with me or even IF the IRS does actually cull these exempt requests in the first place? I don't have the liquidity to simply pay the IRS all at once.   What would be my best option going forward? I use form to send POST request to a page and to login user with wp_signon() in order to authenticate user to my wordpress installation as described in WP documentation:  $creds = array(); $creds['user_login'] = $_POST["user-login"]; $creds['user_password'] = $_POST["user-password"]; $creds['remember'] = true;  $user = wp_signon( $creds, false );   After this little piece of code I'm checking if user was logged in:  if ( is_user_logged_in() ) { echo "SUCCESS"; } else { echo "FAIL!"; }   But I got FAIL! all the time. Then after sniffing around I found this little trick:  wp_set_current_user( $user ); if ( is_user_logged_in() ) { echo "SUCCESS"; } else { echo "FAIL!"; }   I've got SUCCESS on this one but when I leave this page I got FAIL again and again.  Can anyone explain me how to login user with wp_signon() without logging her out after page is changed or reloaded or whatever.    I've got desirable result when I go to /wp_admin and login with WP's default login form. I can navigate through every page of my WP site remaining logged-in all the time. But when I try to do this outside the default form I FAIL.  Guide me! PLEASE! Pokemon Egg Disappearing So my Pokemon eggs are reaching "maturity" then they just disappear. I don't get a new Pokemon. The egg just disappears. I had this happen with a 2k and a 5k now. Is this happening to anyone else? Add a duplicate:0|1 search operator