[go: up one dir, main page]

login
Revision History for A157752 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Smallest positive integer m such that m == prime(i) (mod prime(i+1)) for all 1<=i<=n.
(history; published version)
#20 by Michael De Vlieger at Thu May 04 10:53:54 EDT 2023
STATUS

reviewed

approved

#19 by Joerg Arndt at Thu May 04 10:32:22 EDT 2023
STATUS

proposed

reviewed

#18 by Chai Wah Wu at Thu May 04 10:07:46 EDT 2023
STATUS

editing

proposed

#17 by Chai Wah Wu at Thu May 04 10:07:01 EDT 2023
PROG

def A157752(n): return int(crt((s:=[prime(i+1) for i in range(1, n)])+[prime(n+1)], [2]+s)[0] ) # Chai Wah Wu, May 02 2023

STATUS

proposed

editing

Discussion
Thu May 04
10:07
Chai Wah Wu: Thanks, Michel. Corrected Python code.
#16 by Chai Wah Wu at Tue May 02 17:19:39 EDT 2023
STATUS

editing

proposed

Discussion
Wed May 03
01:45
Michel Marcus: mpz(2), mpz(8), mpz(68), ... : ?
#15 by Chai Wah Wu at Tue May 02 17:19:25 EDT 2023
PROG

(PARI) x=Mod(1, 1); for(i=1, 20, x=chinese(x, Mod(prime(i), prime(i+1))); print1(component(x, 2), ", "))(Python)from sympy.ntheory.modular import crt

(Python)

from sympy.ntheory.modular import crt

from sympy import prime

from sympy import primedef def A157752(n): return crt((s:=[prime(i+1) for i in range(1, n)])+[prime(n+1)], [2]+s)[0] # Chai Wah Wu, May 02 2023

#14 by Chai Wah Wu at Tue May 02 17:18:59 EDT 2023
PROG

(PARI) x=Mod(1, 1); for(i=1, 20, x=chinese(x, Mod(prime(i), prime(i+1))); print1(component(x, 2), ", "))(Python)from sympy.ntheory.modular import crt

from sympy import primedef A157752(n): return crt((s:=[prime(i+1) for i in range(1, n)])+[prime(n+1)], [2]+s)[0] # Chai Wah Wu, May 02 2023

STATUS

approved

editing

#13 by Michel Marcus at Sat Jul 31 04:36:23 EDT 2021
STATUS

reviewed

approved

#12 by Joerg Arndt at Sat Jul 31 04:23:20 EDT 2021
STATUS

proposed

reviewed

#11 by Jinyuan Wang at Sat Jul 31 04:18:42 EDT 2021
STATUS

editing

proposed