Jump to content
Anonim

Barisan Aritmatika

Recommended Posts

Setiap anggota dari himpunan A = {1,2,3,...,n} diwarnai merah dan putih. Tentukan n minimal sehingga bagaimanapun pewarnaannya, selalu terdapat 3 angka berbeda di himpunan A, yang berwarna sama, dan membentuk barisan aritmatika!!!

 

Share this post


Link to post
Share on other sites

Jawabannya :  $W(2,3)=9$

 

Atau yg dikenal sebagai Van der Warden number...

 

 Van der Warden theorem on Arithmetic Progression menyatakan bahwa bilangan yg demikian eksis..

 

Related problem (tp ga sekuat/sekuli ini) : IMO Shortlist 1987 no 17.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now


×