Study location	Hungary, Dunaújváros
Type	Short term, part-time
Nominal duration	2 weeks
Study language	English

Tuition fee	€1,300 one-time This includes: All tuition, including lectures, seminars, and tutorials. Assessment, transcript of academic performance, and certificate. Accommodation at the student hostel of the University Breakfast and lunch during the summer course Social activities, including two excursions to the Hungarian countryside

Entry qualification

High school / secondary education (or higher) This course would suit students from the field of mathematics, especially those with a background in geometry. The entry qualification documents are accepted in the following languages: English. Often you can get a suitable transcript from your school. If this is not the case, you will need official translations along with verified copies of the original. You must take the original entry qualification documents along with you when you finally go to the university.

Language requirements	English Accepted proof of proficiency: FCE or CAE, IELTS 5.5+ or TOEFL 69+

More information	uniduna.hu/..problems-in-discreet-geometry

Overview

Packing and covering problems are special optimization problems concerning geometric objects in a given space or region. Many of the problems involve arranging geometric objects (usually identical) into the space or region as densely as possible with no overlap.

Target group

This course would suit students from the field of mathematics, especially those with a background in geometry.

Course aim

After studying this course, you will:
- develop knowledge and understanding of packing and covering,
- understand some open questions in discrete geometry,
- see some application of discrete geometry questions,
- see connection between geometry and different branch of mathematics.

The classes will be taught by highly experienced academics. Students will receive official Transcripts of Records upon completion of the program. The program includes various interesting and enjoyable social programs and excursions.