|
Virtually every Christian has been taught that prayer is when you talk to God with your eyes closed . We tell our children, “Close your eyes and we will pray”. The idea of having your eyes closed when you pray is so engrained in our culture that we don’t give it a second thought. As protestant Christians, we believe that the Bible contains actual words of God. We also believe in the sufficiency of the Bible’s instruction. Let’s survey th....
|
|
Ho scovato quasi per caso Javascript Tips , incredibile collezione di trucchi e suggerimenti per JavaScript. Si tratta di decine di snippets rivolti soprattutto a chi JavaScript lo usa come un linguaggio vero e proprio e non, come spesso capita, quale semplice strumento per la manipolazione del DOM. Tra le tante chicche (alcune davvero gustose) vi segnalo a caso: concatenare due array senza crearne uno nuovo; mandare un testo in output s..
|
|
Thank you so much for all the interest in testing out the app. Rather that pick a few people I’ve decided to run an open beta on the condition that you all promise to give me lots and lots of feedback on the new features. Especially the background service in combination with pinned feeds and deep linking. Few things to note: Before downloading please subscribe to the blog so that I can keep you up-to-date of any issues. Currently the in..
|
|
Problem: Show that all horses are of the same color. “Solution”: We will show, by induction, that for any set of $ n$ horses, every horse in that set has the same color. Suppose $ n=1$, this is obviously true. Now suppose for all sets of $ n$ horses, every horse in the set has the same color. Consider any set $ H$ of $ n+1$ horses. We may pick a horse at random, $ h_1 \in H$, and remove it from the set, getting a set of $ n$ horses.
|
|
Problem: Show that all horses are of the same color. “Solution”: We will show, by induction, that for any set of $ n$ horses, every horse in that set has the same color. Suppose $ n=1$, this is obviously true. Now suppose for all sets of $ n$ horses, every horse in the set has the same color. Consider any set $ H$ of $ n+1$ horses. We may pick a horse at random, $ h_1 \in H$, and remove it from the set, getting a set of $ n$ horses.
|
|
Problem: Show that all horses are of the same color. “Solution”: We will show, by induction, that for any set of $ n$ horses, every horse in that set has the same color. Suppose $ n=1$, this is obviously true. Now suppose for all sets of $ n$ horses, every horse in the set has the same color. Consider any set $ H$ of $ n+1$ horses. We may pick a horse at random, $ h_1 \in H$, and remove it from the set, getting a set of $ n$ horses.
|
|
As a young programmer, I'm in agreement. It was only a year ago that I actually spent time to deliberately read the source code of an open source project. That project was Python 3. I have tried in the past to read source code. I remember each and every time I would see a bunch of C files, tried my very very hardest to find main() and when I invariably failed, I just gave up because I had no idea what to do next. Do I just start reading....
|
|
How many colors are required to color the provinces of Costa Rica? A common visual aid for maps is to color the regions of the map differently, so that no two regions which share a border also share a color. For example, to the right is a map of the provinces of Costa Rica (where the author is presently spending his vacation). It is colored with eight different colors, one for each province.
|
|
How many colors are required to color the provinces of Costa Rica? A common visual aid for maps is to color the regions of the map differently, so that no two regions which share a border also share a color. For example, to the right is a map of the provinces of Costa Rica (where the author is presently spending his vacation). It is colored with eight different colors, one for each province.
|
|
How many colors are required to color the provinces of Costa Rica? A common visual aid for maps is to color the regions of the map differently, so that no two regions which share a border also share a color. For example, to the right is a map of the provinces of Costa Rica (where the author is presently spending his vacation). It is colored with eight different colors, one for each province.
|
|
Just a quick note to say that due to a change in my email provider the address windowsphone7support@grippers.co.uk no longer works. For support please contact phonesupport[at]grippers.co.uk from now on. Sorry for any hassle caused.
|
|
Problem: Suppose their are three circles in the plane of distinct radii. For any two of these circles, we may find their center of dilation as the intersection point of their common tangents. For example, in the following picture we mark the three centers of dilation for each pair of circles: We notice that the three centers of dilation are collinear. Show they are always collinear for any three non-intersecting circles of distinct radii.
|
|
Problem: Suppose their are three circles in the plane of distinct radii. For any two of these circles, we may find their center of dilation as the intersection point of their common tangents. For example, in the following picture we mark the three centers of dilation for each pair of circles: We notice that the three centers of dilation are collinear. Show they are always collinear for any three non-intersecting circles of distinct radii.
|
|
Problem: Suppose their are three circles in the plane of distinct radii. For any two of these circles, we may find their center of dilation as the intersection point of their common tangents. For example, in the following picture we mark the three centers of dilation for each pair of circles: We notice that the three centers of dilation are collinear. Show they are always collinear for any three non-intersecting circles of distinct radii.
|
|
Quick peak into my work so far on a mango version of BBC News Mobile Features added so far: Double Sided Live Tiles Pin individual feeds to home screen Background service meaning improved live tile and breaking news notifications Background caching if wifi is available to speed up the app If you would be interested in testing out the Beta and have a mango dev unlocked device get in touch via the comments section. Even if you can’t tes..
|
|
To make life simpler I’ve moved onto wordpress and away from my Modx hosted site as it did a bit more than was needed. From now on I’ll be posting updates on my apps here and maybe some general ramblings.
|
|
Somebody tweeted this link out today: [1960s Braun Products Hold the Secrets to Apple's Future](https://gizmodo.com/343641/1960s-braun-products-hold-the-secrets-to-apples-future). The...
|
|
Somebody tweeted this link out today: [1960s Braun Products Hold the Secrets to Apple's Future](https://gizmodo.com/343641/1960s-braun-products-hold-the-secrets-to-apples-future). The...
|
|
Prosegue senza intoppi il cammino di Python Tools per Visual Studio , il progetto open source targato Microsoft che consente di programmare in Python con Visual Studio 2010. Dopo il lancio ufficiale dello scorso marzo e la successiva Beta 2 di maggio, ieri è stata presentata la Release Candidate 1 .
|
|
A Puzzle is Born Sitting around a poolside table, in the cool air and soft light of a June evening, a few of my old friends and I played a game of Texas Hold ‘Em. While we played we chatted about our times in high school, of our old teachers, friends, and, of course, our times playing poker. We even reminisced lightly about some of the more dishonest people we played with (whom we invited for want of a larger payout), but especially we reca..
|
|
A Puzzle is Born Sitting around a poolside table, in the cool air and soft light of a June evening, a few of my old friends and I played a game of Texas Hold ‘Em. While we played we chatted about our times in high school, of our old teachers, friends, and, of course, our times playing poker. We even reminisced lightly about some of the more dishonest people we played with (whom we invited for want of a larger payout), but especially we reca..
|
|
A Puzzle is Born Sitting around a poolside table, in the cool air and soft light of a June evening, a few of my old friends and I played a game of Texas Hold ‘Em. While we played we chatted about our times in high school, of our old teachers, friends, and, of course, our times playing poker. We even reminisced lightly about some of the more dishonest people we played with (whom we invited for want of a larger payout), but especially we reca..
|
|
Many large companies have explicit policies around which development tools to use. For example, “Here at Really Big Corporation we use CVS, Ant and Eclipse”. I understand that companies need to limit the proliferation of tools to ensure familiarity and supportability, but sometimes a little flexibility would be nice. When I hire a tradesman to do work on my house I don’t tell him that we use handsaws here, not tablesaws. I trust him to us..
|
|
It’s often that a student’s first exposure to rigorous mathematics is through set theory, as originally studied by Georg Cantor. This means we will not treat set theory axiomatically (as in ZF set theory), but rather we will take the definition of a set for granted, and allow any operation to be performed on a set. This will be clear when we present examples, and it will be clear why this is a bad idea when we present paradoxes.
|
|
It’s often that a student’s first exposure to rigorous mathematics is through set theory, as originally studied by Georg Cantor. This means we will not treat set theory axiomatically (as in ZF set theory), but rather we will take the definition of a set for granted, and allow any operation to be performed on a set. This will be clear when we present examples, and it will be clear why this is a bad idea when we present paradoxes.
|
|
It’s often that a student’s first exposure to rigorous mathematics is through set theory, as originally studied by Georg Cantor. This means we will not treat set theory axiomatically (as in ZF set theory), but rather we will take the definition of a set for granted, and allow any operation to be performed on a set. This will be clear when we present examples, and it will be clear why this is a bad idea when we present paradoxes.
|
|
Let me tell you, I don’t go to the Perth CBD that frequently, but when I do it’s usually to relax after a long week with a cup of coffee from Streeton’s or some Russian Caravan tea from The Merchant. Unfortunately, lately my trips to the CBD haven’t been that relaxing or enjoyable.
|
It would seem there is a fair deal of call for an updated version of my PhpED dark theme from colleagues as well as random folks on the internet who’ve seen screenshots of my PhpED installation. I previously had my Dark Theme for 5 linked on my Review of PhpED, but I figured I could have a page dedicated to it. Screenshots Download and Installation The first step is to download the proper version. Click here to download the ....
|
|
It would seem there is a fair deal of call for an updated version of my PhpED dark theme from colleagues as well as random folks on the internet who’ve seen screenshots of my PhpED installation. I previously had my Dark Theme for 5 linked on my Review of PhpED, but I figured I could have a page dedicated to it. Screenshots Download and Installation The first step is to download the proper version. Click here to download the ....
|
|
Problem: Show 31.5 = 32.5. “Solution”: Explanation: It appears that by shifting around the pieces of one triangle, we have constructed a second figure which covers less area! Since the first triangle has base length 13 and height 5, its area is 32.5. Clearly, the second figure has the same area minus a square of area 1, giving the second figure area 31.5. In fact, by counting up the squares in each component, we do see that it is simply a s..
|
|
Problem: Show 31.5 = 32.5. “Solution”: Explanation: It appears that by shifting around the pieces of one triangle, we have constructed a second figure which covers less area! Since the first triangle has base length 13 and height 5, its area is 32.5. Clearly, the second figure has the same area minus a square of area 1, giving the second figure area 31.5. In fact, by counting up the squares in each component, we do see that it is simply a s..
|
|
Problem: Show 31.5 = 32.5. “Solution”: Explanation: It appears that by shifting around the pieces of one triangle, we have constructed a second figure which covers less area! Since the first triangle has base length 13 and height 5, its area is 32.5. Clearly, the second figure has the same area minus a square of area 1, giving the second figure area 31.5. In fact, by counting up the squares in each component, we do see that it is simply a s..
|
|
Today the Panasonic Insider Crew (Maybe I’ll shorten this to PIC from now on) home was launched in its own little corner of the web (the “Insider Crew Home”) and I was invited to be one of the beta testers. It’s good to see Soup making progress with the Insider Crew. Many of you know that I’ve had my doubts about the Insider Crew before, but with the Home Entertainment Launch event and now a dedicated PIC Home for the members it’s clear tha..
|
|
The MySQL curtime function has (at least) the following issues: The function returns the current time as a number i.e. the time quarter past 8 would be returned from the function as the number 201500. (So if you subtract one from such a number you get 201499 which has no meaning.) The function only returns this if you use it in an “integer context”, i.e. (x+0) causes x to be evaluated to an integer. (Otherwise it produces a string i....
|
|
What is the purpose of segment level checkpoint before DROP/TRUNCATE of a table?
-
tanelpoder.com
-
14 years ago
-
eng
There was a very good question asked in Oracle-L list today, which has bothered me too in past. The question was: What is the purpose of a segment level checkpoint before DROP/TRUNCATE of a table? In other words, why do we have to wait for the enq: RO - fast object reuse wait event (and in 11.2 the enq: CR - block range reuse ckpt wait) when dropping and truncating segments? I’m not fully confident that I completely know..
|
|
What is the purpose of segment level checkpoint before DROP/TRUNCATE of a table?
-
tanelpoder.com
-
14 years ago
-
eng
There was a very good question asked in Oracle-L list today, which has bothered me too in past. The question was: What is the purpose of a segment level checkpoint before DROP/TRUNCATE of a table? In other words, why do we have to wait for the enq: RO - fast object reuse wait event (and in 11.2 the enq: CR - block range reuse ckpt wait) when dropping and truncating segments? I’m not fully confident that I completely know..
|
|
So my attitude for most of this year has been one of reserving judgement in favor of direct experience. As part of this, I have been trying all the latest "Kool-Aid" web development technologies even if at first glance they didn't sit right with me. So I started building the Othenticate infrastructure on a shiny stack of mongodb, node.js, express, mongoose, jade, and stylus. For the most part, I love this stack. However, after I while I h....
|
|
Problem: Show there are finitely many primes. “Solution”: Suppose to the contrary there are infinitely many primes. Let $ P$ be the set of primes, and $ S$ the set of square-free natural numbers (numbers whose prime factorization has no repeated factors). To each square-free number $ n \in S$ there corresponds a subset of primes, specifically the primes which make up $ n$’s prime factorization. Similarly, any subset $ Q \subset P$ of primes..
|
|
Problem: Show there are finitely many primes. “Solution”: Suppose to the contrary there are infinitely many primes. Let $ P$ be the set of primes, and $ S$ the set of square-free natural numbers (numbers whose prime factorization has no repeated factors). To each square-free number $ n \in S$ there corresponds a subset of primes, specifically the primes which make up $ n$’s prime factorization. Similarly, any subset $ Q \subset P$ of primes..
|