20041015, 06:44  #1 
8206_{10} Posts 
Question relating to Fermat's theorem
Ok so http://primes.utm.edu explains briefly how to find primes:
It explains fermat's theorem like this: Given n > 1, choose a > 1 and calculate (a^n)1 modulo n. If it is one modulo n, then n might be prime. I don't understand how I can calculate this on a computer. I know there is c code for performing mod. But let's say you have a really big number of form (k*(2^n)) +/ 1 what roughly would I put into a c code program to mod that number to tell if it's a 2prp???? 
20041017, 11:03  #2 
5·13·131 Posts 
Well???
Does anyone know where I can find the answer to such a question

20041017, 13:26  #3  
Banned
"Luigi"
Aug 2002
Team Italia
4803_{10} Posts 
Quote:
There is a multiprecision C library that allows mod operations in multiple precision integers. Luigi 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Modified Fermat's theorem  devarajkandadai  Number Theory Discussion Group  2  20170623 04:39 
abc conjecture and Fermat's Last Theorem  jasong  jasong  3  20121024 08:45 
Fermat's Last Theorem Essay  henryzz  Homework Help  2  20110215 07:39 
Fermat's Theorem  Crook  Math  5  20050505 17:18 
Fermat,s Theorem  devarajkandadai  Miscellaneous Math  3  20040605 10:15 