ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M=∏p∣MpapM = \prod_{p|M} p^{a_p} and N=K⋅∏p∣MpbpN = K \cdot \prod_{p|M} p^{b_p} be integers with ap,bp≥1a_p, b_p \ge 1 and gcd⁡(K,M)=1\gcd(K,M) = 1. For each prime factor p∣Mp|M, define

tp:=⌈ap/bp⌉.t_p:= \lceil a_p / b_p \rceil.

The sequence b(n)b(n) is assumed to have a minimal period Pmin⁡P_{\min}. Minimal-period formula. If tp≤2t_p \le 2 for every prime factor p∣Mp|M, then

Pmin⁡=∏p∣Mpep,P_{\min} = \prod_{p|M} p^{e_p},

where

ep=aptp−bp(tp−1).e_p = a_p t_p - b_p(t_p - 1).

This refines the preceding general bounds for the minimal period and is supported by numerical evidence under the stated restriction tp≤2t_p \le 2; its validity beyond these conditions is not asserted here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.