Continuously Iterating Modular Arithmetic
#4
It was a pleasure Catullus. This is really an interesting topic.
If you want you can try to share your own thoughts on it, it doesn't matter if you have not results or proofs. It is enough that you applied to it with passion, maybe you have questions or you have a personal way to approach the problem and you look for tips and observations.

Anyways... if you really want something cool to think about, I suggest you to go deeper instead into the functions \(F_a(n)=[a]_n=a \,{\rm mod}\, n\) for varying \(n\).
Only understanding those is very challenging... maybe iterating them would be an even greater challenge.

Just some hints: every function \([a]_n\in \mathbb Z/n\mathbb Z\) belongs to a different ring... so how we obtain \(F_a\)? Just imagine \(F_a\) to take inputs in \(\mathbb Z\) and give output in the union of all the "modular rings" \(\bigcup _{n\in\mathbb N}\mathbb Z/n\mathbb Z\). Why it is interesting? Because the zeros of \(F_a\) are where \(a\) has it's prime decomposition, i.e. \(F_a\) detects \(a\) prime divisors.

If instead you wanto to continue investigating functions \(\pi_n(a)=a\, {\rm mod} \,n\) then you should begin to study what it means to iterate idempotent functions. A function is idempotent iff \(f(f(x))=f(x)\)... this means that it has all fixed points or pre-periodic point.

Mother Law \(\sigma^+\circ 0=\sigma \circ \sigma^+ \)

\({\rm Grp}_{\rm pt} ({\rm RK}J,G)\cong \mathbb N{\rm Set}_{\rm pt} (J, \Sigma^G)\)
Reply


Messages In This Thread
RE: Continuously Iterating Modular Arithmetic - by MphLee - 07/15/2022, 01:59 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Evaluating Arithmetic Functions In The Complex Plane Caleb 6 10,123 02/20/2023, 12:16 AM
Last Post: tommy1729
  [To Do] Basics of Iterating Relations MphLee 0 2,595 12/27/2022, 07:57 PM
Last Post: MphLee
  Iterating at eta minor JmsNxn 22 24,698 08/05/2022, 02:01 AM
Last Post: JmsNxn
  iterating z + theta(z) ? [2022] tommy1729 5 8,567 07/04/2022, 11:37 PM
Last Post: JmsNxn
  [Video] From modular forms to elliptic curves - The Langlands Program MphLee 1 3,865 06/19/2022, 08:40 PM
Last Post: JmsNxn
  Trying to get Kneser from beta; the modular argument JmsNxn 2 5,262 03/29/2022, 06:34 AM
Last Post: JmsNxn
  iterating exp(z) + z/(1 + exp(z)) tommy1729 0 4,299 07/17/2020, 12:29 PM
Last Post: tommy1729
  [rule 30] Is it possible to easily rewrite rule 30 in terms of modular arithmetic ? tommy1729 0 5,540 07/24/2014, 11:09 PM
Last Post: tommy1729
  Tetration and modular arithmetic. tommy1729 0 6,435 01/12/2014, 05:07 AM
Last Post: tommy1729
  iterating x + ln(x) starting from 2 tommy1729 2 10,140 04/29/2013, 11:35 PM
Last Post: tommy1729



Users browsing this thread: 2 Guest(s)