Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Comments on Golf a FRACTRAN interpreter

Parent

Golf a FRACTRAN interpreter

+8
−0

Description

From the Esolangs wiki,

In Fractran,

  • a program consists of a finite list of positive, rational numbers.
  • The input to a program is a positive integer n.
  • The list is then searched in order, for a rational number $p/q$ such that $n×p/q$ is an integer.
  • Then n is replaced by $n×p/q$ and the search is restarted from the beginning of the list.
  • The program halts when no such number $p/q$ can be found, and the final n becomes the output from the program.
  • Output the final value of $n$.

Your task is to implement an interpreter for this language.

Input

You are to take two inputs:

  • $n$, an integer
  • $A$, an array of fractions, which may be taken as a list of pairs, or in the rational datatype of your language.

Output

A single integer, the final value of $n$.

Test Cases

Formatted as

program
input
output
78/55, 5/3, 1/5, 11/2, 5/7
1096135733
328842888196762472689573703

3/2
1296
6561

455/33, 11/13, 1/11, 3/7, 11/2, 1/3
72
15625
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

General comments (4 comments)
Post
+6
−0

APL (Dyalog Unicode), 33 bytes

{×x←⊃(2⌷⍵)(÷⍨(/⍨)0=|)⍺×1⌷⍵:x∇⍵⋄⍺}

Try it online!

The first case doesn't work because it gets really big, but the other two do. The input is taken on the left and the fractions are taken as a table on the right.

{×x←⊃(2⌷⍵)(÷⍨(/⍨)0=|)⍺×1⌷⍵:x∇⍵⋄⍺}
                      ⍺×            ⍝ n multiplied by
                        1⌷⍵         ⍝ The first row of the right argument (every p)
      (2⌷⍵)                        ⍝ Second row of right arg (all q's)
                    |              ⍝ All n×p modulo q
                  0=               ⍝ Check which ones are 0 (rational)
           ÷⍨                      ⍝ Make another vector of 'n×p÷q's
               /⍨                  ⍝ And keep the ones that were rational
    ⊃                              ⍝ Pick the first (0 if empty)
  x←                               ⍝ Assign to x
 ×                                 ⍝ Sign of x
                                 ⍺ ⍝ If sign is 0, return n
                            x∇⍵   ⍝ Otherwise, call again with x as new n
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.

1 comment thread

General comments (2 comments)
General comments
Razetime‭ wrote over 3 years ago

finding tests for this is a bit of a pain.. everything's in some weird modulo or prime factorization format aaaaa

Razetime‭ wrote over 3 years ago

I'll change the first test case to your output in ⎕FR←1287⋄⎕PP←34