- 687 名前：１３２人目の素数さん mailto:sage [2024/03/24(日) 22:51:34.25 ID:Y954a2uT.net]
- >>654
from fractions import Fraction
# ファレイ数列の生成
def generate_farey_sequence(n):
farey_sequence = [Fraction(0), Fraction(1)]
for i in range(2, n+1):
j = 1
while j < i:
fraction = Fraction(j, i)
if fraction not in farey_sequence:
farey_sequence.append(fraction)
j += 1
farey_sequence.sort()
return farey_sequence
# 逆数を含む数列の生成
def generate_sequence_with_reciprocals(n):
farey_sequence = generate_farey_sequence(n)
sequence_with_reciprocals = []
for fraction in farey_sequence:
sequence_with_reciprocals.append(fraction)
reciprocal = 1 / fraction
if reciprocal not in sequence_with_reciprocals:
sequence_with_reciprocals.append(reciprocal)
return sequence_with_reciprocals
# 2024番目の分数を見つける
def find_fraction_at_position(position):
# ここでは、分数の上限を適当に大きな数に設定しています。
# 実際には、必要に応じてこの数を調整する必要があります。
sequence = generate_sequence_with_reciprocals(100)
if position - 1 < len(sequence):
return sequence[position - 1]
else:
return "Position out of range"
# 結果の出力
print(find_fraction_at_position(2024))
|
 |
