Ask a Question

Prefer a chat interface with context about you and your work?

The divisor problem for (<i>k, r</i>) โ€” integers

The divisor problem for (<i>k, r</i>) โ€” integers

Let k and r be fixed integers such that 1 &lt; r &lt; k . It is well-known that a positive integer is called r -free if it is not divisible by the r -th power of any integer &gt; 1. We call a positive integer n , a ( โ€ฆ