<reponame>lcsm29/project-euler
# Solution of;
# Project Euler Problem 308: An amazing Prime-generating Automaton
# https://projecteuler.net/problem=308
# 
# A program written in the programming language Fractran consists of a list of 
# fractions. The internal state of the Fractran Virtual Machine is a positive 
# integer, which is initially set to a seed value. Each iteration of a 
# Fractran program multiplies the state integer by the first fraction in the 
# list which will leave it an integer. For example, one of the Fractran 
# programs that <NAME> wrote for prime-generation consists of the 
# following 14 fractions:$$\dfrac{17}{91}, \dfrac{78}{85}, \dfrac{19}{51}, 
# \dfrac{23}{38}, \dfrac{29}{33}, \dfrac{77}{29}, \dfrac{95}{23}, 
# \dfrac{77}{19}, \dfrac{1}{17}, \dfrac{11}{13}, \dfrac{13}{11}, 
# \dfrac{15}{2}, \dfrac{1}{7}, \dfrac{55}{1}$$Starting with the seed integer 
# 2, successive iterations of the program produce the sequence:15, 825, 725, 
# 1925, 2275, 425, . . . , 68, 4, 30, . . . , 136, 8, 60, . . . , 544, 32, 
# 240, . . . The powers of 2 that appear in this sequence are 22, 23, 25, . . 
# . It can be shown that all the powers of 2 in this sequence have prime 
# exponents and that all the primes appear as exponents of powers of 2, in 
# proper order!If someone uses the above Fractran program to solve Project 
# Euler Problem 7 (find the 10001st prime), how many iterations would be 
# needed until the program produces 210001st prime ?
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 308
    timed.caller(dummy, n, i, prob_id)

# Solution of;
# Project Euler Problem 308: An amazing Prime-generating Automaton
# https://projecteuler.net/problem=308
# 
# A program written in the programming language Fractran consists of a list of 
# fractions. The internal state of the Fractran Virtual Machine is a positive 
# integer, which is initially set to a seed value. Each iteration of a 
# Fractran program multiplies the state integer by the first fraction in the 
# list which will leave it an integer. For example, one of the Fractran 
# programs that <NAME> wrote for prime-generation consists of the 
# following 14 fractions:$$\dfrac{17}{91}, \dfrac{78}{85}, \dfrac{19}{51}, 
# \dfrac{23}{38}, \dfrac{29}{33}, \dfrac{77}{29}, \dfrac{95}{23}, 
# \dfrac{77}{19}, \dfrac{1}{17}, \dfrac{11}{13}, \dfrac{13}{11}, 
# \dfrac{15}{2}, \dfrac{1}{7}, \dfrac{55}{1}$$Starting with the seed integer 
# 2, successive iterations of the program produce the sequence:15, 825, 725, 
# 1925, 2275, 425, . . . , 68, 4, 30, . . . , 136, 8, 60, . . . , 544, 32, 
# 240, . . . The powers of 2 that appear in this sequence are 22, 23, 25, . . 
# . It can be shown that all the powers of 2 in this sequence have prime 
# exponents and that all the primes appear as exponents of powers of 2, in 
# proper order!If someone uses the above Fractran program to solve Project 
# Euler Problem 7 (find the 10001st prime), how many iterations would be 
# needed until the program produces 210001st prime ?
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 308
    timed.caller(dummy, n, i, prob_id)
# Solution of; # Project Euler Problem 308: An amazing Prime-generating Automaton # https://projecteuler.net/problem=308 # # A program written in the programming language Fractran consists of a list of # fractions. The internal state of the Fractran Virtual Machine is a positive # integer, which is initially set to a seed value. Each iteration of a # Fractran program multiplies the state integer by the first fraction in the # list which will leave it an integer. For example, one of the Fractran # programs that <NAME> wrote for prime-generation consists of the # following 14 fractions:$$\dfrac{17}{91}, \dfrac{78}{85}, \dfrac{19}{51}, # \dfrac{23}{38}, \dfrac{29}{33}, \dfrac{77}{29}, \dfrac{95}{23}, # \dfrac{77}{19}, \dfrac{1}{17}, \dfrac{11}{13}, \dfrac{13}{11}, # \dfrac{15}{2}, \dfrac{1}{7}, \dfrac{55}{1}$$Starting with the seed integer # 2, successive iterations of the program produce the sequence:15, 825, 725, # 1925, 2275, 425, . . . , 68, 4, 30, . . . , 136, 8, 60, . . . , 544, 32, # 240, . . . The powers of 2 that appear in this sequence are 22, 23, 25, . . # . It can be shown that all the powers of 2 in this sequence have prime # exponents and that all the primes appear as exponents of powers of 2, in # proper order!If someone uses the above Fractran program to solve Project # Euler Problem 7 (find the 10001st prime), how many iterations would be # needed until the program produces 210001st prime ? # # by lcsm29 http://github.com/lcsm29/project-euler