4
$\begingroup$

What is the relation that connects the nodes of this digraph?

enter image description here

$\endgroup$
4
  • $\begingroup$ I think there is a typo in the question. It shouldn't be "diagraph" right? $\endgroup$
    – H_D
    Apr 29 '20 at 2:05
  • $\begingroup$ Thanks for checking up on my spelling. "Digraph" is actually what I intended. It is an abbreviation of "directed graph". $\endgroup$ Apr 29 '20 at 2:07
  • $\begingroup$ Oh okok sorry I didn't know that abbreviation. $\endgroup$
    – H_D
    Apr 29 '20 at 2:09
  • $\begingroup$ No problem at all. Every discipline has its own jargon that confuses everyone else :P $\endgroup$ Apr 29 '20 at 2:10
4
$\begingroup$

Node $i$ goes to node $i+s(i)$, where $s(i)$ is the sum of the proper divisors of $i$

$\endgroup$
1
  • $\begingroup$ Nice math knowledge! You nailed it, and used the correct jargon to boot! $\endgroup$ Apr 29 '20 at 2:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.