I have heard of many different ways to make easy gold, hacks, glitches, and rare items. But is there a way where I don't have to glitch, sell one of a kind items, and etc.?
In Oblivion, I had two favorite money-makers:   Dump all my stuff except some basic armor and potions, and raid an oblivion tower. The armor and weapons was worth lots, and selling it in Anvil made a lot of cash fast. Harvest an entire farm's worth of crops, create 'restore fatigue' potions and sell them.   Skyrim seems to spoil this:   Merchants have a max-amount per day/QOD/... instead of per item You can't carry as much (or maybe I have yet to discover the strength/feather spells) Alchemy is a lot harder (most common items go into food recipes now, which don't sell for those prices) On top of that, once a dungeon is cleared, it doesn't respawn - so no 'farming' familiar dungeons?   What are some easy/repeatable money making methods in Skyrim? Which are most efficient effortwise/real-life-time wise?
Find the product $\prod_{n=1}^{\infty} (1+x^{2n-1}) $ How do you give a C# auto-property an initial value?  I either use the constructor, or revert to the old syntax.    Using the Constructor:  class Person  {     public Person()     {         Name = "Initial Name";     }     public string Name { get; set; } }   Using normal property syntax  (with an initial value)  private string name = "Initial Name"; public string Name  {     get      {         return name;     }     set     {         name = value;     } }   Is there a better way? Prove the divergence of the sequence $\left\{ \sin(n) \right\}_{n=1}^{\infty}$. I am looking for nice ways of proving the divergence of the sequence $\left\{x_n\right\}_{n=1}^{\infty}$ defined by $$x_n=\sin{(n)}.$$ One (not so nice) way is to construct two subsequences: one where the indexes are picked such that they lie in the intervals  $$I_k=\left(\dfrac{\pi}{6}+2\pi(k-1),\dfrac{5\pi}{6}+2\pi(k-1)\right)$$ and one where they lie in $$J_k=\left(\dfrac{7\pi}{6}+2\pi(k-1),\dfrac{11\pi}{6}+2\pi(k-1)\right).$$ If ${x_n}$ converges, then all its subsequences must converge to the same limit, but here the first subsequence has all its values in the interval $\left[ \frac{1}{2}, 1\right]$ while the second has its values in $\left[-1,-\frac{1}{2}\right]$. Contradiction.  Filling the details of this proof is rather tedious and not very elegant. Anyone has a better idea? Suppose $K \subset L$ is a finite field extension of degree $m$. Is it true that there exists some natural $n$ such that $L$ is isomorphic to a subfield of $M^{n\times n}(K)$, the ring of $n\times n$ matrices with entries in $K$? What is the smallest dimension (as a function of $m$) for which an isomorphism exists?  The example I had in mind was the 2-dimensional extension $\mathbb{R} \subset \mathbb{C}$ with $\mathbb{C}$ being isomorphic to $\{ \begin{pmatrix}a&amp;-b\\b&amp;a\end{pmatrix} : a, b \in \mathbb{R}\}$. Prove that the minimum number of cycles is $m-n+1$ The question I have is:   Prove that the minimum number of cycles is $m-n+1$ in a connected graph. Where one cycle is a path that starts that begins and ends at the same vertex. Where $m$ is edges and $n$ is the vertices.   I have no idea where to start. A few hints would be appreciated. Please do not provide me with the answer. How to return multiple objects from a Java method? Should flour be thrown out past its expiry date? How to Hide sections of InfoPath form based on Group membership I need to Hide "Sections" of InfoPath form using SharePoint or AD group membership (either is fine). How can I achieve this?  InfoPath 2010 in SharePoint 2010 Delete all but the most recent X files in bash Is there a simple way, in a pretty standard UNIX environment with bash, to run a command to delete all but the most recent X files from a directory?  To give a bit more of a concrete example, imagine some cron job writing out a file (say, a log file or a tar-ed up backup) to a directory every hour. I'd like a way to have another cron job running which would remove the oldest files in that directory until there are less than, say, 5.  And just to be clear, there's only one file present, it should never be deleted. How to get keycodes for xmodmap? I'm trying to use xmodmap to remap Alt / Super keys on Dell L100 keyboard, and have trouble getting the keycodes.  For instance, using xev doesn't give me keycode for Alt   FocusOut event, serial 36, synthetic NO, window 0x4a00001,     mode NotifyGrab, detail NotifyAncestor  FocusIn event, serial 36, synthetic NO, window 0x4a00001,     mode NotifyUngrab, detail NotifyAncestor  KeymapNotify event, serial 36, synthetic NO, window 0x0,     keys:  122 0   0   0   0   0   0   0   0   0   0   0   0   0   0   0               0   0   0   0   0   0   0   0   0   0   0   0   0   0   0   0      For Right Super key, xev and showkey give different keycodes -- 134 and 126 respectively.  What's going on with these keycodes?  I tried getting keycodes from showkey -k, and using xmodmap file below, but that gave a weird map which remapped b key:  clear Mod1 clear Control keycode 125 = Meta_L keycode 126 = Meta_R keycode 58 = Control_L keycode 56 = Control_L keycode 100 = Control_R add Control = Control_L Control_R add Mod1 = Meta_L Meta_R What TV movie had lost space cadets who piloted yellow tripod robots, and a squid bad guy? I'm trying to find a movie I watched on TV, probably in the 90s. I think it was a made-for-TV movie.  It was about a ship with an AI. The ship was crewed by young adults. I think they were cadets?   There was an accident (like a warp drive malfunction) and they end up in another part of space where they meet a female alien whose ship had been shot down.  I remember they had manned robots they would pilot and they took them to a planet to get upgraded and they are attacked by more manned robots. They had three legs and they were yellow, I think.  I also remember the baddie had a holo-projector or something like that which allowed him to change his appearance. He commanded a massive fleet and he worked for someone he spoke to in a video chat that looked like a squid. Identify this YA book series about dragons, acid blood, and dangerously cold nights I'm trying to remember the name of a series of books about a boy who works with dragons.  Dragon's blood (or maybe it was slobber?) is acidic, and the children who wrangle these dragons often end up with deep pock marks.  On this world, days are like ours but nights get very cold, requiring anyone stuck outside to find a shelter until dawn (not the false dawn)  The other thing I remember is that in one of the books by slicing open a dragon and spending the night, the character emerged with special dragon powers. My installer build "signs" a DLL using a Code Signing certificate during the build process.   I've noticed that if I try to build twice in succession, the second build fails because the DLL is already signed so signcode chokes. Obviously I can fix this by signing a copy of the DLL in the build, but the problem intrigued me:   Is it possible to "unsign" a DLL, and if not, why not...? I have this problem I'm working on. Hints are much appreciated (I don't want complete proof):  In a normed vector space, if $ x_n \longrightarrow x $ then  $ z_n = \frac{x_1 + \dots +x_n}{n} \longrightarrow x $   I've been trying adding and subtracting inside the norm... but I don't seem to get anywhere.  Thanks! How do I drop an object to the sand? Unable to lock the administration directory (/var/lib/dpkg/) is another process using it? Low Voltage AC Smoothing Capacitor Calculation I have a 9V AC source which will have a max load of 100mA.  I'm trying to figure the value of a smoothing capacitor with less than a 10% ripple.  I don't have a scope or else I'd just try a bunch out.  I'm just a hobbyist, but I'm trying to understand this.  Since I'm not sure if I'm doing this right, I'll just step through what I've done so far.  First I found this formula: $$V_{ripple}={V_p \over R_LC} \times \Delta T$$  I'm using 60Hz 9VAC that is full wave rectified and I want a 10% ripple so:  $$(9V \times .1)={9V \over R_LC} \times {1 \over 60Hz}$$  I'm calculating my resistive load with Ohm's law. $$R = {9V \over .1A} \quad R = 90 \Omega$$  So plugging that in I get: $$.9V={9V \over 90\Omega \; C} \times {1 \over 60Hz}$$  If I solve for C (admittedly using wolfram alpha), I get: $$C={1\over 540}F \quad C=1851 \mu f$$  1850µf seems pretty high to me...  And if I lower the ripple percent it get crazy high.  Is this the right way to find this?  Or did I screw up somewhere?  Also, my circuit has the capacitor between the full bridge rectifier's positive and negative outputs.  I've only seen this type of smoothing circuit, but maybe my circuit needs to change? Joda Time: How to get dates of weekdays on some date interval? Inequality Regarding e Is there a simple, constructive, 1-1 mapping between the reals and the irrationals? Is there a simple, constructive, 1-1 mapping between the reals and the irrationals?  I know that the Cantor–Bernstein–Schroeder theorem implies the existence of a 1-1 mapping between the reals and the irrationals, but the proofs of this theorem are nonconstructive.  I wondered if a simple (not involving an infinite set of mappings) constructive (so the mapping is straightforwardly specified) mapping existed.  I have considered things like mapping the rationals to the rationals plus a fixed irrational, but then I could not figure out how to prevent an infinite (possible uncountably infinite) regression.