Hi, Number 23: = 11 * 1 + 12 Number/2 = 11.5
Number 17: = 9 * 1 + 8 Number/2 = 8.5 So, its neither floor(n/2) +- 1, nor ceil(n/2) +- 1 On Wed, May 29, 2013 at 2:19 PM, Ankit Sambyal <ankitsambyal1...@gmail.com>wrote: > Hi Nikhil, > > Highest remainder can't be floor(n/2) - 1. > If n = 11, highest remainder would be 5 when it is divided by 6, but your > formula gives 4. > > > > On Mon, May 27, 2013 at 8:16 PM, Nikhil Kumar <niksingha...@gmail.com>wrote: > >> Since we need to divide so the quotient should be at least 1, and we need >> greatest remainder, so we need the least no. which will give the quotient 1 >> upon dividing and that would be the no. you described. >> Also you would have noted the greatest remainder would be floor(n/2)-1 . >> >> >> On Thursday, 16 May 2013 13:56:40 UTC+5:30, Soumya Prasad Ukil wrote: >>> >>> >>> For a given number when divided by a number between 1 and n. I figured >>> out that highest reminder can be got if I divide the number by (⌊(n/2)⌋+ >>> 1) .Can anyone give me pointers ? >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to algogeeks+unsubscr...@googlegroups.com. >> >> >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > > > -- *Ankit Agarwal* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
