This is an archived, read-only copy of the United-TI subforum , including posts and topic from May 2003 to April 2012. If you would like to discuss any of the topics in this forum, you can visit Cemetech's Technology & Calculator Open Topic subforum. Some of these topics may also be directly-linked to active Cemetech topics. If you are a Cemetech member with a linked United-TI account, you can link United-TI topics here with your current Cemetech topics.

Computer Tech Support => Technology & Calculator Open Topic
 » Goto page Previous  1, 2
Author Message
Graphmastur

Joined: 25 Mar 2009
Posts: 360

 Posted: 17 Nov 2009 08:44:06 pm    Post subject: Okay, it's been a while, but I'm posting on my new algorithm. I have a slight problem. If this is true: ((N-1) mod x) = x-1 How can I solve via something like Newton's method? If f(x)=((N-1) mod x)-x+1, what is f'(x)? Then, what is the simplified version of: x - f(x)/f'(x) Thanks!
 Display posts from previous: All Posts Oldest FirstNewest First
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

»
 » Goto page Previous  1, 2 Page 2 of 2 » All times are UTC - 5 Hours