Fill in the blanks:
The numbers 2 ! , 3 ! , 4 ! , ⋯ are all ________ .
Notation: ! is the factorial notation. For example, 8 ! = 1 × 2 × 3 × ⋯ × 8 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Excluding 0 and 1 , then we get the answer Irrational .
Because 0 ! = ± 1 = 1 ! .
Substituting x = 2 to the expression, x ! , then 2 ! = 2 .
Since 2 is a irrational number, so the answer is irrational number.
You still have to demonstrate that 3 ! , 4 ! , 5 ! , … are all irrational numbers.
Log in to reply
I know.
6 , 2 4 , 1 2 0 , 7 2 0 , 5 0 4 0 , 4 0 3 2 0 , ⋯ are all irrational because the factorial cannot be a perfect square.
Log in to reply
But how do you prove a factorial can't be a perfect square? (Hint: think about prime factors; Bertrand's postulate also helps)
Log in to reply
@Chris Lewis – Excepting 0 and 1 , then we get the irrational number.
Because 0 ! = ± 1 = 1 ! .
Of course, I cannot understand why 0 ! is equal to 1 .
Log in to reply
@. . – You still didn't prove that 3 ! , 4 ! , … are all irrational numbers.
Log in to reply
@Pi Han Goh – If 6 is rational, then if a and b are integers, then 6 = a b ( a = 0 ) .
Multiplying a to both sides, then a 6 = b .
And let a b to a irraducible fraction.
Then a 2 6 = b .
So, a 2 × 6 = b 2 .
Next, 6 = ( a b ) 2 .
And, 6 = a 2 b 2 .
Then, 6 a 2 = b 2 .
So, b is even because 6 a 2 is even.
Next, then a is even because b is even.
We let a b is irreducible, but a and b are all even.
So 6 is irrational.
Then, we get the answer Irrational Number .
Much simpler proof exists.
Since 6 is not a perfect square, so 6 is irrational.
Log in to reply
@. . – You have only proved that 3 ! = 6 is irrational number.
What about the other infinitely many numbers, 4 ! , 5 ! , 6 ! , … ?
Log in to reply
@Pi Han Goh – 4 ! = 2 4 , 5 ! = 1 2 0 , 6 ! = 7 2 0 , 7 ! = 5 0 4 0 , 8 ! = 4 0 3 2 0 , ⋯ are all not perfect squares, so 4 ! , 5 ! , 6 ! , 7 ! , 8 ! , ⋯ are all irrational numbers.
So except 0 and 1, then all squares of factorial are all Irrational number . And except negative numbers also.
Log in to reply
@. . – And why are they not perfect squares?
Log in to reply
@Pi Han Goh – It is natural that they are not perfect squares.
For x > 1 , x = Natural Numbers , then we get x ! = a 2 .
a = Integers .
Then you will understand.
If a , b , c , ⋯ are natural numbers, then ( a b × b c × c a ) a b c must be a natural number, and between a , b , and c , there exists a even number.
Next, if x ! = a , then we get x ! = a 2 .
We cannot find the number a that satisfies the expression above.
Because a factorial means x ! = x × ( x − 1 ) × ( x − 2 ) × ⋯ 4 × 3 × 2 ( × 1 ) . .
We must find the number x .
But we cannot find it.
So the value of x ! , x > 1 , x = Natural number is always Irrational Number .
Log in to reply
@. . –
We cannot find the number a that satisfies the expression above.
This is not a valid proof. You have only tested a finite number of cases and found no evidence. When in fact, you should be proving that all such numbers don't satisfy this constraint.
You can't do a proof by exhaustion when there are infinitely many cases.
It's like saying
There are infinitely many prime numbers. Here's my proof:
11 is the biggest prime number? Nope, 13 is also a prime number.
No matter what prime number if you give me, I will always find a larger prime.
Log in to reply
@Pi Han Goh – Then can you tell me the largest prime number?
Log in to reply
@. . – You're completely missing the point.
You have only proven that the square root of some factorials are irrational, when in fact, you should be proving that the square roots of ALL factorials are irrational.
Log in to reply
@Pi Han Goh – Ok.
But you are making me really tired.
First, if 2 4 is rational number, then there is a number which satisfies 2 4 = b a ( b = 0 ) .
And a and b are integers.
Then 2 4 = b 2 a 2 .
So, 2 4 b 2 = a 2 .
Then I proved it as 3 ! , a , and b are all even.
And 5 ! , 6 ! , 7 ! , 8 ! , ⋯ are all irrational number.
Prooves are the same.
I am so tired, so pls don't reply to me anymore.
Log in to reply
@. . – Yikes, this got heated. The point is that you can't prove something holds for an infinite set by going case by case.
Classic examples of this are Euclid's proof that there are infinitely many primes, or any proof of Pythagoras' theorem.
As @Pi Han Goh says, it's not enough to say that because x ! is not a perfect square for x = 2 , 3 , 4 , 5 … it follows that x ! is never a perfect square; how can you be sure (like this) that there isn't some enormous factorial that also happens to be a square?
The only way to approach this kind of problem is to think about something fundamental and common to all factorials, and show that that is incompatible with being a perfect square.
I'll show you a proof below; to make it easier to read, I'll avoid a very formal structure, and I'll include examples (though these aren't necessary).
Fact 1 : the exponent of every prime factor of a square number is even. [Proof: every natural number n has a prime factorisation. Write n in this form; square it; the exponents of each prime in the factorisation of n 2 are twice those in the factorisation of n . For example, 6 = 2 1 ⋅ 3 1 and 6 2 = 3 6 = 2 2 ⋅ 3 2 .]
Fact 2 : (Bertrand's postulate) for x > 1 , the largest prime not exceeding x is greater than 2 1 x . [Example: the largest prime not exceeding 1 0 is 7 and 7 > 2 1 0 ]
Now we can prove the result. Assume that for some x > 1 , x ! is a perfect square. Let p be the largest prime not exceeding x . From fact 2 , the list 1 , 2 , 3 , ⋯ , x contains exactly one multiple of p (ie p itself).
But then the exponent of p in the prime factorisation of x ! is one, which is odd; and this contradicts fact 1 .
Therefore no such x exists.
I hope that makes sense and you can see how it works for all x .
Problem Loading...
Note Loading...
Set Loading...
According to Bertrand's postulate, there is always a prime p , such that ⌊ 2 x ⌋ < p < x . The prime p has the property p ∣ x ! , but p 2 ∣ x ! . Therefore,
x ! = R × p
where R × p = x ! . Also, R and p are coprimes. if x ! is rational, then x ! = b a , for positive integers a , b ( a and b are coprimes).
x ! = R × p ⟹ x ! = R × p ⟹ x ! = b 2 a 2 = R × p ⟹
a 2 = ( R × p ) × b 2 ⟹ p ∣ a ⟹ p 2 ∣ a 2 ⟹ p ∣ b ⟹ g c d ( a , b ) = p
which is contradiction. So, x ! is irrational. Note that the reasoning only works for x > 3 . So for 2 ! and 3 ! one should prove the irrationality separately, although the reasoning is similar.