
Math Events Math Events, Competitions, Meetups  Local, Regional, State, National, International 
 LinkBack  Thread Tools  Display Modes 
September 7th, 2013, 01:12 PM  #1 
Senior Member Joined: Feb 2012 Posts: 628 Thanks: 1  A binary problem
Consider the partition of the positive integers defined as follows: Start with the digit 1. Now take its opposite in binary which is 0, and concatenate the two to create 10. Then take the opposite of 10 which is 01, and concatenate the two to create 1001. Repeat this process indefinitely. If the nth digit of this number is a 1, put n into partition A, and if it is a 0, put n into partition B. Now let represent the kth number (in order from smallest to largest) of partition A, and let represent the kth number of partition B. 1. For certain values of d, it is true that is equal to 1 for every positive integer value of k. What are these values of d? 2. Determine, given arbitrary values of k and d, which of and is larger. 

Tags 
binary, problem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
random variable binary tree problem  frenchiehey  Algebra  1  November 21st, 2013 07:00 PM 
0.1 binary  ungeheuer  Algebra  3  October 26th, 2013 09:33 AM 
Another binary problem  icemanfan  Math Events  0  September 16th, 2013 02:11 PM 
Problem with binary tree  tatausi  Algebra  1  December 5th, 2012 01:22 AM 
Binary Matrix Problem  ElmerOne  Linear Algebra  1  May 30th, 2011 09:43 PM 