scholarly journals Autistic Savants and large number primality detection.

2020 ◽  
Author(s):  
Anil Kumar Bheemaiah
Keyword(s):  
Mental Arithmetic ◽  
Prime Numbers ◽  
Web Based ◽  
Primality Testing ◽  
Arithmetic Skill ◽  
Miller Test ◽  
Learning And Cognition ◽  
Easter Eggs ◽  
Skills Learning ◽  
Fermat Primes

In a sequel to the paper on small number primality detection by mental arithmetic.In this paper, we consider primality detection of four digit prime numbers, leading next to larger six digit and eight digit numbers, optionally scaled to arbitrary sized numbers. Several mental arithmetic techniques as mental arithmetic exercises from literature are cited, towards effective primality detection, by mental arithmetic only.The “large primes” mental arithmetic skill is developed both as a web based UI and as a UI based on slack, using the Wolfram Alpha nd Wolfram API , for primality testing and for Easter Eggs on prime numbers.Keywords: ASD, prime number determination, autistic savants, mathematical testing, Alexa Skills, learning and Cognition, Rabin-Miller test, Lucas test, fermat primes.

Implementation and evaluation of a web-based communication skills learning tool for training internal medicine interns in patient-doctor communication

2009 ◽  
Vol 2 (2) ◽  
pp. 159-172 ◽  
Author(s):  
Carla L. Spagnoletti ◽  
Thuy Bui ◽  
Gary S. Fischer ◽  
Alda Maria R. Gonzaga ◽  
Doris M. Rubio ◽  
...  
Keyword(s):  
Internal Medicine ◽  
Communication Skills ◽  
Learning Tool ◽  
Web Based ◽  
Skills Learning ◽  
Doctor Communication

scholarly journals 3 Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog

2018 ◽  
Vol 1 (1) ◽  
pp. 6
Author(s):  
Rehan Shams ◽  
Fozia Hanif Khan ◽  
Umair Jillani ◽  
M. Umair
Keyword(s):  
Communication System ◽  
Prime Numbers ◽  
Key Generation ◽  
Random Generation ◽  
Primality Testing ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Number Of Cycles ◽  
Testing Algorithm ◽  
Secured Communication

A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption. This procedure also requires random generation of prime numbers, therefore, we are proposing an efficient fast Primality testing algorithm to meet the requirement for generating the key in RSA algorithm. We use right-to-left-binary method for the exponent calculation. This reduces the number of cycles enhancing the performance of the system and reducing the area usage of the FPGA. These blocks are coded in Verilog and are synthesized and simulated in Xilinx 13.2 design suit.

scholarly journals Proof the Skewes’ number is not an integer using lattice points and tangent line

2021 ◽  
Vol 17 (2) ◽  
pp. 5-18
Author(s):  
V. Ďuriš ◽  
T. Šumný ◽  
T. Lengyelfalusy
Keyword(s):  
Counting Function ◽  
Prime Number Theorem ◽  
Prime Numbers ◽  
Integral Function ◽  
Lattice Points ◽  
Tangent Line ◽  
Miller Test ◽  
Logarithmic Integral ◽  
The Difference ◽  
Prime Counting Function

Abstract Skewes’ number was discovered in 1933 by South African mathematician Stanley Skewes as upper bound for the first sign change of the difference π (x) − li(x). Whether a Skewes’ number is an integer is an open problem of Number Theory. Assuming Schanuel’s conjecture, it can be shown that Skewes’ number is transcendental. In our paper we have chosen a different approach to prove Skewes’ number is an integer, using lattice points and tangent line. In the paper we acquaint the reader also with prime numbers and their use in RSA coding, we present the primary algorithms Lehmann test and Rabin-Miller test for determining the prime numbers, we introduce the Prime Number Theorem and define the prime-counting function and logarithmic integral function and show their relation.

New Worlds to Conquer

2004 ◽  
Vol 98 (3) ◽  
pp. 166-170
Author(s):  
Richard L. Francis
Keyword(s):  
Problem Solving ◽  
Mathematical Problem ◽  
Prime Numbers ◽  
Mathematical Problem Solving ◽  
Fermat Primes

Still undiscovered areas of mathematical problem solving. Prime numbers and subset groups are discussed, including Mersenne and Fermat primes.

Mathematical Performance Before, During, and following Cycling at Workloads of Low and Moderate Intensity

1992 ◽  
Vol 75 (3) ◽  
pp. 915-918 ◽  
Author(s):  
Attila Szabo ◽  
Lise Gauvin
Keyword(s):  
Heart Rate ◽  
Mental Arithmetic ◽  
Mathematical Problem ◽  
Male Students ◽  
Moderate Intensity ◽  
Maximal Heart Rate ◽  
Heart Rate Reserve ◽  
Mathematical Performance ◽  
Arithmetic Skill ◽  
Median Split

Mental arithmetic performance before, during, and following low (40% maximal heart-rate reserve; ≈ 90 watts exercise for 15 min.) and moderate (60% maximal heart-rate reserve; ≈ 150 watts exercise for 10 min.) intensity cycling by 20 male students ( M age = 28.1 yr.) was studied. Subjects were grouped, by using a median-split on their total mathematical performance scores, into a group of 10 low in arithmetic skill and a group of 10 high in arithmetic skill. The numbers and percentages of right answers to 1-min. mathematical problem-sets of either group were not different in the various conditions, suggesting that 25 min. of progressive cycling exercise did not influence mathematical problem-solving efficacy.

scholarly journals Predicting The Data For Security Using Rjb23 Algorithm

2021 ◽  
pp. 197-202
Keyword(s):  
Public Information ◽  
Prime Numbers ◽  
Negative Integer ◽  
New Method ◽  
Integer Number ◽  
Present Stage ◽  
Web Based ◽  
Quadratic Equations

The current world is information world; without this information can’t make due in present stage. This information created more from web- based media; this media information is public information; This public information did not have well security; so we applying the proposed method and it has 3 steps; 1. Using prime numbers in quadratic equations; 2. Prime and non-negative integer number used to swap the numbers; 3. Column operations execution; The new method gives well security when contrast to Salsa method.

scholarly journals IMPROVEMENT OF METACOGNITIVE SKILLS THROUGH WEB-BASED SCHOOLOGY BLENDED LEARNING WITH SCIENTIFIC APPROACH IN RATE REACTION

2021 ◽  
Vol 5 (3) ◽  
Author(s):  
Rona Dea Meistasari
Keyword(s):  
Blended Learning ◽  
Learning Outcomes ◽  
Reaction Rate ◽  
Student Learning Outcomes ◽  
Metacognitive Skills ◽  
Web Based ◽  
Learning Improvement ◽  
Scientific Approach ◽  
Skills Learning ◽  
Data Analysis Methods

This research aims to describe the feasibility of blended learning, improvement of metacognitive skills, learning outcomes, as well as students' responses to Web-based Schoology blended learning with a scientific approach to the reaction rate material. The research used a pre-experimental design, namely One Group Pretest-Postest Design. The research was conducted in class XI IPA 3 SMAN 1 Gurah with 36 students without control’s class. The data collection techniques are used observation, test, and questionnaire. The data analysis methods used percentage, mean, paired t-test, and N-Gain test. The results showed that 1) Web-based Schoology blended learning was carried out very well criteria of 99.25%, 2) Metacognitive skills with Web-based Schoology blended learning got 0,534 improvement skills with good category. 3) Student learning outcomes also experienced completeness of 61,11% which states that the use of Web-based Schoology blended learning was good to improve learning outcomes 4) The response of students to the use of Web-based Schoology blended learning as a learning innovation using technology is considered good with 75% of students' responses. Generally, the Web-based Schoology blended learning was effective in improving students's metacognitive skills.

3. Prime-time mathematics

2020 ◽  
pp. 37-57
Author(s):  
Robin Wilson
Keyword(s):  
Number Theory ◽  
Prime Number ◽  
Prime Numbers ◽  
Prime Time ◽  
Leonhard Euler ◽  
Mersenne Primes ◽  
Fermat Primes

‘Prime-time mathematics’ explores prime numbers, which lie at the heart of number theory. Some primes cluster together and some are widely spread, while primes go on forever. The Sieve of Eratosthenes (3rd century BC) is an ancient method for identifying primes by iteratively marking the multiples of each prime as not prime. Every integer greater than 1 is either a prime number or can be written as a product of primes. Mersenne primes, named after French friar Marin de Mersenne, are prime numbers that are one less than a power of 2. Pierre de Fermat and Leonhard Euler were also prime number enthusiasts. The five Fermat primes are used in a problem from geometry.

Sign in / Sign up

Export Citation Format

Share Document