Before you start a new topic in this forum, please make sure that a topic for the same problem does not already exist.
If such a topic already exists, please post your question or concern in that topic; it's the only way to keep the number of topics manageable and make it possible to easily search for a specific problem.
Problem 023
Forum rules
As your posts will be visible to the general public you
are requested to be thoughtful in not posting anything
that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
As your posts will be visible to the general public you
are requested to be thoughtful in not posting anything
that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Re: Problem 23 Hints
See: viewtopic.php?f=50&t=1356
Re: Problem 23 Hints
Need your help one more time folks!
Brute forced and arrived at the solution after 3 mins. Checked the forum for this code which runs way faster! but it is confusing the hell out of me. Can somebody type a few insightful words about this?
I am unsure of the code posting rules for this forum  so i am providing a link here to the problem thread page > edit. I am referring to the one from JavaManIssa  especially around the expressable array that it uses.
Thanks
Brute forced and arrived at the solution after 3 mins. Checked the forum for this code which runs way faster! but it is confusing the hell out of me. Can somebody type a few insightful words about this?
I am unsure of the code posting rules for this forum  so i am providing a link here to the problem thread page > edit. I am referring to the one from JavaManIssa  especially around the expressable array that it uses.
Thanks
Last edited by rayfil on Sat Apr 04, 2009 2:23 am, edited 1 time in total.
Reason: Removed link as precaution
Reason: Removed link as precaution
Re: Problem 23 Hints
Please no discussion here.
PM me what you don't understand in that solution.
PM me what you don't understand in that solution.

 Posts: 7
 Joined: Tue May 12, 2009 3:17 pm
Re: Problem 023
I guess this statement needs to be rephrased
A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.
Re: Problem 023
This means:yashkochar wrote:I guess this statement needs to be rephrasedA number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.
A number whose sum of its proper divisors is less than the number is called deficient and a number whose sum of its proper divisors exceeds the number is called abundant.
Update:
Corrected. Thank you hk.
Last edited by Georg on Fri Jun 12, 2009 10:15 am, edited 1 time in total.
Re: Problem 023
Sum is singular so are>is and exceed>exceedsGeorg wrote:This means:yashkochar wrote:I guess this statement needs to be rephrasedA number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.
A number whose sum of its proper divisors are less than the number is called deficient and a number whose sum of its proper divisors exceed the number is called abundant.
 daniel.is.fischer
 Posts: 2400
 Joined: Sun Sep 02, 2007 10:15 pm
 Location: Bremen, Germany
Re: Problem 023
Reads awkwardly. Wouldn't it be better to write "A number for which the sum of its proper divisors ...", as in the first sentence about perfect numbers?
Or "A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if the sum exceeds n."?
Or "A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if the sum exceeds n."?
Il faut respecter la montagne  c'est pourquoi les gypaètes sont là.
Re: Problem 023
daniel.is.fischer wrote:Reads awkwardly. Wouldn't it be better to write "A number for which the sum of its proper divisors ...", as in the first sentence about perfect numbers?
Or "A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if the sum exceeds n."?
I prefer:
"A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if the sum exceeds n."
Perhaps even better:
"A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n."
 daniel.is.fischer
 Posts: 2400
 Joined: Sun Sep 02, 2007 10:15 pm
 Location: Bremen, Germany
Re: Problem 023
Yes, that's better. Who's going to change the problem wording?
Edit: I already did.
Edit: I already did.
Il faut respecter la montagne  c'est pourquoi les gypaètes sont là.
Re: Problem 023
Hi,
I'm struggling to solve this problem. Can somebody please confirm the following stats?
Min Abundant: 12
Max Abundant: 28122
Abundant Cnt: 6965
Min Target: 1
Max Target: 20161
Target Cnt: 1447
As far as I can see they fit the data given posted previously in this thread (20161 being the highest relevant number and 6965 abundant numbers in the range). Are the other ones also OK?
Thanks in advance
Zifix
I'm struggling to solve this problem. Can somebody please confirm the following stats?
Min Abundant: 12
Max Abundant: 28122
Abundant Cnt: 6965
Min Target: 1
Max Target: 20161
Target Cnt: 1447
As far as I can see they fit the data given posted previously in this thread (20161 being the highest relevant number and 6965 abundant numbers in the range). Are the other ones also OK?
Thanks in advance
Zifix
Re: Problem 023
I just solved this one. All the stats are correct except for:
Target Cnt: 1456
Target Cnt: 1456
Re: Problem 023
Hi guys.
I'm trying to solve this problem and I can't get the right solution. Is there some milestone results to check my code? (for example, the sum of all the numbers below 1000 which are not the sum of to abundant numbers) This will be very useful for debugging
Thanks.
I'm trying to solve this problem and I can't get the right solution. Is there some milestone results to check my code? (for example, the sum of all the numbers below 1000 which are not the sum of to abundant numbers) This will be very useful for debugging
Thanks.
Re: Problem 023
There are 21 abundant numbers below 100.
The sum of the numbers below 100 that cannot be expressed as the sum of two of these is 2766.
That should help your debugging.
The sum of the numbers below 100 that cannot be expressed as the sum of two of these is 2766.
That should help your debugging.
Some thing wrong with Problem 23 Example
In fact the first two abundant numbers are 12 , 18 So their sum = 30 !!the smallest number that can be written as the sum of two abundant numbers is 24
Am I right or I have misunderstanding ??
Re: Some thing wrong with Problem 23 Example
Just a little misunderstanding.
12 + 12 = 24
but I guess 30 is the second smallest.
12 + 12 = 24
but I guess 30 is the second smallest.
 rayfil
 Administrator
 Posts: 1403
 Joined: Sun Mar 26, 2006 4:30 am
 Location: Ontario, Canada
 Contact:
Re: Problem 023
@CMinus
Your post has been merged with the proper thread related to Problem 23.
We realize you are new to this forum. Please read the sticky thread entitled "Comments, questions and clarifications about PE problems". By using the suggested search procedure, you will find that most (if not all) of the older problems already have a thread started for them. And, in many cases, your
inquiry may already have been covered.
Your post has been merged with the proper thread related to Problem 23.
We realize you are new to this forum. Please read the sticky thread entitled "Comments, questions and clarifications about PE problems". By using the suggested search procedure, you will find that most (if not all) of the older problems already have a thread started for them. And, in many cases, your
inquiry may already have been covered.
When you assume something, you risk being wrong half the time.
Re: Problem 023
@rayfill I am sorry but , I searched the forum & I didn't find the post !!
Re: Problem 023
Can someone take a look at my code? It's in C++  I get an answer that's very close (within ~1000), but obviously not the correct answer.
Re: Problem 023
Hi  I just completed problem 023. In my humble opinion, I firmly believe the wording of this question should be changed from
Thankyou for your consideration,
Ben
toFind the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
I spent some time thinking what was wrong with my code until I realised perhaps the question was ambiguous. Surely enough on changing my "i + 1" to "i" in one of my loops I got the correct answer.Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers (the two abundant numbers are allowed to be the same).
Thankyou for your consideration,
Ben