Problem 2595. Polite numbers. Politeness.

Created by Jan Orwat

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A polite number is an integer that sums of two or more consecutive positive integers. Politeness of a positive integer is a number of nontrivial ways to write n as a sum of two or more consecutive positive integers.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For example</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>9 = 4+5 = 2+3+4</w:t></w:r><w:r><w:t> and politeness of 9 is 2.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>N</w:t></w:r><w:r><w:t> return politeness of</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>N</w:t></w:r><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>See also</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.co.uk/matlabcentral/cody/problems/2593\"><w:r><w:t>2593</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

399 Solutions
123 Solvers

Last Solution submitted on Dec 04, 2021

Last 200 Solutions

Problem Comments

5 Comments

5 Comments

Show 2 older comments

Daniel Pereira on 27 Jan 2016

There are some flaws when checking the solutions:

I think 15 has 4 combinations of sum of consecutive INTEGERS (as stated in the problem):
15 = 7+8 = 4+5+6 = 1+2+3+4+5 = 0+1+2+3+4+5; % 0 is integer.

or 1025 (you say 5, I say 9):
1025 = 1022+1023 = sum(203:207) = sum(98:107) = sum(29:53) = sum(5:45) = sum(-4:45) = sum(-28:53) = sum(-97:107) = sum(-202:207); % negative numbers are integers too.

Jan Orwat on 28 Jan 2016

I can see the flaw in the description now, I've missed repeating "positive", Thanks. Btw considering your interpretation 15 has 7 combinations: sum(-14:15),sum(-6:8),sum(-3:6),sum(0:5),sum(1:5),sum(4:6),sum(7:8). In this way 1025 should have 11 and conversion between our interpretations is "yours=2*mine+1"; to any of mine solutions of the form m:n, you can add "-m+1:n", the last thing is to add "-input+1:input"

John D'Errico on 21 Aug 2016

An interesting problem, enough so that I chose to solve it in three essentially different ways. As always, there are various ways to solve any problem. The first two ways were essentially constructive, so counting the set of solutions for any N. The last used a formulaic approach.

Rafael S.T. Vieira on 11 Aug 2020

Politeness is an integer sequence defined at https://oeis.org/A069283.

goc3 on 13 Jan 2021

@Dyuman Joshi: I do not know why that error occurs. I do know that it essentially means that the user needs to wait and re-submit their solution at a later time, sometimes the next day.

By the way, it's best to not post solutions (or solution attempts) in comments. Questions or comments specific to a solution can be posted in a comment tied to said solution or solution attempt.

Solution Comments

Solution 2056983

1 Comment

1 Comment

Asif Newaz on 13 Dec 2019

why it is showing--"While evaluating the solution, the server encountered an error caused by temporary unavailability of MATLAB Service'' ...

Solution 939609

1 Comment

1 Comment

John D'Errico on 21 Aug 2016

So, doing a little reading about polite numbers, one finds that the politeness divisors is related to the number of odd divisors.

Solution 939594

1 Comment

1 Comment

John D'Errico on 21 Aug 2016

vectorized & constructive, explicitly counting all solutions for even and odd k

Solution 939566

1 Comment

1 Comment

John D'Errico on 21 Aug 2016

Brute force, with a while loop. crude as hell, but it works for a first pass.

Solution 814993

1 Comment

1 Comment

Daniel Pereira on 27 Jan 2016

Whit this solution you can check the correct number of combinations that summing consecutive integers give the input number.

Solution 679419

2 Comments

2 Comments

Varoujan on 2 Jun 2015

I had to cheat to get the test 1 to pass. The test requires that if N=1, then politeness=0. According to other reputable sources, politeness of 1 is 1.

Jan Orwat on 28 Jan 2016

then why politeness of 15 isn't 4?

Problem Recent Solvers123

Problem Tags

number theory oeis

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2595. Polite numbers. Politeness.

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers123

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Problem 2595. Polite numbers. Politeness.

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers123

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Players