2
votes
Find all positive integer $n$ such that $\tau(n) = \sqrt{n+1}$
It's easy to prove by induction that $k+1\leq 3^{k/2}$ for all $k\neq 1$ (note that for $k=1$ we have $2<\sqrt 3$) and that $k+1\leq 5^{k/2}$ for all $k$. So if $\nu_3(n)\neq 1$, remembering that $...
1
vote
Find all positive integer $n$ such that $\tau(n) = \sqrt{n+1}$
A simple method is to use the fact that $\tau(n)$ grows more slowly than any power of $n$. Various explicit estimates of this type exist, which will reduce the problem to a finite computation. For ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
number-theory × 41211elementary-number-theory × 7813
prime-numbers × 5363
modular-arithmetic × 2664
algebraic-number-theory × 2638
abstract-algebra × 2235
diophantine-equations × 2181
combinatorics × 1993
analytic-number-theory × 1965
sequences-and-series × 1568
divisibility × 1175
reference-request × 912
elliptic-curves × 817
discrete-mathematics × 816
polynomials × 795
contest-math × 791
p-adic-number-theory × 742
algebraic-geometry × 737
real-analysis × 720
group-theory × 698
prime-factorization × 697
solution-verification × 685
algorithms × 645
summation × 612
algebra-precalculus × 577