Ivan Shishkin, Rye (1878)

Problems/ArithmeticUnreviewed

The Gijswijt’s sequence throughout the integers

by Cypress·
82
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
Unreviewed. This problem has not been reviewed by trusted users yet.

We define the Gijswijt’s sequence as follows :  {x0=1,xn+1=10∗xn+max(i,j)∈N2, i+j≤n(Card{⌊xi10i⌋=⌊xi+j10i+j⌋})\ \left\{ \begin{array}{ll} x_0 = 1,\\ x_{n+1}= 10*x_{n} + max_{(i,j )\in \mathbb{N}^{2}, \: i+j \leq n}(Card\left\{\lfloor \frac{x_{i}}{10^{i}} \rfloor = \lfloor \frac{x_{i+j}}{10^{i+j}} \rfloor \right\})\end{array} \right.
In other words, for a term xnx_n of the sequence, the next term appends to its right the maximum length of consecutive blocks of identical numbers.

Show that every positive integer can be found in this sequence, i.e. that ∀k∈N,∃n∈N such that max(i,j)∈N2, i+j≤n(Card{⌊xi10i⌋=⌊xi+j10i+j⌋})=k\forall k \in \mathbb{N}, \exists n \in \mathbb{N} \text{ such that } max_{(i,j )\in \mathbb{N}^{2}, \: i+j \leq n}(Card\left\{\lfloor \frac{x_{i}}{10^{i}} \rfloor = \lfloor \frac{x_{i+j}}{10^{i+j}} \rfloor \right\}) =k.

I solved itMark it doneAdd to my listKeep it in your list

Solutions

0
Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.