Is there any workaround to overcome the above governor limit without aborting the job.  Thanks !
I launch a batch which call a lot of scheduled job. But I reach the governor limit :     Maximum number of Apex classes scheduled concurrently : 100   I'm wondering what happens when this limit is reached. The next scheduled jobs are waiting the number of scheduled jobs is lower than 100 for being executed or are they all cancelled ?  And is there to way to manage the number of scheduled jobs to avoir reaching this limit ? For example wait before schedule a new job if we are near the limit.
Nature of the quantum degeneracy pressure It is commonly known that it is the electron degeneracy pressure that prevents the collapse of a white dwarf into a neutron star, and it is not the electromagnetic force. However, it is also widely accepted that all the forces in the universe are just manifestations of the four elementary forces in the universe. So can the degeneracy pressure, caused due to Pauli's Exclusion principle, be shown to be due to one of these forces? I have read some other questions in SE , , and they do not answer my question fully.  In one of the links, the degeneracy pressure is described as an 'entropic force', but as far as I understand, all entropic forces can be explained by the underlying fundamental forces. If the degeneracy pressure is something that is fundamentally different from the other forces, why isn't it classified as a separate force? Totally real Galois extension of given degree Let $n≥1$ be an integer. I would like to prove (or disprove) the existence of a subfield $K \subset \Bbb R$ such that $K/\Bbb Q$ is Galois and has degree $n$.   It is easy to construct such a subfield for $n=2^k$: one  take $K=\Bbb Q(\sqrt 2, \sqrt 3, \sqrt 5, ..., \sqrt{p_k})\;$ where $p_k$ is the $k$-th prime number.  I found that the irreducible polynomial $x^3-6x+2 \in \Bbb Q[X]$ (Eisenstein's criterion with $p=2$) has three real roots, so its splitting field $K$ satisfies my conditions for $n=3$. Then I'm done with $n=3\cdot 2^k$ thanks to compositum of fields.  , a Galois extension of odd degree must be . In all cases, I don't know how to construct, in general or in particular cases ($n$ prime for instance), such a totally real Galois extension $K/\Bbb Q$ of degree $n$.  Thank you for your help! Another point of view that $\mathbb{Z}/m\mathbb{Z} \times\mathbb{Z}/n\mathbb{Z}$ is cyclic. I was thinking that the product of groups $\mathbb{Z}/2\mathbb{Z} \times\mathbb{Z}/2\mathbb{Z}$ is not cyclic, but $\mathbb{Z}/2\mathbb{Z} \times\mathbb{Z}/p\mathbb{Z}$ is cyclic if p is an odd prime. Then I found logic that $\mathbb{Z}/m\mathbb{Z} \times\mathbb{Z}/n\mathbb{Z}$ is certainly cyclic if $m$ and $n$ are coprimes.  I searched on google a proof of that, to compare with mine and the answer is that $\mathbb{Z}/m\mathbb{Z} \times\mathbb{Z}/n\mathbb{Z}$ is isomorphic to $\mathbb{Z}/mn\mathbb{Z}$ (which is clearly cyclic) $\iff$ $m$ and $n$ are coprimes.  But I got another proof and I want to know what you think about it :     I claim that $([1]_m,[1]_n)$ generates $\mathbb{Z}/m\mathbb{Z}$   $\times\mathbb{Z}/n\mathbb{Z}$, where $[a]_d$ is the canonical   projection of $a\in \mathbb{Z}$ into $\mathbb{Z}/d\mathbb{Z}$.       Let's take multiples of $([1]_m,[1]_n)$ until we get $m \cdot$   $([1]_m,[1]_n) = ([0]_m,[m]_n)$ (where I suppose $m=\min(m,n)$...   otherwise, consider $\mathbb{Z}/n\mathbb{Z}$   $\times\mathbb{Z}/m\mathbb{Z}$ and $\min(m,n)=n$).       The next step is $([1]_m,[m+1]_n)$. This pair is not equal to   $([1]_m,[1]_n)$, since $m+1 \not\equiv1$ mod $n$ ($m$ and $n$ are   supposed to be coprimes). We can now continue adding $([1]_m,[1]_n)$   to the results.      The last step is precisely reached when you got   $([mn]_m,[mn]_n)=([0]_m,[0]_n)$. At this point, the fact that $m$ and $n$ are coprimes is absolutely necessary because if they are not coprimes, $lcm(m,n)\ne m\cdot n$ and   $([lcm(m,n)]_m,[lcm(m,n)]_n)=([0]_m,[0]_n)$ but all the $m \cdot n$ possible pairs are not reached, only the $lcm(m,n)$ are ! I got a positive definite matrix $B,$ that is, $V(x) = x^TBx &gt; 0$ for any vector $ x \neq 0.$  I want to show that $ \lambda_\min \|x\|_2^2 \leq V(x) \leq \lambda_\max \|x\|_2^2$ for any $x \neq 0,$ where $\lambda_\min$ and $ \lambda_\max$ are defined by $$ \lambda_\min = \min \lbrace | \lambda|: \lambda \text{ is an eigenvalue of } B \rbrace$$ and  $$ \lambda_\max = \max \lbrace | \lambda|: \lambda \text{ is an eigenvalue of } B  \rbrace$$  Any hint please? Batch file to delete files older than N days I am looking for a way to delete all files older than 7 days in a batch file.  I've searched around the web, and found some examples with hundreds of lines of code, and others that required installing extra command line utilities to accomplish the task.  Similar things can be  in just a couple lines of code. It seems that something at least remotely easy could be done for batch files in Windows. I'm looking for a solution that works in a standard Windows command prompt, without any extra utilities. Please no PowerShell or Cygwin either. How do you unit test private methods? How many combinations can I make? let $n \gt 1$ be an integer, and consider $n$ people; $P_1, P_2,..., P_n$ let $A_n$ be the number of ways these $n$ people can be divided into groups, such that each group have either one or two people  determine $A_1, A_2, A_3$  So I have  $A_1 = 1$ way $A_2 = 4$ way $A_3 = 12$ way  But I am not sure if this is right... Can anyone confirm?  edit:  My way of getting this is  $A_1 = 1 $ because {P1} only has 1 way to sort  $A_2 = 4$ because {P1,P2} = {P1,P2},{P2,P1},{P1P2},{P2P1}  etc. Why do we let hostile users dictate the perception of Stack Overflow? Why do PBX systems use -48 V? It seems common that PBX and other telephone hardware use a positive-ground power supply, where the "hot" line is at -48v.  What's the reason for that? Does $G\times K\cong H\times K$ imply $G\cong H$? How can I utilize the whole terminal, like htop or emacs do? I want to write a program that can "draw" in the terminal the same way as htop or emacs. By that I mean "get rid of the prompt and make the output dependent on the current size of the terminal".   To make this a bit more clear:   I want to use the terminal this way:     in stead of this way: How do I disable "you need to format this disk" message in Windows Vista/7? I've started using TrueCrypt to encrypt a partition on an external USB hard drive. I've opted for using a raw partition as opposed to a file container.  But here's the annoyance. Whenever I connect this drive to a computer running Vista or Windows 7, I get the message popup "You need to format the disk in drive J: before you can use it".   The default option is "Format disk", and I'm afraid one of these days I'll accidentally trigger it.  Is there any way to disable this message? probability question ("birthday paradox") $n$ people attend the same meeting, what is the chance that two people share the same birthday? Given the first $b$ birthdays, the probability the next person doesn't share a birthday with any that went before is $(365-b)/365$. The probability that none share the same birthday is the following: $\Pi_{0}^{n-1}\frac{365-b}{365}$. How many people would have to attend a meeting so that there is at least a $50$% chance that two people share a birthday?   So I set $\Pi_{0}^{n-1}\frac{365-b}{365}=.5$ and from there I manipulated some algebra to get $\frac{364!}{(364-n)!365^{n}}=.5\iff (364-n)!365^{n}=364!/.5=.....$   There has to be an easier way of simplifying this. Question title overlap in new design when title is longer Today I noticed that in new design view count is getting overlapped with question title on scifi.se for longer title:    But it's not site specific as same problem happen in Beta site too ( Hinduism.se):    That's why asked in main meta. Character vs Charm - Pronunciation Is there a rule to understand how the group "Cha" has to be pronounced?  "Character" sounds with a hard first syllable, while "Charm" sound softer, but I don't find how to tell which sound to use before earing someone saying the word. It could be because of the double consonant "rm" vs "ra"? Or is it just a matter of knowing the rule for every single word?  EDIT: More specifically, let's talk about UK English pronunciation. How to use Noto Color Emoji with lualatex? I want to use Noto Color Emoji with lualatex (package fonts-noto-color-emoji on my box). However, this fails as follows. How to use Noto Color Emoji with lualatex?  \documentclass{article} \usepackage{fontspec} \setmainfont{Noto Color Emoji} \begin{document} 😺 👅  \end{document}   Error:  $ lualatex emoji.tex  This is LuaTeX, Version 1.07.0 (TeX Live 2019/dev/Debian)   restricted system commands enabled. (./emoji.tex LaTeX2e &lt;2018-12-01&gt;  luaotfload | main : initialization completed in 2.224 seconds (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2018/09/03 v1.4i Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size10.clo)) (/usr/share/texlive/texmf-dist/tex/latex/fontspec/fontspec.sty (/usr/share/texlive/texmf-dist/tex/latex/l3packages/xparse/xparse.sty (/usr/share/texlive/texmf-dist/tex/latex/l3kernel/expl3.sty (/usr/share/texlive/texmf-dist/tex/latex/l3kernel/expl3-code.tex) (/usr/share/texlive/texmf-dist/tex/latex/l3kernel/l3pdfmode.def))) (/usr/share/texlive/texmf-dist/tex/latex/fontspec/fontspec-luatex.sty (/usr/share/texlive/texmf-dist/tex/latex/base/fontenc.sty (/usr/share/texlive/texmf-dist/tex/latex/base/tuenc.def)) (/usr/share/texlive/texmf-dist/tex/latex/fontspec/fontspec.cfg))) (./emoji.aux) [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] (./emoji.aux))  409 words of node memory still in use:    3 hlist, 1 vlist, 1 rule, 2 glue, 3 kern, 1 glyph, 5 attribute, 48 glue_spec , 5 attribute_list, 1 write nodes    avail lists: 2:15,3:4,4:1,5:21,6:1,7:13,8:1,9:6 &lt;/usr/share/fonts/truetype/noto/NotoColorEmoji.ttf ! error:  (file /usr/share/fonts/truetype/noto/NotoColorEmoji.ttf) (ttf): sfnt  table not found !  ==&gt; Fatal error occurred, no output PDF file produced! How to exclude a column from SELECT query? Showing a bijection between the set of ringhomomorphisms $\mathbb{Z}[i] \to R$ and the set of $x \in R$ for which $x^2+1=0$ I've often wondered why Stack Exchange has opted to keep the upvote/downvote buttons available for clicking on question/answers posted by the user. For instance:    Even though these buttons have no use for the user, why are they still placed on the post's left hand column? Moreover, the comments have no controls for flagging/+1'ing the user's own comment. What is the reason for this discrepancy? What benefit do the +1/-1 buttons provide to the user, even though they can't be used for anything? Can a .NET windows application be compressed into a single .exe?