I sell bread at farmers markets. It gets moldy very fast. How can I get them to last longer?
I love making our own bread - we rarely buy shop bought, but it tends to go off very quickly. Part of the appeal is that it doesn't have any "junk" in it - artificial preservatives - which I'm sure contributes to the lovely flavor. Is there anything natural I can add to it to stop it going moldy so fast?
Is there a good resource or tool to help build a palette/color scheme around colors I select? No matter how nice the composition, flow, and lines of my design are, if I am not copying directly from nature, I have a very difficult time picking a decent color scheme.  It either looks too drab, or too garish.  Is there a good resource that will help me to choose a color scheme that has 2 or 3 colors, and the colors do not clash?  I'm not looking for specific colors or color schemes.  What I need is a resource that will help me choose a color (or colors) that go nicely with, or provide a good accent to, whatever main color I am working with on the design. How do I unit test (using xUnit) a class that has internal private methods, fields or nested classes? Or a function that is made private by having  (static in C/C++) or is in a private () namespace?  It seems bad to change the access modifier for a method or function just to be able to run a test. WPF textblock binding with List does anyone know if there is a simple way to bind a textblock to a List. What I've done so far is create a listview and bind it to the List and then I have a template within the listview that uses a single textblock.  what I'd really like to do is just bind the List to a textblock and have it display all the lines.  In Winforms there was a "Lines" property that I could just throw the List into, but I'm not seeing it on the WPF textblock, or TextBox.  Any ideas?  did I miss something simple?  Here's the code  &lt;UserControl x:Class="QSTClient.Infrastructure.Library.Views.WorkItemLogView" xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation" xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"          Width="500" Height="400"&gt; &lt;StackPanel&gt;     &lt;ListView ItemsSource="{Binding Path=Logs}" &gt;         &lt;ListView.View&gt;             &lt;GridView&gt;                 &lt;GridViewColumn Header="Log Message"&gt;                     &lt;GridViewColumn.CellTemplate&gt;                         &lt;DataTemplate&gt;                             &lt;TextBlock Text="{Binding}"/&gt;                         &lt;/DataTemplate&gt;                     &lt;/GridViewColumn.CellTemplate&gt;                 &lt;/GridViewColumn&gt;             &lt;/GridView&gt;         &lt;/ListView.View&gt;     &lt;/ListView&gt; &lt;/StackPanel&gt;     and the WorkItem Class  public class WorkItem {     public string Name { get; set; }     public string Description { get; set; }     public string CurrentLog { get; private set; }     public string CurrentStatus { get; private set; }     public WorkItemStatus Status { get; set; }     public ThreadSafeObservableCollection&lt;string&gt; Logs{get;private set;}   I'm using Prism to create the control and put it into a WindowRegion          WorkItemLogView newView = container.Resolve&lt;WorkItemLogView&gt;();         newView.DataContext = workItem;         regionManager.Regions["ShellWindowRegion"].Add(newView);   thanks Effect of linear terms on a QFT I was told when first learning QFT that linear terms in the Lagrangian are harmless and we can essentially just ignore them. However, I've recently seen in the linear sigma model, \begin{equation}  {\cal L} = \frac{1}{2} \partial _\mu \phi _i \partial ^\mu \phi _i - \frac{m ^2 }{2} \phi _i \phi _i  - \frac{ \lambda }{ 4} ( \phi _i \phi _i ) ^2  \end{equation}  with $m ^2 =-\mu^2 &gt; 0$, adding a linear term in one of the fields $\phi_N$, does change the final results as you no longer have Goldstone bosons (since the $O(N)$ symmetry is broken to begin with).   Are there any other effects of linear terms that we should keep in mind or is this the only exception of the "forget about linear terms" rule? Bibtex style for "Statistics and Computing" I would like to create a bibtex style which answers the requirements of Statistics and Computing journal. How could I do that? Here is an example of how the bibliography should look like:  Journal article: Hamburger, C.: Quasimonotonicity, regularity and duality for nonlinear systems of partial differential equations. Ann. Mat. Pura Appl. 169, 321–354 (1995) Book: Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Boston (1992) Book chapter: Broy, M.: Software engineering — from auxiliary to key technologies. In: Broy, M., Denert, E. (eds.) Software Pioneers, pp. 10–13. Springer, Heidelberg (2002)  In the text, the references should be as follows:  Negotiation research spans many disciplines (Hamburger 1995).  Thank you for your help! When would you call java's thread.run() instead of thread.start()? How to name an item using /give command in MCPE? I'm having troubles with one of the problems in the book Introduction to Commutative Algebra by Atiyah and MacDonald. It's on page 11, and is the last part of the second question.  Given $R$ a commutative ring with unit. Let $R[x]$ be the ring of polynomials in an indeterminate $x$ with coefficients in $R$. We say that a polynomial $f = \sum\limits_{i=0}^n r_ix^i \in R[x]$ (with coefficients $r_0, r_1, \ldots, r_n$) is primitive if $\langle r_0,r_1,...,r_n\rangle = R$, i.e., the ideal generated by the coefficients of $f$ is $R$. Let $f$ and $g$ be two polynomials in $R[x]$. Prove that $fg$ is primitive iff $f$ and $g$ are both primitive.  The $\Rightarrow$ part is easy. Say, $f = \sum\limits_{i=0}^n r_ix^i$, $g = \sum\limits_{i=0}^m s_ix^i$; then $fg = \sum\limits_{i=0}^{m+n} c_ix^i$, where $c_k = \sum\limits_{i + j = k}r_is_j$. Since $fg$ is primitive, there exists a set of $\{\alpha_i\} \subset R$, such that $\sum\limits_{i=0}^{m+n} \alpha_ic_i = 1$, to prove $f$ is primitive, I just need to write all $c_i$'s in terms of $r_i$'s, and $s_j$'s, then group all $r_i$ accordingly, rearranging  it a little bit, and everything is perfectly done. And the proof of the primitivity of $g$ is basically the same. The $\Leftarrow$ part is just so difficult. Say $f = \sum\limits_{i=0}^n r_ix^i$, $g = \sum\limits_{i=0}^m s_ix^i$ are both primitive, then there exists $\{\alpha_i\}; \{\beta_i\} \subset R$, such that $\sum\limits_{i=0}^{n} \alpha_ir_i = 1$, and $\sum\limits_{i=0}^{m} \beta_is_i = 1$. At first, I thought of multiplying the two together, but it just didn't work. So, I'm stuck since I cannot see any way other than multiplying the two sums together. I hope you guys can give me a small push on this. Thanks very much in advance, And have a good day. What does "can only heal so much" mean in this sentence? Prove that every prime larger than $3$ gives a remainder of $1$ or $5$ if divided by $6$ Can we prove that every prime larger than $3$ gives a remainder of $1$ or $5$ if divided by $6$ and if so, which formulas can be used while proving? Extra slash added to the chat room URLs in the side bar Pagination go to first page if i'm on last post I have a custom post type and used get_next_post() and get_previous_post() to create a simple pagination. However i need to create a pagination loop (if that is the correct term). If i'm on the first post i need to browse back to the last post and if i'm on the last post i need to browse to the first post. Is there a simple way to do this that i haven't seen but Google, this site and the codex has not been very helpfull :/  The current code i have is. I've tried to use wp_list_pages and other functions but with little luck.  $next_post = get_next_post(); $prev_post = get_previous_post(); $nav = array(     "next_post" =&gt; array(         "url"       =&gt; get_permalink($next_post-&gt;ID),         "id"        =&gt; $next_post-&gt;ID,         "titill"    =&gt; get_field("vinstri_titill", $next_post-&gt;ID)." - ".get_field("vinstri_undirtitill", $next_post-&gt;ID)     ),     "prev_post" =&gt; array(         "url"       =&gt; get_permalink($prev_post-&gt;ID),         "id"        =&gt; $prev_post-&gt;ID,         "titill"    =&gt; get_field("vinstri_titill", $prev_post-&gt;ID)." - ".get_field("vinstri_undirtitill", $prev_post-&gt;ID)     ), ); EPSG:4326 being saved as CRS:84 How do I sudo a command in a script without being asked for a password? Is it possible to install an app and exclude some of its requested permissions? Occasionally I want to install an application which requires certain permissions that I feel it really shouldn't need. Can I install the app without giving it these permissions? For example, GPS location, , internet connection, etc.  Is it possible to change the permissions of an application once it is installed? Developing Unit Tests While Refactoring Legacy Code? How to count derangements? I was going through .Suppose that there are n persons who are numbered 1, 2, ..., n. Let there be n hats also numbered 1, 2, ..., n. We have to find the number of ways in which no one gets the hat having same number as his/her number. Let us assume that the first person takes hat i. There are n − 1 ways for the first person to make such a choice. There are now two possibilities, depending on whether or not person i takes hat 1 in return:  A) Person i does not take the hat 1. This case is equivalent to solving the problem with n − 1 persons and n − 1 hats: each of the remaining n − 1 people has precisely 1 forbidden choice from among the remaining n − 1 hats (i's forbidden choice is hat 1).  B) Person i takes the hat 1. Now the problem reduces to n − 2 persons and n − 2 hats.  From this, the following relation is derived: !n = (n - 1) (!(n-1) + !(n-2))  I have a hard time understanding point B and the equation derived. I was trying to understand with an example of 4 people named A, B, C and D and the corresponding hats A, B, C and D. Everyone of them are supposed to wear any hat except their own matching hat i.e. A can wear B, C or D.  If suppose A wears B hat so we will be left with only 3 people and 3 hats. So I can understand "(n-1)!(n-1)" part but what i didn't understand is part B(marked above). Can anyone help? Does anyone have a Terminal command-line recipe for making a new bootable USB flash drive for one of the new MacBook Air's?  Is there a way to dd copy the USB boot device that comes in the box and make the new copy bootable?  I'd like to make a new backup copy of the USB rescue device for my MBA, preferably on a much larger flash drive with room for a backup of some of my working directories.  Added:  And is it possible to make, not just a rescue drive, but a bootable USB drive that will boot a fully updated version of the OS (say 10.6.8 or later)?  If so how on a MacBook Air 11, and how big a USB stick will this require? How to make nautilus use file-roller in 17.10 like in 17.04? In Ubuntu 17.10 ubuntu upgraded Nautilus (File Browser) to version 3.26.0. New nautilus is not using file-roller anymore, it has  to an integrated compression mechanism.     This makes it complicated to create encrypted archives and/or different types compression archives that file-roller does provide.  How to make nautilus use file-roller as before?  Related question: Question about the Riemann-Lebesgue Lemma proof Ok, so one of the formulations of the Riemann-Lebesgue Lemma says: $$ f\in L^1(\mathbb{R}) \implies \hat{f}(\omega)\to 0\;\mbox{ when } \;|\omega|\to\infty.$$  I get all the steps of the proof, except the one which says that if $f$ is an arbitrary integrable function, it may be approximated in the $L^1$ norm by a compactly supported smooth function $g\in L^1$. My question is: Why? How do you know that for all $\epsilon&gt;0$, and for all arbitrary function $f\in L^1$ exists a compactly supported smooth function $g$ so that $||f-g||_{L^1}&lt;\epsilon$? The "proof" can be found in many places, but this step can be found in Wikipedia