Divide Set Algorithm to recive the vector (1,1,...,1) - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Divide Set Algorithm to recive the vector (1,1,...,1)

rom_lotanrom_lotan Posts: 2Member
So I'm stuck at this question, the goal is to find a lower bound.
I have a set of natural numbers, each action is
choose a number>1 (refer as k) and divide the whole set (the vector (a1,a2,...,an) by this k then insted of the number's value enter this formula: i/k+i%k (Div+Mod)

for example:
(13,5,8,40) for k=4 we get: (13/4+13%4,5/4+5%4,8/4+8%4,40/4+40%4)
(4,2,2,10) then repeat the action.

-We know the higest number has value N
I need a lower bound of minimum action (If it helps i know the upper bound is 2*sqrt(N))

It's really urgent!!!
Thanks in advance,
Rom.

Comments

Sign In or Register to comment.