This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles Low This article has been rated as Low-priority on the project's priority scale.

I tried to clarify the examples - by the definition not only numbers which include a factor of k can be k-rough, right?

For example, all odd numbers are 3-rough, not only 3 mod 6. -- Walt ( talk) 00:55, 30 October 2008 (UTC) reply

I don't think 1 is 3-rough (?), but it is an odd number. 2601:602:9601:C510:1491:9E32:BCEF:82D3 ( talk) 21:48, 12 October 2021 (UTC) reply

1 is 3-rough, according to the definition that all prime factors are ≥ 3. There are zero prime factors, so all zero of them are ≥ 3. See vacuous truth. — David Eppstein ( talk) 21:56, 12 October 2021 (UTC) reply

Is there any standard terminology or symbology to describe n as being ${\displaystyle k_{m}}$-rough where ${\displaystyle k_{m}=\lceil n^{1/m}\rceil }$? I find a need for such a concept when showing ${\displaystyle \tau (n)\neq x}$ for some x. Hv ( talk) 13:17, 13 July 2022 (UTC) reply