Sauerbruch Hutton's 2008 Museum Brandhorst, München:
Sauerbruch Hutton's 2005 Umweltbundesamt (Federal Environment Agency), Dessau:
Sauerbruch Hutton's 1999 GSW Hauptverwaltung, Berlin:
Thursday, 16 May 2013
Wednesday, 15 May 2013
Schuster: Monochrome Diaries + Portal To Nowhere
For his Monochrome Diaries series, Callum Schuster ground mundane everyday objects into particles and suspended them in acrylic or varnish to form his paint. Schuster previously at O'Born Contemporary, Toronto 2013:
Schuster's infinity mirror Portal To Nowhere at O'Born Contemporary, Toronto 2013:
Schuster's infinity mirror Portal To Nowhere at O'Born Contemporary, Toronto 2013:
Labels:
Art,
Callum Schuster,
O'Born Contemporary
Tuesday, 14 May 2013
Missing Colors
Jürgen Paas's latest exhibition is currently showing at Zürich's A|B|Contemporary. Too bad I cannot be there. I miss Paas's vibrant colours and geometry ...
Labels:
A|B|Contemporary,
Art,
Jürgen Paas
Monday, 13 May 2013
Tate circles
Dadamaino at Tate Modern, London 2013:
Cy Twombly at Tate Modern, London 2013:
Richard Long at Tate Modern, London 2013:
Cy Twombly at Tate Modern, London 2013:
Richard Long at Tate Modern, London 2013:
Labels:
Art,
Cy Twombly,
Dadamaino,
Richard Long,
Tate Britain
Sunday, 12 May 2013
Saturday, 11 May 2013
Marman & Borins: shredded
I saw them at New York's C24 Gallery in 2011. Now in Toronto, Jennifer Marman & Daniel Borins's Shredded Rectangle and Shredded Square at Georgia Scherman Projects:
Thank you for the tips, C. I look forward to Marman & Borins's exhibition of new works at the Art Gallery of Hamilton opening next month.
Thank you for the tips, C. I look forward to Marman & Borins's exhibition of new works at the Art Gallery of Hamilton opening next month.
Friday, 10 May 2013
Eintritt
Agathe de Bailliencourt's solo exhibition Eintritt at General Hardware Contemporary, Toronto 2013:
If you think de Bailliencourt's paintings are brilliant, wait until you see her installations in architectural and public spaces. They are like her paintings exploded into three dimensions. Thank you, N, for bringing us this dazzling show. I hope de Bailliencourt's site-specific works will come to Toronto some time in the near future.
If you think de Bailliencourt's paintings are brilliant, wait until you see her installations in architectural and public spaces. They are like her paintings exploded into three dimensions. Thank you, N, for bringing us this dazzling show. I hope de Bailliencourt's site-specific works will come to Toronto some time in the near future.
Thursday, 9 May 2013
Wednesday, 8 May 2013
Fahren fahren fahren auf der Autobahn
Rirkrit Tiravanija's Untitled 2010 (All The Days On The Autobahn) at Hamburger Bahnhof, Berlin 2012:
Swift car in south London, 2013:
I remember seeing Kraftwerk live at south London's Brixton Academy in 2004 - part of their Maximum Minimum tour.
Labels:
Art,
Hamburger Bahnhof,
Rirkrit Tiravanija
Tuesday, 7 May 2013
The Acquired Inability To Escape + Nataraja
Damien Hirst's The Acquired Inability To Escape and Bridget Riley's Nataraja at Tate Britain, London 2013:
Labels:
Art,
Bridget Riley,
Damien Hirst,
Tate Britain
Monday, 6 May 2013
Down
From the group exhibition Up-Down-Sorry-Now, Juan Carlos Noria's Down series at Robert Kananaj Gallery, Toronto 2013:
Thank you for sharing your insights, R.
Thank you for sharing your insights, R.
Sunday, 5 May 2013
Face Time/Visa-Age
Wanda Koop at Arsenal Contemporary/Division Gallery, Toronto 2013:
Visage's Visa-Age, 1980:
Video from dyonisos38a's youtube channel
Labels:
Arsenal Contemporary,
Art,
Division Gallery,
Music,
Visage,
Wanda Koop
Saturday, 4 May 2013
RSA2048
My last couple of days in Waterloo have been mathematically immersed. Now back in Toronto, I need another dose of mathematics to satisfy my craving ...
The RSA numbers are a collection of large numbers, each of which can be factored into exactly two large primes. They were created in 1991 to encourage research in computational number theory. The RSA Factoring Challenge was a challenge to factor the RSA numbers. The largest among all RSA numbers, RSA2048, has 2048 binary digits (or 617 decimal digits). It is one of the many RSA numbers which are yet to be factored:
The RSA numbers are a collection of large numbers, each of which can be factored into exactly two large primes. They were created in 1991 to encourage research in computational number theory. The RSA Factoring Challenge was a challenge to factor the RSA numbers. The largest among all RSA numbers, RSA2048, has 2048 binary digits (or 617 decimal digits). It is one of the many RSA numbers which are yet to be factored:
25195908475657893494027183240048398571429282126204
03202777713783604366202070759555626401852588078440
69182906412495150821892985591491761845028084891200
72844992687392807287776735971418347270261896375014
97182469116507761337985909570009733045974880842840
17974291006424586918171951187461215151726546322822
16869987549182422433637259085141865462043576798423
38718477444792073993423658482382428119816381501067
48104516603773060562016196762561338441436038339044
14952634432190114657544454178424020924616515723350
77870774981712577246796292638635637328991215483143
81678998850404453640235273819513786365643912120103
97122822120720357 .
Labels:
Mathematics
Friday, 3 May 2013
Fermat's little theorem
Fermat is among the most prominent figures in the history of number theory. One of the elegant properties about numbers he discovered is known as Fermat's little theorem, which states that if p is a prime number, then for any integer a, the number a p − a is divisible by p:
An alternative version of Fermat's little theorem states that if a is not divisible by p, then the number a p − 1 − 1 is a multiple of p:
Fermat's little theorem was proved by Euler and can be generalized by Euler's theorem: if a and n are relatively prime, then
where φ(n) is the number of integers between 1 and n that are relatively prime with n. Euler's theorem form the basis of the RSA encryption system.
a p ≡ a (mod p).
An alternative version of Fermat's little theorem states that if a is not divisible by p, then the number a p − 1 − 1 is a multiple of p:
a p − 1 ≡ 1 (mod p).
Fermat's little theorem was proved by Euler and can be generalized by Euler's theorem: if a and n are relatively prime, then
a φ(n)
≡ 1 (mod n),
where φ(n) is the number of integers between 1 and n that are relatively prime with n. Euler's theorem form the basis of the RSA encryption system.
Labels:
Euler,
Fermat,
Mathematics
Thursday, 2 May 2013
Powers of 2
20 = 1
21 = 2
22 = 4
23 = 8
24 = 16
25 = 32
26 = 64
27 = 128
28 = 256
29 = 512
210 = 1024
211 = 2048
212 = 4096
213 = 8192
214 = 16384
215 = 32768
216 = 65536
217 = 131072
218 = 262144
219 = 524288
220 = 1048576
221 = 2097152
222 = 4194304
223 = 8388608
224 = 16777216
Labels:
Mathematics
Wednesday, 1 May 2013
Subscribe to:
Posts (Atom)



.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)




.jpg)



.jpg)
.jpg)

.jpg)
.jpg)
.jpg)










.jpg)
.jpg)
.jpg)
.jpg)
.jpg)









.jpg)
.jpg)
.jpg)
.jpg)
.jpg)



