Tuesday, 31 July 2012
Monday, 30 July 2012
Sunday, 29 July 2012
Saturday, 28 July 2012
Friday, 27 July 2012
Thursday, 26 July 2012
Wednesday, 25 July 2012
Tuesday, 24 July 2012
Monday, 23 July 2012
Sunday, 22 July 2012
Saturday, 21 July 2012
Friday, 20 July 2012
Thursday, 19 July 2012
Wednesday, 18 July 2012
Tuesday, 17 July 2012
Monday, 16 July 2012
Flashmobs with Style
Found these links at Openculture
Seemed like a great way to start the week... (adjacent tweet said most suicides happen on Monday... :-{ Listen, enjoy, Live..
Ode to Joy in Spain
and Bolero at the Train Station in Copenhagen... (ahh, admit it, you LOVE Bolero)
Seemed like a great way to start the week... (adjacent tweet said most suicides happen on Monday... :-{ Listen, enjoy, Live..
Ode to Joy in Spain
and Bolero at the Train Station in Copenhagen... (ahh, admit it, you LOVE Bolero)
Sunday, 15 July 2012
Are You as Smart as a British Postman
About a year ago I came across this envelope at a post by Gregg Ross at Futility Closet ; According to the addressee, "Though not having a single written word upon it, this envelope reached me from London without delay." Can you figure out the address?
The Solution is here along with another strange puzzle
Enjoy
The Solution is here along with another strange puzzle
Enjoy
Saturday, 14 July 2012
Friday, 13 July 2012
Thursday, 12 July 2012
Wednesday, 11 July 2012
Tuesday, 10 July 2012
Monday, 9 July 2012
Sunday, 8 July 2012
Saturday, 7 July 2012
Friday, 6 July 2012
Thursday, 5 July 2012
Wednesday, 4 July 2012
repdigit endings to squares
James Tanton @jamestanton Wrote:
"2^2 ends with 4 and 12^2 ends with 44. Is there a square than ends 444? How about one that ends 4444?"
To which I think the answer is yes,..... and no.
38 squared is 1444
462 squared is 213444
538 squared is 289444 and there are many more... (so I'm pretty firm on the "yes".)
but I don't think you will ever see a square ending in 4444. Here's why:
This is a list of the square numbers that end in 444 from 1 to 100,000,000
00001444
00213444
00289444
00925444
01077444
02137444
02365444
03849444
04153444
06061444
06441444
08773444
09229444
11985444
12517444
15697444
16305444
19909444
20593444
24621444
25381444
29833444
30669444
35545444
36457444
41757444
42745444
48469444
49533444
55681444
56821444
63393444
64609444
71605444
72897444
80317444
81685444
89529444
90973444
99241444
Notice a pattern? Look at that digit in the thousands place...
Those are the squares of these numbers:
0038
0462
0538
0962
1038
1462
1538
1962
2038
2462
2538
2962
3038
3462
3538
3962
4038
4462
4538
4962
5038
5462
5538
5962
6038
6462
6538
6962
7038
7462
7538
7962
8038
8462
8538
8962
9038
9462
9538
9962
and another pattern appears, that may help us with a more formal proof:
I hadn't thought too much about the idea of digit repeats at the end of squares, and maybe you haven't either, so here is a quick question to get you started.
When speaking of square numbers:
What ending digits can repeat 2, 3 or more times? More particularly, is there any ending digit that repeats four (or more) times?
Much later I found the cube of 3247 ends in 3333, I don't think there are any five repdigit endings to the cubes, but if you are a clever programmer with the right equipment and find me wrong (or right) send a message and let me know. I think more like this will continue with fourth, fifth, and higher powers, but I'm not sure if the length or repdigit endings gets longer and longer, although one anonymous reader teased me with, "Oh, there are some really beautiful patterns in the fourth and fifth powers....
Am I being Hazed????
Anyway if you guys find something that you want to share with the rest of us, send me a note and I will pass it on.
After I posted this on LinkedIn, I got a comment from Arthur Rubin with a very nice proof that there could be no square numbers with four consecutive fours at the end.
"If n^2 ends in 4 4s, then (n/2)^2 = n^2/4 ends in 2 1s, which is impossible.
Nice, but for students I think it might help to discuss Why there can be no square numbvers ending in two ones. Dirst let's be clear about one 1.... the only way to get a square number ending in one is to start with a number that ends in one, or nine. Look at your times tables.
So why can't we have two ones at the end? Well think Algebra I, or two or anything after that. If you have a two digit number that ends in one we cn write bit as x1 or x9, which we know is expressed as 10 x + 1 or 10 x +9. So let's take the easy one and square it. (10 x + 1)^2 = 100 + 20 x + 1....right???
Now where is the problem it ends in one, and the 100 doesn't even count if we are looking at the last two digits... but oh that 20x....
what ever numeral x is, 20 x puts an even number right smack dab in the way of a second 1. Now you do the x9 and have it ready to turn in when class starts tomorrow (Man am I a hard teacher...)
A look at the list will convince you that "X^2 ends in 3 4s iff X ≡ ±38 (mod 500)" is true... not a proof but pretty impressive support. Can you write the other obvious Modular relation that produces three fours in the last three digit spaces? Yeah...Way to go.
And as an additional incentive, Shyam Sunder Gupta added
"No perfect square can end in four like digits except 0's. General formula for ending in three 4's and two 4's is illustrated in detail in the book "Exploring the Beauty of Fascinating Numbers" published by Springer." To which I add, A wonderful book, and it is on Amazon.
Tuesday, 3 July 2012
An Unusual Prime Series
I just came across this in an article in The American Mathematical Monthly Vol. 1, No. 6, Jun., 1894. The article is taken from a paper by J. W. NICHOLSON., President and Professor of Mathematics at Louisiana State University.
To keep it simple I will present a very small example of the professor's theorem.
Pick a prime number, p (I'll use five because it keeps things short and easy) .
Now take the sum of the squares of every integer smaller than p and "voila", it is divisible by p
42 + 32 + 22 + 12 = 30, which is divisible by 5.
and it doesn't have to be a square, the same series using cubes gives:
43 + 33 + 23 + 13 = 100, which is also divisible by 5.
In general, the first baby rule says for prime p, (p-1)n + (p-2) n + ... + 1n will be divisible by p as for any power n smaller than p.
Go ahead, try a few of your own.
Now to kick it up a little... let's add in any constant, c, to the mix.
It is also true, that for prime p and n smaller than p:
(c+p-1)n+(c+p-2)n ...... + (c+0)n will also be divisible by p.
If I keep p = 5 and use c=2 the series would be :
(2+4)2+(2+3)2++(2+2)2+(2+1)2 + (2+0)2 =90 which is still divisible by 5.
Ok, and one to grow on: you can use a constant multiplier in front of the p-x terms... for example using a multiplier of three in each case we have
(2+3x4)2+(2+3x3)2+(2+3x2)2+(2+3x1)2 + (2+0)2 =410 which is still divisible by 5.
According to the Professor, this works only if, we use a prime p, As pointed out in the comments, there are some primes for which this is not true. I originally misstated what he wrote.
No justification was given, and I can provide none, so if you know how to prove this, I will welcome your proof and post it here.
To keep it simple I will present a very small example of the professor's theorem.
Pick a prime number, p (I'll use five because it keeps things short and easy) .
Now take the sum of the squares of every integer smaller than p and "voila", it is divisible by p
42 + 32 + 22 + 12 = 30, which is divisible by 5.
and it doesn't have to be a square, the same series using cubes gives:
43 + 33 + 23 + 13 = 100, which is also divisible by 5.
In general, the first baby rule says for prime p, (p-1)n + (p-2) n + ... + 1n will be divisible by p as for any power n smaller than p.
Go ahead, try a few of your own.
Now to kick it up a little... let's add in any constant, c, to the mix.
It is also true, that for prime p and n smaller than p:
(c+p-1)n+(c+p-2)n ...... + (c+0)n will also be divisible by p.
If I keep p = 5 and use c=2 the series would be :
(2+4)2+(2+3)2++(2+2)2+(2+1)2 + (2+0)2 =90 which is still divisible by 5.
Ok, and one to grow on: you can use a constant multiplier in front of the p-x terms... for example using a multiplier of three in each case we have
(2+3x4)2+(2+3x3)2+(2+3x2)2+(2+3x1)2 + (2+0)2 =410 which is still divisible by 5.
According to the Professor, this works only if, we use a prime p, As pointed out in the comments, there are some primes for which this is not true. I originally misstated what he wrote.
No justification was given, and I can provide none, so if you know how to prove this, I will welcome your proof and post it here.
Monday, 2 July 2012
Sunday, 1 July 2012
Subscribe to:
Posts (Atom)

