Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

NEW CHALLENGE

Name: Anonymous 2007-09-05 14:27 ID:j2VLdZwS

A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:

    1/2    =     0.5
    1/3    =     0.(3)
    1/4    =     0.25
    1/5    =     0.2
    1/6    =     0.1(6)
    1/7    =     0.(142857)
    1/8    =     0.125
    1/9    =     0.(1)
    1/10    =     0.1

Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.

Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.

Name: Anonymous 2007-09-05 14:36 ID:wqFQlmNd

Oh please. Let's have a challenge that:

- Is not from Project Euler
- Does something actually useful

Name: Anonymous 2007-09-05 14:41 ID:/Ivoe33+

0.9999999999999999999... = 1

Name: Anonymous 2007-09-05 14:42 ID:I0y9sVqm

>>2
Which problem is this?  Because I'll have to add it to my score.

Name: Anonymous 2007-09-05 14:42 ID:Heaven

>>3
0.(9) = 1

Name: Anonymous 2007-09-05 14:43 ID:wqFQlmNd

>>4
26

Name: Anonymous 2007-09-05 14:43 ID:xFritMzu

stop trying to make /prog/ solve project euler for you

Name: Anonymous 2007-09-05 15:01 ID:j2VLdZwS

>>2
>>7
I'm doing it myself, I just want to see what Anonymous also comes up with and possibly foster some interesting discussion. COCKS.

Name: Anonymous 2007-09-05 15:30 ID:270VaDc7

(define (cycle-length d)
  (define (iter n remainders)
    (let ((r (remainder (* n 10) d)))
      (cond ((= r 0) 0)
            ((memv r remainders) => length)
            (else (iter r (append remainders (list r)))))))
  (iter 1 '()))

(define (longest-cycle limit)
  (define (iter i max-d max-length)
    (if (>= i limit)
        (begin
          (display `(1 / ,max-d has the longest recurring cycle with length ,max-length))
          (newline))
        (let ((length (cycle-length i)))
          (if (> length max-length)
              (iter (+ i 1) i length)
              (iter (+ i 1) max-d max-length)))))
  (iter 2 0 0))

1 / 983 has the longest recurring cycle with length 982

Name: Anonymous 2007-09-05 16:30 ID:HJL0XWVi

Heh, I did the same challenge this morning. I hate decimal fractions.

Name: Anonymous 2007-09-05 17:07 ID:Heaven

>>8
Then why the fuck don't you just use the forums especially intended for this purpose?

Name: Anonymous 2013-01-19 23:47

/prog/ will be spammed continuously until further notice. we apologize for any inconvenience this may cause.
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -