Prime Ministerial Candidacy Of Narendra Modi
   HOME



picture info

Prime Ministerial Candidacy Of Narendra Modi
The Bharatiya Janata Party (BJP), one of the major political parties in India, announced that Narendra Modi, the then chief minister of Gujarat state, would be their prime ministerial candidate for the 2014 Indian general election. The announcement was made by the then BJP president Rajnath Singh on 12 September 2013. Background Narendra Modi, being one of the chief minister from BJP was speculated to be a PM candidate. After his exceptional victory in the 2012 Gujarat elections, his popularity amongst the general public as well as the BJP cadre grew exponentially. According to an opinion poll conducted by India Today, Modi was the most preferred choice for PM candidate of BJP. In early 2012 itself, Nitin Gadkari, the former president of BJP hinted that Modi could become the PM candidate. Likewise, Sushma Swaraj, the LoP in Lok Sabha, also endorsed Modi as prime minister during the 2012 Gujarat election campaign. Many media houses also reported that Modi is being considered ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Prime Minister Of India Narendra Modi
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 Ã— 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number , called trial division, tests whether is a multiple of any integer between 2 and . Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE