Here f is a function that returns the number of times a number is wholly divisible by 2, i.e. the number of times a number is divisible by 2 until it becomes an odd number.
Assumptions:
f accepts only zero or a positive integer
If x = 0 or x is an odd number then f(x) = 0
a, b and n are positive integers
a, b are odd
n is even
a > b
I would very much appreciate methods for this kind of problem. Thanks in advance!
2007-07-22
17:17:38
·
1 answers
·
asked by
semyaza2007
3
in
Science & Mathematics
➔ Mathematics
Can't figure it out? You can visit Geocities at www.geocities.com/sem26k/index.htm for my answer.
2007-07-22
20:21:59 ·
update #1
I have posted my answer at http://www.geocities.com/sem26k/index.htm
2007-07-23
04:35:00 ·
update #2