Could we allow suspended users to bookmark questions? I'm aware that  but I would like to have this feature changed.
Even though I got banned suspended, I'm able to mark a question as a favorite. Is this functionally correct?
I want to hit enemy's axe to break it. How this is properly played in D&amp;D 5e? And what about shield or armor? Can I attack these items to break it? When is it appropriate to use a hyphen? Full page image as title page Background  Wrote a technical manual in LyX. The technical manual currently has two parts:   Cover image (PDF) Manual text (PDF)   Problem  When merging the two PDF files (with GhostScript or other software tools), there are a number of issues:   Bookmarks (lost in merging) Colours (obvious changes) PDF tags (lost in merging)   I would rather include the cover page image as a full page (no margins) at the start of the manual and have LyX (LaTeX) generate the front page when it creates the PDF. In this fashion, the cover page and the manual text need not be merged as a separate step.  Question  How do you instruct LaTeX to generate a full page image as the first page in a PDF using KOMA-Script?  Update  Using the pdfpages package produces the following result:    Note the white space above and below the image. The white space is removed using the following:  \includepdf[fitpaper]{cover}   Update  Part of the preamble contains:  % Resize figures that are too wide for the page. \let\oldincludegraphics\includegraphics \renewcommand\includegraphics[2][]{%   \graphicsformat{%     \oldincludegraphics[width=\ScaleIfNeeded,#1]{#2}%   }% }   The full preamble is at:   The error message is:  !pdfTeX error: pdflatex (file cover.pdf): cannot find image file   The file ch_02.lyx and test.latex are in the same directory. The file test.latex is the document in Martin's post. The file test.latex can find the file cover.pdf, yet the file ch_02.lyx cannot find the file. Both use the following code:  \includepdf[fitpaper]{cover.pdf}   Update  The most minimal LyX example that produces the problem:  #LyX 1.6.7 created this file. For more info see http://www.lyx.org/ \lyxformat 345 \begin_document \begin_header \textclass scrbook \begin_preamble \usepackage{pdfpages} \end_preamble \use_default_options false \language english \inputencoding utf8 \font_roman lmodern \font_sans helvet \font_typewriter courier \font_default_family default \font_sc false \font_osf false \font_sf_scale 100 \font_tt_scale 100  \graphics default \float_placement H \paperfontsize default \spacing single \use_hyperref true \pdf_bookmarks true \pdf_bookmarksnumbered false \pdf_bookmarksopen false \pdf_bookmarksopenlevel 1 \pdf_breaklinks false \pdf_pdfborder false \pdf_colorlinks false \pdf_backref false \pdf_pdfusetitle true \papersize letterpaper \use_geometry false \use_amsmath 2 \use_esint 1 \cite_engine basic \use_bibtopic false \paperorientation portrait \secnumdepth 3 \tocdepth 3 \paragraph_separation indent \defskip medskip \quotes_language english \papercolumns 1 \papersides 1 \paperpagestyle default \bullet 0 5 11 -1 \bullet 1 5 24 -1 \bullet 2 0 0 -1 \tracking_changes false \output_changes false \author ""  \author ""  \end_header  \begin_body  \begin_layout Standard \begin_inset ERT status collapsed  \begin_layout Plain Layout   \backslash includepdf[fitpaper]{cover.pdf} \end_layout  \end_inset   \end_layout  \begin_layout Standard Test \end_layout  \end_body \end_document   Thank you! Basis for Skew Symmetric Matrix I'm trying to find a basis for the kernel for the following mapping:  Considering the linear transformation T: $M_{33} \rightarrow M_{33}  $ defined by $T(A) = .5(A + A^T)$. I know that this is basically asking for the basis under the condition that $T(A)=0$ which means that $A+A^T=0$ so $A^T = -A$.  I found that matrices that fit this condition are Skew Symmetric Matrices.  However, I'm not sure how to find the basis for the kernel of these matrices. What approach should I take to establish this logical proof? I need to design a logical math proof:  Write a detailed structured proof to prove that if m and n are integers, then either 4 divides mn or else 4 does not divide n.   Hint: Think about the form of the statement.   I was thinking about first proving that either 4 should divide m or n in order for the first part to be true, then use proof by cases to prove what happened when m was 4, and another case when n was 4...  But I got stuck, what do you recommend:    This is what I got so far: Claim: (m ∈ Z ∧ n ∈ Z) => (4 | mn ˅ 4 ∤ n)  Negated claim: (m ∈ z ∧ n ∈ z) ∧ ( P(n) ∧ ¬P(mn) )  Proof by contradiction  Assume m , n ∈ z:    Assume P(n) ∧ ¬P(mn):       Then ∃ q ∈ R, n = 4q       Let q0 be such that n = 4q0       Then mn = m(4q0)       Then mn = 4(mq0)       Then ∃ q ∈ R, mn = 4q        Then 4 | mn     Then P(n) ∧ P(mn) Then (m , n ∈ z) ∧ P(n) ∧ P(mn))    I know that is wrong, how can I fix it? Prove the inequality $\,\frac{1}{\sqrt{1}+ \sqrt{3}} +\frac{1}{\sqrt{5}+ \sqrt{7} }+\ldots+\frac{1}{\sqrt{9997}+\sqrt{9999}}\gt 24$ Prove the inequality $$\frac{1}{\sqrt{1}+ \sqrt{3}}  +\frac{1}{\sqrt{5}+ \sqrt{7} }+......... +\frac{1}{\sqrt{9997}+\sqrt{9999}} &gt; 24$$   My work:   Rationalizing the denominator gives   $$\frac{\sqrt{3}-1}{2}  +\frac{\sqrt{7}-\sqrt{5}}{2}+......+\frac{\sqrt{9999}-\sqrt{9997}}{2} .$$  Now by taking two as common and separating the positive and negative terms gives  $$\frac{1}{2} [ \{\sqrt{3} +\sqrt{7}+\dots +\sqrt{9999}\} - \{1+\sqrt{5} +\dots+\sqrt{9997}\}].$$  Can we do like this please suggest. Thanks. Let $\gamma:[0,1] \to \mathbb R^n$ be a smooth closed curve, such that $\gamma(0)=\gamma(1), \gamma'(0)=\gamma'(1), |\gamma'(a)|=1$ and let $B_r=\{x| \exists t, |\gamma(t)-x|&lt;r\}$. How can i show that the volume of $B_r$ is equal to $br^{(n-1)}$ for $r &lt;\varepsilon$ for some $\varepsilon&gt;0$. And how can I find $b$? It is intuitively obvious. But how can one prove it? I have no idea. My friend had a  on the board with 10 counters on it.  If I destroy it and he sacs it in response to gain the life, is there anything that can be done about that?  Like, can I put another destroy artifact on the stack to resolve before his sac resolves? I am trying to find the name of a direct to TV movie, possibly a 2-3 part miniseries which I believe aired on the SciFi channel in the 90s. I don't remember who starred in it, but the movie opened with an astronaut attempting reentry whose shuttle ends up exploding. He awakes in a large bubble of air in a river and after reaching the surface and swimming to shore, meets several other people, from seemingly many different times throughout history (including one alien, who died on Earth).  Over the course of the movie, we learn the world is the afterlife, where everyone goes when they die. The major plot involves launching a steamboat (built by Mark Twain, no less) to travel up a river to the mountains, where the beings responsible for bringing everyone to this world are.  Does anyone know what the title of this movie/miniseries is? Can I change the color of the last selected face? Can I change the color of the last selected face, so that it is the same as the other selected faces?  Here, I've selected the left face then the right face. Note the right face is some sort of checkered or dithered pattern, and just the outline has the nice orange 'selected' color.    Here I've selected the top face, note the right face has now the nice color.    And here I've deselected the top face. Now, both of the remaining selected faces have the nice color. This is the result I'd rather see instead of image 1. I recently bought myself a pack of four YN560 IV's and a YN560-TX for my Canon camera, and apparently I got ahead of myself and didn't realise I should make sure the flashes support HSS.  I tried them out yesterday at home, and even on 1/128 and 1/250s on the camera, they were overexposing here and there. Unfortunately, I don't really have the space to move the flashes much further from my subject, so I was wondering if there is any way to trick them into HSS? I should mention that I also own a Canon 580ex II, which does support HSS. I was thinking I could perhaps use that mounted on the camera to trigger the Yongnuo's, but as far as I can tell that would render the 560-TX useless as the flashes can't be controlled wirelessly when in S1 or S2.  I guess I could buy an ND filter, but as I have lenses with differing sizes, this feels like more of a pain in the ass.  Is there any hack I can pull off here that you guys know of?  Thanks! I am asked to complete my withdrawal transaction with COT fee of 1200 dollars I was marketed by a lady online on some investment packages in bitcoin. ($200 to become $2500 in one week of trade). I indicated interest in this. She took me to a trading website to sign up.  I deposited $200 at the start. After trading for 2 days with earnings, they called me to upgrade the account with $450 which I did. They then traded for 1 week and the account balance became $6786.    I requested to withdraw $6000 from my account and they told me to bring a COT fee of $1200 to complete my withdrawal.  Please help me do a background check on them. Are they real or fake? Check the registration of the company if it is real. The marketer told me the company will pay her from the COT fee. Pointwise Convergence and Convergence in the mean of Riemann-integrable functions Let $(f_n)_{n\in\mathbb{N}}$ be a sequence of Riemann-integrable functions on $[a, b]$.   Assume that $(f_n)_{n\in\mathbb{N}}$ converges pointwise to $f$ on $[a, b]$ and converges in the mean to $g$ on $[a, b]$, where $f$ and $g$ are both continuous. Show that $f = g$.   ($(f_n)_{n\in\mathbb{N}}$ converges in the mean to g on $[a , b]$ means that $\lim_{n\to\infty} d(f_n, g) = 0$, where $d$ is the $L_2$ metric.)  I am studying real analysis now and want to prove this statement. But I don't know how to use condition "$(f_n)_{n\in\mathbb{N}}$ converges in the mean to g on $[a , b]$." How can I prove this? I want to be able to program a  with  but I'm not sure what pins on the actual chip I should use, and all the guides seemed to be using a different chip Should questions include "tags" in their titles? How to tell a lambda function to capture a copy instead of a reference in C#? I've been learning C#, and I'm trying to understand lambdas.  In this sample below, it prints out 10 ten times.  class Program {     delegate void Action();     static void Main(string[] args)     {         List&lt;Action&gt; actions = new List&lt;Action&gt;();          for (int i = 0; i &lt; 10; ++i )             actions.Add(()=&gt;Console.WriteLine(i));          foreach (Action a in actions)             a();     } }   Obviously, the generated class behind the lambda is storing a reference or pointer to the int i variable, and is assigning a new value to the same reference every time the loop iterates.  Is there a way to force the lamda to grab a copy instead, like the C++0x syntax  [&amp;](){ ... } // Capture by reference   vs.  [=](){ ... } // Capture copies What is the most straightforward way to pad empty dates in sql results (on either mysql or perl end)? I'm building a quick csv from a mysql table with a query like:  select DATE(date),count(date) from table group by DATE(date) order by date asc;   and just dumping them to a file in perl over a:  while(my($date,$sum) = $sth-&gt;fetchrow) {     print CSV "$date,$sum\n" }   There are date gaps in the data, though:  | 2008-08-05 |           4 |  | 2008-08-07 |          23 |    I would like to pad the data to fill in the missing days with zero-count entries to end up with:  | 2008-08-05 |           4 |  | 2008-08-06 |           0 |  | 2008-08-07 |          23 |    I slapped together a really awkward (and almost certainly buggy) workaround with an array of days-per-month and some math, but there has to be something more straightforward either on the mysql or perl side.   Any genius ideas/slaps in the face for why me am being so dumb?    I ended up going with a stored procedure which generated a temp table for the date range in question for a couple of reasons:   I know the date range I'll be looking for every time The server in question unfortunately was not one that I can install perl modules on atm, and the state of it was decrepit enough that it didn't have anything remotely Date::-y installed   The perl Date/DateTime-iterating answers were also very good, I wish I could select multiple answers! How can I effectively use the Coppersmith? Why is there no 32 bit ISO for the new Ubuntu 18.04? Separate Biblatex bibliographies with newest entry and highest reference number at the top I would like to have a similar biblatex behaviour as described , i.e. separate bibliographies for different publication types, each bibliography should 1) be prefixed with a corresponding label (C for conference publications, J for journals etc), 2) sorted so that the newest entry is at the top (defined by the publication year) and 3) with reference numbers sorted in descending order per bibliography, i.e. the newest entry should have the highest number.  Journal articles ---------------- [J3]    reference from 2017 [J2]    reference from 2016 [J1]    reference from 2015  Conference publications ----------------------- [C4]    reference from 2017 [C3]    reference from 2017 [C2]    reference from 2016 [C1]    reference from 2015   I currently have the following:  \usepackage[backend=biber,         isbn=true,         giveninits=true,         style=numeric,         maxnames=99,         sorting=ydnt,         defernumbers=true,         autocite=superscript]{biblatex}  \subsection*{Journal articles} \begin{refcontext}[labelprefix=J] \printbibliography[type=article] \end{refcontext}  \subsection*{Conference publications} \begin{refcontext}[labelprefix=C] \printbibliography[type=inproceedings]   Separate bibliographies works fine, labelprefix also works as desired, sorting by year in descending order as well. However, if I try the solution mentioned in the above question I get very high reference numbers (in the 500s).  Is the above behaviour possible at all and, if yes, what is the most elegant solution using current biblatex etc.?  Thanks a lot in advance!