Re: Finding divisibility through seed numbers | |

very well expalined...... but would u tell some more usage of this concept.... if their is something exist.... |

Re: Finding divisibility through seed numbers | |

TG sir Isnt this the osculator funda....? |

Re: Finding divisibility through seed numbers | |

yep. |

Re: Finding divisibility through seed numbers | |

what is osculator yaar.... |

Re: Finding divisibility through seed numbers | |

Hi TG Thanks for lucid article......1 doubt.. Is 5 is an exception for this.Ofcourse finding remainder is easy,just want to know if there is any other exception... |

Re: Finding divisibility through seed numbers | |

Hi TG Thanks for lucid article......1 doubt.. Is 5 is an exception for this.Ofcourse finding remainder is easy,just want to know if there is any other exception... |

Re: Finding divisibility through seed numbers | |

hi Subrahmanyam another exception which i can think of is 2 |

Re: Finding divisibility through seed numbers | |

hi tg sir, the topic was really good. can you please also tell me the topic of factors....... thanks sir. |

Re: Finding divisibility through seed numbers | |

Hi, Here we take -5 as a seed number and then we solve it. but what if we solve using 12 as a seed number for 17. last two digit number comes is 64. which not divisible for 17. |

Re: Finding divisibility through seed numbers | |

Hi Bhushan, If u r talking about 9044 to be divisible by 17(wen seed no is 12),then the calculation goes like this: 9044 = 904+12*4=952=95+2*12=95+24=119 which is clearly divisible by 17.Also even if u repeat the process after 119 u will again get 119....... Thanks |

Re: Finding divisibility through seed numbers | |

Simply superb concept hav a doubt... what if there is a large power on the number 9044pow3023 like this |

Re: Finding divisibility through seed numbers | |

thanks Supriya, |

Re: Finding divisibility through seed numbers | |

i think it wont applicable in powers if it is applicable den plz tell me how |

Re: Finding divisibility through seed numbers | |

hi subrahmanyam, oculator simply means to bring the no near multiple of 10 suppose if u hav to find osculator for 7 den 7*3=21 its near to multiple of 10 so we need to decrease it by 1 to make it multiple of 10.so its a so its a negative osculator and 20 is divided by 10 its give 2 so its become -2 suppose u hav to divide 133/7 den 3*-2==6 13-6=7 it is divisible by 7 in divisibilty of 13 13*5=51 so its 1 more osculator so we will multiply last digit of divisor by +5 |

Re: Finding divisibility through seed numbers | |

Hi TG, This is a very good conecept,thanks 4 sharing! but again as someone asked earlier please do tell some other use of seed number apart from divisiblity test if exist. Thanks in advance!! |

Re: Finding divisibility through seed numbers | |

nice article i must say. i have a question that is it possible that if we keep on reducing the number and in the last we see it giving a remainder can we find something from that remiander like the number will also give the same remainder and if number is raised to certain power then we can tell remainder will be the remainder we obtained raised to the power and den divided by number. plz throw some light. |