June 27th, 2017, 10:04 AM  #1 
Newbie Joined: Jun 2017 From: N/A Posts: 1 Thanks: 0  divisor chain problem
Let a divisor chain be a sequence of numbers starting with 1, where each element divides the next. A(n) represents the number of chains ending with n. Prove that the number of oddlengthed chains O(n) and the number of evenlengthed chains D(n) are either the same or differ by 1. Last edited by skipjack; June 27th, 2017 at 10:07 AM. 

Tags 
chain, divisor, problem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The 5 chain problem  shunya  Elementary Math  3  October 14th, 2015 07:26 AM 
Greatest Common Divisor. Really hard problem.  isel  Algebra  2  September 23rd, 2013 07:44 PM 
Sum of divisor problem  brangelito  Number Theory  8  May 3rd, 2012 05:19 PM 
a divisor and limit problem  elim  Number Theory  5  June 7th, 2010 07:42 AM 
coin tossing problem/ markov chain problem  aptx4869  Advanced Statistics  0  June 30th, 2007 09:03 PM 