I'm writing my thesis in texshop, using Bibdesk as bib library. The problem I'm having is; I can't import all references into my thesis. there are 50 items and I can see only 30 of them.   I'll be glad for any help.
Im very new at LaTeX and I would appreciate some help solving this problem. I have created a BibTeX file containing all references to a document. In this text file BibTeX items are inserted and no other text are written, for instance @article{...}. When I call for this bib file from the main.tex file I use the commands:  \bibliographystyle{plain} \bibliography{thebibliography}   Now to my question. All i get when I compile this main.tex is the title (bibliography) for this chapter, otherwise the textfield is blank. Is this error occurring because I should write anything in the bib file or have I missed any lines in the main.tex file.
Prove that $\sum_{n=0}^\infty \frac{(-1)^n}{3n+1} = \frac{\pi}{3\sqrt{3}}+\frac{\log 2}{3}$ Applications of complex numbers to solve non-complex problems Recently I asked a question regarding the diophantine equation $x^2+y^2=z^n$ for $x, y, z, n \in \mathbb{N}$, which to my surprise was answered with the help complex numbers. I find it fascinating that for a question which only concerns integers, and whose answers can only be integers, such an elegant solution comes from the seemingly unrelated complex numbers - looking only at the question and solution one would never suspect that complex numbers were lurking behind the curtain!  Can anyone give some more examples where a problem which seems to deal entirely with real numbers can be solved using complex numbers behind the scenes? One other example which springs to mind for me is solving a homogeneous second order differential equation whose coefficients form a quadratic with complex roots, which in some cases gives real solutions for real coefficients but requires complex arithmetic to calculate.  (If anyone is interested, the original question I asked can be found here: )  EDIT:  I just wanted to thank everyone for all the great answers! I'm working my way through all of them, although some are beyond me for now! What's the difference between align and align*? After some brief searching I can't find the difference between align and align*. Google summarily ignoring the * is making it harder I think.  Can you tell me the difference between these two?  Moreover, can you tell me where you generally go for this type of information? As a relatively new user I'm still building up my resources. Determining ethnicity according to ancestry? My sister, cousins, and other relatives speculate that my mom's grandmother was Jewish (for various reasons). I've heard people say at times things like, for example, "I'm 50% German" or "I'm 25% Swedish." This has to do with their ancestry. But, how exactly is this calculated? Say for example that my mother's paternal grandmother was indeed 100% Jewish, what would that make me and my siblings, and how is it calculated? This question pertains to L1 &amp; L2 regularization parameters in Light GBM. As per official documentation:  reg_alpha (float, optional (default=0.)) – L1 regularization term on weights.  reg_lambda (float, optional (default=0.)) – L2 regularization term on weights  I have seen data scientists using both of these parameters at the same time, ideally either you use L1 or L2 not both together.   While reading about tuning LGBM parameters I cam across one such case: Kaggle official GBDT Specification and Optimization Workshop in Paris where Instructors are ML experts. And these experts have used positive values of both L1 &amp; L2 params in LGBM model. Link below (Ctrl+F 'search_spaces' to directly reach parameter grid in this long kernel)      I have seen same in XGBoost implementations.  My question is why use both at the same time in LGBM/XGBoost.  Thanks. Duality discrete math problem This is the only answer I got wrong on my HW and the prof does not want to give us the correct answers before our midterm     The dual of a compound proposition that contains only the logical operators $\lor$ , $\land$ , and   $\neg$ is the compound proposition obtained by replacing each $\lor$ by $\land$ , each $\land$ by $\lor$ , each $\def\T{{\rm T}}\def\F{{\rm F}}$   $\T$ by $\F$ , and each $\F$ by $\T$ . The dual of $s$ is denoted by $s^*$. Find the dual of these compound propositions.      a) $p \lor\neg q$     I got $\neg p \land q$       b) $p \land (q \lor (r \land \T))$     My answer was $\neg p \lor (\neg q \land r)$       c) $(p \land \neg q) \lor (q \land \F)$     My answer was $(\neg p \lor q) \land  \neg q$  I have tried googling the problem and cannot come up with anything on duals and our lectures are online and upon reviewing do not see anything. I am just confused and looking for a little guidance on what was incorrect with my answers. Wear a hat multiple times? Map matching links and ideas? I'm using OpenStreetMap and its vectorial road network and I'd like to implement a map matcher algorithm.   Currently I'm able, for each GPS position, to retrieve the nearest road segment and calculate the projection of this position to that segment, like on this image (Red pin is the pure GPS position, in blue the mapped segment and in Green the mapped position):    However, due to the lack of accuracy of the GPS, sometimes the mapped position jumps from segment to another and can provide some inconsistent mapped position from time to time.  My current algorithm is very basic : from the pure GPS position, I get the nearest segment and decide that the mapped matched position is on this one. I know that this can be really improved.  I can imagine that taking the vehicle direction into account will improve the map matching but do you know any other approach that would enable me to improve my map matcher ?  I seek any link, and/or open source software? Expected value of the number of flips until the first head Suppose we flip a coin until we see a head. What is the expected value of the number of flips we will take?  I am pretty new to expected value, so I tried to evaluate it by multiplying the probability of each scenario with the number of flips it took to get there (like taking the arithmetic mean). This didn't work though, because of the infinite possibilities. I'm really confused, and if someone were to provide an answer, I would really appreciate it if they could go into detail. I think I've got it down to the most basic case:  int main(int argc, char ** argv) {   int * arr;    foo(arr);   printf("car[3]=%d\n",arr[3]);   free (arr);   return 1; }  void foo(int * arr) {   arr = (int*) malloc( sizeof(int)*25 );   arr[3] = 69; }   The output is this:  &gt; ./a.out   car[3]=-1869558540  a.out(4100) malloc: *** error for object 0x8fe01037: Non-aligned pointer                          being freed  *** set a breakpoint in malloc_error_break to debug &gt;   If anyone can shed light on where my understanding is failing, it'd be greatly appreciated. How to detect the Internet connection is offline in JavaScript? how to left justify comments to indent same as other text in Algorithmic How do I left justify my comments in the algorithm.  I am using algorithmicx package.  What I want is: to pull the comment to left as shown in the attached snapshot.  The code for my algorithm is       \documentclass[a4paper]{article}     \pagestyle{empty}     \usepackage{algorithm}     \usepackage{algpseudocode}     \usepackage[caption=false,font=footnotesize]{subfig}     \begin{document}     \begin{algorithm} \label{algoQ}     \caption{Algorithm to check quality of methods}     \begin{algorithmic}     \For{\textbf{each} $msd$ in$msdList$}  \Comment { \% for each MSD \%}     \Statex   \Comment { \% get MSDs referenced method service \%}     \EndFor \textbf{endFor}     \end{algorithmic}     \end{algorithm}     \end{document} I've noticed that, if I add \n to a pattern for substituting using sed, it does not match. Example:  $ cat &gt; alpha.txt This is a test Please do not be alarmed  $ sed -i'.original' 's/a test\nPlease do not/not a test\nBe/' alpha.txt  $ diff alpha.txt{,.original}  $ # No differences printed out   How can I get this to work? Does using the Console Commands negatively affect me? I'm wondering in case I get stuck in an area that I'm unable to get out of or if I clip into a wall and I suddenly can't move. I've had to disable clipping to get out of certain areas in Skyrim before but I want to make sure that things like my achievements and stuff won't shut out on my playthrough.  If I enable something, spawn an item that didn't spawn for me, or just basically use the console command to fix any bugs, what will happen achievement and game-wise? How do I simulate flip of biased coin? In unbiased coin flip H or T occurs 50% of times.  But I want to simulate coin which gives H  with probability 'p' and T with probability '(1-p)'.  something like this:  def flip(p):    '''this function return H with probability p'''    # do something    return result  &gt;&gt; [flip(0.8) for i in xrange(10)] [H,H,T,H,H,H,T,H,H,H] Having trouble finding Plantera's Bulb I have been playing on hardmode for a while and have beaten the three  a couple of times. But I have yet to find a . It's getting really frustrating.  Does anyone have any methods to finding a Plantera Bulb? Regarding the `book`, `report`, and `article` document classes: what are the main differences? How to sort a ConcurrentSkipListMap by value? unable to printout arrayOfInt initialised within the class constructor Show that $(L^{p},\|\|_{p})$ is a Banach space. Show that $(L^{p},\|\|_{p})$ is a Banach space.  My approach: I prove the statement for $(L^{1},\|\|_{1})$, of the following way, first all, is easy show that $\|\|_{1}$ is a norm. So,  $(L^{1},\|\|_{1})$ is vector space. To show that is a Banach space, note that  Prop. 1: Let $(f_{n})_{n\in\mathbb{N}}\subset\mathcal{L}^{1}$ (where $\mathcal{L}^{1}=\mathcal{L}^{1}(X,\tau,\mu)$ is the space of all integrals function), such that $\sum_{i}{\|f_{n}\|}_{1}&lt;\infty$, then the sequences $\left(\sum_{n=1}^{N}{f_{n}}\right)_{n\in\mathbb{N}}$ converges almost everywhere to the integral function, that we called $\sum_{n\in\mathbb{N}}{f_{n}}$. Furthermore $$\sum_{n\in\mathbb{N}}{\int{f_{n}d\mu}}=\int{\sum_{n\in\mathbb{N}}{f_{n}d\mu}}\quad\lim_{N\to\infty}{\|\sum_{n=1}^{N}{f_{n}}-\sum_{n\in\mathbb{N}}{f_{n}}\|_{1}}=0$$ Prop. 2: Let $(E,\|\|)$ a normed vector space. Then $E$  is a Banach space if and only if for all $(e_{k})_{k\in\mathbb{N}}\subset E$ such that $\sum_{k\in\mathbb{N}}{\|e_{k}\|}&lt;\infty$, $\left(\sum_{k=1}^{n}{e_{k}}\right)_{n\in\mathbb{N}}$ converges in $E$  We take the proposition 2. Let $(f_{n})_{n\in\mathbb{N}}\subset L^{1}$ such that $\sum_{n}{\|\hat{f}_{n}\|_{1}}&lt;\infty$. Let $f_{n}\in\hat{f}_{n}$, then $\|f_{n}\|_{1}=\|\hat{f}_{n}\|_{1}$ and then $\sum_{n}{\|f_{n}\|_{1}}&lt;\infty$, by prop. 1, there exist $F\in\mathcal{L}^{1}$ such that $\|\sum_{n=1}^{N}{f_{n}-F\|_{1}}\to 0$, and then $\|\sum_{n=1}^{N}{\hat{f}_{n}-F\|_{1}}\to 0$. Finally note that $\hat{F}\in L^{1}$ is a Banach space. This was my answer for  $L^{1}$ space, but how I prove the general statement for $L^{p}$ (I want to do a similar response). Edit: I'm stuck in the problem, any idea or hint is appreciated.Thanks!!