# Tagged Questions

The Problem was as follows: Define $\log*(n)$ to be the smallest number of times the log function must be iteratively applied to $n$ to get a result less than or equal to $1$. For example ...
The question was as follows: Compute the smallest positive integer $n$ such that $n^n$ has at least $1,000,000$ positive divisors. I did some work, finding that if $n=2^a*3^b*5^c*7^d$ then the $n^n= ... 2answers 281 views ### Solve exponential-polynomial equation Solve the equation in$\mathbb{R}$$$10^{-3}x^{\log_{10}x} + x(\log_{10}^2x - 2\log_{10} x) = x^2 + 3x$$ To be fair I wasn't able to make any progress. I tried using substitution for the ... 1answer 65 views ### Find the value of$\sqrt{(b-a-4)^2}- \sqrt{(a-b+1)^2}$if a>0 and b<0 Find the value of$\sqrt{(b-a-4)^2}- \sqrt{(a-b+1)^2}$if$a>0$and$b<0$. How do i find the value? This doesn't make any sense. 3answers 142 views ### Find the smallest natural number that satisfy$13^N = 1 \pmod {2013}\$
Moderator Note: This is a current contest question on Brilliant.org. Find the smallest natural number that satisfy: $$13^N = 1 \pmod {2013}$$ My idea is to use the Fermat's little theorem ...