A random analogue of Gilbreath's conjecture
Zachary Chase (Oxford)
29-Jun-2020, 16:00-17:00 (4 years ago)
Abstract: Given a sequence a1, a2, ... of integers, one can form the sequence |a1-a2|, |a2-a3|, .... Gilbreath's conjecture is that if you start with the sequence of the primes and iterate this consecutive differencing procedure, then the first term of every sequence (besides the initial one) is a 1. We prove the conclusion of Gilbreath's conjecture for a suitably random initial sequence instead of the primes.
combinatoricsnumber theory
Audience: researchers in the topic
Webinar in Additive Combinatorics
Series comments: Signup via homepage to receive email notification and Zoom link for upcoming Webinars in Additive Combinatorics.
Organizer: | Sean Prendiville* |
*contact for this listing |
Export talk to