PUMaC 2025 · 代数（A 组） · 第 2 题

PUMaC 2025 — Algebra (Division A) — Problem 2

Let ⋆ be an associative operation on the set of positive real numbers that satisfies x x ⋆ x ⋆ · · · ⋆ x = √ | {z } k x appears k times for any positive real number x and positive integer k . Let s denote the n th smallest positive n integer with no prime factor greater than 5. Compute s ⋆ s ⋆ s ⋆ · · · . 1 2 3

解析

暂无解答链接。

No solutions link available.