(Original post) https://qiita.com/Yuya-Shimizu/items/5f00e085c8052c115604
https://live.sympy.org/ input print([i for i in sieve.primerange(1, 100)]) output [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
input Prime numbers up to 100 https://www.wolframalpha.com/input/?i=100%E3%81%BE%E3%81%A7%E3%81%AE%E7%B4%A0%E6%95%B0&lang=ja output 2 | 3 | 5 | 7 | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 | 43 | 47 | 53 | 59 | 61 | 67 | ... | 97 (25 integer)
input Prime numbers up to 100 https://www.google.com/search?q=100%E3%81%BE%E3%81%A7%E3%81%AE%E7%B4%A0%E6%95%B0&rlz=1C1CHBD_jaJP908JP908&oq=100%E3%81%BE%E3%81%A7%E3%81%AE&aqs=chrome.1.69i57j0l4j0i395l3.6254j1j7&sourceid=chrome&ie=UTF-8 output The prime numbers that are often taken up in memorization tests are from 1 to 100, "2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, It is 25 pieces of "59, 61, 67, 71, 73, 79, 83, 89, 97".
Recommended Posts