Homehttps://heurisztika.btk.mta.hu/en/2026-10-22T11:14:46+00:00Joomla! - Open Source Content ManagementCoronavirus Update2020-03-20T10:51:10+00:002020-03-20T10:51:10+00:00https://heurisztika.btk.mta.hu/en/2-program/79-coronavirus-updateBenedek András<div class="feed-description"><h1><span style="font-size: 18pt;">To our community,</span></h1>
<p class="lead"><span style="font-size: 12pt;">In a time of rapid change related to the spread of COVID-19, we are maintaining operations in the best possible way.</span></p>
<p><span style="font-size: 12pt;">During this unprecedented and uncertain period, we appreciate your sense of community and your patience, as we continue our mission to support, engage and serve you. Please check this page regularly for updates and resources.</span></p>
<p><span style="font-size: 12pt;">Our thoughts go out to all of you.</span></p>
<p><span style="font-size: 12pt;">We will remain vigilant in monitoring the situation and responding rapidly, as conditions evolve.</span></p>
<p> </p>
<p style="text-align: center;"><span style="color: #000000; font-size: 18pt;"><strong>Fall Western Sectional Meeting of the AMS<br />University of Utah, Salt Lake City, Utah, October 24-25, 2020</strong></span></p>
<p style="text-align: center;"><span style="font-size: 18pt; color: #ff0000;"><strong><strong>Special Session on "How to Solve It? Heuristics and Inquiry Based Learning"</strong> </strong></span></p>
<p style="text-align: center;"><span style="font-size: 14pt;"><a href="https://www.ams.org/meetings/sectional/2279_program_ss15.html#title."><strong>PROGRAM</strong> and information</a></span></p>
<p style="text-align: center;"> _______________________________________________________________________________________________________________________________________</p>
<h3 class="text-center" style="text-align: center;"><span style="font-size: 18pt; color: #ff0000;">Cancellations and Updates</span></h3>
<p> </p>
<p style="text-align: justify;"><span style="font-size: 14pt;">The <strong>György Pólya Heuristic Subcommittee</strong> of the Standing Committee of the History of Science and Technology of the Hungarian Academy of Sciences informs all affected participants that due to precautions around COVID-19, the Special Session of the Spring Meeting of the AMS below that was jointly organized by the <strong>Research Centre for the Humanities</strong> and the <strong>California State University, Fresno </strong>has been<strong> <span style="color: #ff0000;">CANCELLED</span>.</strong></span></p>
<p><span style="font-size: 14pt;"><a href="https://www.ams.org/meetings/sectional/2272_program_ss18.html#title"><strong>Special Session of the Spring Western Sectional Meeting of the American Mathematical Society on "How to Solve It? Heuristics and Inquiry Based Learning</strong></a> <span style="color: #ff0000;"><strong><br /></strong></span></span></p>
<p><span style="font-size: 14pt;">The<strong> Spring Western Sectional Meeting </strong>was<span style="font-size: 14pt;"></span> <strong><a href="https://www.ams.org/home/covid-19">CANCELLED</a></strong> by the AMS because of COVID-19.<br /></span></p>
<h2><span style="font-size: 14pt;">Since at least half of our session presenters enthusiastically supported our idea of proposing the same special session for the upcoming </span></h2>
<h2 style="text-align: center;"><span style="font-size: 14pt;"><span style="color: #ff0000;">Fall Western Sectional Meeting of AMS<br />University of Utah, Salt Lake City, Utah, October 24-25, 2020,</span></span></h2>
<p><span style="font-size: 14pt;"><strong>we reorganized the session for the Fall Western Sectional Meeting.</strong></span></p>
<p><span style="font-size: 14pt;">See the details and the <span style="color: #ff0000;">deadlines</span> <a href="https://www.ams.org/meetings/sectional/2279_deadlines.html"><strong>HERE.</strong></a></span></p>
<p>--------------------------------------------------------------------------------------------------------</p>
<h2>AMS Sectional Meeting AMS Special Session</h2>
<h3>Spring Western Sectional Meeting</h3>
<ul class="list-unstyled">
<li>California State University, Fresno, Fresno, CA</li>
</ul>
<h3>Special Session on How to Solve It? Heuristics and Inquiry Based Learning</h3>
<p> <strong>Saturday May 2, 2020, 8:00 a.m.-10:40 a.m.</strong></p>
<ul>
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, I <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno<br />
<ul>
<li>8:00 a.m.<br /> <em>Discussion</em></li>
<li>8:30 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-292.pdf"><em>Investigating Resampling Methods in Upper Division Math Courses.</em></a> <br /> <strong>Mario Banuelos*</strong>, California State University, Fresno <br />(1158-97-292)</li>
<li>9:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-258.pdf"><em>Linking IBL and Research through Dialectical Heuristics.</em></a> <br /> <strong>Zoe C Ashton*</strong>, The Ohio State University <br />(1158-97-258)</li>
<li>10:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-306.pdf"><em>The What and Why Behind IBL Communities: Beginning to Build in CA & NV.</em></a> <br /> <strong>Megan E Selbach-Allen*</strong>, Stanford University <br />(1158-97-306)</li>
</ul>
</li>
</ul>
</ul>
<p> <strong>Saturday May 2, 2020, 3:00 p.m.-5:20 p.m.</strong></p>
<ul>
<ul>
<li style="list-style-type: none;">
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, II <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno</li>
<li>3:00 p.m.</li>
<li><a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-195.pdf"><em>Learning through Problem-Solving.</em></a> <br /> <strong>Ravi Damodar Vakil*</strong>, Stanford University <br />(1158-97-195)</li>
<li>4:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-37.pdf"><em>Polya's "Let us Teach Guessing" Revisited: Shortest Distance Problems.</em></a> <br /> <strong>Peter Tannenbaum*</strong>, Santa Barbara, CA <br />(1158-97-37)</li>
<li>4:30 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-134.pdf"><em>Let's Take Polya Back to School.</em></a> <br /> <strong>Robert G Stein*</strong>, California State University, San Bernardino <br />(1158-97-134)</li>
<li>5:00 p.m.<br /> <em>Discussion</em></li>
</ul>
</li>
</ul>
</ul>
<p> <strong>Sunday May 3, 2020, 8:00 a.m.-10:40 a.m.</strong></p>
<ul>
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, III <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno <br />
<ul>
<li>8:00 a.m.<br /> <em>Discussion</em></li>
<li>8:30 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-137.pdf"><em>Towards a Lacanian Critique in Mathematics Education: The University Discourse and Current Work.</em></a> <br /> <strong>Lance D Burger*</strong>, California State University, Fresno <br />(1158-97-137)</li>
<li>9:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-03-118.pdf"><em>Learning from and Working with Contradictions in Heuristics.</em></a> <br /> <strong>Can Başkent*</strong>, Department of Computer Science, Middlesex University, London <br />(1158-03-118)</li>
<li>10:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-94-248.pdf"><em>Models and Logics in the Practice of Mathematical Heuristics: Tools for concept development and discovery or just for retroactive reconstruction?</em></a> <br /> <strong>Andrew G. Benedek*</strong>, Institute of Philosophy Research Centre for the Humanities <br />(1158-94-248)</li>
</ul>
</li>
</ul>
</ul>
<p> </p>
<ul>
<li><strong>Sunday May 3, 2020, 2:00 p.m.-4:20 p.m.</strong><br />Special Session on How to Solve It? Heuristics and Inquiry Based Learning, IV <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno <a href="mailto:agnest@csufresno.edu">agnest@csufresno.edu</a><br />
<ul>
<li style="list-style-type: none;">
<ul>
<li>2:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-132.pdf"><em>Unusual chessboard tasks for gifted learners.</em></a> <br /> <strong>Péter Juhász*</strong>, Alfréd Rényi Institute of Mathematics <br />(1158-97-132)</li>
<li>3:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-106.pdf"><em>Food For Thought: Exploring Euclidean and non-Euclidean Geometries.</em></a> <br /> <strong>Jennifer E Clinkenbeard*</strong>, California State University Monterey Bay <br />(1158-97-106)</li>
<li>3:30 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-01-364.pdf"><em>George Polya's influence on mathematics competitions in the USA.</em></a> <br /> <strong>Agnes Tuska*</strong>, Department of Mathematics, California State University, Fresno <br />(1158-01-364)</li>
<li>4:00 p.m.<br /> <em>Discussion</em></li>
</ul>
</li>
</ul>
</li>
</ul>
<p> </p></div><div class="feed-description"><h1><span style="font-size: 18pt;">To our community,</span></h1>
<p class="lead"><span style="font-size: 12pt;">In a time of rapid change related to the spread of COVID-19, we are maintaining operations in the best possible way.</span></p>
<p><span style="font-size: 12pt;">During this unprecedented and uncertain period, we appreciate your sense of community and your patience, as we continue our mission to support, engage and serve you. Please check this page regularly for updates and resources.</span></p>
<p><span style="font-size: 12pt;">Our thoughts go out to all of you.</span></p>
<p><span style="font-size: 12pt;">We will remain vigilant in monitoring the situation and responding rapidly, as conditions evolve.</span></p>
<p> </p>
<p style="text-align: center;"><span style="color: #000000; font-size: 18pt;"><strong>Fall Western Sectional Meeting of the AMS<br />University of Utah, Salt Lake City, Utah, October 24-25, 2020</strong></span></p>
<p style="text-align: center;"><span style="font-size: 18pt; color: #ff0000;"><strong><strong>Special Session on "How to Solve It? Heuristics and Inquiry Based Learning"</strong> </strong></span></p>
<p style="text-align: center;"><span style="font-size: 14pt;"><a href="https://www.ams.org/meetings/sectional/2279_program_ss15.html#title."><strong>PROGRAM</strong> and information</a></span></p>
<p style="text-align: center;"> _______________________________________________________________________________________________________________________________________</p>
<h3 class="text-center" style="text-align: center;"><span style="font-size: 18pt; color: #ff0000;">Cancellations and Updates</span></h3>
<p> </p>
<p style="text-align: justify;"><span style="font-size: 14pt;">The <strong>György Pólya Heuristic Subcommittee</strong> of the Standing Committee of the History of Science and Technology of the Hungarian Academy of Sciences informs all affected participants that due to precautions around COVID-19, the Special Session of the Spring Meeting of the AMS below that was jointly organized by the <strong>Research Centre for the Humanities</strong> and the <strong>California State University, Fresno </strong>has been<strong> <span style="color: #ff0000;">CANCELLED</span>.</strong></span></p>
<p><span style="font-size: 14pt;"><a href="https://www.ams.org/meetings/sectional/2272_program_ss18.html#title"><strong>Special Session of the Spring Western Sectional Meeting of the American Mathematical Society on "How to Solve It? Heuristics and Inquiry Based Learning</strong></a> <span style="color: #ff0000;"><strong><br /></strong></span></span></p>
<p><span style="font-size: 14pt;">The<strong> Spring Western Sectional Meeting </strong>was<span style="font-size: 14pt;"></span> <strong><a href="https://www.ams.org/home/covid-19">CANCELLED</a></strong> by the AMS because of COVID-19.<br /></span></p>
<h2><span style="font-size: 14pt;">Since at least half of our session presenters enthusiastically supported our idea of proposing the same special session for the upcoming </span></h2>
<h2 style="text-align: center;"><span style="font-size: 14pt;"><span style="color: #ff0000;">Fall Western Sectional Meeting of AMS<br />University of Utah, Salt Lake City, Utah, October 24-25, 2020,</span></span></h2>
<p><span style="font-size: 14pt;"><strong>we reorganized the session for the Fall Western Sectional Meeting.</strong></span></p>
<p><span style="font-size: 14pt;">See the details and the <span style="color: #ff0000;">deadlines</span> <a href="https://www.ams.org/meetings/sectional/2279_deadlines.html"><strong>HERE.</strong></a></span></p>
<p>--------------------------------------------------------------------------------------------------------</p>
<h2>AMS Sectional Meeting AMS Special Session</h2>
<h3>Spring Western Sectional Meeting</h3>
<ul class="list-unstyled">
<li>California State University, Fresno, Fresno, CA</li>
</ul>
<h3>Special Session on How to Solve It? Heuristics and Inquiry Based Learning</h3>
<p> <strong>Saturday May 2, 2020, 8:00 a.m.-10:40 a.m.</strong></p>
<ul>
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, I <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno<br />
<ul>
<li>8:00 a.m.<br /> <em>Discussion</em></li>
<li>8:30 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-292.pdf"><em>Investigating Resampling Methods in Upper Division Math Courses.</em></a> <br /> <strong>Mario Banuelos*</strong>, California State University, Fresno <br />(1158-97-292)</li>
<li>9:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-258.pdf"><em>Linking IBL and Research through Dialectical Heuristics.</em></a> <br /> <strong>Zoe C Ashton*</strong>, The Ohio State University <br />(1158-97-258)</li>
<li>10:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-306.pdf"><em>The What and Why Behind IBL Communities: Beginning to Build in CA & NV.</em></a> <br /> <strong>Megan E Selbach-Allen*</strong>, Stanford University <br />(1158-97-306)</li>
</ul>
</li>
</ul>
</ul>
<p> <strong>Saturday May 2, 2020, 3:00 p.m.-5:20 p.m.</strong></p>
<ul>
<ul>
<li style="list-style-type: none;">
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, II <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno</li>
<li>3:00 p.m.</li>
<li><a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-195.pdf"><em>Learning through Problem-Solving.</em></a> <br /> <strong>Ravi Damodar Vakil*</strong>, Stanford University <br />(1158-97-195)</li>
<li>4:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-37.pdf"><em>Polya's "Let us Teach Guessing" Revisited: Shortest Distance Problems.</em></a> <br /> <strong>Peter Tannenbaum*</strong>, Santa Barbara, CA <br />(1158-97-37)</li>
<li>4:30 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-134.pdf"><em>Let's Take Polya Back to School.</em></a> <br /> <strong>Robert G Stein*</strong>, California State University, San Bernardino <br />(1158-97-134)</li>
<li>5:00 p.m.<br /> <em>Discussion</em></li>
</ul>
</li>
</ul>
</ul>
<p> <strong>Sunday May 3, 2020, 8:00 a.m.-10:40 a.m.</strong></p>
<ul>
<ul>
<li>Special Session on How to Solve It? Heuristics and Inquiry Based Learning, III <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno <br />
<ul>
<li>8:00 a.m.<br /> <em>Discussion</em></li>
<li>8:30 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-137.pdf"><em>Towards a Lacanian Critique in Mathematics Education: The University Discourse and Current Work.</em></a> <br /> <strong>Lance D Burger*</strong>, California State University, Fresno <br />(1158-97-137)</li>
<li>9:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-03-118.pdf"><em>Learning from and Working with Contradictions in Heuristics.</em></a> <br /> <strong>Can Başkent*</strong>, Department of Computer Science, Middlesex University, London <br />(1158-03-118)</li>
<li>10:00 a.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-94-248.pdf"><em>Models and Logics in the Practice of Mathematical Heuristics: Tools for concept development and discovery or just for retroactive reconstruction?</em></a> <br /> <strong>Andrew G. Benedek*</strong>, Institute of Philosophy Research Centre for the Humanities <br />(1158-94-248)</li>
</ul>
</li>
</ul>
</ul>
<p> </p>
<ul>
<li><strong>Sunday May 3, 2020, 2:00 p.m.-4:20 p.m.</strong><br />Special Session on How to Solve It? Heuristics and Inquiry Based Learning, IV <br /><small>Room 308, Science 2 Building</small><br />Organizers: <br /><strong>Mario Banuelos</strong>, California State University, Fresno <br /><strong>Andrew G. Benedek</strong>, Research Centre for the Humanities, Hungary <br /><strong>Agnes Tuska</strong>, California State University, Fresno <a href="mailto:agnest@csufresno.edu">agnest@csufresno.edu</a><br />
<ul>
<li style="list-style-type: none;">
<ul>
<li>2:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-132.pdf"><em>Unusual chessboard tasks for gifted learners.</em></a> <br /> <strong>Péter Juhász*</strong>, Alfréd Rényi Institute of Mathematics <br />(1158-97-132)</li>
<li>3:00 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-97-106.pdf"><em>Food For Thought: Exploring Euclidean and non-Euclidean Geometries.</em></a> <br /> <strong>Jennifer E Clinkenbeard*</strong>, California State University Monterey Bay <br />(1158-97-106)</li>
<li>3:30 p.m.<br /> <a href="https://www.ams.org/amsmtgs/2272_abstracts/1158-01-364.pdf"><em>George Polya's influence on mathematics competitions in the USA.</em></a> <br /> <strong>Agnes Tuska*</strong>, Department of Mathematics, California State University, Fresno <br />(1158-01-364)</li>
<li>4:00 p.m.<br /> <em>Discussion</em></li>
</ul>
</li>
</ul>
</li>
</ul>
<p> </p></div>The Anatomy of Thought – Student Challenge2019-07-15T07:55:39+00:002019-07-15T07:55:39+00:00https://heurisztika.btk.mta.hu/en/2-program/40-the-anatomy-of-thought-student-challenge-3Benedek András<div class="feed-description"><p> </p>
<p style="text-align: center;"><span style="font-size: 18pt;"><strong><em>The Anatomy of Thought</em></strong></span><strong><span style="font-size: 18pt;"> – Student Challenge</span><br /> </strong>2nd International Heuristics Conference: <em>Motivating, Orienting and Modeling Invention<br /> </em>Balatonfüred, August 30-31, 2019.<br /> <a href="https://heurisztika.btk.mta.hu/en/">http://heurisztika.btk.mta.hu/en/</a></p>
<p>How is thinking and talking related in problem-solving? How our wordless train of thought does arrive at a solution? How can we put out our ideas from our heads and present them in such ways that others can understand them following our line of reasoning? </p>
<p>In our second student program, we challenge individual students just as student groups to present their personal or group-wise ways to genuine solutions of problems. We expect to spell out how they came to their conclusions representing the road leading from the beginning thoughts to their arrival to a solution, or the lack of it, in such a manner that other thinkers can best understand it.</p>
<p>The Challenge addresses the following questions: What role manipulatives and our embodied gestures and practices play in spelling out our problem-solving procedures? What knowledge organizing tools we have for capturing and recording our steps towards crucial points and how can we present our way to new discoveries and insights? </p>
<p>The applicants may select the knowledge organizing tools that they use for the purpose of making their “Anatomy of Thoughts” comprehensible and representable. They can decide what methods and instruments are the best for this purpose ranging from pen and pencil visualizations or video recordings through-enhancing digital environments or augmented reasoning to personal virtual presentations or group-shows.</p>
<p>We only present the problems and suggest some exemplary tools from a possible toolbox that may be useful. The applicants are expected to do their own research and develop their own inventory that fits the best the representation of their own ways to their insights.</p>
<p>The Jury will evaluate not the solutions themselves but the effort and success of the applicants in making their problem solving comprehensible and achieving a traceable reproduction of their thinking process. “Dead-ends” are just as welcome as new discoveries and the point is not finding a solution but spelling out how you had arrived at finding, or not finding, it a solution.</p>
<p>Consequently, the assigned problems are not set tasks or word problems with predefined solutions rather challenges giving the opportunity to tell your own story of struggling with them.</p>
<p><strong>We are looking forward to receiving the presentation of the solution of one of the assigned problems and a freely chosen problem from each applicant. The assigned problems will be published on July 15, 2019, on this website of the conference. See the instructions for submission of the presentations in accordance with the detailed tender conditions specified below. The deadline for submission is <span style="color: #ff0000;">August 25</span>, 2019 midnight.</strong></p>
<p><em>Some suggested tools you can (optionally) use:</em></p>
<p><a href="https://www.geogebra.org/?lang=hu">https://www.geogebra.org/?lang=hu</a></p>
<p><a href="http://www.visual-literacy.org/periodic_table/periodic_table.html">http://www.visual-literacy.org/periodic_table/periodic_table.html</a></p>
<p><a href="https://www.wabisabilearning.com/blog/a-list-of-the-best-free-digital-storytelling-tools-for-teachers">https://www.wabisabilearning.com/blog/a-list-of-the-best-free-digital-storytelling-tools-for-teachers</a></p>
<p><a href="https://mindgraph.co/">https://mindgraph.co/</a></p>
<p><a href="https://debategraph.org/Stream.aspx?nid=61932&vt=ngraph&dc=focus">https://debategraph.org/Stream.aspx?nid=61932&vt=ngraph&dc=focus</a></p>
<p><a href="https://screencast-o-matic.com/plans">https://screencast-o-matic.com/plans</a></p>
<p><a href="https://www.nchsoftware.com/software/recording.html">https://www.nchsoftware.com/software/recording.html</a></p>
<p><a href="https://www.sodapdf.com/blog/best-free-recording-software/">https://www.sodapdf.com/blog/best-free-recording-software/</a></p>
<p><a href="https://www.thepodcasthost.com/editing-production/producing-editing-an-audio-drama-podcast/">https://www.thepodcasthost.com/editing-production/producing-editing-an-audio-drama-podcast/</a></p>
<p><a href="https://play.google.com/store/apps/details?id=ru.knnv.geometrycalcfree&hl=en_US">https://play.google.com/store/apps/details?id=ru.knnv.geometrycalcfree&hl=en_US</a></p>
<p><em>Conditions of application</em></p>
<p>Tenders that arrive by <span style="color: #ff0000;">August 25</span>, 2019, 24:00 hour are going to be considered. Apply by sending a message attaching a decoding posy-file to <a href="https://heurisztika.btk.mta.hu/<a href=">heurisztika2019@gmail.com</a>">heurisztika2019@gmail.com as follows.</p>
<p>Applicant(s) are expected to submit a password-protected Word doc or docx , or PDF file containing</p>
<p>1) the name,</p>
<p>2) year of birth,</p>
<p>3) email address of the applicant(s) (and if willing, their phone number),</p>
<p>4) their educational institution,</p>
<p>5) their grade, and</p>
<p>6) name and</p>
<p>7) contact details of (at least one of) their teacher(s)/ trainer(s).</p>
<p><strong>Please specify <span style="text-decoration: underline;">in the filename</span> <em>the posy</em> that will be referenced in all further submissions!</strong></p>
<p>Applicants are to present the solution of one of the assigned tasks and a mathematical problem of their choice based on their own solution.</p>
<p>In another (not password protected) <span style="text-decoration: underline;">descriptive</span> Word or PDF file containing <em>only the posy</em> but not the name of the applicants, please submit (to <a href="mailto:heurisztika2019@gmail.com">heurisztika2019@gmail.com</a>) that which assigned task was chosen and describe the freely chosen problem including the used processing and presentation method. (The presentation of the processing of these two tasks may be different; one may be submitted digital material and the other a personal presentation.)</p>
<p>The process of problem-solving can be presented</p>
<p>1) <em>in digital form</em>, in the way that the applicant(s) describe the processing and presentation method in the submitted <span style="text-decoration: underline;">descriptive</span> Word or PDF file, or</p>
<p>2) in the form of <em>a personal presentation</em> as part of the student program “<em>An Anatomy of Thought</em><strong> –<em> Student Challenge</em></strong><strong><em>”</em></strong> starting at 9:45 in <a href="http://kultura.balatonfured.hu/vaszary-galeria/"><em>Vaszary Gallery</em></a>, on September 1, 2019, in <a href="https://balatonfured.hu/en/the-history-of-balatonfured/">Balatonfüred</a>.</p>
<p>The time available for personal presentation will be max. 12 minutes. The presentations, if permission is received, will be video recorded.</p>
<p>It is also possible to use digital devices (notebook, software, projector) in the case of personal presentations. Please specify the devices you want to use in the submitted <span style="text-decoration: underline;">descriptive</span> (Word or PDF) file.</p>
<p>All completed digital materials must be submitted by the applicant (s) no later than <span style="color: #ff0000;">25 August</span> 2019, 24:00, providing access to them for evaluation. Submission is by uploading the digital materials to the applicant’s personal Google Drive and providing access to them by sharing the files with <a href="mailto:heurisztika2019@gmail.com">heurisztika2019@gmail.com</a> or by choosing a similar access-providing solution (e.g. Dropbox).</p>
<p>It is the responsibility of the applicant(s) to provide proper access to their submissions and ensure the <em>playability</em> or <em>downloadability </em>of their digital materials.</p>
<p>The submissions received will be evaluated on September 1, 2019, in <a href="http://kultura.balatonfured.hu/vaszary-galeria/"><em>Vaszary Gallery</em></a>, Balatonfüred.</p>
<p>Besides issuing a certificate of participation to each applicant, we plan to award a total of 50-100.000 HUF depending on the quality and quantity of outstanding applications.</p>
<p><em>Assigned Problems:</em></p>
<ol>
<li>Construct a triangle that has exactly the same area as a given quadrilateral. Construct as many different triangles as you can. Explain your construction methods. How did you come up with this idea? Why does it work? Generalization challenge: How could you construct a triangle that has the same area as a given polygon of many vertices (pentagon, hexagon, etc.)?</li>
<li>Suppose that there are 100 ambassadors invited into a banquet. Every ambassador has at most 49 enemies. Can the ambassadors be seated around a round table so that nobody sits next to their enemy? Give more than one solution and spell out how you discovered it!</li>
<li>Agnes runs on the same route every morning, starting at the same time. Her route includes running through a bridge that has railroad tracks, too. Each morning there is a passenger train crossing the bridge while Agnes is running. Agnes knows that the train whistles when she has passed 3/8 of the length of the bridge. She has experienced several times that if she keeps running with full speed forward, the train reaches her exactly at the moment when she gets to the further end of the bridge. On the other hand, if she turns around at the moment she hears the whistle and keeps running with full speed towards the closer end of the bridge, she meets the train exactly at the closer end of the bridge. The “full speed” Agnes can maintain is 7 miles per hour. What is the speed of the train?</li>
<li>Regarding a group of n individuals (n>2) we know two parameters: first, the number of the relationships in the group; second, the average number of offsprings in a given reproductive cycle.<br />a) Investigate (in terms of <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">n, m</em>, and <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">k</em>) the conditions for „long-term” (i.e., at least m>2 cycles) survival of the group if the average lifespan of a group member is <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">k.<br /></em>b) What other parameters may influence the solution and how? E.g., what happens if we do not only know the average number of offsprings but also their distribution? Construct models which take into account these further parameters.</li>
<li>Andrew is 185 cm tall. He wants to hang a mirror in his bathroom so that he could see his whole body in the mirror when he stands in front of the mirror. Help him! The longer the mirror, the more expensive it is. What is the shortest mirror that would do the job? Does it depend on the size of his bathroom? Does it matter how he hangs the mirror? How long is the shortest mirror in which both Andrew and his 1m tall daughter can fully see themselves?</li>
</ol>
<p><strong>+</strong><em> A problem of your choice presenting your attempts of its solution.</em></p>
<p>Remark: Describe the problems you encountered during the solution. If a problem is not unambiguous solve it in all possible sense! Record, reproduce and explain your individual or collective thinking process!</p>
<p>This book may help you:</p>
<p><img style="display: block; margin-left: auto; margin-right: auto;" src="https://heurisztika.btk.mta.hu/images/Pictures/GEORGE-POLYA-books.jpg" alt="How to Solve It" /></p>
<p>If you are in Hungary you can read it nearby the George Polya Memorial Tree <em>in <a href="https://wego.here.com/directions/mix/Tagore-s%C3%A9t%C3%A1ny,-8230-Balatonf%C3%BCred,-Hungary:loc-dmVyc2lvbj0xO3RpdGxlPVRhZ29yZStzJUMzJUE5dCVDMyVBMW55O2xhbmc9aHU7bGF0PTQ2Ljk1Mzg4MDMxMDA1ODU5NDtsb249MTcuODk0NTEwMjY5MTY1MDQ7c3RyZWV0PVRhZ29yZStzJUMzJUE5dCVDMyVBMW55O2NpdHk9QmFsYXRvbmYlQzMlQkNyZWQ7cG9zdGFsQ29kZT04MjMwO2NvdW50cnk9SFVOO2Rpc3RyaWN0PUJhbGF0b25mJUMzJUJDcmVkO3N0YXRlPVZlc3pwcmVtO2NvdW50eT1CYWxhdG9uZiVDMyVCQ3JlZGkrSiVDMyVBMXIlQzMlQTFzO2NhdGVnb3J5SWQ9c3RyZWV0LXNxdWFyZTtzb3VyY2VTeXN0ZW09aW50ZXJuYWw7cGRzQ2F0ZWdvcnlJZD05MDAtOTQwMC0wNDAx/Vaszary-Gal%C3%A9ria,-Honv%C3%A9d-u.-2-4.,-8230-Balatonf%C3%BCred:e-eyJuYW1lIjoiVmFzemFyeSBHYWxcdTAwZTlyaWEiLCJhZGRyZXNzIjoiSG9udlx1MDBlOWQgdS4gMi00LiwgQmFsYXRvbmZcdTAwZmNyZWQiLCJsYXRpdHVkZSI6NDYuOTU0NTEsImxvbmdpdHVkZSI6MTcuODkxNzMsInByb3ZpZGVyTmFtZSI6ImZhY2Vib29rIiwicHJvdmlkZXJJZCI6MTE1NTkxMzYxODA5NDM5fQ==?map=46.95296,17.8964,16,normal&fb_locale=en_US">the memorial tree park of the Tagore promenade in Balatonfüred</a>.</em></p>
<p> </p>
<p><img src="https://heurisztika.btk.mta.hu/images/Pictures/Polya_emlekfa_IMG_20190818_125130.jpg" alt="Memorial tree" /></p>
<p> </p></div><div class="feed-description"><p> </p>
<p style="text-align: center;"><span style="font-size: 18pt;"><strong><em>The Anatomy of Thought</em></strong></span><strong><span style="font-size: 18pt;"> – Student Challenge</span><br /> </strong>2nd International Heuristics Conference: <em>Motivating, Orienting and Modeling Invention<br /> </em>Balatonfüred, August 30-31, 2019.<br /> <a href="https://heurisztika.btk.mta.hu/en/">http://heurisztika.btk.mta.hu/en/</a></p>
<p>How is thinking and talking related in problem-solving? How our wordless train of thought does arrive at a solution? How can we put out our ideas from our heads and present them in such ways that others can understand them following our line of reasoning? </p>
<p>In our second student program, we challenge individual students just as student groups to present their personal or group-wise ways to genuine solutions of problems. We expect to spell out how they came to their conclusions representing the road leading from the beginning thoughts to their arrival to a solution, or the lack of it, in such a manner that other thinkers can best understand it.</p>
<p>The Challenge addresses the following questions: What role manipulatives and our embodied gestures and practices play in spelling out our problem-solving procedures? What knowledge organizing tools we have for capturing and recording our steps towards crucial points and how can we present our way to new discoveries and insights? </p>
<p>The applicants may select the knowledge organizing tools that they use for the purpose of making their “Anatomy of Thoughts” comprehensible and representable. They can decide what methods and instruments are the best for this purpose ranging from pen and pencil visualizations or video recordings through-enhancing digital environments or augmented reasoning to personal virtual presentations or group-shows.</p>
<p>We only present the problems and suggest some exemplary tools from a possible toolbox that may be useful. The applicants are expected to do their own research and develop their own inventory that fits the best the representation of their own ways to their insights.</p>
<p>The Jury will evaluate not the solutions themselves but the effort and success of the applicants in making their problem solving comprehensible and achieving a traceable reproduction of their thinking process. “Dead-ends” are just as welcome as new discoveries and the point is not finding a solution but spelling out how you had arrived at finding, or not finding, it a solution.</p>
<p>Consequently, the assigned problems are not set tasks or word problems with predefined solutions rather challenges giving the opportunity to tell your own story of struggling with them.</p>
<p><strong>We are looking forward to receiving the presentation of the solution of one of the assigned problems and a freely chosen problem from each applicant. The assigned problems will be published on July 15, 2019, on this website of the conference. See the instructions for submission of the presentations in accordance with the detailed tender conditions specified below. The deadline for submission is <span style="color: #ff0000;">August 25</span>, 2019 midnight.</strong></p>
<p><em>Some suggested tools you can (optionally) use:</em></p>
<p><a href="https://www.geogebra.org/?lang=hu">https://www.geogebra.org/?lang=hu</a></p>
<p><a href="http://www.visual-literacy.org/periodic_table/periodic_table.html">http://www.visual-literacy.org/periodic_table/periodic_table.html</a></p>
<p><a href="https://www.wabisabilearning.com/blog/a-list-of-the-best-free-digital-storytelling-tools-for-teachers">https://www.wabisabilearning.com/blog/a-list-of-the-best-free-digital-storytelling-tools-for-teachers</a></p>
<p><a href="https://mindgraph.co/">https://mindgraph.co/</a></p>
<p><a href="https://debategraph.org/Stream.aspx?nid=61932&vt=ngraph&dc=focus">https://debategraph.org/Stream.aspx?nid=61932&vt=ngraph&dc=focus</a></p>
<p><a href="https://screencast-o-matic.com/plans">https://screencast-o-matic.com/plans</a></p>
<p><a href="https://www.nchsoftware.com/software/recording.html">https://www.nchsoftware.com/software/recording.html</a></p>
<p><a href="https://www.sodapdf.com/blog/best-free-recording-software/">https://www.sodapdf.com/blog/best-free-recording-software/</a></p>
<p><a href="https://www.thepodcasthost.com/editing-production/producing-editing-an-audio-drama-podcast/">https://www.thepodcasthost.com/editing-production/producing-editing-an-audio-drama-podcast/</a></p>
<p><a href="https://play.google.com/store/apps/details?id=ru.knnv.geometrycalcfree&hl=en_US">https://play.google.com/store/apps/details?id=ru.knnv.geometrycalcfree&hl=en_US</a></p>
<p><em>Conditions of application</em></p>
<p>Tenders that arrive by <span style="color: #ff0000;">August 25</span>, 2019, 24:00 hour are going to be considered. Apply by sending a message attaching a decoding posy-file to <a href="https://heurisztika.btk.mta.hu/<a href=">heurisztika2019@gmail.com</a>">heurisztika2019@gmail.com as follows.</p>
<p>Applicant(s) are expected to submit a password-protected Word doc or docx , or PDF file containing</p>
<p>1) the name,</p>
<p>2) year of birth,</p>
<p>3) email address of the applicant(s) (and if willing, their phone number),</p>
<p>4) their educational institution,</p>
<p>5) their grade, and</p>
<p>6) name and</p>
<p>7) contact details of (at least one of) their teacher(s)/ trainer(s).</p>
<p><strong>Please specify <span style="text-decoration: underline;">in the filename</span> <em>the posy</em> that will be referenced in all further submissions!</strong></p>
<p>Applicants are to present the solution of one of the assigned tasks and a mathematical problem of their choice based on their own solution.</p>
<p>In another (not password protected) <span style="text-decoration: underline;">descriptive</span> Word or PDF file containing <em>only the posy</em> but not the name of the applicants, please submit (to <a href="mailto:heurisztika2019@gmail.com">heurisztika2019@gmail.com</a>) that which assigned task was chosen and describe the freely chosen problem including the used processing and presentation method. (The presentation of the processing of these two tasks may be different; one may be submitted digital material and the other a personal presentation.)</p>
<p>The process of problem-solving can be presented</p>
<p>1) <em>in digital form</em>, in the way that the applicant(s) describe the processing and presentation method in the submitted <span style="text-decoration: underline;">descriptive</span> Word or PDF file, or</p>
<p>2) in the form of <em>a personal presentation</em> as part of the student program “<em>An Anatomy of Thought</em><strong> –<em> Student Challenge</em></strong><strong><em>”</em></strong> starting at 9:45 in <a href="http://kultura.balatonfured.hu/vaszary-galeria/"><em>Vaszary Gallery</em></a>, on September 1, 2019, in <a href="https://balatonfured.hu/en/the-history-of-balatonfured/">Balatonfüred</a>.</p>
<p>The time available for personal presentation will be max. 12 minutes. The presentations, if permission is received, will be video recorded.</p>
<p>It is also possible to use digital devices (notebook, software, projector) in the case of personal presentations. Please specify the devices you want to use in the submitted <span style="text-decoration: underline;">descriptive</span> (Word or PDF) file.</p>
<p>All completed digital materials must be submitted by the applicant (s) no later than <span style="color: #ff0000;">25 August</span> 2019, 24:00, providing access to them for evaluation. Submission is by uploading the digital materials to the applicant’s personal Google Drive and providing access to them by sharing the files with <a href="mailto:heurisztika2019@gmail.com">heurisztika2019@gmail.com</a> or by choosing a similar access-providing solution (e.g. Dropbox).</p>
<p>It is the responsibility of the applicant(s) to provide proper access to their submissions and ensure the <em>playability</em> or <em>downloadability </em>of their digital materials.</p>
<p>The submissions received will be evaluated on September 1, 2019, in <a href="http://kultura.balatonfured.hu/vaszary-galeria/"><em>Vaszary Gallery</em></a>, Balatonfüred.</p>
<p>Besides issuing a certificate of participation to each applicant, we plan to award a total of 50-100.000 HUF depending on the quality and quantity of outstanding applications.</p>
<p><em>Assigned Problems:</em></p>
<ol>
<li>Construct a triangle that has exactly the same area as a given quadrilateral. Construct as many different triangles as you can. Explain your construction methods. How did you come up with this idea? Why does it work? Generalization challenge: How could you construct a triangle that has the same area as a given polygon of many vertices (pentagon, hexagon, etc.)?</li>
<li>Suppose that there are 100 ambassadors invited into a banquet. Every ambassador has at most 49 enemies. Can the ambassadors be seated around a round table so that nobody sits next to their enemy? Give more than one solution and spell out how you discovered it!</li>
<li>Agnes runs on the same route every morning, starting at the same time. Her route includes running through a bridge that has railroad tracks, too. Each morning there is a passenger train crossing the bridge while Agnes is running. Agnes knows that the train whistles when she has passed 3/8 of the length of the bridge. She has experienced several times that if she keeps running with full speed forward, the train reaches her exactly at the moment when she gets to the further end of the bridge. On the other hand, if she turns around at the moment she hears the whistle and keeps running with full speed towards the closer end of the bridge, she meets the train exactly at the closer end of the bridge. The “full speed” Agnes can maintain is 7 miles per hour. What is the speed of the train?</li>
<li>Regarding a group of n individuals (n>2) we know two parameters: first, the number of the relationships in the group; second, the average number of offsprings in a given reproductive cycle.<br />a) Investigate (in terms of <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">n, m</em>, and <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">k</em>) the conditions for „long-term” (i.e., at least m>2 cycles) survival of the group if the average lifespan of a group member is <em style="background-color: inherit; color: inherit; font-family: inherit; font-size: 1rem;">k.<br /></em>b) What other parameters may influence the solution and how? E.g., what happens if we do not only know the average number of offsprings but also their distribution? Construct models which take into account these further parameters.</li>
<li>Andrew is 185 cm tall. He wants to hang a mirror in his bathroom so that he could see his whole body in the mirror when he stands in front of the mirror. Help him! The longer the mirror, the more expensive it is. What is the shortest mirror that would do the job? Does it depend on the size of his bathroom? Does it matter how he hangs the mirror? How long is the shortest mirror in which both Andrew and his 1m tall daughter can fully see themselves?</li>
</ol>
<p><strong>+</strong><em> A problem of your choice presenting your attempts of its solution.</em></p>
<p>Remark: Describe the problems you encountered during the solution. If a problem is not unambiguous solve it in all possible sense! Record, reproduce and explain your individual or collective thinking process!</p>
<p>This book may help you:</p>
<p><img style="display: block; margin-left: auto; margin-right: auto;" src="https://heurisztika.btk.mta.hu/images/Pictures/GEORGE-POLYA-books.jpg" alt="How to Solve It" /></p>
<p>If you are in Hungary you can read it nearby the George Polya Memorial Tree <em>in <a href="https://wego.here.com/directions/mix/Tagore-s%C3%A9t%C3%A1ny,-8230-Balatonf%C3%BCred,-Hungary:loc-dmVyc2lvbj0xO3RpdGxlPVRhZ29yZStzJUMzJUE5dCVDMyVBMW55O2xhbmc9aHU7bGF0PTQ2Ljk1Mzg4MDMxMDA1ODU5NDtsb249MTcuODk0NTEwMjY5MTY1MDQ7c3RyZWV0PVRhZ29yZStzJUMzJUE5dCVDMyVBMW55O2NpdHk9QmFsYXRvbmYlQzMlQkNyZWQ7cG9zdGFsQ29kZT04MjMwO2NvdW50cnk9SFVOO2Rpc3RyaWN0PUJhbGF0b25mJUMzJUJDcmVkO3N0YXRlPVZlc3pwcmVtO2NvdW50eT1CYWxhdG9uZiVDMyVCQ3JlZGkrSiVDMyVBMXIlQzMlQTFzO2NhdGVnb3J5SWQ9c3RyZWV0LXNxdWFyZTtzb3VyY2VTeXN0ZW09aW50ZXJuYWw7cGRzQ2F0ZWdvcnlJZD05MDAtOTQwMC0wNDAx/Vaszary-Gal%C3%A9ria,-Honv%C3%A9d-u.-2-4.,-8230-Balatonf%C3%BCred:e-eyJuYW1lIjoiVmFzemFyeSBHYWxcdTAwZTlyaWEiLCJhZGRyZXNzIjoiSG9udlx1MDBlOWQgdS4gMi00LiwgQmFsYXRvbmZcdTAwZmNyZWQiLCJsYXRpdHVkZSI6NDYuOTU0NTEsImxvbmdpdHVkZSI6MTcuODkxNzMsInByb3ZpZGVyTmFtZSI6ImZhY2Vib29rIiwicHJvdmlkZXJJZCI6MTE1NTkxMzYxODA5NDM5fQ==?map=46.95296,17.8964,16,normal&fb_locale=en_US">the memorial tree park of the Tagore promenade in Balatonfüred</a>.</em></p>
<p> </p>
<p><img src="https://heurisztika.btk.mta.hu/images/Pictures/Polya_emlekfa_IMG_20190818_125130.jpg" alt="Memorial tree" /></p>
<p> </p></div>