Intereting Posts

Do we have such a direct product decomposition of Galois groups?
Entropy of matrix
History of the predicate calculus
Fermat's Last Theorem near misses?
On the factorial equations $A! B! =C!$ and $A!B!C! = D!$
Description of the Universe $V$
Is there a function whose inverse is exactly the reciprocal of the function, that is $f^{-1} = \frac{1}{f}$?
Prove that there exists bipartite graph with this degree sequence: $(3,3,3,3,3,5,6,6,6,6,6,6,6,6)$
Show how to calculate the Riemann zeta function for the first non-trivial zero
Is every ideal of $R$ a sum of a nilpotent ideal and an idempotent ideal?
Complex differentiability vs differentiability in $\mathbb{R}^2$
Kähler differential over a field
Probability problem
How to prove gcd of consecutive Fibonacci numbers is 1?
Geometric intuition for linearizing algebraic group action

Prove that for $ n \geq 2$, n has at least one prime factor.

I’m trying to use induction. For n = 2, 2 = 1 x 2. For n > 2, n = n x 1, where 1 is a prime factor. Is this sufficient to prove the result? I feel like I may be mistaken here.

- What is an odd prime?
- Is $1847^{2013}+2$ really a prime?
- Proving that there are at least $n$ primes between $n$ and $n^2$ for $n \ge 6$
- Convergence of $\sum_{m\text{ is composite}}\frac{1}{m}$
- Golbach's partitions: is there always one common prime in $G(n)$ and $G(n+6)$ , $n \ge 8$ (or a counterexample)?
- Prime with digits reversed is prime?

- Sum of odd prime and odd semiprime as sum of two odd primes?
- Prove by induction that $10^n -1$ is divisible by 11 for every even natural number
- What is the proof that covariance matrices are always semi-definite?
- Prove that if $f:A\to B$ is uniformly continuous on $A$ and $g$ is uniformly continuous on $B$, then $g(f(x))$ is uniformly continuous on $A$
- (Easy?) consequence of the Riemann Hypothesis
- Let$\ p_n$ be the$\ n$-th prime. Is$\ \lim_{n\to\infty} \log \log n \prod_{i=1}^{\lfloor \log n \rfloor} \frac{p_i-1}{p_i}>0$?
- Complex prime numbers
- Proof related to Harmonic Progression
- Prove that $\cot^2{(\pi/7)} + \cot^2{(2\pi/7)} + \cot^2{(3\pi/7)} = 5$
- In proof by induction, what does it mean when condition for inductive step is lesser than the propsition itself?

For a formal proof, we use *strong induction*. Suppose that for all integers $k$, with $2\le k\lt n$, the number $k$ has at least one prime factor. We show that $n$ has at least one prime factor.

If $n$ is prime, there is nothing to prove. If $n$ is not prime, by definition there exist integers $a$ and $b$, with $2\le a\lt n$ and $2\le b\lt n$, such that $ab=n$.

By the induction assumption, $a$ has a prime factor $p$. But then $p$ is a prime factor of $n$.

Inductive case: Assume $n$ has prime factors: It is either a prime, then it’s got a prime factor (itself), and then $n+1$ is even and has 2 as a prime factor. If $n$ isn’t prime, then the FTA says it has a unique prime factorization and $n+1$ is either prime or FTA says it has a prime factorization.

Induction seems a bit useless here.

You can use a proof by contradiction. If $n>1$ has no prime divisor, you can build an inifinite series of decreasing numbers.

let $n \in \mathbb{N}, n \geq 2$ and let’s consider cases:

$n\mbox{ is prime}$: done.

$n\mbox{ is not prime} \iff n \mbox{ is mixed} \implies n=\prod_{i=1}^j P_i^{q_i}$, where $P_k \mbox { is prime}$, $q_k \mbox { is the exponent}$ $\implies$ $n$ has prime factors: done.

If $n$ is prime, then we’re done, since $n$ is our desired prime factor of $n$. Otherwise, if $n > 2$ is not prime, then $n = ab$ for some $a,b \in \mathbb N$, where $1 < a \leq b < n$. But then since $a \geq 2$, it follows by the induction hypothesis that $a$ has at least one prime factor, say $p$, so that $a = pk$ for some $k \in \mathbb Z$. But then since $n = (pk)b = p\underbrace{(kb)}_{\in ~ \mathbb Z}$, we have that $p$ is also a prime factor of $n$, as desired.

Let n be a number greater than 2. It can be proved in following way.

Case 1:If n is a prime number and $n \geq 2 $ , then the number n can be factorized like $n= 1 * n $, where n is the only prime factor.

Case 2:If n is not a prime number and $n \geq 2 $, then the number n may be factorized in the following manner

$n = p_1^m * p_2^r *…p_i^a$ where $p_i$ denotes the prime factor and i denotes the number of prime numbers involved in its factorization such that $i > 1$.

If $i=1$ , it falls in the case 1.

Hence proved.

- What determines if a function has a least positive period?
- Pseudo Inverse Solution for Linear Equation System Using the SVD
- A sort of inverse question in topology
- Show that, if $f:A\to B$ is a function, with $A$ and $B$ being finite sets, and $|A|=|B|$, then $f$ is one to one iff $f$ is onto.
- How to solve the Brioschi quintic in terms of elliptic functions?
- How to prove $ \sum_{k=0}^n \frac{(-1)^{n+k}{n+k\choose n-k}}{2k+1}=\frac{-2\cos\left(\frac{2(n-1)\pi}{3}\right)}{2n+1}$
- What is a fair game?
- Why is the probability that a continuous random variable takes a specific value zero?
- Evaluate the eccentricity of the elliptical section of a right circular cone
- Divisibility rules and congruences
- Solve $\cos^{n}x-\sin^{n}x=1$ with $n\in \mathbb{N}$.
- If a linear operator has an adjoint operator, it is bounded
- $A+B=AB$ does it follows that $AB=BA$?
- For which real numbers $x$ is $\arcsin(2x^2-1)-2\arcsin x=-\dfrac{\pi}{2}$
- Prove that $a_n=1+\frac{1}{1!} + \frac{1}{2!} +…+ \frac{1}{n!}$ converges using the Cauchy criterion