I'm looking for very simple obfuscation (like encrypt and decrypt but not necessarily secure) functionality for some data. It's not mission critical. I need something to keep honest people honest, but something a little stronger than  or .  I'd prefer something that is already included in the  framework 2.0, so I don't have to worry about any external dependencies.  I really don't want to have to mess around with public/private keys, etc. I don't know much about encryption, but I do know enough to know that anything I wrote would be less than worthless... In fact, I'd probably screw up the math and make it trivial to crack.
How can I encrypt and decrypt a string in C#?
How did the house elves start serving wizards? How/Why/When did the house elves start serving wizards? I tried on my own to find the answer but I couldn't find anything relevant to my subject but I am bad at searching. I have read answers to questions like  but I couldn't find a general rule for using "you" or "yourself", "him" or "himself" that could explain things I see in some examples.  For example, I think that one normally say (according to examples I see in ):   You bring something with you. You have something in you. You have something on you. You pressed her to you.   But on the other hand one would say:   You draw attention to yourself. He killed himself. You can try it out for yourself.   As a general rule, it seems that the reflexive pronoun is used when the object is the same as the subject of the verb. But for prepositional phrases, it seems more complicated. Do some prepositions (like "with", "in", "on") always come with the accusative form of the pronoun, and some other (like "for") don't? What about "to", that seems to be followed by both in different circumstances? Is it (always) true that $$\mathrm{Var}\left(\sum\limits_{i=1}^m{X_i}\right) = \sum\limits_{i=1}^m{\mathrm{Var}(X_i)} \&gt;?$$ author not appearing in \maketitle in amsart I am new to the amsart document class. For some reasons \author (etc..) is not showing after I use \maketitle. This is my tex:  \documentclass[12pt,reqno,a4paper]{amsart}  \usepackage{amsmath} \usepackage{amssymb} \usepackage{amsfonts} \usepackage{mathrsfs}  \usepackage{amsthm}  \usepackage{latexsym}  \usepackage{pictexwd} \usepackage{pdftricks} \usepackage{natbib} \usepackage{setspace} \usepackage{color} \usepackage[affil-it]{authblk}  \begin{document}  \title{Temptation, Asymmetric information and Committment}  \author{Mark}  \affil{University of Leicester}  \date{February 2014}  \maketitle  \begin{abstract} To be written \end{abstract}  \section{introduction}  ...  \end{document}   and this is the output:   can anybody help me out? Yu Yuphoria bricked after installing custom recovery and boot file My YU YUPHORIA got bricked while I was working with it. I want to install custom ROM into it for that I am installing custom recovery and boot file but the file that is found on Internet was not working and that's why I am stuck with company logo. I can't go into recovery mod, neither it boot, and USB debugging mode is turned off. I tried to install fresh ROM from fastboot but after installing every driver properly command prompt is showing "waiting for the device". Please sugest some way to get rid of this problem. "Please do not repeat the mistake" and "Please do not repeat the mistake again" Why am I getting objects printed twice? Does Gentle Repose work on a Circle of Spore Druid's Fungal Infestation Ability? The Circle of Spores Druid feature Fungal Infestation states:  If a beast or humanoid that is Small or Medium dies within 10 feet of you, you can use your reaction to animate it, causing it to stand up immediately with 1 hit point. The creature uses the zombie statistics. It remains animate for 1 hour, after which time it collapses and dies.  Circle of Spore druids also gain access to the  spell, which states:  You touch a corpse or other remains. For the duration, the target is protected from decay and can’t become undead. The spell also effectively extends the time limit on raising the target from the dead, since days spent under the influence of this spell don’t count against the time limit of spells such as raise dead.  There seem to be some good arguments that they cannot work together:  First, Gentle Repose states the target cannot become undead, which would seem to preclude Gentle Repose working on a fungally infested creature that appears to be in some sense raised from the dead. Second, gentle repose states you touch a corpse or other remains - one could argue that using the zombie statistics, the fungally infested entity is neither a corpse or remains, but an undead zombie.  However, there are also some reasonable arguments that they could work together:  First, the Fungal Infestation does not say that the creature is undead or a zombie, but that it uses the statistics of a zombie, which might leave room for a RAW interpretation that the features could work together (for example, it could be considered a fungally infested corpse or fungally raised remains). Second, Gentle Repose says that it extends the time limit of raising the target from the dead and makes reference to spells like Raise Dead, which in flavour are similar to what happens with Fungal Infestation.  RAW, can a player cast gentle repose on a zombie created by Fungal Infestation? I get this error in the deployment step of a share-point farm based project. Most of the suggested solutions on the net are a simple Visual Studio re-start, however, a simple VS restart won't fix this.   Any ideas on what might be causing this? So I am in an introductory linear algebra(with proofs) class, and I came across the following theorem:  If $S$ is a subspace of a vector space $V(F)$ and is generated by $\{a_1,...,a_n\}$ then any subset $\{b_1,...,b_m\}$ of $S$ with $m&gt;n$ is linearly dependent.   The proof in the textbook is done through induction (as most proofs regarding finite sets are) but I really do not follow it and I feel there is a simpler way of doing it. A hint would be appreciated. What's wrong with XKCD's Frequentists vs. Bayesians comic? makes fun of a frequentist statistician who derives an obviously wrong result.  However it seems to me that his reasoning is actually correct in the sense that it follows  the standard frequentist methodology.   So my question is "does he correctly apply the frequentist methodology?"    If no: what would be a correct frequentist inference in this scenario? How to integrate "prior knowledge" about the sun stability in the frequentist methodology? If yes: wtf? ;-) Why can two (or more) electric field lines never cross? The the title is self explanatory, I guess.  Why can two (or more) electric  never cross? How do berry mutations work? I wanna create a new partition from the existing root partition.My root partition is about 250GB.I wanna create a new partition say 150 GB taking space from this root partition.Can anyone help me with the procedure on doing this?  output: fdisk -l  karthick@karthick:~$ sudo fdisk -l [sudo] password for karthick:   Disk /dev/sda: 250.0 GB, 250000000000 bytes 255 heads, 63 sectors/track, 30394 cylinders Units = cylinders of 16065 * 512 = 8225280 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x28219744  Device Boot      Start         End      Blocks   Id  System /dev/sda1   *           1          61      487424   83  Linux Partition 1 does not end on cylinder boundary. /dev/sda2              61       30395   243650561    5  Extended /dev/sda5              61         124      498688   82  Linux swap / Solaris /dev/sda6             124         186      498688   82  Linux swap / Solaris /dev/sda7             186       30395   242651136   83  Linux I am very confused about how to compute  $$\sum_{n=0}^{\infty}nk^n.$$  Can anybody help me? A composition of a periodic function that is somehow not periodic. Hide a Subdomain from Google/Search Engine SEO Result? We currently have some indexes where ALLOW_PAGELOCKS is set to off. This presumably was done in order to reduce deadlocks. However I doubt that it would really had an effect back then.   Now I am trying to understand WHEN SQL Server actually chooses to start locking pages rather than keys in a clustered index. I asked Jonathan Keyhaisas recently and he told me that this could happen if I am touching rows on several subsequent pages. However I didn't manage to get any exclusive page locks by updating rows in a clustered index with a sample query.   Could you help me understand page locks better with a sample query and table? I am running SQL Server 2008 SP4.  Thanks in advance  Martin Suppose that I have a group $G$ of order $p^{2}q$ for two distinct primes $p$ and $q$.  I need to first show that one of its Sylow subgroups is normal.  I start by letting $H$ be a Sylow $p$-subgroup and $K$ be a Sylow $q$-subgroup.  If $K$ is not normal, then letting $r$ denote the number of Sylow $q$-subgroups, I have that $r|p^{2}$ and $r\equiv 1$(mod $q$).  I also have by the second Sylow theorem that $r\neq 1$.  So $r = p$ or $p^{2}$.  If $r = p^{2}$, I can write out the Sylow $q$-subgroups, and count their combined elements to show that $H$ is uniquely determined and then again imply Sylow number $2$ to obtain that $H$ is normal.  But if $r = p$, then I cannot see how to proceed.  Can anyone give any advice?  Thank you.  ( I am happy to provide more detail for the $r = p^{2}$ case if it is desired or appropriate. ) I have calculated AIC and AICc to compare two general linear mixed models; The AICs are positive with model 1 having a lower AIC than model 2.  However, the values for AICc are both negative (model 1 is still &lt; model 2).  Is it valid to use and compare negative AICc values?