An insect starts from and in steps and has to reach again. But in between one of the s steps and can't go . Find probability. For example is valid but is not valid.
Attachments:
This post has been edited 2 times. Last edited by Rohit-2006, 3 hours ago
Let be an integer. In a configuration of an board, each of the cells contains an arrow, either pointing up, down, left, or right. Given a starting configuration, Turbo the snail starts in one of the cells of the board and travels from cell to cell. In each move, Turbo moves one square unit in the direction indicated by the arrow in her cell (possibly leaving the board). After each move, the arrows in all of the cells rotate counterclockwise. We call a cell good if, starting from that cell, Turbo visits each cell of the board exactly once, without leaving the board, and returns to her initial cell at the end. Determine, in terms of , the maximum number of good cells over all possible starting configurations.
Proposed by Melek Güngör, Turkey
This post has been edited 1 time. Last edited by Lukaluce, Yesterday at 11:54 AM
Let be an acute triangle. Points , and lie on a line in this order and satisfy . Let and be the midpoints of and , respectively. Suppose triangle is acute, and let be its orthocentre. Points and lie on lines and , respectively, such that and are concyclic and pairwise different, and and are concyclic and pairwise different. Prove that and are concyclic.
I will post a question and someone has to answer it. Then they have to post a question and someone else will answer it and so on. We can only post questions related to Number Theory and each problem should be more difficult than the previous. Let's start!
Question 1
Starting with the simplest
What is ?
This post has been edited 1 time. Last edited by JetFire008, Apr 7, 2025, 7:14 AM
A regular octagon and all of its diagonals are drawn. Find, with proof, the number of squares that appear in the resulting diagram. (The side of each square must lie along one of the edges or diagonals of the octagon.)
Let be an integer. We are given a balance and weights of weight . We are to place each of the weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed.
Determine the number of ways in which this can be done.