ABSTRACT Primitive weird number is weird number which are not a multiple of any smaller weird numbers. The goal of this work is to generate a square-free primitive weird number where be an increasing sequence of prime numbers such that is greater than and is deficient number with greater than , to be able to use this special form to enhancing the classic bounds of Ω-results for
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
In this paper we study some structure properties of primitive weird numbers in terms of their factor...
We give an algorithm to enumerate all primitive abundant numbers (PAN) with a fixed Ω, the number of...
8 pagesWeird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the ...
In Fall 2013, the Math Honors Seminar at Central Washington University broke the world record for la...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
In this work , we follow a new technique in analyzing odd numbers and showing of the odd numbers and...
Abstract: Mathematicians has been trying to prove the weak Goldbach’s conjecture by adding prime num...
In the pursuit of understanding the enigmatic world of prime numbers,a unique formula has been ident...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
In this paper we study some structure properties of primitive weird numbers in terms of their factor...
We give an algorithm to enumerate all primitive abundant numbers (PAN) with a fixed Ω, the number of...
8 pagesWeird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the ...
In Fall 2013, the Math Honors Seminar at Central Washington University broke the world record for la...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
During past years author worked with representations of numbers in terms of 1 to 9 and 9 to 1. These...
In this work , we follow a new technique in analyzing odd numbers and showing of the odd numbers and...
Abstract: Mathematicians has been trying to prove the weak Goldbach’s conjecture by adding prime num...
In the pursuit of understanding the enigmatic world of prime numbers,a unique formula has been ident...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
DOI
Add to ORKG