From af9ca32df2f7d435ed7a5c023a2cc59542218b67 Mon Sep 17 00:00:00 2001 From: Hamid Ayub Date: Wed, 24 May 2023 22:18:55 +0500 Subject: [PATCH 1/3] added a snippet for prime factors in python --- snippets/python/s/prime-factors.md | 31 ++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 snippets/python/s/prime-factors.md diff --git a/snippets/python/s/prime-factors.md b/snippets/python/s/prime-factors.md new file mode 100644 index 00000000000..ead80e52fbf --- /dev/null +++ b/snippets/python/s/prime-factors.md @@ -0,0 +1,31 @@ +--- +title: Prime factors of number +type: snippet +language: python +tags: [math,algorithm] +cover: dark-leaves-3 +dateModified: 2023-05-24T00:00:00.000Z +--- + +Find and return the list containing prime factors of a number. + +- Use a `while` loop to iterate over all possible prime factors, starting with `2`. +- If the current `factor`, exactly divides `num`, add `factor` to the `factors` list and divide `num` by `factor`. Otherwise, increment `factor` by one. + +```py +def prime_factors(num): + factors = [] + factor = 2 + while (num >= 2): + if (num % factor == 0): + factors.append(factor) + num = num / factor + else: + factor += 1 + return factors +``` + +```py +prime_factors(12) # [2,2,3] +prime_factors(42) # [2,3,7] +``` \ No newline at end of file From 8a956c0efcc578fd640691e30725846792fb27ff Mon Sep 17 00:00:00 2001 From: Angelos Chalaris Date: Thu, 25 May 2023 22:37:25 +0300 Subject: [PATCH 2/3] Update prime-factors.md --- snippets/python/s/prime-factors.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/snippets/python/s/prime-factors.md b/snippets/python/s/prime-factors.md index ead80e52fbf..4d0a977f2dd 100644 --- a/snippets/python/s/prime-factors.md +++ b/snippets/python/s/prime-factors.md @@ -3,14 +3,14 @@ title: Prime factors of number type: snippet language: python tags: [math,algorithm] -cover: dark-leaves-3 -dateModified: 2023-05-24T00:00:00.000Z +cover: river-flow +dateModified: 2023-05-24T05:00:00+02:00 --- -Find and return the list containing prime factors of a number. +Finds and returns the list of prime factors of a number. - Use a `while` loop to iterate over all possible prime factors, starting with `2`. -- If the current `factor`, exactly divides `num`, add `factor` to the `factors` list and divide `num` by `factor`. Otherwise, increment `factor` by one. +- If the current `factor` exactly divides `num`, add `factor` to the `factors` list and divide `num` by `factor`. Otherwise, increment `factor` by one. ```py def prime_factors(num): @@ -28,4 +28,4 @@ def prime_factors(num): ```py prime_factors(12) # [2,2,3] prime_factors(42) # [2,3,7] -``` \ No newline at end of file +``` From be3514a906d43c00dad26033ea50886bc451f6b0 Mon Sep 17 00:00:00 2001 From: Angelos Chalaris Date: Thu, 25 May 2023 22:38:29 +0300 Subject: [PATCH 3/3] Update prime-factors.md --- snippets/python/s/prime-factors.md | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/snippets/python/s/prime-factors.md b/snippets/python/s/prime-factors.md index 4d0a977f2dd..7015871c351 100644 --- a/snippets/python/s/prime-factors.md +++ b/snippets/python/s/prime-factors.md @@ -14,15 +14,15 @@ Finds and returns the list of prime factors of a number. ```py def prime_factors(num): - factors = [] - factor = 2 - while (num >= 2): - if (num % factor == 0): - factors.append(factor) - num = num / factor - else: - factor += 1 - return factors + factors = [] + factor = 2 + while (num >= 2): + if (num % factor == 0): + factors.append(factor) + num = num / factor + else: + factor += 1 + return factors ``` ```py