2018 JC Ferrero Challenger Open – Doubles

Doubles
	2018 JC Ferrero Challenger Open
Champions	Wesley Koolhof; Artem Sitak
Runners-up	Guido Andreozzi; Ariel Behar
Final score	6–3, 6–2

Wesley Koolhof and Artem Sitak won the title after defeating Guido Andreozzi and Ariel Behar 6–3, 6–2 in the final.

This was the first edition of the tournament.

Seeds

Wesley Koolhof / Artem Sitak (Champions)
Andre Begemann / Divij Sharan (First round)
Jonathan Eysseric / Hugo Nys (First round)
Guido Andreozzi / Ariel Behar (Final)

Draw

Key

First Round					Quarterfinals					Semifinals					Final

1	W Koolhof A Sitak	6	6
	Í Cervantes D Marrero	4	1		1	W Koolhof A Sitak	w/o
Alt	A Arnaboldi A Giannessi	7	7		Alt	A Arnaboldi A Giannessi
	R Junaid G Oliveira	5	5							1	W Koolhof A Sitak	5	6	[10]
3	J Eysseric H Nys	2	4							WC	P Martínez D Vega Hernández	7	4	[5]
WC	P Martínez D Vega Hernández	6	6		WC	P Martínez D Vega Hernández	6	4	[10]
WC	A de Minaur S Gutiérrez Ferrol	2	4			Y Shyla A Vasilevski	4	6	[8]
	Y Shyla A Vasilevski	6	6												1	W Koolhof A Sitak	6	6
WC	Carlos Boluda-Purkiss M Vilella Martínez	6	6												4	G Andreozzi A Behar	3	2
	K de Schepper E López Pérez	4	2		WC	C Boluda-Purkiss M Vilella Martínez	3	1
	T Bednarek G Panfil	2	6	[8]	4	G Andreozzi A Behar	6	6
4	G Andreozzi A Behar	6	3	[10]						4	G Andreozzi A Behar	6	6
	A Motti S Travaglia	6	7⁷								A Motti S Travaglia	0	2
	Z Kolář A Siljeström	1	6³			A Motti S Travaglia	6	6
	S Clayton D Pel	6	5	[10]		S Clayton D Pel	3	2
2	A Begemann D Sharan	4	7	[6]

gollark: I warned you.

gollark: I put in `const raw = polynomial(seq([2, 3, 5, 7, 11, 13, 17, 19, 23, 29]))`.

gollark: (x - 3) * -1 / 2.14708725e+8 * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 3.72736e+7 * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -1 / 1.3934592e+7 * (x - 3) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 1.01376e+7 * (x - 3) * (x - 5) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -5 / 3.5831808e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 6.7584e+6 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -1 / 1.24416e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 2.193408e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 23) * (x - 29) + (x - 2) * -1 / 2.322432e+8 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 29) + (x - 2) / 7.685922816e+9 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23)

gollark: What are your 10 favourite primes?

gollark: As far as I'm aware, this generates something like O(n²) output terms.

References

Main Draw

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.