|
|
| Line 1: |
Line 1: |
| == Typos == | | == Typos == |
|
| |
|
| There are 12 instances of "n/d" on this page which quite possibly were all intended to be "nd". | | There are 12 instances of "n/d" on this page which probably were all intended to be "nd". I cannot make these changes myself, though; the page is locked to admins only. So if an admin could take care of it, I would appreciate it. --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 05:22, 13 April 2022 (UTC) |
| | |
| Alternatively, the problem could be fixed by defining the obvious extension of sopfr from the integers to rationals; in that case popfr (''product'' of prime factors with repetition; a synonym for product complexity or Benedetti height) could be defined and used in places where we see "(n/d)" as well as in place of that "true()" function, and this way it could be shown how both functions have the same argument. --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 15:29, 12 April 2022 (UTC)
| |
| | |
| But as is usual with these sorts of discussion topics from me, the reason I post it here rather than make the corrections myself is that I cannot make these changes myself; the page is locked to admins only. So if an admin could take care of it, I would appreciate it. --[[User:Cmloegcmluin|Cmloegcmluin]] ([[User talk:Cmloegcmluin|talk]]) 15:31, 12 April 2022 (UTC)
| |