Add test for very large prime number to Perfect Numbers exercise

Programming Rust
1

The most straightforward solution has time complexity of O(num), but there’s a solution possible that has time complexity of O(sqrt(num)). The added case tests for efficiency and fails O(num) solutions.

Here is the link to PR: Add test for very large prime number to perfect-numbers.rs by gregzaitsev · Pull Request #1868 · exercism/rust · GitHub

2

You may want to read this prior to opening PRs. Suggesting Exercise Improvements | Exercism's Docs

3

Adding new tests may break existing solutions.

Makes sense, thank you! Let’s leave my PR closed.