{"title":"费马小定理","authors":"S. Kundu, Sypriyo Mazumder","doi":"10.3840/000970","DOIUrl":null,"url":null,"abstract":"Let p be a prime and let a ∈ Z + be such that a is not a multiple of p, i.e., p does not divide a. Let's look at the set Z p of congruence classes modulo p. There are exactly p congruence classes and We define the function f a : Z p → Z p by f a ([x] p) = [ax] p .","PeriodicalId":280679,"journal":{"name":"Number Theory and its Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fermat's Little Theorem\",\"authors\":\"S. Kundu, Sypriyo Mazumder\",\"doi\":\"10.3840/000970\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let p be a prime and let a ∈ Z + be such that a is not a multiple of p, i.e., p does not divide a. Let's look at the set Z p of congruence classes modulo p. There are exactly p congruence classes and We define the function f a : Z p → Z p by f a ([x] p) = [ax] p .\",\"PeriodicalId\":280679,\"journal\":{\"name\":\"Number Theory and its Applications\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Number Theory and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3840/000970\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Number Theory and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3840/000970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
设p是素数,且a∈Z +使得a不是p的倍数,即p不能除a。我们来看同余类的集合zp对p取模,有p个同余类,我们定义函数f a: zp→zp by f a ([x] p) = [ax] p。
Let p be a prime and let a ∈ Z + be such that a is not a multiple of p, i.e., p does not divide a. Let's look at the set Z p of congruence classes modulo p. There are exactly p congruence classes and We define the function f a : Z p → Z p by f a ([x] p) = [ax] p .