diff --git a/src/include/sof/math/numbers.h b/src/include/sof/math/numbers.h
index 0cd9314f4859..80d4eba1a639 100644
--- a/src/include/sof/math/numbers.h
+++ b/src/include/sof/math/numbers.h
@@ -36,7 +36,11 @@
 	__a > 0 ? 1 : 0;	\
 })
 
+/* Zephyr added gcd() in 2025/Nov to sys/util.h */
+#ifndef gcd
+#define USE_SOF_GCD 1
 int gcd(int a, int b); /* Calculate greatest common divisor for a and b */
+#endif
 
 /* This is a divide function that returns ceil of the quotient.
  * E.g. ceil_divide(9, 3) returns 3, ceil_divide(10, 3) returns 4.
diff --git a/src/math/numbers.c b/src/math/numbers.c
index b4d6ade10421..df4f822c749a 100644
--- a/src/math/numbers.c
+++ b/src/math/numbers.c
@@ -15,6 +15,9 @@
 #include <rtos/symbol.h>
 #include <stdint.h>
 
+/* see numbers.h */
+#ifdef USE_SOF_GCD
+
 /* This function returns the greatest common divisor of two numbers
  * If both parameters are 0, gcd(0, 0) returns 0
  * If first parameters is 0 or second parameter is 0, gcd(0, b) returns b
@@ -74,6 +77,7 @@ int gcd(int a, int b)
 	return a << k;
 }
 EXPORT_SYMBOL(gcd);
+#endif /* USE_SOF_GCD */
 
 #if CONFIG_NUMBERS_VECTOR_FIND