Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2007 OIM Problems/Problem 5

Revision as of 15:51, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == A natural number <math>n</math> is "''daring''"<math> if the set of its divisors, from 1 to </math>n$ inclusive, can be divided into three subsets such that the...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A natural number $n$ is "daring"$if the set of its divisors, from 1 to$n$ inclusive, can be divided into three subsets such that the sum of the elements of each subset is the same in all three. What is the smallest number of divisors a daring number can have?

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_OIM_Problems/Problem_5&oldid=207460"