## 2016-05-22

## 2016-03-14

### Happy Pi Day! Pizza Hut's Math Competition for free pizza for 3.14 years

Three problems, if you are the first to solve any of them, then you win the grand pizza prize.

Since the first two are solved already in the comments. I chose to focus and solve 'Option C'.

WARNING SPOILERS BELOW!!!

The solution to Option C I arrived at is 7 + n, where n is any positive integer. Here's the picture I drew to convince myself:

The numbers represent how many rings each circle represents and 'n' represents any number of set of rings or chain of rings (like a chain of 1 rings). It got a bit messy when I tried to draw each of them individually. ;)

The two at the bottom don't need to be interlinking, especially when n=2. There are other combination of rings, but this seems to provide the simplest answer and largest possible answer space.

The "pairs" are indistinguishable. The triplet is distinguishable from any other triplet. This meets all the requirements of the puzzle.

Thanks for the opportunity to solve it. Pizza Hut and Mr. Conway

The Pizza Hut blog post: National Pi Day Math Contest Problems

~ Danial Goodwin ~

Calling all math experts and Pizza Hut fans alike! National Pi Day is here and this is your chance to win free “pie,” that’s 3.14 years of Pizza Hut pizza (awarded in Pizza Hut® gift cards)! Take a look at the math problems below and provide your answer to Option A, B, or C in the comments section. Please be sure to note which you are trying to solve. Answers will be time stamped to determine the potential winner and participants can only win once.The three problems:

Best of luck!

– Pizza Hut & John H. Conway

OPTION A: SOLVED – WINNERS WILL BE NOTIFIED WITHIN 24 HOURS

I’m thinking of a ten-digit integer whose digits are all distinct. It happens that the number formed by the first n of them is divisible by n for each n from 1 to 10. What is my number?

OPTION B: SOLVED – WINNERS WILL BE NOTIFIED WITHIN 24 HOURS

Our school’s puzzle-club meets in one of the schoolrooms every Friday after school.

Last Friday, one of the members said, “I’ve hidden a list of numbers in this envelope that add up to the number of this room.” A girl said, “That’s obviously not enough information to determine the number of the room. If you told us the number of numbers in the envelope and their product, would that be enough to work them all out?”

He (after scribbling for some time): “No.” She (after scribbling for some more time): “well, at least I’ve worked out their product.”

What is the number of the school room we meet in?”

OPTION C: YET TO BE SOLVED, No one has gotten this one exactly right yet! Hint: It helps to show your work!

My key-rings are metal circles of diameter about two inches. They are all linked together in a strange jumble, so that try as I might, I can’t tell any pair from any other pair.

However, I can tell some triple from other triples, even though I’ve never been able to distinguish left from right. What are the possible numbers of key-rings in this jumble?

Since the first two are solved already in the comments. I chose to focus and solve 'Option C'.

WARNING SPOILERS BELOW!!!

The solution to Option C I arrived at is 7 + n, where n is any positive integer. Here's the picture I drew to convince myself:

The numbers represent how many rings each circle represents and 'n' represents any number of set of rings or chain of rings (like a chain of 1 rings). It got a bit messy when I tried to draw each of them individually. ;)

The two at the bottom don't need to be interlinking, especially when n=2. There are other combination of rings, but this seems to provide the simplest answer and largest possible answer space.

The "pairs" are indistinguishable. The triplet is distinguishable from any other triplet. This meets all the requirements of the puzzle.

Thanks for the opportunity to solve it. Pizza Hut and Mr. Conway

The Pizza Hut blog post: National Pi Day Math Contest Problems

~ Danial Goodwin ~

## 2016-03-02

### Privacy: Programmatically Identifying Developer Devices

Apps can programmatically identify likely device(s) of app developers.

It's due to the fact that app developers usually install their app many times. And, it's possible to watch for those app installs in Android.

Implementing an app that takes advantage of this requires ZERO permissions.

So, I've created two working proof-of-concept apps: One to programmatically identify developer devices, and one to identify those kinds of apps and stop them. Both are open source and can be found on GitHub, and the later one can be found on Google Play.

I'll explain shortly how this is done.

Imagine, if you are an app developer, then your device(s) can be programmatically identified and have special code ran for them and nobody else will experience the same issue or app changes.

It's due to the fact that app developers usually install their app many times. And, it's possible to watch for those app installs in Android.

Implementing an app that takes advantage of this requires ZERO permissions.

So, I've created two working proof-of-concept apps: One to programmatically identify developer devices, and one to identify those kinds of apps and stop them. Both are open source and can be found on GitHub, and the later one can be found on Google Play.

I'll explain shortly how this is done.

Imagine, if you are an app developer, then your device(s) can be programmatically identified and have special code ran for them and nobody else will experience the same issue or app changes.

## 2016-02-24

### AI not equivalent to Smart

Having AI (Artificial Intelligence) doesn't mean that it is smart. In fact, it is much easier to create "dumb" AI than "smart" AI.

~ Danial Goodwin ~

~ Danial Goodwin ~

## 2016-01-23

### Level Up - GitHub: Closing issues via commit messages

GitHub Level Up: Closing issues via commit messages.

TLDR: A commit message with "Fix #1" automatically closes issue #1 when merged in repo.

TLDR: A commit message with "Fix #1" automatically closes issue #1 when merged in repo.

Subscribe to:
Posts (Atom)