Problem 44732. Highly divisible triangular number (inspired by Project Euler 12)

Created by goc3

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>Triangular numbers can be calculated by the sum from 1 to n. For example, the first 10 triangular numbers are:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>All divisors for each of these numbers are listed below</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ 1: 1\n 3: 1,3\n 6: 1,2,3,6\n 10: 1,2,5,10\n 15: 1,3,5,15\n 21: 1,3,7,21\n 28: 1,2,4,7,14,28\n 36: 1,2,3,4,6,9,12,18,36\n 45: 1,3,5,9,15,45\n 55: 1,5,11,55]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Your challenge is to write a function that will return the value of the first triangular number to have over d divisors (d will be passed to your function).</w:t></w:r></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

95 Solutions
33 Solvers

Last Solution submitted on Sep 25, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

li haitao on 7 Nov 2018

Why are so many solutions lost?

Problem Recent Solvers33

Problem Tags

divisor project euler projecteuler sequence series triangle triangular number

Community Treasure Hunt

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

Start Hunting!

Problem 44732. Highly divisible triangular number (inspired by Project Euler 12)

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers33

Suggested Problems

More from this Author139

Problem Tags

Community Treasure Hunt

Problem 44732. Highly divisible triangular number (inspired by Project Euler 12)

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers33

Suggested Problems

More from this Author139

Problem Tags

Community Treasure Hunt

Players