Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
3
Newest
 Scholar
Impact
~105 people reached

  • 0 posts edited
  • 0 helpful flags
  • 3 votes cast
Aug
19
comment Proving that all integers are even or odd
Sorry if my logic is wrong, but if n is 2k, then n- 1 = 2k-1, which is 2(k-1) +1, which is odd? So even if n < 0, you can still apply the 2k or 2k+1 proof?
Dec
20
awarded  Scholar
Dec
20
accepted Determining number of parent node on an n-tree.
Dec
20
awarded  Supporter
Dec
20
comment Determining number of parent node on an n-tree.
Sorry, this is assuming indices are 0-based. And for n=4, I picked a few random numbers, like 97, 256, and 1000 to see if it worked. I would've went higher, but I had a hard time drawing the tree to that level.
Dec
20
awarded  Editor
Dec
20
revised Determining number of parent node on an n-tree.
added 2 characters in body
Dec
20
comment Determining number of parent node on an n-tree.
yeah (i-1)/n, lemme fix that
Dec
20
asked Determining number of parent node on an n-tree.