olymmath

MEMO 2018 Problem 8

    An integer nn is called silesian if there exist positive integers a,ba,b and cc such that n=a2+b2+c2ab+bc+ca.n=\frac{a^2+b^2+c^2}{ab+bc+ca}. (a)(a) prove that there are infinitely many silesian integers. (b)(b) prove that not every positive integer is silesian.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator memo/2018/p8 · Tag EXWPQZ1WPZ · Edit this page on GitHub · Keys: j next, k previous