This one of the courses at the Lipa Summer School.
Linear recurrence sequence (LRS), such as the Fibonacci numbers, permeate vast areas of mathematics, physics, and computer science. In this tutorial, I consider some fundamental decision problems for LRS over the integers, such as the Skolem Problem (does the sequence have a zero?) and the Positivity Problem (are all terms of the sequence positive?).