Add to ORKGIn this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a given number of distinct prime factors are presented. These algorithms yield pri- mitive weird numbers of the form mp1 ... pk for a suitable deficient positive integer m and primes p1 , ... , pk and generalize a recent technique developed for generating primitive weird numbers of the form 2n p1 p2 . The same techniques can be used to search for odd weird numbers, whose existence is still an open question
To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a ...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random numb...
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...
ABSTRACT Primitive weird number is weird number which are not a multiple of any smaller weird numbe...
8 pagesWeird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the ...
An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson prov...
In Fall 2013, the Math Honors Seminar at Central Washington University broke the world record for la...
University of Technology, Sydney. Department of Mathematical Sciences.A long standing unanswered que...
In this work , we follow a new technique in analyzing odd numbers and showing of the odd numbers and...
In the pursuit of understanding the enigmatic world of prime numbers,a unique formula has been ident...
A congruent number is a positive integer which can be represented as the area of a right triangle su...
AbstractIn this paper we consider the integers of the forms k±2n and k2n±1, which are ever focused b...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a ...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random numb...
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...
ABSTRACT Primitive weird number is weird number which are not a multiple of any smaller weird numbe...
8 pagesWeird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the ...
An abundant number is said to be primitive if none of its proper divisors are abundant. Dickson prov...
In Fall 2013, the Math Honors Seminar at Central Washington University broke the world record for la...
University of Technology, Sydney. Department of Mathematical Sciences.A long standing unanswered que...
In this work , we follow a new technique in analyzing odd numbers and showing of the odd numbers and...
In the pursuit of understanding the enigmatic world of prime numbers,a unique formula has been ident...
A congruent number is a positive integer which can be represented as the area of a right triangle su...
AbstractIn this paper we consider the integers of the forms k±2n and k2n±1, which are ever focused b...
In this work we construct a lower bound for an odd perfect number in terms of the number of its dist...
To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a ...
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For i...
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random numb...