如何编写函数以在RStudio中查找范围内的质数

问题描述 投票:0回答:1

我想编写一个函数来询问用户一个范围,然后返回该范围内的素数。但是我不知道如何定义输入?

prime<-function(x,y){
  u<-range(x:y)
  for (u in range){
    for(j in 2:u-1){
      if (u%%j==0){
        print("u is prime")
      }
    }
  }

}enter code here帮我编辑此代码。感谢ypu

arguments range rstudio primes
1个回答
0
投票

对于少量(少于一百万),请用小于1000的素数进行试除:

primes_less_than_1000 = [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, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613,
617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]

def is_prime(n):
    factor = 0
    if n in primes_less_than_1000:
        return 1
    if n > 1000:
        for p in primes_less_than_1000:
            if (n%p==0):
                factor = 1
                return 0
        if (factor==0):
            return 1
    else:
        return 0

现在我们有了素数确定功能,我们可以测试一百万以下的任意范围:

def primes_in_range(lower,upper):
    primes = []
    for n in range(lower,upper):
        if is_prime(n)==1:
            primes.append(n)
    return primes

例如:

print(primes_in_range(1000,1100))
>>> [1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097]

如果您希望素数超过一百万,则试验除法将占用更多内存,因此您应该查看https://primes.utm.edu/

最新问题
© www.soinside.com 2019 - 2024. All rights reserved.