How to get the post data without form builder
Access POST values in Symfony2 request object
Most of the time, I use good and well interchangeably. However, on many occasions I would find well or good a misfit. Please suggest the proper usage. How do I recover or "undelete" files that I accidentally deleted? I've accidentally deleted some really important files on my machine, and I'm looking to find out how to recover them.  Using the Trash bins "restore" isn't an option, as the files aren't there (mostly likely I wasn't paying attention and permanently deleted them from there).  Is there any way that I can un-delete these files? Prove that the number of $\alpha\in\mathbb{F}_{27}$ such that $|A_\alpha|=26 $ equals 12. Let $\mathbb{F}_{27}$ denote the finite field of size 27. For each $\alpha\in\mathbb{F}_{27}$ , define $ A_{\alpha}$ $=$ { $ 1, 1+\alpha , 1+\alpha+{\alpha}^2 , 1+\alpha+{\alpha}^2+{\alpha}^3 , .... $} . Then  prove that  the number of  $\alpha\in\mathbb{F}_{27}$ such that $|A_\alpha|$=26 equals 12.  $ 0\in A_\alpha $ if and only if $\alpha\neq 0$ For the first proof , the multiplicative group of the field $\mathbb{F}_{27}$ is cyclic and its order is 26  , so there are 12 generators in that group.   Now  I need  to  show  that  $ 1+\alpha+{\alpha}^2+.. {\alpha}^{25} $ =0  , where order of $\alpha$=26 . Since   $\alpha ^{26}$ =1 ($\alpha$-1)(1+$\alpha$+${\alpha}^2$+...+${\alpha}^{25}$)=0 , since $\alpha\neq 1$  , So $ 1+\alpha+...+{\alpha}^{25} $ =0 My question is , can I write these last two  lines?  I mean are those two lines alright to write? If those two lines are invalid then I need some help to show  $ 1+\alpha+{\alpha}^2+..+{\alpha}^{25} $=0  .Thanks Nowhere monotonic continuous function Does there exist a nowhere monotonic continuous function from some open subset of $\mathbb{R}$ to $\mathbb{R}$? Some nowhere differentiable function sort of object? Moving from HTTP to HTTPS in Google Search Console Using both “one’s” and “their” to refer to the same entity datetime.parse and making it work with a specific format I'm trying to include a tabu inside a new definition of an environment but it fails if the postamble (enddef) of the new environment includes tabu's contents, so cells. With tabular or tabular* works. The error is:   ! Missing number, treated as zero. \tabu@0.H5   The MWE:  \documentclass{article} \usepackage{tabu} \newenvironment{testt} {\begin{tabu} to \textwidth{cccc}  11 &amp; 12 &amp; 13 &amp; 14 \\  21 &amp; 22 &amp; 23 &amp; 24 \\} {  41 &amp; 42 &amp; 43 &amp; 44 \end{tabu} }  \begin{document}  \begin{testt}  31 &amp; 32 &amp; 33 &amp; 34 \\ \end{testt} \end{document}   How to solve this? Measure the size of a PostgreSQL table row I have a PostgreSQL table. select * is very slow whereas select id is nice and quick. I think it may be that the size of the row is very large and it's taking a while to transport, or it may be some other factor. I need all of the fields (or nearly all of them), so selecting just a subset isn't a quick fix. Selecting the fields that I want is still slow. Here's my table schema minus the names: integer                  | not null default nextval('core_page_id_seq'::regclass) character varying(255)   | not null character varying(64)    | not null text                     | default '{}'::text character varying(255)   |  integer                  | not null default 0 text                     | default '{}'::text text                     |  timestamp with time zone |  integer                  |  timestamp with time zone |  integer                  |   The size of the text field may be any size. But still, no more than a few kilobytes in the worst case. Questions  Is there anything about this that screams 'crazy inefficient'? Is there a way to measure page size at the Postgres command-line to help me debug this? I found Minecraft's marvelous large worlds extremely slow to navigate, even with a quad core and meaty graphics card.  I assume Minecraft's slowness comes from:   Java, as spatial partitioning and memory management are faster in native C++. Weak world partitioning.   I could be wrong on both assumptions. However, this got me thinking about the best way to manage large voxel worlds. As it is a true 3D world, where a block can exist in any part of the world, it is basically a big 3D array [x][y][z], where each block in the world has a type (i.e BlockType.Empty = 0, BlockType.Dirt = 1, etc.)  I assume that to make this sort of world perform well, you would need to:   Use a tree of some variety (//) to split all the cubes out; it seems like an oct/kd would be the better option, as you can just partition on a per cube level not a per triangle level. Use some algorithm to work out which blocks can currently be seen, as blocks closer to the user could obfuscate the blocks behind, making it pointless to render them. Keep the block object themselves lightweight, so it is quick to add and remove them from the trees.   I guess there is no right answer to this, but I would be interested to see peoples' opinions on the subject.  How would you improve performance in a large voxel-based world? Choosing numbers without consecutive numbers. In how many ways can we choose $r$ numbers from $\{1,2,3,...,n\}$,   In a way where we have no consecutive numbers in the set? (like $1,2$) Playing Minecraft on Windows 10, owning a Xbox One disc I own a Minecraft disc for an Xbox One, and would like to play on my PC (ultimately, playing with others who will be on the Xbox).  I'm not too familiar with the Xbox account ecosystem, and with dozen different Minecraft editions, I'm lost as to how I can do that. Removing small spaces (slivers) between polygons? What is "it" in the following sentence: It is clear that Bob likes doughnuts Capitalize fields of study? Do I say "I study computer science," or "I study Computer Science"? Similarly, "I really liked that computer science course," vs. "I really liked that Computer Science course." I've been working through a bit of Ireland and Rosen's Number Theory for fun. Problem 4.11 of Ireland and Rosen asks     Prove that $1^k+2^k+\cdots+(p-1)^k\equiv 0\pmod{p}$ if $p-1\nmid k$, and $-1\pmod{p}$ if $p-1\mid k$.    My work is leading where I didn't expect to go. Here I assume $p$ id odd. First, if $p-1\mid k$, then we can wrike $k=(p-1)j$ for some $j$. But then $$ 1^k+\cdots+(p-1)^k\equiv 1^{(p-1)j}+\cdots+(p-1)^{(p-1)j}\equiv \underbrace{1+\cdots+1}_{p-1\text{ times}}=\frac{(p-1)p}{2}\equiv 0\pmod{p} $$ since $p-1$ is even.   Secondly, I suppose $p-1\nmid k$. WLOG, I can assume $0&lt;k&lt;p-1$, Since if $k=(p-1)j+r$ with $0&lt;r&lt;p-1$, then  $$ a^k\equiv a^{(p-1)j+r}\equiv a^r\pmod{p}. $$  Then if $g$ is a primitive root, $$ 1^k+\cdots+(p-1)^k=\sum_{i=1}^{p-1}(g^k)^i=\frac{g^k(1-g^{k(p-1)})}{1-g^k}. $$ Since $g$ is primitive, $p\nmid 1-g^k$, but $p\mid 1-g^{k(p-1)}$, so the above sum is again congruent to $0\pmod{p}$.  So in all cases, I get the sum is congruent to $0$ regardless. Have I messed up, or is there a typo? Thanks. Pass extra parameters to an event handler? Live search through table rows How to put a full stop at the bottom, not mid-line, after an aligned matrix? How do I install Firefox 52 ESR on 16.04? This  asks how to install FF32 bit while keeping the 64 bit.  I want the much more simple thing: is there a canonical way to install firefox 52 ESR as "default" firefox in my 16.04?  I found this  ... but there are no packages; probably no wonder given the fact that the linked blog article dates back to 2012.  So, 2017, Ubuntu 16.04; how to install FF 52 ESR (as I simply need the java plugin to work for me).  ( my current solution: I downloaded the TAR file from mozilla, extracted that to /opt; and then changed /usr/bin/firefox to be a link to that ESR version of firefox. works, but ugly )