{"request":{"endpoint":"https://exercism.org/api/v2/tracks/r/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"1d34f9173ebe4b6f99baf6634d6eab7f","snippet":"prime_factors <- function(number) { factors <- c() rem <- number current_prime <- 2 while (rem > 1) { if (rem %% current_prime == 0) { rem <- rem / current_prime factors[length(factors) + 1] <- current_prime } else { ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"r","author":{"handle":"jonmcalder"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/jonmcalder","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"59506243b397484f81affcc66d13aaa5","snippet":" getPrimeNumbers <- function(maxn) { if (maxn<2) return(c()); primeq = rep(T, maxn); primeq[1] = F; limit= floor(sqrt(maxn)); for (kk in 1:limit) { if (primeq[kk]) { primeq[kk*(2:floor(maxn/kk))] = F } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-11T11:19:32.000Z","is_out_of_date":false,"language":"r","author":{"handle":"sojbaek"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/sojbaek","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"e11780c8e6e04c8c8167379f4ff3c62e","snippet":"prime_factors <- function(number) { factors <- c() divisor <- 2 while (number > 1) { while (number %% divisor == 0) { factors <- c(factors, divisor) number <- number / divisor } divisor <- divisor + 1 } ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-10T06:36:38.000Z","is_out_of_date":false,"language":"r","author":{"handle":"DenisGremaud"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/DenisGremaud","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"1e0a3d3f14034e0bb6db7efa2da4bd86","snippet":"prime_factors <- function(number) { factors <- c() divisor <- 2 while (number > 1) { if (number %% divisor == 0) { factors <- c(factors, divisor) number <- number / divisor } else { divisor <- divisor + 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-19T15:08:21.000Z","is_out_of_date":false,"language":"r","author":{"handle":"rainer99"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/rainer99","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"64b0290923bc4d159ac37ff60ec189a7","snippet":"prime_factors <- function(number) { # set start conditions factors <- c() f <- 2 # loop through checking factors for even division and append # [ ] recursion possible as in collatz.R? while (number > 1) { if (number %% f == 0) { ","num_views":0,"num_stars":1,"num_comments":3,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"r","author":{"handle":"katrinleinweber"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/katrinleinweber","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"53589a506d4d4a77b46fc0345a2455cf","snippet":"prime_factors <- function(number) { factors <- c() # Return empty vector for numbers less than 2 if (number < 2) { return(factors) } divisor <- 2 n <- number ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":23,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-06-07T15:03:11.000Z","is_out_of_date":false,"language":"r","author":{"handle":"david82"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/david82","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"bcfa76218ccb459e910973a269500ce8","snippet":"prime_factors <- function(number) { pf <- c() f <- 2 while (number != 1) { while (number %% f == 0) { pf <- c(pf, f) number <- number / f } f <- f + 1 } ","num_views":0,"num_stars":0,"num_comments":2,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"r","author":{"handle":"jejones3141"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/jejones3141","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"3b93a271875248408d6043208d65161b","snippet":"prime_factors <- function(number) { if(is_prime(number)) number else{ prime_factors <- c() i <- 2 remaining <- number while(i<=(number/2) & remaining>1){ if(is_prime(i)){ if(remaining%%i==0){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2018-09-24T17:27:11.000Z","is_out_of_date":true,"language":"r","author":{"handle":"Nia11"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/Nia11","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"58039b6e070644aa97a258867d81fdfd","snippet":"prime_factors <- function(target) { if(target <= 1 || target %% 1 != 0){ return(c()) } factors = c(get_first_factor(target)) while(prod(factors) != target){ next_factor <- get_next_factor(factors) while(target %% next_factor != 0){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-20T15:01:36.000Z","is_out_of_date":false,"language":"r","author":{"handle":"MindOfMetalAndWheels"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/MindOfMetalAndWheels","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"b7b859361d194f0ab3703d040bebbac1","snippet":"prime_factors <- function(n) { factors <- c() f <- 2 while (f ^ 2 <= n) { if (n %% f == 0) { factors <- append(factors, f) n <- n / f } else { f <- f + 1 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-25T20:07:18.000Z","is_out_of_date":false,"language":"r","author":{"handle":"glennj"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/glennj","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"8f70f88c7257483b91351e4a64af7816","snippet":"prime_factors <- function(number) { ret <- c() start <- 2 while (number > 1) { while (number %% start == 0) { number <- number / start ret <- c(ret, start) } start <- start + 1 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-06T18:53:04.000Z","is_out_of_date":false,"language":"r","author":{"handle":"Link477"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/Link477","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"50a00b1eac8d4194997200976a287e6c","snippet":"prime_factors <- function(number) { if (number %in% c(0, 1)){ return(c()) } potentials <- 2:floor(sqrt(number)) primes <- c() i <- 1 while (length(potentials) > 0){ primes <- c(primes, potentials[1]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":33,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"exceptioned","published_at":"2022-02-06T05:30:09.000Z","is_out_of_date":true,"language":"r","author":{"handle":"sin7"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/sin7","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"754e06995ad44a79b13a2fdee9a3f514","snippet":"prime_factors <- function(number) { factors <- c() # initialize an empty vector to store the prime factors divisor <- 2 # start with the smallest prime number while (number > 1) { if (number %% divisor == 0) { # check if the divisor evenly divides the number factors <- c(factors, divisor) # add the divisor to the list of factors number <- number / divisor # divide the number by the divisor } else { divisor <- divisor + 1 # try the next prime number ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-16T17:51:06.000Z","is_out_of_date":false,"language":"r","author":{"handle":"nogajacobs"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/nogajacobs","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"68b0106c711c41b6bf82a766cc4246d0","snippet":" prime_factors <- function(number) { # should be greater than 1 if(number <= 1) return(NULL) # set defaults number_current <- number primes <- 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-29T18:13:51.000Z","is_out_of_date":false,"language":"r","author":{"handle":"pteridin"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/pteridin","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"96c03f12f6dd480189700e0d067f15da","snippet":"prime_factors <- function(number) { prime<-2 factors<-c() while(number > 1){ if(number %% prime == 0){ number<-number / prime factors<-append(factors,prime) }else{ prime<-prime + 1 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-21T10:54:29.000Z","is_out_of_date":false,"language":"r","author":{"handle":"Blag"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/Blag","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"e8f6d826ffcc40eca5bfaa3bfec0807a","snippet":"# Compute the prime factors for 'number'. The prime factors are # prime numbers that when multiplied give the desired number. # The prime factors of 'number' will be ordered lowest to highest. prime_factors <- function(number) { if (number < 2) { return(c()) } factors <- c() prime <- 2 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-14T16:17:49.000Z","is_out_of_date":false,"language":"r","author":{"handle":"brehberg"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/brehberg","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"11be4723cf804dad8f6b9cc000c75360","snippet":"prime_factors <- function(number) { factors <- c() divisor <- 2 while (number != 1) { while (number %% divisor == 0) { factors <- append(factors, divisor) number <- number / divisor } divisor <- divisor + 1 } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-23T02:13:37.000Z","is_out_of_date":false,"language":"r","author":{"handle":"johnsyweb"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/johnsyweb","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"7f85112e0cb5496cb00a61ac13fded43","snippet":"prime_factors <- function(number) { if(number == 1) return(NULL) factor <- smallest_factor(number) if(factor == number) return(factor) return(c(factor, prime_factors(number / factor))) } smallest_factor <- function(n) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-07T19:55:01.000Z","is_out_of_date":false,"language":"r","author":{"handle":"racciel"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/racciel","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"88275e4c2d7041529ea97893a4abf0b7","snippet":"prime_factors <- function(value) { primes <- c() n <- 2 limit <- floor(sqrt(value)) + 1 while (value > 1) { if (n > limit) {return(c(primes, value))} while (value %% n == 0) { primes <- c(primes, n) value <- value %/% n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-17T07:51:01.000Z","is_out_of_date":false,"language":"r","author":{"handle":"hmtysv"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/hmtysv","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"1552e67e957b4514a8d8f5ebc0441277","snippet":"prime_factors <- function(number) { result <- c() for (i in 2:number) { if (i > number) break while (number %% i == 0) { number <- number / i result[length(result)+1] <- i } } result ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-27T17:39:04.000Z","is_out_of_date":false,"language":"r","author":{"handle":"AMathMonkey"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/AMathMonkey","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"4bb5ff70252a406caae7a63699a188dd","snippet":"all_factors <- function(n) { seq <- 1:n f1 <- (seq)[n %% seq == 0] f1 <- (f1)[f1 != 1] f1 <- (f1)[f1 != n] for (i in f1) { if (i^2 == n) {f1 <- sort(c(f1, i))} } return(f1) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-01T12:59:13.000Z","is_out_of_date":false,"language":"r","author":{"handle":"joshcantcodeforshit"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/joshcantcodeforshit","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"6108ec0afa9c46519bb3aed9d8590d7b","snippet":"prime_factors <- function(number) { factors <- c() for(k in 2:floor(sqrt(number))){ if(number==1) break while(number%%k ==0){ factors <- c(factors,k) number <- number/k } } if(number!=1) factors<-c(factors, number) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"analyzing","published_iteration_head_tests_status":"exceptioned","published_at":"2026-02-15T07:06:05.000Z","is_out_of_date":true,"language":"r","author":{"handle":"efwhofmann"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/efwhofmann","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"3b6af1c32b804d0ea7655419885086f7","snippet":" prime_factors <- function(number) { factors <- integer(0) divisor <- 2L while (number > 1) { while (number %% divisor == 0) { factors <- c(factors, divisor) number <- number %/% divisor } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-03T08:49:12.000Z","is_out_of_date":false,"language":"r","author":{"handle":"LFM023"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/LFM023","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}},{"uuid":"c2a882a09acd44b7acbc1d820fb6b537","snippet":"# Find the next prime number, following the idea of Eratosthenes' sieve. next_prime <- function(primes, multiples) { c <- if (length(primes)) max(primes) + 1 else 2 while (TRUE) { incr <- multiples < c while (any(incr)) { multiples[incr] <- multiples[incr] + primes[incr] incr <- multiples < c } if (all(multiples > c)) break ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-19T10:44:13.000Z","is_out_of_date":false,"language":"r","author":{"handle":"vrijaer"},"exercise":{"title":"Πρώτοι παράγοντες","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"R","icon_url":"https://assets.exercism.org/tracks/r.svg","highlightjs_language":"r"},"links":{"public_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/solutions/vrijaer","private_iterations_url":"https://exercism.org/el/tracks/r/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":85,"total_pages":4,"unscoped_total":85}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders