Toggle navigation
Mathematics
SAT
JEE
IMO
Vocabulary
Algorithms
Sign In
Subscribe to the weekly news from TrueShelf
Subscribe
Sort By:
trending ▼
date
0
High School
By
TrueShelf Inc.
on May 27, 2014 | Updated Jan. 16, 2017
JEE-Main 2013 Mathematics 31
The circle passing through \((1, −2)\) and touching the axis of \(x\) at \((3, 0)\) also passes through the point
Mathematics
Geometry
circle
jee
jee main
0
Undergraduate
By
TrueShelf Inc.
on June 13, 2013 | Updated Jan. 16, 2017
Among the following sorting algorithms, which one has the least worst-case running time asymptotically ?
Computer Science
Algorithms
sorting
0
High School
By
TrueShelf Inc.
on May 29, 2014 | Updated Jan. 16, 2017
JEE-Main 2013 Mathematics 35
All the students of a class performed poorly in Mathematics. The teacher decided to give grace marks of 10 to each of the students. Which of the following statistical measures will not change even aft…
Mathematics
jee
jee main
statistics
variance
0
High School
By
TrueShelf Inc.
on May 29, 2014 | Updated Jan. 16, 2017
JEE-Advanced 2013 Mathematics 55
A rectangular sheet of fixed perimeter with sides having their lengths in the ratio 8 : 15 is converted into an open rectangular box by folding after removing squares of equal area from all four corne…
Mathematics
Geometry
volume
0
Undergraduate
By
Shiva Kintali
on May 31, 2013 | Updated Jan. 16, 2017
Let \(b > 1\). Then \(\log_b((n^2)!)\) is
Mathematics
asymptotic analysis
0
High School
By
TrueShelf Inc.
on Jan. 7, 2017 | Updated Jan. 27, 2017
JEE Advanced 2016 Paper 1 Mathematics Question 41
The least value of \(\alpha \in \mathbb{R}\) for which \(4\alpha {x}^2 + \frac{1}{x} \geq 1\), for all \(x > 0\), is
Mathematics
Calculus
differentiation
inequality
jee
jee 2016
jee advanced
jee mathematics
0
Undergraduate
By
Shiva Kintali
on May 31, 2013 | Updated Jan. 16, 2017
Evaluate the following summation \(\sum_{i=1}^n {i^{-1/2}}\)
Mathematics
Discrete Mathematics
asymptotic analysis
summation
0
Undergraduate
By
Shiva Kintali
on June 8, 2013 | Updated Jan. 16, 2017
Let \(G\) be a \(k\)-regular simple bipartite graph with vertex partitions \(A\) and \(B\). Then,
Mathematics
Graph Theory
counting
0
Undergraduate
By
Shiva Kintali
on June 8, 2013 | Updated Jan. 16, 2017
Let \(G(V,E)\) be an undirected simple graph with \(|V|=n\) and \(|E|=m\). Let \(deg(v)\) be the degree of a vertex \(v \in V(G)\). Then, the sum of the degrees of all vertices in \(G\) i.e., …
Mathematics
Graph Theory
counting
0
Undergraduate
By
Shiva Kintali
on June 6, 2013 | Updated Jan. 16, 2017
There are exactly _________ spanning trees on the vertex set {\(1, \dots , n\)}.
Mathematics
Graph Theory
counting
trees
1
2
3
4
next page »
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
digraphs
fermats little theorem
binomial theorem
induction
divisibility
primes
image
jee
jee 2016
jee advanced
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×