# These tests are auto-generated with test data from: # https://github.com/exercism/problem-specifications/tree/main/exercises/perfect-numbers/canonical-data.json # File last updated on 2026-03-14 source("./perfect-numbers.R") library(testthat) # Perfect numbers test_that("Smallest perfect number is classified correctly", { n <- 6 expect_equal(number_type(n), "perfect") }) test_that("Medium perfect number is classified correctly", { n <- 28 expect_equal(number_type(n), "perfect") }) test_that("Large perfect number is classified correctly", { n <- 33550336 expect_equal(number_type(n), "perfect") }) # Abundant numbers test_that("Smallest abundant number is classified correctly", { n <- 12 expect_equal(number_type(n), "abundant") }) test_that("Medium abundant number is classified correctly", { n <- 30 expect_equal(number_type(n), "abundant") }) test_that("Large abundant number is classified correctly", { n <- 33550335 expect_equal(number_type(n), "abundant") }) test_that("Perfect square abundant number is classified correctly", { n <- 196 expect_equal(number_type(n), "abundant") }) # Deficient numbers test_that("Smallest prime deficient number is classified correctly", { n <- 2 expect_equal(number_type(n), "deficient") }) test_that("Smallest non-prime deficient number is classified correctly", { n <- 4 expect_equal(number_type(n), "deficient") }) test_that("Medium deficient number is classified correctly", { n <- 32 expect_equal(number_type(n), "deficient") }) test_that("Large deficient number is classified correctly", { n <- 33550337 expect_equal(number_type(n), "deficient") }) test_that("Edge case (no factors other than itself) is classified correctly", { n <- 1 expect_equal(number_type(n), "deficient") }) # Invalid inputs test_that("Zero is rejected (as it is not a positive integer)", { n <- 0 expect_error(number_type(n)) }) test_that("Negative integer is rejected (as it is not a positive integer)", { n <- -1 expect_error(number_type(n)) })