Finding Recurring Cycle

Question

2.50/5 (2 votes)

See more:

I am looking for any algorithm to help me find the recurring cycle in decimal fraction
of 1/n.

I have searched google but couldn't find my answer.
Please guide me to an useful article or anything that can help me.

Thank you all.

Posted 22-Sep-12 2:25am

WebMaster

Updated 22-Sep-12 2:29am

v2

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sandeep Mewara · Accepted Answer · 2012-09-22T03:13:00

Solution 1

Here, have a look at these:
Project Euler 26: Find the value of d < 1000 for which 1/d contains the longest recurring cycle[^]
Project Euler #26[^]

Posted 22-Sep-12 3:13am

Sandeep Mewara

Comments

[no name] 22-Sep-12 9:35am

Thank you.