<?xml version="1.0" encoding="UTF-8" standalone="no"?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0"><channel><title>easynet1</title><description>world of computer tricks........</description><managingEditor>noreply@blogger.com (Karan Patel)</managingEditor><pubDate>Fri, 8 Nov 2024 06:48:33 -0800</pubDate><generator>Blogger http://www.blogger.com</generator><openSearch:totalResults xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/">6</openSearch:totalResults><openSearch:startIndex xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/">1</openSearch:startIndex><openSearch:itemsPerPage xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/">25</openSearch:itemsPerPage><link>http://easynet1.blogspot.com/</link><language>en-us</language><itunes:explicit>no</itunes:explicit><itunes:subtitle>world of computer tricks........</itunes:subtitle><itunes:owner><itunes:email>noreply@blogger.com</itunes:email></itunes:owner><item><title>NUMBERS WHOLE BASICS</title><link>http://easynet1.blogspot.com/2015/06/numbers-whole-basics.html</link><category>Factors</category><category>Factors Product.</category><category>Factors Sum</category><category>HCF</category><category>LCM</category><category>Numbers</category><category>Prime</category><author>noreply@blogger.com (Karan Patel)</author><pubDate>Wed, 3 Jun 2015 06:02:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-7594333256605567017</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;header class="entry-header page-header" style="background-color: white; border-bottom-color: rgb(238, 238, 238); border-bottom-style: solid; border-bottom-width: 1px; box-sizing: border-box; color: #6b6b6b; font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif; font-size: 14px; line-height: 23.7999992370605px; margin: 0px 0px 20px; padding-bottom: 9px;"&gt;&lt;h1 class="entry-title " style="box-sizing: border-box; color: #444444; font-family: inherit; font-size: 32px; font-weight: 500; line-height: 1.1; margin: 20px 0px 10px;"&gt;
&lt;/h1&gt;
&lt;/header&gt;&lt;br /&gt;
&lt;div class="entry-content" style="background-color: white; box-sizing: border-box; color: #6b6b6b; font-family: 'Helvetica Neue'; font-size: 14px; line-height: 23.7999992370605px; margin: 1.5em 0px 0px;"&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;1. BASICS NUMBERS&lt;/span&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&amp;lt;hr&amp;gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
1) Real_numbers &amp;nbsp;(Cat syllabus)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
2) Imaginary_numbers &amp;nbsp;( not in cat syllabus)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
*Real numbers ranges from (-infinite to infinite). It includes all points below&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
I) Integers : { -infi..-3,-2,-1,0,1,2,3…infi}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
2) Natural_numbers : {1,2,3,…infi}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
3) Whole_numbers : {0,1,2,….infi}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
4) Rational_numbers : I) All the above 3 types are Rational&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
ii) All the numbers whose decimal values are infinite (non terminating) but which have recurring pattern. Ex, 4.3333=13/3, 1.148148. = 93/81 are Rational numbers.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
5) Irrational_numbers : Infinite non recurring decimal values ie neither they have pattern nor do they have end. Ex; rt3 rt5, Pi, e. are all irrational numbers.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; And whenever you find there is a number less than 0 inside root, samajh jao ki imaginary hai . Ex : root (-2), root (-3)… etc&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;2. BASICS OF HCF AND LCM&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
-Number system mostly deals with natural numbers.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
-Factors,Lcm,Hcf, multiples all mostly belongs to natural numbers. Though hcf, lcm can be applied on fractions too but also they are applied separately when numerator and denominator will be natural.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
– #LCM &amp;nbsp;(Least Common Multiple)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Common multiples of 7,2 are set of {14,28,42…..}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
The least of these multiples ie 14 is the Least common Multiple. (Lcm)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
– #HCF &amp;nbsp;(Highest common Factor).&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Factors of 80 are {1,2,4,5…80}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Factors of 144 are {1,2,3,….144}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
List of common factors are: {1,2,4,8,16}&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Highest of the common factors ie 16 is the Highest Common Factor (HCF).&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;3. PRIME NUMBERS&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Prime numbers are those which have only two factors. 1 and the number itself. And hence its divisible by no other number.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
While all other numbers apart from prime and 1 are composite numbers which have more than 2 factors.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; 1 is neither prime nor composite.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; 2 is the smallest prime&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; 2 is the only even prime&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; Lowest odd prime is 3.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; Any prime number &amp;gt; 3 is of the form 6k+/-1 while converse may not be true.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; For any prime p&amp;gt;3, p^2-1 is divisible by 24.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
#Proof : as p^2-1= (6k+/-1)^2 -1 = 36k^2+/-12k+1-1 = 36k^2+/-12k=12k(3k+/-1)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Now if k= even, =&amp;gt; 12*2a (odd)=24k&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
if k=odd, =&amp;gt; 12k (even)=24k.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So always p^2-1 is divisible by 24.&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;4. METHOD TO CHECK IF THE NUMBER IS PRIME&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
i) Any number greater than 3 if gives a remainder of 1 or 5 when divided by 6 then it may be a prime and if not then it’s definitely not a prime.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
ii) When we have to check if a number N is prime, we need to only check for its divisibility by prime factors below root(N).&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Lets check 239, 15 &amp;lt; root(239) &amp;lt; 16&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Prime numbers below 15 =&amp;gt; 2,3,5,7,11,13.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
As 239 is not divisible by any of the primes below 15 hence 239 is a prime number.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; Why this works?&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Whenever we have to find the factors of any number N we will get the factors in pairs (ie factor pair)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Further factor pairs will be such that in each pair,one of the factors will be lower than root(N) while other will be higher than root(N).&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Extending this logic, wecan say that if we are not able to find a factor upto root (N), we will not be able to find any above root (N) and hence the number will be prime.&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;5. NUMBER OF FACTORS&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Let N = a^x*b^y*c^z, where a,b,c are primes&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt;Then number of factors = (x+1)(y+1)(z+1)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Ex: Number of factors of 360 = 2^3*3^2*5, is (3+1)(2+1)(1+1) = 4*3*2=24.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
If N = 2^x*b^y*c^z, then number of Even Factors will be counted by taking a 2 common and finding factors of remaining numbers ie. 2(2^(x-1)*b^y*c^z.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
and number of even factors = x(y+1)(z+1).&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Ex: Number of even factors of 360=2^3*3^2*5 ie., factors of 2(2^2*3^2*5) is (2+1)(2+1)(1+1) = 3*3*2=18&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
And number of Odd Factors can be counted by eliminating the 2^x and find remaining factors of b^y*c^z =&amp;gt; (y+1)(z+1)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Ex: Number of odd factors of 360=2^3*3^2*5 ie.,factors of 3^2*5 is (2+1)(1+1)=3*2= 6.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So Even factors+odd factors = Total factors&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
= &amp;gt; 18+6 = 24. #Hence_proved :p&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;6. FACTORS SUM&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Let N = 360= 2^3*3^2*5&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Then sum of all its factors is (2^0 + 2^1 + 2^2 + 2^3)(3^0 + 3^1 + 3^2)(5^0 + 5^1) = (15)(13)(6) = 1170&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Sum of even factors: It can be easily calculated by just eliminating 2^0 from above and summing up remaining.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Sum of even factors of 360 = (2^1 + 2^2 + 2^3)(3^0 + 3^1 + 3^2)(5^0 + 5^1) = (14)(13)(6) = 1092&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Why this works ? Coz even*odd is always even and after removing 2^0=1 we left with all evens in the first term which on multiplication with any other will give an even factor.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Sum of odd factors: For this remove all the even terms so that we only left with odd and odd*odd is always odd.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So Sum of odd factors of 360 = (2^0)(3^0 + 3^1 + 3^2)(5^0 + 5^1) = 1(13)(6) = 78&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So Even sum + odd sum = total sum&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
=&amp;gt; 1092+78 = 1170. #Hence_Proved&amp;nbsp;&lt;img alt=":P" class="wp-smiley" data-recalc-dims="1" src="https://us3.proxysite.com/process.php/joV9sh_2/FWCUgchM/TSGl7Cm8/VII3pOg2/U9udX6yS/SIsOeiEn/bvYWQ7QG/9fpAPsxO/aEGEu4ki/8zlc4AqW/GJ6cqZ9H/91f2X4AQ/_3D_3D/b7/" style="border: none; box-sizing: border-box; height: auto; margin-bottom: 0px; margin-top: 0px; max-width: 100%; padding: 0px; vertical-align: middle;" /&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;span style="box-sizing: border-box; font-weight: 700;"&gt;7. FACTOR PRODUCT&lt;/span&gt;&lt;/div&gt;
&lt;hr style="border-bottom-width: 0px; border-left-width: 0px; border-right-width: 0px; border-top-color: rgb(238, 238, 238); border-top-style: solid; box-sizing: content-box; height: 0px; margin-bottom: 20px; margin-top: 20px;" /&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
The Product of factors of a number N is N^(m/2), where m is the number of factors of N.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Ex; The product of factors of 360 = 360^(m/2)&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
and number of factors,m = 24, so its 360^(24/2) = 360^12.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
Why this works? coz in a number product of each factor pair will give the Number N.&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
1*360=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
2*180=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
3*120=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
4*90=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
5*72=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
6*60=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
8*45=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
9*40=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
10*36=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
12*30=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
15*24=360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
18*20= 360&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So observe carefully above, as there are 24 factors and hence there are 12 “Factor Pairs”&lt;/div&gt;
&lt;div style="box-sizing: border-box; margin-bottom: 10px;"&gt;
So multiplying all 24 factors = multiplying 12 factor pairs = multiplying 360 12 times, hence PRODUCT = 360^12&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></item><item><title>How to determine if the number is prime</title><link>http://easynet1.blogspot.com/2015/06/how-to-determine-if-number-is-prime.html</link><category>Number</category><category>Number System</category><category>System</category><author>noreply@blogger.com (Karan Patel)</author><pubDate>Wed, 3 Jun 2015 05:57:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-8044484578068532652</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
&lt;div style="background-color: white; box-sizing: border-box; color: #6b6b6b; line-height: 23.7999992370605px; margin-bottom: 10px; text-align: left;"&gt;
&lt;/div&gt;
&lt;h4 style="background-color: white; box-sizing: border-box; color: #6b6b6b; line-height: 23.7999992370605px; margin-bottom: 10px;"&gt;
&lt;div style="text-align: left;"&gt;
&lt;/div&gt;
&lt;ol style="text-align: left;"&gt;
&lt;li&gt;&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;span style="font-family: Times, Times New Roman, serif;"&gt;Any number greater than 3 if gives a remainder of 1 or 5 when divided by 6 then it may be a prime and if not then it’s definitely not a prime.&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;
&lt;li&gt;&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;span style="font-family: Times, Times New Roman, serif;"&gt;When we have to check if a number N is prime, we need to only check for its divisibility by prime factors below root(N).&lt;/span&gt;&lt;/span&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;div style="text-align: justify;"&gt;
&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;span style="font-family: Georgia, Times New Roman, serif;"&gt;&amp;nbsp;Lets check 239, 15 &amp;lt; root(239) &amp;lt; 16&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div style="text-align: justify;"&gt;
&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;span style="font-family: Georgia, Times New Roman, serif;"&gt;Prime numbers below 15 =&amp;gt; 2,3,5,7,11,13.&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;div style="text-align: justify;"&gt;
&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;span style="font-family: Georgia, Times New Roman, serif;"&gt;As 239 is not divisible by any of the primes below 15 hence 239 is a prime number.&lt;/span&gt;&lt;/span&gt;&lt;/div&gt;
&lt;/h4&gt;
&lt;h2&gt;
&lt;ul style="font-family: 'Helvetica Neue'; text-align: left;"&gt;
&lt;li&gt;&lt;span style="line-height: 23.7999992370605px;"&gt;&lt;b&gt;&lt;span style="font-size: small;"&gt;Why this works?&lt;/span&gt;&lt;/b&gt;&lt;/span&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/h2&gt;
&lt;span style="font-family: Helvetica Neue;"&gt;Whenever we have to find the factors of any number N we will get the factors in pairs (ie factor pair)&lt;/span&gt;&lt;br /&gt;
&lt;span style="font-family: Helvetica Neue;"&gt;Further factor pairs will be such that in each pair,one of the factors will be lower than root(N) while other will be higher than root(N).&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;span style="font-family: Helvetica Neue;"&gt;Extending this logic, we can say that if we are not able to find a factor upto root (N), we will not be able to find any above root (N) and hence the number will be prime.&lt;/span&gt;&lt;/div&gt;
&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></item><item><title/><link>http://easynet1.blogspot.com/2012/07/hi-friends-today-some-pdf-magazines-for.html</link><author>noreply@blogger.com (Karan Patel)</author><pubDate>Thu, 5 Jul 2012 01:47:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-3144789904177154073</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
Hi Friends&lt;br /&gt;
today some pdf magazines for u&lt;br /&gt;
&lt;br /&gt;
&lt;h3 style="text-align: left;"&gt;

&lt;u&gt;&lt;b&gt;CYBERSAFAR&lt;/b&gt;&lt;/u&gt;&lt;/h3&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;/div&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhl1LduQS2Aa83K1UV6vyHBSNrPoKRuGGN_b0Ckiy-m-tk2sER_vQb8GLXCA8XRiiyXDoEi7Rk2K_KPTmPV7lLih7ITGks5Dbd3V5SvHm97eiiHLnTtfR2lhzpghfJ8n8nLFkk9SBSWnIZB/s1600/wes.jpeg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"&gt;&lt;img border="0" height="640" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhl1LduQS2Aa83K1UV6vyHBSNrPoKRuGGN_b0Ckiy-m-tk2sER_vQb8GLXCA8XRiiyXDoEi7Rk2K_KPTmPV7lLih7ITGks5Dbd3V5SvHm97eiiHLnTtfR2lhzpghfJ8n8nLFkk9SBSWnIZB/s640/wes.jpeg" width="483" /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;a href="https://docs.google.com/file/d/0BzGMp5pl6CQYMnJQUm1ZYTBPaG8/edit?pli=1" target="_blank"&gt;Cybersafar View magazine here&lt;/a&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
(in google docs to download this magazine just go to&lt;br /&gt;
FILE--DOWNLOAD or press ctrl+s)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;span style="font-size: large;"&gt;&lt;u&gt;&lt;b&gt;Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition&lt;/b&gt;&lt;/u&gt;&lt;/span&gt;&lt;/h3&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiO-2FL6f9UX4fTHWprABM9HzJQfBy2IFf8Zea9HrQeBdevkIeydIVarIjB7Sp6tALTKRvTZN13vJBp0Pr794GHdZKR_IV3w-JsM036B5f5KEfkM29HTFJfMB9z9ZUNoQqd3VEHfmHFHQzN/s1600/os2.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"&gt;&lt;img border="0" height="400" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiO-2FL6f9UX4fTHWprABM9HzJQfBy2IFf8Zea9HrQeBdevkIeydIVarIjB7Sp6tALTKRvTZN13vJBp0Pr794GHdZKR_IV3w-JsM036B5f5KEfkM29HTFJfMB9z9ZUNoQqd3VEHfmHFHQzN/s400/os2.jpg" width="305" /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;b&gt;&lt;a href="http://www.mediafire.com/?dyyuo2nz2im" target="_blank"&gt;DOWNLOAD BOOK HERE&lt;/a&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;
&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;h3 class="post-title entry-title" style="font-weight: normal; text-align: left;"&gt;

&lt;b&gt;&amp;nbsp;&lt;/b&gt;&lt;/h3&gt;
&lt;div style="background-color: white; border: medium none; color: black; overflow: hidden; text-align: left; text-decoration: none;"&gt;
&lt;/div&gt;
&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhl1LduQS2Aa83K1UV6vyHBSNrPoKRuGGN_b0Ckiy-m-tk2sER_vQb8GLXCA8XRiiyXDoEi7Rk2K_KPTmPV7lLih7ITGks5Dbd3V5SvHm97eiiHLnTtfR2lhzpghfJ8n8nLFkk9SBSWnIZB/s72-c/wes.jpeg" width="72"/><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></item><item><title>GOOGLE NEXUS</title><link>http://easynet1.blogspot.com/2012/07/google-nexus.html</link><author>noreply@blogger.com (Karan Patel)</author><pubDate>Wed, 4 Jul 2012 09:26:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-7876804868124465405</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;br /&gt;&lt;/div&gt;
&lt;span style="font-size: large;"&gt;The Net Giant GOOGLE has came with an android phone call&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; "SAMSUNG&amp;nbsp; GOOGLE NEXUS"&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;span style="font-size: large;"&gt;&amp;nbsp;&lt;a href="http://www.google.com/nexus/features.html#/gallery" target="_blank"&gt;Amazig pics of Samsung google NEXUS&lt;/a&gt;&lt;/span&gt;&lt;br /&gt;
&lt;span style="font-size: large;"&gt;&lt;br /&gt;&lt;/span&gt;&lt;br /&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi1dlLIRH7sNAVkr14WzkcCOqoTFVU0v7J4UU2gg26tF0WHsFKNZqA8daWa_Tw1HVkKtWYp7FwZ8lNJQsOr21sCfUkN4aJ01dwLEumM0I55nQvo7SBfcumIqWvDwFlvNC-lpHYThQs9roVx/s1600/nexus+1.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"&gt;&lt;img border="0" height="306" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi1dlLIRH7sNAVkr14WzkcCOqoTFVU0v7J4UU2gg26tF0WHsFKNZqA8daWa_Tw1HVkKtWYp7FwZ8lNJQsOr21sCfUkN4aJ01dwLEumM0I55nQvo7SBfcumIqWvDwFlvNC-lpHYThQs9roVx/s400/nexus+1.jpg" width="400" /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiHOA7tDKpnXb-9JyOtLrlPl6Wni-bGTOPJBToaRtO1CdirvWMq0hjQoUEZOhWZ59WoLxMNJJEKCHBr52-qTg17examMbNjSQFHvF17-cztUuAxrQ3QN-21tkOy0VDxBhessbVC9r3mS2Cv/s1600/nexus+2.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"&gt;&lt;img border="0" height="383" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiHOA7tDKpnXb-9JyOtLrlPl6Wni-bGTOPJBToaRtO1CdirvWMq0hjQoUEZOhWZ59WoLxMNJJEKCHBr52-qTg17examMbNjSQFHvF17-cztUuAxrQ3QN-21tkOy0VDxBhessbVC9r3mS2Cv/s400/nexus+2.jpg" width="400" /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
all photograph source : www.google.co.in/nexus&lt;br /&gt;
all these info source&amp;nbsp;&amp;nbsp;&amp;nbsp; : http://www.google.com/nexus/features.html#/tech-specs&lt;br /&gt;
&lt;div class="column"&gt;
&lt;h3&gt;



          Screen
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            4.65" HD(1280 x 720) Super AMOLED
          &lt;/li&gt;
&lt;li&gt;
            Contour Display (curved glass)
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;



          Size (mm)
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            67.94 X 135.5 X 9.47 (LTE)
          &lt;/li&gt;
&lt;li&gt;
            67.94 X 135.5 X 8.94 (HSPA+)
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;



          Weight
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            145.5 g (LTE)
          &lt;/li&gt;
&lt;li&gt;
            135 g (HSPA+)
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;



          Data
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            &lt;b&gt;WiFi&lt;/b&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Bluetooth &amp;nbsp;&amp;nbsp;&lt;/b&gt;
          &lt;/li&gt;
&lt;/ul&gt;
&lt;/div&gt;
&lt;div class="column"&gt;
&lt;br /&gt;
&lt;h3&gt;



          Memory
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            Storage: 32GB (LTE), 16GB (HSPA+)
          &lt;/li&gt;
&lt;li&gt;
            Memory: 1GB RAM
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;



          Camera
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            5MP continuous auto focus
          &lt;/li&gt;
&lt;li&gt;
            1.3MP Front
          &lt;/li&gt;
&lt;li&gt;
            LED Flash
          &lt;/li&gt;
&lt;li&gt;
            Zero shutter lag
          &lt;/li&gt;
&lt;li&gt;
            Video recording in 1080p
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;



          Network
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            Option 1: CDMA/LTE
          &lt;/li&gt;
&lt;li&gt;
            Option 2: HSPA+/3G/EDGE/GPRS
          &lt;/li&gt;
&lt;/ul&gt;
&lt;h3&gt;
&amp;nbsp;USB
        &lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;
            Micro USB&amp;nbsp; &lt;/li&gt;
&lt;/ul&gt;
&lt;br /&gt;
&lt;br /&gt;

&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;
            &lt;b&gt;CPU:&lt;/b&gt; 1.2 GHZ dual core processor
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Notification:&lt;/b&gt; three-color LED
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Mics:&lt;/b&gt; 2 Mics
          &lt;/li&gt;
&lt;li&gt;
            &lt;span class="uppercase"&gt;&lt;b&gt;Buttonless&lt;/b&gt;&lt;/span&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;span class="uppercase"&gt;&lt;b&gt;NFC&lt;/b&gt;&lt;/span&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Accelerometer&lt;/b&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Gyro&lt;/b&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Compass&lt;/b&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Proximity/Light&lt;/b&gt;
          &lt;/li&gt;
&lt;li&gt;
            &lt;b&gt;Barometer&amp;nbsp;&lt;/b&gt;
          &lt;/li&gt;
&lt;/ul&gt;
&lt;ul&gt;
&lt;/ul&gt;
&lt;/div&gt;
&lt;div class="separator" style="clear: both; text-align: center;"&gt;
&lt;object class="BLOGGER-youtube-video" classid="clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0" data-thumbnail-src="http://3.gvt0.com/vi/-F_ke3rxopc/0.jpg" height="266" style="clear: left; float: left;" width="320"&gt;&lt;param name="movie" value="http://www.youtube.com/v/-F_ke3rxopc&amp;fs=1&amp;source=uds" /&gt;&lt;param name="bgcolor" value="#FFFFFF" /&gt;&lt;param name="allowFullScreen" value="true" /&gt;&lt;embed width="320" height="266"  src="http://www.youtube.com/v/-F_ke3rxopc&amp;fs=1&amp;source=uds" type="application/x-shockwave-flash" allowfullscreen="true"&gt;&lt;/embed&gt;&lt;/object&gt;&lt;/div&gt;
&lt;br /&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Jeet Patel&lt;br /&gt;
jeetpatelindia1@gmail.com&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" height="72" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi1dlLIRH7sNAVkr14WzkcCOqoTFVU0v7J4UU2gg26tF0WHsFKNZqA8daWa_Tw1HVkKtWYp7FwZ8lNJQsOr21sCfUkN4aJ01dwLEumM0I55nQvo7SBfcumIqWvDwFlvNC-lpHYThQs9roVx/s72-c/nexus+1.jpg" width="72"/><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></item><item><title>Check your INTRENT Speed...</title><link>http://easynet1.blogspot.com/2012/07/check-your-intrent-speed.html</link><author>noreply@blogger.com (Karan Patel)</author><pubDate>Wed, 4 Jul 2012 08:49:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-8844283717159395996</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
hi friends...&lt;br /&gt;
&lt;br /&gt;
do you think you are getting as same internet speed as your&amp;nbsp; ISP( INTERNET SERVICE PROVIDER&amp;nbsp; like rellaince, tata docomo, airtel etc.) had told you...&lt;br /&gt;
&lt;br /&gt;
now chek your INTERNET download and upload speed&amp;nbsp; here...&lt;br /&gt;
&lt;br /&gt;
&lt;a href="http://www.speedtest.net/" target="_blank"&gt;SPEED TEST&lt;/a&gt;&lt;br /&gt;
&lt;br /&gt;
note that it is your downloading speed and uploading speed...it&amp;nbsp; is not surfing speed...&lt;br /&gt;
&lt;br /&gt;
you can count your surfing speed by multiplying your download speed with 8 ...&lt;br /&gt;
&lt;br /&gt;
thanx&lt;br /&gt;
share your speed in comment....&lt;br /&gt;
&lt;br /&gt;
if you want to get little more speed&amp;nbsp; then, u can use INTERNET DOWNLOAD MANAGER(idm)&lt;br /&gt;
for that just&amp;nbsp; google it..... &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
JEET PATEL&lt;br /&gt;
jeetpatelindia1@gmail.com&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></item><item><title>First Post...</title><link>http://easynet1.blogspot.com/2012/07/first-post.html</link><author>noreply@blogger.com (Karan Patel)</author><pubDate>Wed, 4 Jul 2012 08:34:00 -0700</pubDate><guid isPermaLink="false">tag:blogger.com,1999:blog-6827005741626401298.post-7408117567622562808</guid><description>&lt;div dir="ltr" style="text-align: left;" trbidi="on"&gt;
Hello Friends...&lt;br /&gt;
&lt;br /&gt;
this is my first blog on blogspot.&lt;br /&gt;
about subject of it i don't wanna to say anything because i don't think blog should be created on only one or two topics ....&lt;br /&gt;
&lt;br /&gt;
i hope u&amp;nbsp; will like it.......... &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
JEET PATEL&lt;br /&gt;
jeetpatelindia1@gmail.com&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;get the updates to your email adress.....&lt;/div&gt;</description><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total><georss:featurename xmlns:georss="http://www.georss.org/georss">Rana Pratap Marg, Chanakyapuri, Ahmedabad, Gujarat, India</georss:featurename><georss:point xmlns:georss="http://www.georss.org/georss">23.078729943317342 72.535852789878845</georss:point><georss:box xmlns:georss="http://www.georss.org/georss">23.078273443317343 72.53523578987884 23.07918644331734 72.536469789878851</georss:box></item></channel></rss>