Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Prove that n! = Ω(n^100)
wtquevb123
asked
in
Algorithms
Mar 14
edited
Mar 15
by
wtquevb123
59
views
0
votes
0
votes
theory-of-computation
algorithms
time-complexity
wtquevb123
asked
in
Algorithms
Mar 14
edited
Mar 15
by
wtquevb123
by
wtquevb123
59
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
n! = Ω(n^100)
First "
Ω
" means ">=" in terms of asymptotic notations
so it says n! >= n^100 (this terminology should only be used at the
time of solving mcqs)
Now taking log on both side we get
n(logn) >= 100(logn) {as log(n! = n logn)}
so now we by reducing logn from both side we get
n>= 100(constant).{which is true}
Hence Proved
Teet Makor
answered
Mar 23
by
Teet Makor
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
2
answers
1
Ojamajo Conan
asked
in
Algorithms
Oct 3, 2018
463
views
Prove that for any constant c > 0, (log n)^c = o(n).
Ojamajo Conan
asked
in
Algorithms
Oct 3, 2018
by
Ojamajo Conan
463
views
algorithms
time-complexity
0
votes
0
votes
0
answers
2
krishan_rathi
asked
in
Theory of Computation
Feb 21
112
views
Prove that the following languages are not regular. You may use the pumping lemma and the closure of the class of regular languages under union, intersection, and complement. a. {0"1"0"| m, n 2 0} b. (0"1"| m ‡ n) c. (w| w € {0,1)* is not a palindrome) d. (wtw| w,t € (0,1)*)
krishan_rathi
asked
in
Theory of Computation
Feb 21
by
krishan_rathi
112
views
theory-of-computation
0
votes
0
votes
0
answers
3
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
235
views
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
235
views
theory-of-computation
regular-language
finite-automata
4
votes
4
votes
1
answer
4
naveenagrahari
asked
in
Algorithms
Jul 9, 2015
5,137
views
$(\log n)!$ and $(\log \log n)!$ are polynomially bounded ? anybody can prove?
naveenagrahari
asked
in
Algorithms
Jul 9, 2015
by
naveenagrahari
5.1k
views
logarithmic-function
time-complexity
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy