Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
æ¦ε.¿DIāÉ-s÷D>*2÷Æ®ygmP}O æ¦ε } # map over each non-empty subset of the divisors .¿D # take the GCDLCM of the subset IāÉ- # push the range with the lower bound decreased s÷ # integer divide modified range by GCDLCM D>*2÷ # for both resulting integers, compute the nth triangular number Æ # reduce by subtraction (results in negative values) ®ygm* # multiply with GCDLCM and (-1)**len(subset) O # sum the resulting list æ¦ε.¿DIāÉ-s÷D>*2÷Æ®ygmP}O æ¦ε } # map over each non-empty subset of the divisors .¿D # take the GCD of the subset IāÉ- # push the range with the lower bound decreased s÷ # integer divide modified range by GCD D>*2÷ # for both resulting integers, compute the nth triangular number Æ # reduce by subtraction (results in negative values) ®ygm* # multiply with GCD and (-1)**len(subset) O # sum the resulting list æ¦ε.¿DIāÉ-s÷D>*2÷Æ®ygmP}O æ¦ε } # map over each non-empty subset of the divisors .¿D # take the LCM of the subset IāÉ- # push the range with the lower bound decreased s÷ # integer divide modified range by LCM D>*2÷ # for both resulting integers, compute the nth triangular number Æ # reduce by subtraction (results in negative values) ®ygm* # multiply with LCM and (-1)**len(subset) O # sum the resulting list æ¦ε.¿DIāÉ-s÷D>*2÷Æ*®ygm*s÷D>*2÷Æ®ygmP}O æ¦ε } # map over each non-empty subset of the divisors .¿D # take the GCD of the subset IāÉ- # push the range with the lower bound decreased s÷ # integer divide modified range by GCD D>*2÷ # for both resulting integers, compute the nth triangular number Æ # reduce by subtraction (results in negative values) ®ygm* # multiply with GCD and (-1)**len(subset) O # sum the resulting list æ¦ε.¿DIāÉ-s÷D>*2÷Æ®ygmP}O æ¦ε } # map over each non-empty subset of the divisors .¿D # take the GCD of the subset IāÉ- # push the range with the lower bound decreased s÷ # integer divide modified range by GCD D>*2÷ # for both resulting integers, compute the nth triangular number Æ # reduce by subtraction (results in negative values) ®ygm* # multiply with GCD and (-1)**len(subset) O # sum the resulting list