MathDB
NT with difference of divisors

Source: Bulgaria MO Regional round 2024, 11.3

February 13, 2024
number theory

Problem Statement

A positive integer nn is called <spanclass=latexitalic>good</span><span class='latex-italic'>good</span> if 2τ(n)2 \mid \tau(n) and if its divisors are 1=d1<d2<<d2k1<d2k=n,1=d_1<d_2<\ldots<d_{2k-1}<d_{2k}=n, then dk+1dk=2d_{k+1}-d_k=2 and dk+2dk1=65d_{k+2}-d_{k-1}=65. Find the smallest <spanclass=latexitalic>good</span><span class='latex-italic'>good</span> number.