I would like to get older versions of /private/var/log/system.log files from TimeMachine.  Is this possible?  How?   I see current system.log files. I went to folder /private/var/log then invoked TimeMachine.     When I go back to previous backup, I do not see system.log files.    relates to    User want to look through macOS log files to see history of external drive mounting. Data is in "/private/var/log/system.log".  Needed data is a month old. A month is longer than normal backup of system.log is keep.  Attempted to look in timemachine backup but it seems the older system.log files are not kept.
In addition to whatever files I may choose to exclude, what files does the system exclude by rule or classification?    It might make sense not to backup Trash or Caches, but I'm looking for a way to tell what files are skipped "behind the scenes." Knowing if the system maintains an exclusion list or exclusion pattern would be very helpful in managing larger groups of macs.
Dual Booting win 10 and Ubuntu 18.04 on two separate physical ssds I have gotten as far as to create the bootable usb, booting into that bootable usb and getting to the install options however i quit because I had some concerns.  I currently have a Samsung 850 evo 1tb that has win 10ninstalled. I want to dual boot with Ubuntu 18.04 by installing it on a brand new unformatted uninitialized Samsung 860bevo 250gb. Should i format the brand new ssd as a new volume in win 10 and then proceed with the Ubuntu install on this volume. What else should i do? Im a first time Ubuntu user and installer.  Any and all help is appreciated. Proof that $(x-1)^2$ divides a $nx^{n+1} – (n+1)x^{n}+1$ I am studying elementary Algebraic Topology recently. I have seen that a topological space is identified with a group. We are telling the group as Fundamental Group. So every topological space $X$ and for any $x \epsilon X$ there is a fundamental group $\pi_1 (X,x)$. I have a question about the converse. If we consider any arbitrary group $G$, then does there exist a topological space $X$ and an element $x\epsilon X$ such that $\pi_1 (X,x)=G$? Decrypt all RSA ciphertexts if you can break 1% of them I'm too spoiled by Windows utilities that take a digital snapshot of your entire drive, which you can then restore from in the event of a drive crash.  (e.g. like Time Machine for Mac OS X).  Is there a similar way of doing this in Linux? I would like to ask if MS Access database supports working in networks &amp; multi-user access? How can we connect a PHP script to MS Access (.mdb) file?  I tried by including following PHP code:  $db_path = $_SERVER['DOCUMENT_ROOT'] . '\WebUpdate\\' . $file_name . '.mdb'; $cfg_dsn = "Provider=Microsoft.Jet.OLEDB.4.0;Data Source=" . $db_path; $odbcconnect = odbc_connect($cfg_dsn, '', '');   But it failed and I received following error message:   Warning: odbc_connect() [function.odbc-connect]: SQL error: [Microsoft][ODBC Driver Manager] Data source name not found and no default driver specified, SQL state IM002 in SQLConnect in C:\web\WebUpdate\index.php on line 41 The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this? How to execute file I'm editing in Vi(m) How to test randomness (case in point - Shuffling) First off, this question is ripped out from  question. I did it because I think this part is bigger than a sub-part of a longer question. If it offends, please pardon me.  Assume that you have a algorithm that generates randomness. Now how do you test it? Or to be more direct - Assume you have an algorithm that shuffles a deck of cards, how do you test that it's a perfectly random algorithm?  To add some theory to the problem - A deck of cards can be shuffled in 52! (52 factorial) different ways. Take a deck of cards, shuffle it by hand and write down the order of all cards. What is the probability that you would have gotten exactly that shuffle? Answer: 1 / 52!.  What is the chance that you, after shuffling, will get A, K, Q, J ... of each suit in a sequence? Answer 1 / 52!  So, just shuffling once and looking at the result will give you absolutely no information about your shuffling algorithms randomness. Twice and you have more information, Three even more...  How would you black box test a shuffling algorithm for randomness? Inspired exercise Sheet from Indesign I would like to create this sheet which was made it by adobe indesign   Could someone create it with latex ?     Here's my code:  \documentclass[12pt,a4paper,twocolumn]{report} \usepackage[margin=0.5in]{geometry} \usepackage[french]{babel} \usepackage{fontspec} \usepackage{graphicx} \usepackage{amsthm,amssymb,amsfonts,mathtools} \usepackage[utf8]{inputenc} \usepackage{multicol} \usepackage{multirow} \usepackage{amssymb} \usepackage{array} \usepackage{graphicx} \setlength{\columnseprule}{0.5pt} \thispagestyle{empty} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} %%%%%%%%%%head%%%%%%%%%%%%%%%%%%%%%%% \twocolumn[    \begin{@twocolumnfalse}  \begin{center}  \fbox{\Large Exercise Sheets} \end{center}     \hrulefill \end{@twocolumnfalse}   ]  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%  \fbox{ Exercise $1$:}\\  Compute the following limits \begin{multicols}{2} \begin{enumerate} \item $\lim_{x\to 2}\dfrac{4x^{3}-5x-22}{x^{2}-x-2}$ \item $\lim_{x\to 0^{+}}\dfrac{x-\sqrt{x}}{x+\sqrt{x}}$ \item $\lim_{x\to 1}\dfrac{\sqrt{x+3}+\sqrt{x}-3}{x-1}$ \item $\lim_{x\to 2}\dfrac{x^{2}\sqrt{x+2}-8}{4-x^{2}}$ \end{enumerate} \end{multicols}  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \fbox{ Exercise $2$:}\\ Let $n\in\mathbb{N}^{*}$ \begin{enumerate}     \item calculate : ${\displaystyle \lim_{x\to 0}\dfrac{1-\cos(x)\cos(2x)\ldots+\cos(nx)}{x^2} }$     \item b     \item c     \item d     \item e     \item f \end{enumerate} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \end{document} Prove that for all non-negative integers $m,n$, $\frac{(2m)!(2n)!}{m!n!(m + n)!}$ is an integer. Prove that for all non-negative integers $m,n$, $\frac{(2m)!(2n)!}{m!n!(m + n)!}$ is an integer.   I'm not familiar to factorial and I don't have much idea, can someone show me how to prove this? Thank you. Using a foreign driver's license in California when staying with a J-1 visa I'm planning to attend a Californian university as a visiting scholar (not paid by the university) on a J-1 visa, for a total of four weeks; a colleague of mine will do the same, but for 12 weeks. I've been told (personally, ie. no citable sources) that, if you're staying on a J-1, you're effectively a California resident for the time you're there, and, therefore, need a Californian driver's license.  I've read up on this and found  that states:     If you are a visitor in California over 18 and have a valid driver   license from your home state or country, you may drive in this state   without getting a California driver license as long as your home state   license remains valid.      If you become a California resident, you must get a California driver   license within 10 days. Residency is established by voting in a   California election, paying resident tuition, filing for a homeowner's   property tax exemption, or any other privilege or benefit not   ordinarily extended to nonresidents.   I'm not planning to vote in any elections, nor will I own a home there, but I'm not sure what would constitute "privileges or benefits not ordinarily extended to nonresidents".  Do we need to get driver's licenses in California, or can we use our foreign licenses? How about day trips to Arizona or Nevada?  Note: this seems to be related to , but my question is specifically about staying there on a J-1. I have purchased a rather large bag of long-grain white rice (25 lbs.) and need to know the best way for storing it long-term. This rice will be used as both a food-storage food source and as my everyday source of rice for cooking, so the storage solution should (hopefully) be resealable, rather than once-it's-open-it's-open. I eat rice maybe three times a month, so it isn't really "everyday" but it will be my go-to when I have it. I use a Windows 10 machine remotely at work. Both the local and remote machine are in the same ISP network (not same local network, but same ISP). I've been using it like that for almost a year now and I had never experienced absolutely any issues.  Until recently. I don't know if anything specific triggered this behavior, but I feel that it started happening after I upgraded the remote to W10 1903. I later upgraded the local one as well and I feel that it only made the problem worse (but I don't really have any data).  From time to time, the session will freeze - the image stops updating. However, what I type and mouse clicks are still being sent. No error message is shown whatsoever, the image simply freezes. To make it work again, I have to close and re-open the session. Everything that I had typed and/or clicked while it was frozen is there.  Is there any way I can debug this? Subsample of a random sample: random sample? Let's say you have a large random sample of soccer players in Europe but you are only interested in what happens in Spain. Could you reduce your sample to players in Spain and still call it a random sample (but of a different population)? If not, how would you call that subsample and which specific precautions should you take to be able to make inferences on the population of spanish soccer players?  My feeling is that using that subsample would be fine as long as it is large enough, but maybe I am missing something. How do I use '&' literally in LaTeX? Good abstract algebra books for self study Last semester I picked up an algebra course at my university, which unfortunately was scheduled during my exams of my major (I'm a computer science major). So I had to self study the material, however, the self written syllabus was not self study friendly (good syllabus overall though).  The course was split up into 3 parts, group theory, ring theory and field theory. As a computer science major we only had to study the first 2.  Now that I passed the exam for this course I want to study the field theory part ( which covers Galois theory, etc).  So, now I want to ask whether any of you know any good books on abstract algebra, which lift off at basic ring theory and continue to more advanced ring theory and to finite fields, Galois theory, ...  Please keep in mind that I am not a math major, and that I would like books which are suited for self study (thus a lot of examples and intuition).  Thanks in advance! How do I escape a backtick ` within a code block?  This is probably a duplicate, since I'm sure it's a common concern, but I can't find a question that addresses this specifically.  How do I write List'1 with the "1" character still in the code-text format? "Give him a box that everyone knows what it contains." "Give him a box that everyone knows what it contains."  Is this correct English? It sounds wrong to me.