åœé¡
n ãæ£ã®æŽæ°ãšãããä»»æã® n ã«ã€ããŠ
(10^{n}*1198 -1)/9
ã¯åææ°ã§ããã
æ¬æ¥æ°ã«ãªã£ãŠãã¡ãã¡èª¿ã¹ãŸãããŸããã
ã©ãããæªè§£æ±ºã®ããã§ãã
2000 以äžã® n ã«ã€ããŠã¯åææ°ãšå€æããŠã㊠2001 ãã 2500 ãŸã§ã®ç¯å²ã§ã¯ãäžèšã®å³ã«ç»å ŽããŠãã n 以å€ã§åææ°ãšå€æããŠããŸããäžèšå³ã® n ã«ã€ããŠã¯åææ°ãçŽ æ°ãã«ã€ããŠããã£ãŠããªãããã§ãã
133ã®åŸã«1ãnåç¶ããŠçŽ æ°ã«ãªãæå°ã®nã¯2890ã§ãããããããã®å€ã¯ãã¹ãŠåææ°ãšããã£ãŠããŸãã
å®éããããã®å€ãPari/GPã§isprime((10^2248*1198-1)/9)ã®ããã«èª¿ã¹ããšããã¹ãŠ(1ç§ä»¥å
ã§)0(ã€ãŸãåææ°)ãšå€å®ãããŸãã
åè: https://oeis.org/A069568
âãã®ããŒãžã®ããŒã¿ã¯ç§ã2023幎ã«a(119)ïœa(602)ã远å ãããŸã§ã¯a(1)ïœa(118)ãŸã§ãããããŸããã§ããã
603ã®åŸã«1ãäœåç¶ãããšçŽ æ°ã«ãªããã¯ããããã誰ãããã£ãŠããªããšæããŸãã
ïŒå°ãªããšã30äžåãŸã§ã¯åææ°ã§ãããïŒ
ããããããã忥ã§ããã
â» (11980000*(1000000^(n))-1)/9 â å®ã¯ãã¡ãã®å€çš®ã§ããããŠãããŸããã(â ãâ oâ ãâ ;
a(603) ãäžæãšã®ããšã倧å€ã«å¿æ¹ãããŸãã
çœç¶ããŸããš
MAGMA ã§ä»¥äžã®ã³ãŒãã§èµ°ãããŠçŽ æ°ãã¿ã€ãã£ãŠããªãã£ãã®ã§æ²ããã§ãã
for n in [4000] do
p := (1198 * 10^n - 1) div 9;
if IsPrime(p) then
printf "n = %o, candidate = %o\n", n, p;
end if;
end for;
Python ã§äžèšãèµ°ããããšããããããã«ã
n = 2890 ã§çŽ æ°ãšãªããŸããã
from sympy import isprime
# n ã 2889 ãã 2891 ã®ç¯å²ã§èª¿ã¹ã
n_range = range(2889, 2892)
# çµæãæ ŒçŽãã倿°
prime_results = []
for n in n_range:
P_n = (1198 * 10**n - 1) // 9 # æŽæ°å€ãèšç®
if isprime(P_n):
prime_results.append((n, P_n)) # n ãšãã®çŽ æ°ãèšé²
prime_results # çµæãåºå
> â» (11980000*(1000000^(n))-1)/9 â å®ã¯ãã¡ãã®å€çš®ã§ããããŠãããŸããã(?ã?o?ã?;
(10^n*1198-1)/9 ã¯
nã奿°ã®ãšã11ã§å²ãåãã
nâ¡0 (mod 6)ã®ãšã7ã§å²ãåãã
nâ¡2 (mod 6)ã®ãšã3ã§å²ãåããŸãã®ã§ã
çŽ æ°ã«ãªããšããã
nâ¡4 (mod 6)ãããããŸããã
ããã衚ããã®ã
(11980000*(1000000^(n))-1)/9
ã§ããã
ïŒã€ãŸããå€çš®ãããªãã¡ãã®åœ¢ã«ãªããªã(10^n*1198-1)/9ã¯åææ°ãªã®ã§ã調ã¹ãå¿
èŠããªããšããããšã§ãïŒ
n=2890ã®æ¬¡ã«çŽ æ°ã«ãªãã®ã¯n=17710ã§ããã
ãã ããn=17710ã®ãšãã®å€ã¯ç¢ºçççŽ æ°ã§ãã
ãããããããæé£ãããããŸãã
Cèšèªã§çµãŸããŠããŸããïŒ
ã¯ããCèšèªã§ãã
ããããããã
埡åçãããããšãããããŸããã