0
$\begingroup$

Problem : Find a sequence of whole numbers $n _ { 1 } , n _ { 2 } , \ldots$ such that $n _ { i - 1 } | n _ { i }$ for all $i \geq 2$ and for every $k \in \mathbb{N}$ there exists $i$ such that $k | n _ { i }$.

The subject of the exercice is "the splitting field of $\mathbb{F}_p$", with $p$ a prime. But this first question doesn't seem to relate (yet) to rings and fields theory.

This question makes me think of the proof of the the fundamental theorem of finite abelian groups with invariant factors.

$\endgroup$
  • $\begingroup$ What have you tried? For instance, one famous sequence in particular stands out to me as almost made for this purpose. Try constructing such a sequence yourself, and maybe you can figure out which one I'm talking about. $\endgroup$ – Arthur May 12 at 17:28
  • $\begingroup$ @arthur the Fibonacci sequence? $\endgroup$ – NotAbelianGroup May 12 at 17:30
  • $\begingroup$ The Fibonacci sequence has, somewhere close to the beginning, a $2$ and then a $3$. Do we have $2\mid 3$? $\endgroup$ – Arthur May 12 at 17:31
  • $\begingroup$ @Arthur Sorry that was a dumb and quick answer, you said "famous sequence" and I directly thought about this. I'm gonna look into that. $\endgroup$ – NotAbelianGroup May 12 at 17:33
  • 2
    $\begingroup$ They will work wonderfully. You do have to check this yourself, though. You shouldn't trust strangers on the internet, after all :) $\endgroup$ – Arthur May 12 at 17:43
0
$\begingroup$

What about $n_i = i!$?

(Is this enough characters?)

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.