Congruence Classes: Solve the Hard Problem!

  • Thread starter Thread starter shaner-baner
  • Start date Start date
  • Tags Tags
    Classes
shaner-baner
Messages
24
Reaction score
0
Here is a fun problem, it's hard to write out clearly, but I'll try to do it w/ little confusion.
Is it, or is it not true that
(2^2^...^2)(n times)=(2^2^...^2)(n-1 times) mod n
so for example, when n=2, 2^2=2 ->
4=2 mod 2.
 
Mathematics news on Phys.org
He he sorry.
 
Last edited:

Thread 'Trigonometry problem of interest'

Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
View full post »
Thread 'Unit Circle Double Angle Derivations'

Thread 'Unit Circle Double Angle Derivations'

Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
View full post »

Thread 'Fermat's Last Theorem'

Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
View full post »

Similar threads

I Modulo and Modulus in math and computer programming
Replies
5
Views
3K
MHB Interpolating Points with Continuous Modular Functions?
Replies
5
Views
1K
I Is there any way to simplify my proof by induction?
Replies
13
Views
2K
I Optimization problem with multiple outputs: impossible?
Replies
6
Views
2K
MHB Appending a number to itself n times and finding modulo m
Replies
6
Views
3K
Insights Fermat's Last Theorem
3
Replies
105
Views
6K
MHB Can we use this method to efficiently check if $N$ is composite?
Replies
29
Views
5K
[IntroNumTheory] Determining the remainder by using congruence
Replies
1
Views
1K
I Simple, almost "intuitive" conjecture, hard or impossible to solve?
Replies
5
Views
2K
B Death Rally: an intricate probability problem?
Replies
8
Views
2K

Hot Threads

Recent Insights

Back
Top