From d400e879c3389dd34f2549e0bfc00bcb70ce75b9 Mon Sep 17 00:00:00 2001
From: Remo Senekowitsch <remo@buenzli.dev>
Date: Wed, 15 Oct 2025 07:46:47 +0200
Subject: [PATCH] Fix clippy warnings

---
 exercises/practice/nth-prime/.meta/example.rs       | 2 +-
 exercises/practice/ocr-numbers/.meta/example.rs     | 4 ++--
 exercises/practice/perfect-numbers/.meta/example.rs | 2 +-
 exercises/practice/prime-factors/.meta/example.rs   | 2 +-
 4 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/exercises/practice/nth-prime/.meta/example.rs b/exercises/practice/nth-prime/.meta/example.rs
index ce9b07d6a..ba0986c29 100644
--- a/exercises/practice/nth-prime/.meta/example.rs
+++ b/exercises/practice/nth-prime/.meta/example.rs
@@ -1,7 +1,7 @@
 fn is_prime(n: u32) -> bool {
     let mut i = 3;
     while (i * i) < (n + 1) {
-        if n % i == 0 {
+        if n.is_multiple_of(i) {
             return false;
         }
         i += 1;
diff --git a/exercises/practice/ocr-numbers/.meta/example.rs b/exercises/practice/ocr-numbers/.meta/example.rs
index 98153936f..5aea684df 100644
--- a/exercises/practice/ocr-numbers/.meta/example.rs
+++ b/exercises/practice/ocr-numbers/.meta/example.rs
@@ -8,12 +8,12 @@ pub enum Error {
 
 pub fn convert(input: &str) -> Result<String, Error> {
     let line_count = input.lines().count();
-    if line_count % 4 != 0 {
+    if !line_count.is_multiple_of(4) {
         return Err(Error::InvalidRowCount(line_count));
     }
     for line in input.lines() {
         let char_count = line.chars().count();
-        if char_count % 3 != 0 {
+        if !char_count.is_multiple_of(3) {
             return Err(Error::InvalidColumnCount(char_count));
         }
     }
diff --git a/exercises/practice/perfect-numbers/.meta/example.rs b/exercises/practice/perfect-numbers/.meta/example.rs
index 7fc827309..a2c6b3b3c 100644
--- a/exercises/practice/perfect-numbers/.meta/example.rs
+++ b/exercises/practice/perfect-numbers/.meta/example.rs
@@ -2,7 +2,7 @@ pub fn classify(num: u64) -> Option<Classification> {
     if num == 0 {
         return None;
     }
-    let sum: u64 = (1..num).filter(|i| num % i == 0).sum();
+    let sum: u64 = (1..num).filter(|i| num.is_multiple_of(*i)).sum();
     Some(match sum.cmp(&num) {
         std::cmp::Ordering::Equal => Classification::Perfect,
         std::cmp::Ordering::Less => Classification::Deficient,
diff --git a/exercises/practice/prime-factors/.meta/example.rs b/exercises/practice/prime-factors/.meta/example.rs
index e8c6245da..52ab60979 100644
--- a/exercises/practice/prime-factors/.meta/example.rs
+++ b/exercises/practice/prime-factors/.meta/example.rs
@@ -3,7 +3,7 @@ pub fn factors(n: u64) -> Vec<u64> {
     let mut out: Vec<u64> = vec![];
     let mut possible: u64 = 2;
     while val > 1 {
-        while val % possible == 0 {
+        while val.is_multiple_of(possible) {
             out.push(possible);
             val /= possible;
         }