Skip to search formSkip to main contentSkip to account menu

Fermat

Known as: Fermat computer algebra system 
Fermat is a freeware program developed by Prof. Robert H. Lewis of Fordham University. It is a computer algebra system, in which items being computed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
"Classic" Mac OSComputer algebra systemLaurent polynomialList of computer algebra systems

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
MATHEMATICAL METHODS IN SOLUTIONS OF THE PROBLEMS PRESENTED AT THE THIRD INTERNATIONAL STUDENTS’ OLYMPIAD IN CRYPTOGRAPHY
2016
2016
Generalized RSA using 2k prime numbers with secure key generation
Cryptography is used for secure communication since ancient days for providing confidentiality, integrity and availability of the… 
2015
2015
On the automorphism group of non-singular plane curves fixing the degree
This note is devoted, after the result of Harui, arXiv:1306.5842, to solve some natural questions for non-singular plane curves… 
2004
2004
Stream cipher based on quasigroup string transformations in Zp*
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\bbbz_p^*$ (where p is a… 
Review
2004
Review
2004
Fermat's Last Theorem, Simon Singh (Fourth Estate, 1997) : book review
This book is a gripping read, and while the author does not talk down to his readers, he also does not expect deep thinking from… 
2001
2001
PROOF OF SCHINZEL'S HYPOTHESIS
In this paper using the arithmetic function ) ( 2 ω J we prove Schinzel’s hypothesis, twin prime theorem and Goldbach theorem. If… 
1996
1996
VLSI Architectures and Arithmetic Operations with Application to the Fermat Number Transform
Theproperties of arithmetic operations in Fermat integer quotient ringsZ m , where m , are investigated. The arithmetic… 
1992
1992
Autocorrelation analysis of speech signals using Fermat number transform (FNT)
A method for speedy computation of the autocorrelation coefficients used by linear predictive coding (LPC) that uses Fermat… 
1978
1978
On the Fermat—Weber problem with convex cost functions
We treat an extension of the generalized Fermat—Weber problem with convex cost functions. It is shown that the entire sequence of… 
1951
1951
A Note on Fermat's Conjecture
The classical conjecture of Fermat, unpoved so far, asserts that the equation x q + y q = z q (I, I) is unsolvable in positive… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)