Intereting Posts

Bubble sorting question
Evaluating the integral, $\int_{0}^{\infty} \ln\left(1 – e^{-x}\right) \,\mathrm dx $
Is there a constructible flat pairing function?
Are monomorphisms of rings injective?
Group Law for an Elliptic curve
Energy for the 1D Heat Equation
Generalizations of equi-oscillation criterion
Linear Algebra – Rank of a matrix
Proofs that involve Tricks
If $a^2 + b^2 + c^2 = 2$, find the maximum of $\prod(a^5+b^5)$
how many distinct values does it have?
Local maxima of Legendre polynomials
Why any short exact sequence of vector spaces may be seen as a direct sum?
Show that this piecewise function is differentiable at $0$
Convolution of two Gaussians is a Gaussian

I was randomly thinking and I stumbled upon this question in my mind. I was thinking of numbers, and I observed that any number is greater than or equal to the product of digits in many cases. I was thinking, is this true for all natural numbers or for only a few cases? Please help.

- Diophantine equation: $7^x=3^y-2$
- $n$ and $n^5$ have the same units digit?
- The sum of three consecutive cubes numbers produces 9 multiple
- If $N\in \mathbb N$ is a palindrome in base $b$, can we say it is a palindrome in other bases?
- Finding primes so that $x^p+y^p=z^p$ is unsolvable in the p-adic units
- Exponent of $p$ in the prime factorization of $n!$
- Under what conditions does $(\frac{3}{p})(\frac{-1}{p})=1?$ Two ways, different results.
- $\forall n\ /\ \not\exists$ {primitive roots modulo n}: if $\ Max(ord_n(k))+1 \mid n\ $ then $\ Max(ord_n(k))+1\ $ is prime?
- IMO 1988, problem 6
- For any prime $p > 3$, why is $p^2-1$ always divisible by 24?

Let $k$ be the number of digits, and let $a$ be the first digit (assume $a>0$). Then the product of the digits is bounded above by $a\times 9^{k-1}$. The value of the number itself is bounded below by the total value of that first digit: $a\times 10^{k-1}$.

$\begin{eqnarray} {\bf Hint}

& & a + 10\ b + 10^2 c + 10^3 d\\

&=& a+\color{#c00}{10}(b+\color{#c00}{10}(c+\color{#c00}{10}d))\\

&\ \ge\ & a+\ \color{#c00}a\ (b +\ \color{#c00}b\ (c+\ \color{#c00}c\ d))\quad\ \ {\rm by}\ \ \ \color{#c00}{10 > a,b,c}\\

& =& a+\ a\,\ b + a\ b\ c+ abcd\ \ge\ abcd

\end{eqnarray}$

(Note: This is not a formal, mathematical proof, just a way of thinking about it. IANAM)

Let’s look at the number 12: a good, honest number who always pays its taxes on time and helps old ladies cross the street. 12 won’t tell you this, because his mother taught him to be polite, but he’s made up of two components: 12 = 1*10 + 2

Now let’s look at 12’s good friend 26. He is also made up of two components: 26 = 2*10 + 6.

As a last example, we’ll have a look at their long lost cousin 794, which exhibits the exact same behaviour: 794 = 7*100 + 9*10 + 4.

We can see that the product of the numbers they’re made up of is smaller than themselves:

- 12 > 1*2
- 26 > 2*6
- 794 > 7*9*4

The reason for this is revealed when you ignore the advice of 12’s mother and look at what they’re made of. As we saw, one of 12’s components is 1*10. Since there’s no such digit as 10, all of the `10+x`

family (where `x`

is a digit) will be larger than the product of their digits, because the number itself exhibits a multiplication larger than any single digit.

Let’s expand this to be more formal. A number in our decimal system looks like this:

$a*10^n + b*10^{(n-1)} + … + z*10^0$

We can see our digits here, they’re `a, b, ... z`

. Looking at their product:

$a * b * … * z$

And we can see that in the former, they’re being multiplied by things far larger than they.

In conclusion, this makes sense because our decimal system works by multiplying digits by powers of 10. No digit can be bigger than that multiplication (and the number is a sum of these multiplications), so it stands to reason that a number is greater or equal to the product of its digits.

Let **k** be the number of digits, and **a _{k-1} a_{k-2}** ….

for example, Let the number is 265 then k=3 , a_{2} = 2, a_{1}=6, a_{0} = 5.

Then **product of digit of the number** is **a _{k-1} * a_{k-2} * … * a_{0}**

The **actual value of number** is **a _{k-1} * 10^{k-1} + a_{k-2} * 10^{k-2} +….+a_{0} * 10^{0}**

Compare **product of digit of the number** and **1st part of actual value of the number**

** a _{k-1} * a_{k-2} * … * a_{0}**

** a _{k-1} * 10^{k-1}**

In product of digit of the number after **first digit (a _{k-1})** there are product of

In actual value of number after **first digit (a _{k-1})** there are product of

**10 ^{k-1}** always grater than

Therefore,

**If k>1** the number is always grater than product of digit of the number.

~~And ~~**if k=1 we can’t find the product of digit of the number** because product is **binary operator**.

**Any natural number is greater than or equal to its product of digits.**

- Expected Values of Operators in Quantum Mechanics
- Show inequality of integrals (cauchy-schwarz??)
- Result due to Cohn, unique division ring whose unit group is a given group?
- Intuition about infinite sums
- Possible matrix-determinant identity
- How many roots have a complex number with irrational exponent?
- No closed form for the partial sum of ${n\choose k}$ for $k \le K$?
- $K/\langle x^2-y^3\rangle \cong K$
- Prove $\int\cos^n x \ dx = \frac{1}n \cos^{n-1}x \sin x + \frac{n-1}{n}\int\cos^{n-2} x \ dx$
- Thue-Morse sequence cube-freeness proof from the Book
- Number of elements which are cubes/higher powers in a finite field.
- If g(f(x)) is one-to-one (injective) show f(x) is also one-to-one (given that…)
- Taylor expansion of $(1+x)^α$ to binomial series – why does the remainder term converge?
- Inductive proof of $a_n = 3*2^{n-1} + 2(-1)^n$ if $a_n = a_{n-1} + 2*a_{n-2}, a_1 = 1, a_2 = 8$
- If $a^3 b = ba^3$ and if $ a $ has order 7, show that $ab = ba$