How can I combine 2D slider with MatrixPlot?
MatrixPlot with Tooltips
I have a series of pending jobs in the queue,   $ atq 8   Mon Oct 29 13:21:00 2018 5   Mon Oct 29 10:36:00 2018 15  Mon Oct 29 13:31:00 2018 4   Mon Oct 29 10:35:00 2018 18  Mon Oct 29 15:55:00 2018 3   Mon Oct 29 10:31:00 2018 16  Mon Oct 29 15:54:00 2018 11  Mon Oct 29 13:24:00 2018 12  Mon Oct 29 13:24:00 2018 17  Mon Oct 29 15:53:00 2018 10  Mon Oct 29 13:23:00 2018 19  Tue Oct 30 15:43:00 2018 2   Mon Oct 29 07:41:00 2018 6   Mon Oct 29 10:41:00 2018 7   Mon Oct 29 13:20:00 2018 9   Mon Oct 29 13:22:00 2018   and plan to remove them job on Oct 29. Fortunately, atrm could remove multiple jobs  atrm 8 5 15 4    despite this, a iteration might be a better solution,   $ atq | grep "Oct 29" 18  Mon Oct 29 15:55:00 2018 3   Mon Oct 29 10:31:00 2018 16  Mon Oct 29 15:54:00 2018 11  Mon Oct 29 13:24:00 2018 12  Mon Oct 29 13:24:00 2018 17  Mon Oct 29 15:53:00 2018 10  Mon Oct 29 13:23:00 2018 2   Mon Oct 29 07:41:00 2018 6   Mon Oct 29 10:41:00 2018 7   Mon Oct 29 13:20:00 2018 9   Mon Oct 29 13:22:00 2018   How could I select the first field of the job number so as to iterating them? Fixing "Page is not mobile friendly" report from Google test In search results google reports "this page is not mobile-friendly". I want to fix this.   when I test my website in the mobile-friendly test, it reports:   Content wider than screen. Clickable elements too close together.   How can I find the items/content that are creating these problems?  Any help would be appreciated. I'm trying to find the longest consecutive set of composite numbers Hello and I'm quite new to Math SE.  I am trying to find the largest consecutive sequence of composite numbers. The largest I know is:  $$90, 91, 92, 93, 94, 95, 96$$  I can't make this series any longer because $97$ is prime unfortunately.  I can however, see a certain relation, if suppose we take the numbers like (let $a_1, a_2, a_3,...,a_n$denote digits and not multiplication):  $$a_1a_2a_3...a_n1,\ a_1a_2a_3...a_n2,\ a_1a_2a_3...a_n3,\ a_1a_2a_3...a_n4,\ a_1a_2a_3...a_n5,\ a_1a_2a_3...a_n6,\ a_1a_2a_3...a_n7,\ a_1a_2a_3...a_n8,\ a_1a_2a_3...a_n9,\ a_1a_2a_3...(a_n+1)0$$  The entire list of consecutive natural numbers I showed above can be made composite if:   The number formed by digits $a_1a_2a_3...a_n$ should be a multiple of 3 The numbers $a_1a_2a_3...a_n1$ and $a_1a_2a_3...a_n7$ should be composite numbers   If I didn't clearly convey what I'm trying to say, I mean like, say I want the two numbers (eg: ($121$, $127$) or ($151$, $157$) or ($181$, $187$)) to be both composite.  I'm still quite not equipped with enough knowledge to identify if a random large number is prime or not, so I believe you guys at Math SE can help me out. Is $f(x)=10$ a periodic function? What is the importance of the Diophantine inequality $\frac{1}{p} + \frac{1}{q} + \frac{1}{r} > 1$? In Humphreys' book  Introduction to Lie algebras and Representation Theory(3rd printing, p.62), the Diophantine inequality $$\frac{1}{p} + \frac{1}{q} + \frac{1}{r} &gt; 1$$ appeared while classifying all Coxeter graphs of irreducible root systems. Under the assumption $p \geq q \geq r \geq 2 $, the possible triples turn out to be $(p,2,2), (3,3,2),(4,3,2),(5,3,2)$, which correspond to the Coxeter graph $\text{D}_{p+2}, \text{E}_6, \text{E}_7, \text{E}_8$, respectively.  It seems quite straightforward to solve the inequality in positive integers, but Humphreys said that      This inequality, by the way, has a long mathematical history.   without further comment. So I want to know if this Diophantine inequality has any important significance, or if it has appeared in other context (maybe relevant history) before. Geocoding USA addresses that cannot be sent over internet? View vote count button on mobile On the mobile site, can there be a button directly below the vote up/down buttons for viewing vote counts? When I am using the mobile site and I want to view vote counts, I have to switch to the full site to do it which is very inconvenient.   It could be a small link that says "vote counts," because I don't know what the button would be (the letter "V?" a "+/-" thing? I have no idea).  Related:  , but I am requesting an additional button below the vote buttons. That way you won't accidentally click a vote button. What's your recommendation on drive partitioning schemes for a desktop and home server? What partitioning scheme do you recommend for a desktop? I've always created three or four primary partitions -- root, swap, home, and sometimes a separate boot partition. Ubuntu's default install offers LVMs. I've never had to add additional drives or space, so it never seemed like a big deal. Whenever I do a fresh install, though, I always think there might be a better way. Why is my Mac constantly trying to connect to another server? After logging on, I see this dialog box pop up. Whenever I dismiss it, it reappears 30 seconds later. (Stealing focus at the same time! Grrrr!)    "Slate" is my old iMac, which is sitting on the desk next to me, turned off. How can I stop my new Mac from constantly trying to connect to my old one? Both are running 10.7.1. Checking to see if a DateTime variable has had a value assigned What's the Best Way to Shuffle an NSMutableArray? If you have an NSMutableArray, how do you shuffle the elements randomly?  (I have my own answer for this, which is posted below, but I'm new to Cocoa and I'm interested to know if there is a better way.)    Update: As noted by @Mukesh, as of iOS 10+ and macOS 10.12+, there is an -[NSMutableArray shuffledArray] method that can be used to shuffle. See  for details. (But note that this creates a new array, rather than shuffling the elements in place.) Idea behind proof that $\frac{21n+4}{14n+3}$ is irreducible for all $n$ I have a proof of $\frac{21n+4}{14n+3}$ being an irreducible fraction for any positive integer $n$. The proof starts with the following: Indeed, from the equality: $$2(21n+4)-3(14n+3)=-1$$ and so on..But how does this equality follow from the fraction? Prove that the ideal $(X_1-a_1,...,X_n-a_n)$ is maximal in $K[X_1,\dots,X_n]$ Let $K$ be a field, and $a_1,\dots,a_n \in K$. Prove that the ideal $$(X_1-a_1,\dots,X_n-a_n)$$ is maximal in $K[X_1,\dots,X_n]$.   I tried proving that the only elements outside the ideal are the invertibles of $K$ (I should still prove that this implies maximality, but it shouldn't be too difficult).  Is there a better strategy, or another stategy? How do I see the type of a variable whether it is unsigned 32 bit, signed 16 bit, etc.?  How do I view it? Use variable with TOP in select statement in SQL Server without making it dynamic Default poster size What is the typical size for a conference poster? Is it "ask the organizers", or can I safely assume that I'll get a default size, and that there will be enough space to hang it at the poster session? How can I see the history of stories I've read on Apple News? Sometimes I'll be interrupted in the middle of reading a story on Apple News and later when I open the app, it didn't save the story I was previously reading. I want to be able to resume reading the article, how can I find it again? Here are my configurations: DB type: postgresql (9.3 if that's necessary) Table name: product_sections Column names: section_id (integer) &amp; section_path (ltree)    Detail: I have one reference value: section_id: 15 &amp; section_path: Automation_Solutionz. So, when I want to rename Automation_Solutionz to, say Chrome, I want all references of Automation_Solutionz to be updated.      FROM:  Automation_Solutionz Automation_Solutionz.Test_Case_Creation Automation_Solutionz.Test_Case_Creation.Automation Automation_Solutionz.Test_Case_Creation.Manual   TO:  Chrome Chrome.Test_Case_Creation Chrome.Test_Case_Creation.Automation Chrome.Test_Case_Creation.Manual     Similarly, when I update a value which is in the middle, it should rename those too. In the case above, Test_Case_Creation should be renamed to something like TestCase or anything else. The same goes for any item which is either in the middle, end or at the start.  Hope, I explained things correctly. Thanks in advance :) Submission on hold on arxiv I have recently submitted a paper to arXiv, but the arXiv moderators put my paper in status "on hold", because they have to make a decision on the right classification for the paper.   To those who have experienced a similar situation, how long did it take before they made a decision and published the paper on the arXiv? I just want to have an idea of how long I will have to wait. The Sharpshooter feat includes an interesting feature: you can choose to take -5 penalty to hit with a ranged weapon attack to increase its damage by 10. Normally, I'd dismiss the trade-off as too situational, but I've only just thought of combining it with the Archery fighting style (+2 to hit with ranged weapon attacks).  After building a sample character using these features, the end result looks quite effective. My questions are: Is this build valid? Have I interpreted the rules correctly? If so, how well does it compare against other damage-focused builds?  5th level variant Human Fighter:   Ability Scores (via point buy): Str 10, Dex 16, Con 16, Int 9, Wis 12, Cha 10 HP: 47, AC: 17 (or 18 with disadvantage on Stealth) Weapons: Hand Crossbow x 2 Fighting Style: Archery Martial Archetype: Battle Master (with the Precision Attack maneuver) Feat (variant Human): Crossbow Expert Feat (4th level ability score improvement): Sharpshooter   The end result is a fighter capable of hitting targets 120' away, behind 1/2 or 3/4 cover, or engaged in melee with him, all without penalty. Normally, he can make 3 such attacks per round (Attack action + Extra Attack + Crossbow Expert's bonus attack). Once per short rest he can make 5 attacks per round via Action Surge (Attack action 1 + Extra Attack, Attack action 2 + Extra Attack, Crossbow Expert's bonus attack).  His normal attack bonus is +8 (3 proficiency, 3 Dexterity, 2 Archery fighting style), and normal damage is 1d6+3. Not amazing damage, but nice accuracy and flexibility (attacks can be focused on one target, or spread around; works equally well in melee and ranged combat).  The real winner is his ability to take -5 on any of these attack rolls to increase the damage by 10, to an average of 16.5 per shot (excluding crits). If he lands his usual 3 attacks, that's ~47 damage; 5 attacks is ~83. While the -5 to hit seems imposing, he's still got superiority dice: he can increase his attack roll by 1d8 after seeing the result, up to 4 times per short rest. And even without the superiority dice, his attack bonus is still an acceptable +3; ok for hitting low AC targets, or those granting advantage on attack rolls (e.g. surprised or prone + adjacent).  With a decent AC, a Fighter's HP, and the Second Wind feature, he can also take a decent amount of damage. He'll also have decent Strength, Dexterity, and Constitution saving throws.  This build seems almost too well rounded. Unlike a blaster, he only requires short rests to recover his big hitters. Unlike a brawler, he can target just about anything on the field at a moment's notice. Have I missed any rules, or overlooked any drawbacks?