SOLUTION: For any integers n, let ® n be defined as the sum of the distinct prime factors of n. For instance, ® 36=5, because 2 and 3 are the only prime factors of 36 and
2+3=5.
What is t
Algebra.Com
Question 447147: For any integers n, let ® n be defined as the sum of the distinct prime factors of n. For instance, ® 36=5, because 2 and 3 are the only prime factors of 36 and
2+3=5.
What is the smallest value of w for which ® w=12 ?
Found 2 solutions by richard1234, solver91311:
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
The only way to express 12 as a sum of distinct prime numbers is 5+7. Therefore the smallest value of n that satisfies is (5^1)(7^1) = 35, because 5+7 = 12.
Answer by solver91311(24713) (Show Source): You can put this solution on YOUR website!
Hint: 5 + 7 = 12
John
My calculator said it, I believe it, that settles it
RELATED QUESTIONS
For positive integer values of N, let N be defined as:
N = 2 + 4 + 6 + ... + N, if N (answered by Edwin McCravy)
Choose all the descriptions for natural numbers n that have 3 divisors.
1- n= p^2 * q... (answered by ikleyn,math_tutor2020)
Let n be a positive integer greater than 1. We call n prime if the only positive integers (answered by jim_thompson5910)
Let the "kernel" of a number be defined as the square of its greatest prime factor. For... (answered by tinbar)
Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime... (answered by richard1234)
Dear math teacher,
I am having difficulties with the following problem:
4 times nC2 (answered by Theo)
THE SUM OF THE SQUARES OF TWO CONSECUTIVE POSITIVE INTEGERS IS 41
41=n^2(n+1)^2... (answered by richard1234)
Let T(n) denote the number of distinct ways that a postage of n
cents, where n ≥ 4 and (answered by greenestamps)
please help! I have been looking at this question for just over a week and ive put it off (answered by alka001)
